research-article

The chase revisited

Authors:

Jeff RemmelAuthors Info & Claims

PODS '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 149 - 158

https://doi.org/10.1145/1376916.1376938

Published: 09 June 2008 Publication History

Abstract

We revisit the standard chase procedure, studying its properties and applicability to classical database problems. We settle (in the negative) the open problem of decidability of termination of the standard chase, and we provide sufficient termination conditions which are strictly less over-conservative than the best previously known. We investigate the adequacy of the standard chase for checking query containment under constraints, constraint implication and computing certain answers in data exchange, gaining a deeper understanding by separating the algorithm from its result. We identify the properties of the chase result that are essential to the above applications, and we introduce the more general notion of F-universal model set, which supports query and constraint languages that are closed under a class F of mappings. By choosing F appropriately, we extend prior results to existential first-order queries and ∀∃-firstorder constraints. We show that the standard chase is incomplete for finding universal model sets, and we introduce the extended core chase which is complete, i.e. finds an F-universal model set when it exists. A key advantage of the new chase is that the same algorithm can be applied for all mapping classes F of interest, simply by modifying the set of constraints given as input. Even when restricted to the typical input in prior work, the new chase supports certain answer computation and containment/implication tests in strictly more cases than the incomplete standard chase.

References

[1]

S. Abiteboul and O. M. Duschka. Complexity of answering queries using materialized views. In PODS, 1998.

Digital Library

[2]

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

Digital Library

[3]

A. V. Aho, C. Beeri, and J. D. Ullman. The theory of joins in relational databases. ACM Trans. Database Syst., 4(3), 1979.

Digital Library

[4]

C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. J. ACM, 31(4):718--741, 1984.

Digital Library

[5]

A. Calì, D. Calvanese, G. D. Giacomo, and M. Lenzerini. Data integration under integrity constraints. Inf. Syst., 29(2), 2004.

Digital Library

[6]

A. Calì, D. Lembo, and R. Rosati. Query rewriting and answering under constraints in data integration systems. In IJCAI, 2003.

[7]

A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, 1977.

Digital Library

[8]

A. Deutsch, B. Ludaescher, and A. Nash. Rewriting queries using views with access patterns under integrity constraints. In ICDT, 2005.

Digital Library

[9]

A. Deutsch, A. Nash, and J. Remmel. The Chase Revisited (full version). UCSD Tech. Report 2008, http://db.ucsd.edu.

[10]

A. Deutsch and V. Tannen. Mars: A system for publishing xml from mixed and redundant storage. In VLDB, pages 201--212, 2003.

Digital Library

[11]

A. Deutsch and V. Tannen. Reformulation of XML Queries and Constraints. In ICDT, 2003.

Digital Library

[12]

R. Fagin. Horn clauses and database dependencies. JACM, 29(4),'82.

Digital Library

[13]

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. ICDT 2003, full version in Theor. Comput. Sci. 336(1): 89--124 (2005).

[14]

R. Fagin, P. G. Kolaitis, and L. Popa. Data Exchange: Getting to the Core. In PODS, 2003. Full version in TODS, 30(1), 2005.

Digital Library

[15]

A. Fuxman, P. G. Kolaitis, R. J. Miller, and W. C. Tan. Peer data exchange. In PODS, 2005. Full version in TODS, 31(4), 2006.

Digital Library

[16]

G. Gottlob and A. Nash. Data exchange: Computing cores in polynomial time. In PODS, 2006.

Digital Library

[17]

A. Y. Halevy, Z. G. Ives, D. Suciu, and I. Tatarinov. Schema Mediation in Peer Data Management Systems. ICDE 2003.

[18]

P. Hell and J. Nešetřil. The core of a graph. Discr. Math., 109(1-3):117--126, 1992.

Digital Library

[19]

P. G. Kolaitis, J. Panttaja, and W. C. Tan. The complexity of data exchange. In PODS, pages 30--39, 2006.

Digital Library

[20]

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

Digital Library

[21]

Maier, Sagiv, and Yannakakis. On the complexity of testing implication of functional and join dependencies. J. ACM, 1981.

Digital Library

[22]

D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4):455--469, 1979.

Digital Library

[23]

A. Nash, A. Deutsch, and J. Remmel. Data exchange, data integration, and the chase. UCSD Tech. Report CS2006-0859, 2006.

[24]

B. Rossman. Existential positive types and preservation under homomorphisisms. In LICS, pages 467--476, 2005.

Digital Library

[25]

M. Vardi. Inferring multivalued dependencies from functional and join dependencies. Acta Informatica, 1983.

[26]

C. Yu and L. Popa. Constraint-Based XML Query Rewriting For Data Integration. In SIGMOD, pages 371--382, 2004.

Digital Library

Cited By

Anwar MWang ALan FCaesar MSchulzrinne HKohler EMaltz DMisra V(2023)Demo: Structural Network Minimization: A Case of Reflective NetworkingProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3610847(1188-1190)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3603269.3610847
Zhang YWang YFlatt OCao DZucker PRosenthal ETatlock ZWillsey M(2023)Better Together: Unifying Datalog and Equality SaturationProceedings of the ACM on Programming Languages10.1145/35912397:PLDI(468-492)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591239
Baget JMugnier MRudolph SGeerts FNgo HSintos S(2023)Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable QueryingProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588659(291-302)Online publication date: 18-Jun-2023
https://dl.acm.org/doi/10.1145/3584372.3588659
Show More Cited By

Index Terms

The chase revisited
1. Theory of computation
  1. Logic

Recommendations

Benchmarking the Chase
PODS '17: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

The chase is a family of algorithms used in a number of data management tasks, such as data exchange, answering queries under dependencies, query reformulation with constraints, and data cleaning. It is well established as a theoretical tool for ...
A general datalog-based framework for tractable query answering over ontologies
PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

In this paper, we introduce a family of expressive extensions of Datalog, called Datalog+/-, as a new paradigm for query answering over ontologies. The Datalog+/- family admits existentially quantified variables in rule heads, and has suitable ...
The backchase revisited

Semantic query optimization is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. In this paper, we report about a Chase & Backchase (C&B) algorithm strategy that generalizes and improves ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

June 2008

330 pages

ISBN:9781605581521

DOI:10.1145/1376916

General Chair:
Phokion Kolaitis
IBM Almaden Research Center, USA
,
Program Chair:
Maurizio Lenzerini
SAPIENZA University of Rome, Italy

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tag

chase

Qualifiers

Research-article

Conference

SIGMOD/PODS '08

Sponsor:

SIGMOD/PODS '08: SIGMOD/PODS '08 - International Conference on Management of Data

June 9 - 12, 2008

Vancouver, Canada

Acceptance Rates

PODS '08 Paper Acceptance Rate 28 of 159 submissions, 18%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

189
Total Citations
View Citations
1,220
Total Downloads

Downloads (Last 12 months)69
Downloads (Last 6 weeks)7

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Anwar MWang ALan FCaesar MSchulzrinne HKohler EMaltz DMisra V(2023)Demo: Structural Network Minimization: A Case of Reflective NetworkingProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3610847(1188-1190)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3603269.3610847
Zhang YWang YFlatt OCao DZucker PRosenthal ETatlock ZWillsey M(2023)Better Together: Unifying Datalog and Equality SaturationProceedings of the ACM on Programming Languages10.1145/35912397:PLDI(468-492)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591239
Baget JMugnier MRudolph SGeerts FNgo HSintos S(2023)Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable QueryingProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588659(291-302)Online publication date: 18-Jun-2023
https://dl.acm.org/doi/10.1145/3584372.3588659
Wang AAnwar MLan FCaesar M(2023)Structural Semantics Management: an Application of the Chase in Networking2023 31st International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS59514.2023.10387636(1-4)Online publication date: 16-Oct-2023
https://doi.org/10.1109/MASCOTS59514.2023.10387636
GOTTLOB GMANNA MMARTE C(2023)Dyadic Existential RulesTheory and Practice of Logic Programming10.1017/S1471068423000327(1-23)Online publication date: 24-Aug-2023
https://doi.org/10.1017/S1471068423000327
Bertossi LMilani M(2023)Extending sticky-Datalog± via finite-position selection functionsInformation Systems10.1016/j.is.2022.102156114:COnline publication date: 1-Mar-2023
https://dl.acm.org/doi/10.1016/j.is.2022.102156
Oriol XTeniente EMaynou MNadal S(2023)Generating valid test data through data cloningFuture Generation Computer Systems10.1016/j.future.2023.02.020144(179-191)Online publication date: Jul-2023
https://doi.org/10.1016/j.future.2023.02.020
Arndt DMennicke S(2023)Notation3 as an Existential Rule LanguageRules and Reasoning10.1007/978-3-031-45072-3_5(70-85)Online publication date: 18-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-45072-3_5
Schüler TMennicke SLochau M(2023)Abstract Domains for Database Manipulating ProcessesRules and Reasoning10.1007/978-3-031-45072-3_16(222-237)Online publication date: 18-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-45072-3_16
Lyon TRudolph S(2023) Derivation-Graph-Based Characterizations of Decidable Existential Rule SetsLogics in Artificial Intelligence10.1007/978-3-031-43619-2_26(369-384)Online publication date: 20-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43619-2_26
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 Table of Conten