Constraint Query Languages.
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz:
Constraint Query Languages.
PODS 1990: 299-313@inproceedings{DBLP:conf/pods/KanellakisKR90,
author = {Paris C. Kanellakis and
Gabriel M. Kuper and
Peter Z. Revesz},
title = {Constraint Query Languages},
booktitle = {Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on
Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee},
publisher = {ACM Press},
year = {1990},
isbn = {0-89791-352-3},
pages = {299-313},
ee = {http://doi.acm.org/10.1145/298514.298582, db/conf/pods/KanellakisKR90.html},
crossref = {DBLP:conf/pods/90},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
We discuss the relationship between constraint
programming and database query languages.
We show that bottom-up, efficient, declarative
database programming can be combined with efficient
constraint solving. The key intuition is
that the generalization of a ground fact, or tuple,
is a conjunction of constraints. We describe the
basic Constraint Query Language design principles,
and illustrate them with four different
classes of constraints: Polynomial, rational order,
equality, and boolean constraints.
Copyright © 1990 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98.
and ...
Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings.
and ...
Printed Edition
Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee.
ACM Press 1990, ISBN 0-89791-352-3
Contents 
Journal Version
Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz:
Constraint Query Languages.
J. Comput. Syst. Sci. 51(1): 26-52(1995)
References
- [AV88]
- Serge Abiteboul, Victor Vianu:
Procedural and Declarative Database Update Languages.
PODS 1988: 240-250
- [ASU79]
- Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalences Among Relational Expressions.
SIAM J. Comput. 8(2): 218-246(1979)
- [AGSS86]
- ...
- [B81]
- Alan Borning:
The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory.
ACM Trans. Program. Lang. Syst. 3(4): 353-387(1981)
- [BKR86]
- Michael Ben-Or, Dexter Kozen, John H. Reif:
The Complexity of Elementary Algebra and Geometry.
J. Comput. Syst. Sci. 32(2): 251-264(1986)
- [BS87]
- Wolfram Büttner, Helmut Simonis:
Embedding Boolean Expressions into Logic Programming.
J. Symb. Comput. 4(2): 191-205(1987)
- [C87]
- Alain Colmerauer:
An Introduction to Prolog III.
Commun. ACM 33(7): 69-90(1990)
- [CH80]
- Ashok K. Chandra, David Harel:
Computable Queries for Relational Data Bases.
J. Comput. Syst. Sci. 21(2): 156-178(1980)
- [CM76]
- Ashok K. Chandra, Philip M. Merlin:
Optimal Implementation of Conjunctive Queries in Relational Data Bases.
STOC 1977: 77-90
- [ChI89]
- Jan Chomicki, Tomasz Imielinski:
Relational Specifications of Infinite Query Answers.
SIGMOD Conference 1989: 174-183
- [Co70]
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks.
Commun. ACM 13(6): 377-387(1970)
- [D88]
- Mehmet Dincbas, Pascal Van Hentenryck, Helmut Simonis, Abderrahmane Aggoun, Thomas Graf, Françoise Berthier:
The Constraint Logic Programming Language CHIP.
FGCS 1988: 693-702
- [FG77]
- Jeanne Ferrante, James R. Geiser:
An Efficient Decision Procedure for the Theory of Rational Order.
Theor. Comput. Sci. 4(2): 227-233(1977)
- [GJ79]
- M. R. Garey, David S. Johnson:
Computers and Intractability: A Guide to the Theory of NP-Completeness.
W. H. Freeman 1979, ISBN 0-7167-1044-7
- [HHLE89]
- Michael R. Hansen, Bo S. Hansen, Peter Lucas, Peter van Emde Boas:
Integrating Relational Databases and Constraint Languages.
Comput. Lang. 14(2): 63-82(1989)
- [HS89]
- Richard Hull, Jianwen Su:
Domain Independence and the Relational Calculus.
Acta Inf. 31(6): 513-524(1994)
- [I86]
- Neil Immerman:
Relational Queries Computable in Polynomial Time.
Information and Control 68(1-3): 86-104(1986)
- [JL87]
- Joxan Jaffar, Jean-Louis Lassez:
Constraint Logic Programming.
POPL 1987: 111-119
- [Ka90]
- ...
- [Ki88]
- Michael Kifer:
On Safety, Domain Independence, and Capturability of Database Queries (Preliminary Report).
JCDKB 1988: 405-415
- [Kl88]
- Anthony C. Klug:
On conjunctive queries containing inequalities.
J. ACM 35(1): 146-160(1988)
- [KP88]
- Phokion G. Kolaitis, Christos H. Papadimitriou:
Why Not Negation by Fixpoint?
PODS 1988: 231-239
- [K80]
- Dexter Kozen:
Complexity of Boolean Algebras.
Theor. Comput. Sci. 10: 221-247(1980)
- [KY86]
- Dexter Kozen, Chee-Keng Yap:
Algebraic Cell Decomposition in NC (Preliminary Version).
FOCS 1985: 515-521
- [Le87]
- ...
- [L84]
- John W. Lloyd:
Foundations of Logic Programming, 1st Edition.
Springer 1984, ISBN 3-540-13299-6
- [MN88]
- Ursula Martin, Tobias Nipkow:
Unification in Boolean Rings.
J. Autom. Reasoning 4(4): 381-396(1988)
- [PS85]
- ...
- [R83]
- ...
- [R88]
- Raghu Ramakrishnan:
Magic Templates: A Spellbinding Approach to Logic Programs.
ICLP/SLP 1988: 140-159
- [S80]
- ...
- [T51]
- ...
- [U82]
- Jeffrey D. Ullman:
Principles of Database Systems, 2nd Edition.
Computer Science Press 1982, ISBN 0-914894-36-6
- [UvG88]
- Jeffrey D. Ullman, Allen Van Gelder:
Parallel Complexity of Logical Query Programs.
Algorithmica 3: 5-42(1988)
- [V82]
- Moshe Y. Vardi:
The Complexity of Relational Query Languages (Extended Abstract).
STOC 1982: 137-146
Copyright © Fri Mar 12 17:19:55 2010
by Michael Ley (ley@uni-trier.de)
