## Constraint Databases: A Survey (1998)

Venue: | Semantics in Databases, number 1358 in LNCS |

Citations: | 23 - 3 self |

### BibTeX

@INPROCEEDINGS{Revesz98constraintdatabases:,

author = {Peter Z. Revesz},

title = {Constraint Databases: A Survey},

booktitle = {Semantics in Databases, number 1358 in LNCS},

year = {1998},

pages = {209--246},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### 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. In memory of Paris C. Kanellakis 1 Introduction There is a growing interest in recent years among database researchers in constraint databases, which are a generalization of relational databases by finitely representable infinite relations. Constraint databases are parametrized by the type of constraint domains and constraint used. The good news is that for many parameters constraint databases leave intact most of the fundamental assumptions of the relational database framework proposed by Codd. In particular, 1. Constraint databases can be queried by constraint query languages that (a) have a semantics ba...