Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Constraint Databases

  • Floris GeertsEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1268


Constraint databases are a generalization of relational databases aimed to store possibly infinite-sized sets of data by means of a finite representation (constraints) of that data. In general, constraints are expressed by quantifier-free first-order formulas over some fixed vocabulary Ω and are interpreted in some Ω-structure \( \mathrm{\mathcal{M}}=\left\langle \mathbb{U},\Omega \right\rangle \)

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Benedikt M, Libkin L, Schwentick T, Segoufin L. Definable relations and first-order query languages over strings. J ACM. 2003;50(5):694–751.MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Bochnak J, Coste M, Roy MF. Real algebraic geometry. Berlin: Springer; 1998.zbMATHCrossRefGoogle Scholar
  3. 3.
    Kanellakis PC, Kuper GM, Revesz PZ. Constraint query languages. J Comput Syst Sci. 1995;51(1):26–52.MathSciNetCrossRefGoogle Scholar
  4. 4.
    Kuper GM, Libkin L, Paredaens J, editors. Constraint databases. Berlin: Springer; 2000.zbMATHGoogle Scholar
  5. 5.
    Revesz PZ. Introduction to constraint databases. Berlin: Springer; 2002.zbMATHGoogle Scholar

Copyright information

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

Authors and Affiliations

  1. 1.University of AntwerpAntwerpBelgium

Section editors and affiliations

  • Leonid Libkin
    • 1
  1. 1.School of InformaticsUniversity of EdinburghEdinburghUK