Constraint databases: A survey

  • Peter Z. Revesz
Conference paper

DOI: 10.1007/BFb0035010

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1358)
Cite this paper as:
Revesz P.Z. (1997) Constraint databases: A survey. In: Thalheim B., Libkin L. (eds) Semantics in Databases. SiD 1995. Lecture Notes in Computer Science, vol 1358. Springer, Berlin, Heidelberg

Abstract

Constraint databases generalize relational databases by finitely representable infinite relations. This paper surveys the state of the art in constraint databases: known results, remaining open problems and current research directions. The paper also describes a new algebra for databases with integer order constraints and a complexity analysis of evaluating queries in this algebra.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Peter Z. Revesz
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of Nebraska-LincolnUSA

Personalised recommendations