Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Paper
A simple characterization of database dependency implication
Abstract
A simple and elegant set-theoretic characterization is given as to when a given set of functional and multivalued dependencies logically implies a given functional or multivalued dependency. A simple proof of the characterization is given which makes use of a result of Sagiv, Delobel, Parker, and Fagin (1981). © 1986.
Related
Conference paper
A quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Kento Tsubouchi, Yosuke Mitsuhashi, et al.
npj Quantum Information