On chase termination beyond stratification

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 970-981

  Meier, Michael ^a,a   Lausen, Georg ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA INTEGRATION; DATABASE SYSTEMS; ELECTRONIC DATA INTERCHANGE; OPTIMIZATION; QUERY LANGUAGES;

CHASE ALGORITHM; CONJUNCTIVE QUERIES; CONSTRAINT VIOLATION; DATABASE PROBLEMS; IMPLICATION PROBLEM; KNOWLEDGE BASIS; TERMINATION CONDITION; TERMINATION PROBLEMS;

QUERY PROCESSING;

EID: 77954498300     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687737     Document Type: Article

References (22)

1. A. Deutsch, L. Popa and V. Tannen. Query Reformulation with Constraints. SIGMOD Record, 35(1):65-73, 2006.
2. A. Fuxman, P.G. Kolaitis, R.J. Miller and W. Tan. Peer Data Exchange. ACM Trans. Database Syst., 31(4):1454-1498, 2006.
3. A. V. Aho, Y. Sagiv, and J. D. Ullman. Efficient Optimization of a Class of Relational Expressions. ACM Trans. Database Syst., 4(4):435-454, 1979.
4. C. Beeri and M. Y. Vardi. A Proof Procedure for Data Dependencies. J. ACM, 31(4):718-741, 1984.
5. A. Calì, G. Gottlob, and M. Kifer. Taming the Infinite Chase:Query Answering under Expressive Relational Constraints. In Description Logics, volume 353, 2008.
6. A. Calì, G. Gottlob, and T. Lukasiewicz. Datalog+-: A Unified Approach to Ontologies and Integrity Constraints. In ICDT, pages 14-30, 2009.
7. B. Courcelle. The Monadic Second-order Logic of Graphs II:Infinite Graphs of Bounded Width. Mathematical Systems Theory, 21(4):187-221, 1989.
8. D. Maier, A. Mendelzon and Y. Sagiv. Testing Implications of Data Dependencies. In SIGMOD, pages 152-152, 1979.
9. A. Deutsch, A. Nash, and J. Remmel. The Chase Revisited. In PODS, pages 149-158, 2008.
10. A. Deutsch and V. Tannen. Reformulation of XML Queries and Constraints. In ICDT, pages 225-241, 2003.
11. G. Gottlob and A. Nash. Efficient Core Computation in Data Exchange. J. ACM, 55(2), 2008.
12. A. Y.. Answering Queries Using Views: A Survey. VLDB Journal, 10(4):270-294, 2001.
13. D. S. Johnson and A. Klug. Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. In PODS, pages 164-169, 1982.
14. J. J. King. QUIST: A System for Semantic Query Optimization in Relational Databases. In VLDB, pages 510-517, 1981.
15. M. Lenzerini. Data Integration: A Theoretical Perspective. In PODS, pages 233-246, 2002.
16. M. Meier, M. Schmidt, and G. Lausen. On Chase Termination Beyond Stratification, Technical Report. CoRR, abs/0906.4228, 2009.
17. M. Meier, M. Schmidt, and G. Lausen. Stop the Chase, Extended Abstract. Proc. Alberto Mendelzon International Workshop on Foundations of Data Management, 2009.
18. M. Meier, M. Schmidt, and G. Lausen. Stop the Chase, Technical Report. CoRR, abs/0901.3984, 2009.
19. D. Olteanu, J. Huang, and C. Koch. SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases. In ICDE, pages 640-651, 2009.
20. L. Popa and V. Tannen. An Equational Chase for Path-Conjunctive Queries, Constraints, and Views. In ICDT, pages 39-57, 1999.
21. R. Fagin, P.G. Kolaitis, R.J. Miller and L. Popa. Data Exchange: Semantics and Query Answering. Theor. Comput. Sci., 336(1):89-124, 2005.
22. M. Schmidt, M. Meier, and G. Lausen. Foundations of SPARQL Query Optimization, Technical Report. CoRR, abs/0812.3788, 2008.