Query reformulation with constraints
Related Collections
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Contributor
Abstract
Let Σ1, Σ2 be two schemas, which may overlap, C be a set of constraints on the joint schema Σ1 ∪ Σ2, and q1 be a Σ1-query. An (equivalent) reformulation of q1 in the presence of C is a Σ2-query, q2, such that q2 gives the same answers as q1 on any Σ1 ∪ Σ2-database instance that satisfies C. In general, there may exist multiple such reformulations and choosing among them may require, for example, a cost model.
Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
Journal title
Volume number
Issue number
Publisher
Publisher DOI
Comments
doi: http://dx.doi.org/10.1145/1121995.1122010 Alin Deutsch (http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/d/Deutsch:Alin.html), Lucian Popa (http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/p/Popa:Lucian.html), Val Tannen: Query reformulation with constraints. http://www.informatik.uni-trier.de/~ley/db/journals/sigmod/sigmod35.html#DeutschPT06 SIGMOD Record 35(1): 65-73 (2006) Authors retain the right to post a pre-print version of the journal article on Internet web sites including electronic pre-print servers, and to retain indefinitely such version on such servers or sites. The right to post a revised personal version of the text of the final journal article (to reflect changes made in the peer review process) on the author's personal or institutional web site or server, incorporating the complete citation and with a link to the Digital Object Identifier (DOI) of the article.