Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 1501–1508Cite as

FOL Modeling of Integrity Constraints (Dependencies)

  • Reference work entry
  • First Online:

  • 18 Accesses

Synonyms

Dependencies; Relational integrity constraints

Definition

Integrity constraints (also known as dependencies in the relational model) are domain-specific declarations which indicate the intended meaning of the data stored in a database. They complement the description of the structure of the data (e.g., in the relational model the structure is given by listing the names of tables and the names and types of their attributes). Integrity constraints express properties that must be satisfied by all instances of a database schema that can arise in the intended application domain (e.g., “no two distinct employees may have the same ssn value”, “departments have a single manager”, etc.).

Historical Background

The reference textbook [1] provides a comprehensive, unifying overview of the many special classes of relational dependencies, their modeling in first-order logic (FOL), and the key problems in the study of dependencies. This entry is a condensed form of chapter 10 in [1]...

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Abiteboul S, Hull R, Vianu V. Foundations of databases. Reading: Addison-Wesley; 1995.

    MATH  Google Scholar 

  2. Beeri C, Vardi MY. The implication problem for data dependencies. In: Proceedings of the International Conference on Algorithms, Languages and Programming; 1981. p. 73–85.

    Chapter  Google Scholar 

  3. Codd EF. Relational completeness of database sublanguages. In: Rustin R, editor. Courant computer science symposium 6: data base systems. Englewood Cliffs: Prentice-Hall; 1972. p. 65–98.

    Google Scholar 

  4. Date CJ. Referential integrity. In: Proceedings of the 7th International Conference on Very Data Bases; 1981. p. 2–12.

    Google Scholar 

  5. Delobel C. Normalization and hierarchical dependencies in the relational data model. ACM Trans Database Syst. 1978;3(3):201–22.

    Article  Google Scholar 

  6. Deutsch A, Tannen V. XML queries and constraints, containment and reformulation. Theor Comput Sci. 2005;336(1):57–87.

    Article  MathSciNet  MATH  Google Scholar 

  7. Deutsch A, Ludäscher B, Nash A. Rewriting queries using views with access patterns under integrity constraints. Theor Comput Sci. 2007;371(3):200–26.

    Article  MathSciNet  MATH  Google Scholar 

  8. Fagin R. Horn clauses and database dependencies. J ACM. 1982;29(4):952–85.

    Article  MathSciNet  MATH  Google Scholar 

  9. Fagin R. Multivalued dependencies and a new normal form for relational databases. ACM Trans Database Syst. 1977;2(3):262–78.

    Article  MathSciNet  Google Scholar 

  10. Fagin R, Vardi MY. The theory of data dependencies: a survey. In: Anshel M, Gewirtz W, editors. Mathematics of information processing: proceedings of symposia in applied mathematics, vol. 34. Providence: American Mathematical Society; 1986. p. 19–27.

    Chapter  Google Scholar 

  11. Gallaire H, Minker J. Logic and databases. New York: Plenum Press; 1978.

    MATH  Google Scholar 

  12. Ginsburg S, Zaiddan SM. Properties of functional dependency families. J ACM. 1982;29(4):678–98.

    Article  MathSciNet  MATH  Google Scholar 

  13. Grahne G, Mendelzon AO. Tableau techniques for querying information sources through global schemas. In: Proceedings of the 7th International Conference on Database Theory; 1999. p. 332–47.

    Google Scholar 

  14. Kannellakis PC. Elements of relational database theory. In: Van Leeuwen J, editor. Handbook of theoretical computer science. Amsterdam: Elsevier; 1991.p. 1074–156.

    Google Scholar 

  15. Maier D, Ullman JD, Vardi MY. On the foundations of the universal relation model. ACM Trans Database Syst. 1984;9(2):283–308.

    Article  MathSciNet  MATH  Google Scholar 

  16. Mendelzon AO, Maier D. Generalized mutual dependencies and the decomposition of database relations. In: Proceedings of the 5th International Conference on Very Data Bases; 1979. p. 75–82.

    Google Scholar 

  17. Nicolas JM. First order logic formalization for functional, multivalued, and mutual dependencies. Acta Informatica. 1982;18(3):227–53.

    Article  MathSciNet  Google Scholar 

  18. Paredaens J. Transitive dependencies in a database scheme. Technical Report R387, MBLE, Brussels; 1979.

    Google Scholar 

  19. Parker DS, Parsaye-Ghomi K. Inference involving embedded multivalued dependencies and transitive dependencies. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1980. p. 52–7.

    Google Scholar 

  20. Sagiv Y, Walecka SF. Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies. J ACM. 1982;29(1):103–17.

    Article  MathSciNet  MATH  Google Scholar 

  21. Vardi MY. On decomposition of relational databases. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science; 1982. p. 176–85.

    Google Scholar 

  22. Vardi MY. Trends in theoretical computer science. In: Borger E, editor. Fundamentals of dependency theory. Rockville: Computer Science Press; 1987.p. 171–224.

    Google Scholar 

  23. Yannakakis M, Papadimitriou C. Algebraic dependencies. J Comput Syst Sci. 1982;25(2):3–41.

    MathSciNet  MATH  Google Scholar 

  24. Zaniolo C. Analysis and design of relational schemata for database systems. PhD Thesis, University of California, Los Angeles; 1976. Technical Report UCLA-Eng-7669, Department of Computer Science.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California-San Diego, La Jolla, CA, USA

    Alin Deutsch

Authors
  1. Alin Deutsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alin Deutsch .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. Dept. of Computer and Inf. Science, Univ. of Pennsylvania, Philadelphia, PA, USA

    Val Tannen

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Deutsch, A. (2018). FOL Modeling of Integrity Constraints (Dependencies). 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_980

Download citation

Publish with us

Policies and ethics

Search

Navigation