## Constraint Programming and Database Query Languages (1994)

Venue: | In Proc. 2nd Conference on Theoretical Aspects of Computer Software (TACS |

Citations: | 60 - 3 self |

### BibTeX

@INPROCEEDINGS{Kanellakis94constraintprogramming,

author = {Paris Kanellakis and Dina Q Goldin},

title = {Constraint Programming and Database Query Languages},

booktitle = {In Proc. 2nd Conference on Theoretical Aspects of Computer Software (TACS},

year = {1994},

pages = {96--120},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

. The declarative programming paradigms used in constraint languages can lead to powerful extensions of Codd's relational data model. The development of constraint database query languages from logical database query languages has many similarities with the development of constraint logic programming from logic programming, but with the additional requirements of data efficient, set-at-a-time, and bottomup evaluation. In this overview of constraint query languages (CQLs) we first present the framework of [41]. The principal idea is that: "the k-tuple (or record) data type can be generalized by a conjunction of quantifier-free constraints over k variables". The generalization must preserve various language properties of the relational data model, e.g., the calculus/algebra equivalence, and have time complexity polynomial in the size of the data. We next present an algebra for dense order constraints that is simpler to evaluate than the calculus described in [41], and we sharpen some of...