Anatomy of the Chase

DOI10.3233/FI-2018-1627zbMATH Open1390.68247arXiv1303.6682OpenAlexW2963013562MaRDI QIDQ4637897FDOQ4637897

Authors: Gösta Grahne, Adrian Oneţ 

Publication date: 3 May 2018

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Abstract: A lot of research activity has recently taken place around the chase procedure, due to its usefulness in data integration, data exchange, query optimization, peer data exchange and data correspondence, to mention a few. As the chase has been investigated and further developed by a number of research groups and authors, many variants of the chase have emerged and associated results obtained. Due to the heterogeneous nature of the area it is frequently difficult to verify the scope of each result. In this paper we take closer look at recent developments, and provide additional results. Our analysis allows us create a taxonomy of the chase variations and the properties they satisfy. Two of the most central problems regarding the chase is termination, and discovery of restricted classes of sets of dependencies that guarantee termination of the chase. The search for the restricted classes has been motivated by a fairly recent result that shows that it is undecidable to determine whether the chase with a given dependency set will terminate on a given instance. There is a small dissonance here, since the quest has been for classes of sets of dependencies guaranteeing termination of the chase on all instances, even though the latter problem was not known to be undecidable. We resolve the dissonance in this paper by showing that determining whether the chase with a given set of dependencies terminates on all instances is coRE-complete. Our reduction also gives us the aforementioned instance-dependent RE-completeness result as a byproduct. For one of the restricted classes, the stratified sets dependencies, we provide new complexity results for the problem of testing whether a given set of dependencies belongs to it. These results rectify some previous claims that have occurred in the literature.

Full work available at URL: https://arxiv.org/abs/1303.6682

Recommendations

• scientific article; zbMATH DE number 23383
• Chases and escapes. The mathematics of pursuit and evasion
• Chases and escapes. The mathematics of pursuit and evasion
• Chases and escapes: from singles to groups
• Coexistence in chase-escape
• A problem of pursuit and evasion
• Anatomy of deconfinement
• Publication:3202156

zbMATH Keywords

complexityundecidabilitydata exchangechaseincomplete databasesdata repair

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Grammars and rewriting systems (68Q42)

Cited In (19)

• Preserving constraints with the stable chase
• A Single Approach to Decide Chase Termination on Linear Existential Rules
• Title not available (Why is that?)
• Title not available (Why is that?)
• Incomplete data and data dependencies in relational databases
• Title not available (Why is that?)
• On the k-Boundedness for Existential Rules
• Privacy aware data management and chase
• Semi-oblivious chase termination: the sticky case
• Restricted chase termination for existential rules: a hierarchical approach and experimentation
• Characterizing boundedness in chase variants
• All-instances termination of chase is undecidable
• Title not available (Why is that?)
• Universal solutions for temporal data exchange
• Provenance-directed Chase\&Backchase
• Querying Weak Instances Under Extension Chase Semantics: A Complete Solution
• Taming the infinite chase: query answering under expressive relational constraints
• Uniform Restricted Chase Termination
• Query answering over inconsistent knowledge bases: a probabilistic approach

This page was built for publication: Anatomy of the Chase

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637897)