article

Query reformulation with constraints

Authors:

Val TannenAuthors Info & Claims

ACM SIGMOD Record, Volume 35, Issue 1

Pages 65 - 73

https://doi.org/10.1145/1121995.1122010

Published: 01 March 2006 Publication History

Abstract

Let Σ₁, Σ₂ be two schemas, which may overlap, C be a set of constraints on the joint schema Σ₁ ∪ Σ₂, and q₁ be a Σ₁-query. An (equivalent) reformulation of q₁ in the presence of C is a Σ₂-query, q₂, such that q₂ gives the same answers as q₁ on any Σ₁ ∪ Σ₂-database instance that satisfies C. In general, there may exist multiple such reformulations and choosing among them may require, for example, a cost model.

References

[1]

S. Abiteboul and O. M. Duschka. Complexity of Answering Queries Using Materialized Views. In PODS, pages 254--263, 1998.]]

Digital Library

[2]

S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.]]

Digital Library

[3]

S. Adali, K. S. Candan, Y. Papakonstantinou, and V. Subrahmanian. Query Caching and Optimization in Distributed Mediator Systems. In SIGMOD, pages 137--148, 1996.]]

Digital Library

[4]

C. Beeri and Y. Kornatzky. Algebraic Optimisation of Object Oriented Query Languages. TCS, 116(1):59--94, 1993.]]

Digital Library

[5]

C. Beeri and M. Y. Vardi. A Proof Procedure for Data Dependencies. JACM, 31(4):718--741, 1984.]]

Digital Library

[6]

P. Buneman, S. Naqvi, V. Tannen, and L. Wong. Principles of Programming with Collection Types. TCS, 149(1):3--48, 1995.]]

Digital Library

[7]

A. Calì, D. Calvanese, G. D. Giacomo, and M. Lenzerini. Data Integration under Integrity Constraints. In CAiSE, pages 262--279, 2002.]]

Digital Library

[8]

R. G. G. Cattell, D. K. Barry, M. Berler, J. Eastman, D. Jordan, C. Russell, O. Schadow, T. Stanienda, and F. Velez, editors. The Object Data Standard: ODMG 3.0. Morgan Kaufmann, 2000.]]

Digital Library

[9]

A. K. Chandra and P. M. Merlin. Optimal Implementation of Conjunctive Queries in Relational Data Bases. In STOC, pages 77--90, 1977.]]

Digital Library

[10]

A. Deutsch. XML Query Reformulation Over Mixed and Redundant Storage. PhD thesis, Dept. of Computer and Information Sciences, University of Pennsylvania, 2002.]]

Digital Library

[11]

A. Deutsch, L. Popa, and V. Tannen. Physical Data Independence, Constraints and Optimization with Universal Plans. In VLDB, pages 459--470, 1999.]]

Digital Library

[12]

A. Deutsch and V. Tannen. MARS: A System for Publishing XML from Mixed and Redundant Storage. In VLDB, pages 201--212, 2003.]]

Digital Library

[13]

A. Deutsch and V. Tannen. Reformulation of XML Queries and Constraints. In ICDT, pages 225--241, 2003.]]

Digital Library

[14]

A. Deutsch and V. Tannen. XML Queries and Constraints, Containment and Reformulation. TCS, 336(1):57--87, 2005.]]

Digital Library

[15]

O. M. Duschka and M. R. Genesereth. Answering recursive queries using views. In PODS, pages 109--116, 1997.]]

Digital Library

[16]

R. Fagin. Horn Clauses and Database Dependencies. JACM, 29(4):952--985, Oct. 1982.]]

Digital Library

[17]

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. In ICDT, pages 207--224, 2003.]]

Digital Library

[18]

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. TCS, 336(1):89--124, 2005.]]

Digital Library

[19]

R. Fagin, P. G. Kolaitis, and L. Popa. Data Exchange: Getting to the Core. ACM TODS, 30(1):174--210, 2005.]]

Digital Library

[20]

G. Gottlob. Computing Cores for Data Exchange: New Algorithms and Practical Solutions. In PODS, 2005.]]

Digital Library

[21]

A. Halevy. Answering Queries Using Views: A Survey. VLDB Journal, pages 270--294, 2001.]]

Digital Library

[22]

C. Koch. Query Rewriting with Symmetric Constraints. In Proceedings of FoIKS (LNCS 2284), pages 130--147, 2002.]]

Digital Library

[23]

K. Lellahi and V. Tannen. A calculus for collections and aggregates. In E. Moggi and G. Rosolini, editors, LNCS 1290: Category Theory and Computer Science (Proceedings of CTCS'97), pages 261--280, 1997.]]

Digital Library

[24]

M. Lenzerini. Data Integration: A Theoretical Perspective. In PODS, pages 233--246, 2002.]]

Digital Library

[25]

A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering Queries Using Views. In PODS, pages 95--104, 1995.]]

Digital Library

[26]

A. Y. Levy, A. Rajamaran, and J. J. Ordille. Querying Heterogeneous Information Sources Using Source Descriptions. In VLDB, pages 251--262, 1996.]]

Digital Library

[27]

D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing Implications of Data Dependencies. ACM TODS, 4(4):455--469, 1979.]]

Digital Library

[28]

L. Popa. Object/Relational Query Optimization with Chase and Backchase. PhD thesis, Dept. of Computer and Information Sciences, University of Pennsylvania, 2000.]]

Digital Library

[29]

L. Popa, A. Deutsch, A. Sahuguet, and V. Tannen. A Chase Too Far? In SIGMOD, pages 273--284, 2000.]]

Digital Library

[30]

L. Popa and V. Tannen. An Equational Chase for Path-Conjunctive Queries, Constraints, and Views. In ICDT, pages 39--57, 1999.]]

Digital Library

[31]

L. Popa, Y. Velegrakis, R. J. Miller, M. A. Hernandez, and R. Fagin. Translating Web Data. In VLDB, pages 598--609, 2002.]]

Digital Library

[32]

J. Shanmugasundaram, J. Kiernan, E. Shekita, C. Fan, and J. Funderburk. Querying XML Views of Relational Data. In VLDB, pages 261--270, 2001.]]

Digital Library

[33]

O. Tsatalos, M. Solomon, and Y. Ioannidis. The GMAP: A Versatile Tool for Physical Data Independence. VLDB Journal, 5(2):101--118, 1996.]]

Digital Library

Cited By

Yun JTak BHan W(2024)ReCG: Bottom-up JSON Schema Discovery Using a Repetitive Cluster-and-Generalize FrameworkProceedings of the VLDB Endowment10.14778/3681954.368201917:11(3538-3550)Online publication date: 30-Aug-2024
https://doi.org/10.14778/3681954.3682019
Benedikt MBuron MGermano SKappelmann KMotik B(2024)Rewriting the Infinite Chase for Guarded TGDsACM Transactions on Database Systems10.1145/369641649:4(1-44)Online publication date: 18-Sep-2024
https://dl.acm.org/doi/10.1145/3696416
Han SIves Z(2024)Implementation Strategies for Views over Property GraphsProceedings of the ACM on Management of Data10.1145/36549492:3(1-26)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654949
Show More Cited By

Index Terms

Query reformulation with constraints
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
  2. Information retrieval
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Exploiting Constraints in Query Processing: Query transformation using interity constraints and views
Modeling reformulation as query distributions
Examining collaborative query reformulation: a case of travel information searching
SIGIR '14: Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval

Users often reformulate or modify their queries when they engage in searching information particularly when the search task is complex and exploratory. This paper investigates query reformulation behavior in collaborative tourism information searching ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record

ACM SIGMOD Record Volume 35, Issue 1

March 2006

71 pages

ISSN:0163-5808

DOI:10.1145/1121995

Issue’s Table of Contents

Copyright © 2006 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 2006

Published in SIGMOD Volume 35, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

87
Total Citations
View Citations
700
Total Downloads

Downloads (Last 12 months)31
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yun JTak BHan W(2024)ReCG: Bottom-up JSON Schema Discovery Using a Repetitive Cluster-and-Generalize FrameworkProceedings of the VLDB Endowment10.14778/3681954.368201917:11(3538-3550)Online publication date: 30-Aug-2024
https://doi.org/10.14778/3681954.3682019
Benedikt MBuron MGermano SKappelmann KMotik B(2024)Rewriting the Infinite Chase for Guarded TGDsACM Transactions on Database Systems10.1145/369641649:4(1-44)Online publication date: 18-Sep-2024
https://dl.acm.org/doi/10.1145/3696416
Han SIves Z(2024)Implementation Strategies for Views over Property GraphsProceedings of the ACM on Management of Data10.1145/36549492:3(1-26)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654949
Benedikt MCooper FGermano SGyorkei GTsamoura EMoore BOrtiz C(2023)PDQ 2.0ACM SIGMOD Record10.1145/3582302.358230851:4(36-41)Online publication date: 25-Jan-2023
https://dl.acm.org/doi/10.1145/3582302.3582308
Hai RKoutras CIonescu ALi ZSun Wvan Schijndel JKang YKatsifodimos A(2023)Amalur: Data Integration Meets Machine Learning2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00301(3729-3739)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00301
Link S(2023)Entity integrity management under data volume, variety and veracityKnowledge and Information Systems10.1007/s10115-022-01814-165:7(2895-2934)Online publication date: 25-Jan-2023
https://dl.acm.org/doi/10.1007/s10115-022-01814-1
Benedikt MBuron MGermano SKappelmann KMotik B(2022)Rewriting the infinite chaseProceedings of the VLDB Endowment10.14778/3551793.355185115:11(3045-3057)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.14778/3551793.3551851
Kossmann JPapenbrock TNaumann F(2021)Data dependencies for query optimization: a surveyThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-021-00676-331:1(1-22)Online publication date: 14-Jun-2021
https://dl.acm.org/doi/10.1007/s00778-021-00676-3
Chabin JCiferri CHalfeld-Ferrari MHara CPenteado R(2021)Role-Based Access Control on Graph DatabasesSOFSEM 2021: Theory and Practice of Computer Science10.1007/978-3-030-67731-2_38(519-534)Online publication date: 25-Jan-2021
https://dl.acm.org/doi/10.1007/978-3-030-67731-2_38
Afrati FChirkova R(2019)Answering Queries Using Views, Second EditionSynthesis Lectures on Data Management10.2200/S00884ED2V01Y201811DTM05414:3(1-275)Online publication date: 15-Apr-2019
https://doi.org/10.2200/S00884ED2V01Y201811DTM054
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents