Compiling query constraints

Peter J. Stuckey, S. Sudarshan

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

16 Citations (Scopus)

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 constraints 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.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
PublisherAssociation for Computing Machinery (ACM)
Pages56-67
Number of pages12
ISBN (Print)0897916425
Publication statusPublished - 1 Jan 1994
Externally publishedYes
EventACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems 1994 - Minneapolis, United States of America
Duration: 24 May 199426 May 1994
Conference number: 13th

Publication series

NameProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Conference

ConferenceACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems 1994
Abbreviated titlePODS 1994
CountryUnited States of America
CityMinneapolis
Period24/05/9426/05/94

Cite this