Synonyms
Logical implication or entailment
Definition
The implication problem is to decide whether or not a given set of constraints logically implies another constraint. With any constraint (dependency) language \({\mathcal {L}}\) there are two implication problems associated, which do not coincide in general.
In the traditional logic framework, an instance of a schema R is a logical structure that is either finite or infinite, referred to as an unrestricted instance of R. A set Σ of constraints over R implies without restriction a constraint ϕ, denoted by Σ⊧unrϕ, if for each unrestricted instance I of R that satisfies Σ, I also satisfies ϕ. The unrestricted implication problem for \({\mathcal {L}}\) is to determine, given a set Σ of constraints in \({\mathcal {L}}\) and another constraint ϕ in \({\mathcal {L}}\), whether or not Σ⊧unrϕ.
In the context of databases, only finite instances are considered, and implication analysis lies within finite model theory. A set Σ of constraints...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Abiteboul S, Hull R, Vianu V. Foundations of databases. Reading: Addison-Wesley; 1995.
Abiteboul S, Vianu V. Regular path queries with constraints. J Comput Syst Sci. 1999;58(3): 428–52.
Aho AV, Beeri C, Ullman JD. The theory of joins in relational databases. ACM Trans Database Syst. 1979;4(3):297–314.
Arenas M, Fan W, Libkin L. Consistency of XML specifications. In: Inconsistency tolerance. Berlin: Springer; 2005. p. 15–41.
Armstrong WW. Dependency structures of data base relationships. In: Proceedings of the IFIP Congress, Information Processing 74; 1974. p. 580–3.
Beeri C, Bernstein PA. Computational problems related to the design of normal form relational schemas. ACM Trans Database Syst. 1979;4(1):30–59.
Beeri C, Vardi MY. The implication problem for data dependencies. In: Proceedings of the 8th International Colloquium on Automata, Languages, and Programming. 1981. p. 73–85.
Bernstein PA. Synthesizing third normal form relations from functional dependencies. ACM Trans Database Syst. 1976;1(4):277–98.
Casanova MA, Fagin R, Papadimitriou CH. Inclusion dependencies and their interaction with functional dependencies. In: Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems; 1982. p. 171–6.
Chandra AK, Lewis HR, Makowsky JA. Embedded implicational dependencies and their inference problem. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing; 1981. p. 342–54.
Chandra AK, Vardi MY. The implication problem for functional and inclusion dependencies is undecidable. SIAM J Comput. 1985;14(3):671–7.
Fagin R, Vardi MY. The theory of data dependencies – an overview. In: Proceedings of the 11th International Colloquium on Automata, Languages, and Programming; 1984. p. 1–22.
Fan W, Libkin L. On XML integrity constraints in the presence of DTDs. J ACM. 2002;49(3):368–406.
Klug AC. Calculating constraints on relational expressions. ACM Trans Database Syst. 1980;5(3):260–90.
Maier D, Mendelzon AO, Sagiv Y. Testing implications of data dependencies. ACM Trans Database Syst. 1979;4(4):455–69.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Fan, W. (2018). Implication of Constraints. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1238
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1238
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering