Compiling Query Constraints.
Peter J. Stuckey, S. Sudarshan:
Compiling Query Constraints.
PODS 1994: 56-67@inproceedings{DBLP:conf/pods/StuckeyS94,
author = {Peter J. Stuckey and
S. Sudarshan},
title = {Compiling Query Constraints},
booktitle = {Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium
on Principles of Database Systems, May 24-26, 1994, Minneapolis,
Minnesota},
publisher = {ACM Press},
year = {1994},
isbn = {0-89791-642-5},
pages = {56-67},
ee = {http://doi.acm.org/10.1145/182591.182598, db/conf/pods/pods94-56.html},
crossref = {DBLP:conf/pods/94},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
We present a general technique to push query constraints (such as
length <= 1000) into database views and (constraint) logic programs.
We introduce the notion of parametrized constraints, which help us push
constraints with argument values that are known only at run time, and
develop techniques for pushing parametrized constraints into
predicate/view definitions.
Our technique provides a way of compiling programs with constraint queries
into programs with parametrized constraints compiled in, and which can
be executed on systems, such as database query evaluation systems, that
do not handle full constraint solving. Thereby our technique can push
constraint selections that earlier constraint query rewriting techniques
could not. Our technique is independent of the actual constraint domain,
and we illustrate its use with equality constraints on structures (which
are useful in object-oriented query languages) and linear arithmetic
constraints.
Copyright © 1994 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 ...
BibTeX
Printed Edition
Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 24-26, 1994, Minneapolis, Minnesota.
ACM Press 1994, ISBN 0-89791-642-5
Contents BibTeX
[Abstract and Index Terms]
[Full Text in PDF Format, 1210 KB]
References
- [BMSU86]
- François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman:
Magic Sets and Other Strange Ways to Implement Logic Programs.
PODS 1986: 1-15 BibTeX
- [BR86]
- François Bancilhon, Raghu Ramakrishnan:
An Amateur's Introduction to Recursive Query Processing Strategies.
SIGMOD Conference 1986: 16-52 BibTeX
- [BR87a]
- Isaac Balbin, Kotagiri Ramamohanarao:
A Generalization of the Differential Approach to Recursive Query Evaluation.
J. Log. Program. 4(3): 259-262(1987) BibTeX
- [BR87b]
- Catriel Beeri, Raghu Ramakrishnan:
On the Power of Magic.
PODS 1987: 269-284 BibTeX
- [CDE91]
- Michael Codish, Dennis Dams, Eyal Yardeni:
Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis.
ICLP 1991: 79-93 BibTeX
- [CoC77]
- Patrick Cousot, Radhia Cousot:
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.
POPL 1977: 238-252 BibTeX
- [JL87]
- Joxan Jaffar, Jean-Louis Lassez:
Constraint Logic Programming.
POPL 1987: 111-119 BibTeX
- [KKR90]
- Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz:
Constraint Query Languages.
PODS 1990: 299-313 BibTeX
- [KRB85]
- Won Kim, David S. Reiner, Don S. Batory (Eds.):
Query Processing in Database Systems.
Springer 1985, ISBN 3-540-13831-5
Contents BibTeX
- [KRBM89]
- David B. Kemp, Kotagiri Ramamohanarao, Isaac Balbin, Krishnamurthy Meenakshi:
Propagating Constraints in Recusive Deduction Databases.
NACLP 1989: 981-998 BibTeX
- [KS93]
- David B. Kemp, Peter J. Stuckey:
Analysis Based Constraint Query Optimization.
ICLP 1993: 666-682 BibTeX
- [LS92]
- Alon Y. Levy, Yehoshua Sagiv:
Constraints and Redundancy in Datalog.
PODS 1992: 67-80 BibTeX
- [MFPR90a]
- Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan:
Magic is Relevant.
SIGMOD Conference 1990: 247-258 BibTeX
- [MFPR90b]
- Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan:
Magic Conditions.
PODS 1990: 314-330 BibTeX
- [MP94]
- Inderpal Singh Mumick, Hamid Pirahesh:
Implementation of Magic-sets in a Relational Database System.
SIGMOD Conference 1994: 103-114 BibTeX
- [Ram88]
- Raghu Ramakrishnan:
Magic Templates: A Spellbinding Approach to Logic Programs.
ICLP/SLP 1988: 140-159 BibTeX
- [RS91]
- Raghu Ramakrishnan, S. Sudarshan:
Top-Down versus Bottom-Up Revisited.
ISLP 1991: 321-336 BibTeX
- [Sch86]
- ...
- [SR93a]
- Divesh Srivastava, Raghu Ramakrishnan:
Pushing Constraint Selections.
J. Log. Program. 16(3): 361-414(1993) BibTeX
- [SR93b]
- S. Sudarshan, Raghu Ramakrishnan:
Optimizations of Bottom-Up Evaluation with Non-Ground Terms.
ILPS 1993: 557-574 BibTeX
- [Ull88]
- Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume I.
Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX
- [Ull89]
- Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume II.
Computer Science Press 1989, ISBN 0-7167-8162-X
Contents BibTeX
Referenced by
- Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan:
Magic Conditions.
ACM Trans. Database Syst. 21(1): 107-155(1996)
- Praveen Seshadri, Joseph M. Hellerstein, Hamid Pirahesh, T. Y. Cliff Leung, Raghu Ramakrishnan, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan:
Cost-Based Optimization for Magic: Algebra and Implementation.
SIGMOD Conference 1996: 435-446
- Paris C. Kanellakis:
Constraint Programming and Database Languages: A Tutorial.
PODS 1995: 46-53
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:34:10 2009
