Semantic query optimization in the presence of types

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2010, Pages 111-122

  Meier, Michael ^a   Schmidt, Michael ^a   Wei, Fang ^a   Lausen, Georg ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

chase; constraints; query optimization; types

Indexed keywords

CHASE ALGORITHM; CONJUNCTIVE QUERIES; DATA DEPENDENCIES; DECISION PROBLEMS; LOGIC-BASED FRAMEWORKS; NON-TRIVIAL; QUERY MINIMIZATION; QUERY OPTIMIZATION; SEMANTIC QUERY OPTIMIZATIONS; STATE SPACE; TYPE INFORMATION;

QUERY LANGUAGES; SEMANTICS;

OPTIMIZATION;

EID: 77954741522     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807085.1807102     Document Type: Conference Paper

References (42)

1. A. Deutsch, L. Popa and V. Tannen. Query Reformulation with Constraints. SIGMOD Record, 35(1):65-73, 2006.
2. S. Abiteboul, G. Lausen, H. Uphoff, and E. Waller. Methods and rules. In SIGMOD, pages 32-41, New York, NY, USA, 1993. ACM.
3. C. Beeri and M. Y. Vardi. A Proof Procedure for Data Dependencies. J. ACM, 31(4):718-741, 1984.
4. M. Bruynooghe, J. Gallagher, and W. Van Humbeeck. Inference of Well-Typings for Logic Programs with Application to Termination Analysis. In SAS, pages 35-51, 2005.
5. P. Buneman, W. Fan, and S. Weinstein. Interaction between path and type constraints. ACM Trans. Comput. Logic, 4(4):530-577, 2003.
6. A. Calì, G. Gottlob, and T. Lukasiewicz. A General Datalog-based Framework for Tractable Query Answering over Ontologies. In PODS, 2009.
7. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-lite Family. J. Autom. Reasoning, 39(3):385-429, 2007.
8. D. Calvanese, G. De Giacomo, and M. Lenzerini. Conjunctive Query Containment and Answering under Description Logic Constraints. ACM Trans. Comput. Log., 9(3), 2008.
9. U. Chakravarthy, J. Grant, and J. Minker. Logic-based Approach to Semantic Query Optimization. TODS, 15(2):162-207, 1990.
10. E. Chan. Containment and Minimization of Positive Conjunctive Queries in OODB's. In PODS, 1992.
11. D. Maier, A. Mendelzon and Y. Sagiv. Testing Implications of Data Dependencies. In SIGMOD, pages 152-152, 1979.
12. O. de Moor, D. Sereni, P. Avgustinov, and M. Verbaere. Type Inference for Datalog and its Application to Query Optimisation. In PODS, pages 291-300, 2008.
13. A. Deutsch, B. Ludäscher, and A. Nash. Rewriting Queries Using Views with Access Patterns under Integrity Constraints. Theor. Comput. Sci., 371(3):200-226, 2007.
14. A. Deutsch, A. Nash, and J. Remmel. The Chase Revisited. In PODS, pages 149-158, 2008.
15. G. Dong and J. Su. Conjunctive Query Containment with Respect to Views and Constraints. Inf. Process. Lett., 57(2):95-102, 1996.
16. R. Fagin. Horn Clauses and Database Dependencies. J. ACM, 29(4):952-985, 1982.
17. R. Fagin, P. Kolaitis, R. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. Theor. Comput. Sci., 336(1):89-124, 2005.
18. W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. J. ACM, 49(3):368-406, 2002.
19. T. Frühwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic Programs as Types for Logic Programs. In LICS, pages 300-309, 1991.
20. A. Fuxman, P. Kolaitis, R. Miller, and W.-C. Tan. Peer Data Exchange. TODS, 31(4):1454-1498, 2006.
21. J. Gallagher and G. Puebla. Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs. In PADL, pages 243-261, 2002.
22. A. Halevy. Answering Queries Using Views: A Survey. VLDB Journal, 10(4):270-294, 2001. (Pubitemid 33570969)
23. J. Henriksson and J. Maluszynski. Static Type-Checking of Datalog with Ontologies. In PPSWR, pages 76-89, 2004.
24. D. Johnson and A. Klug. Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies. In PODS, pages 164-169, 1982.
25. M. Kifer, G. Lausen, and J. Wu. Logical Foundations of Object-Oriented and Frame-Based Languages. J. ACM, 42(4):741-843, 1995.
26. P. Kolaitis, D. Martin, and M. Thakur. On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates. In PODS, pages 197-204, 1998.
27. M. Lenzerini. Data Integration: A Theoretical Perspective. In PODS, pages 233-246, 2002.
28. A. Levy and D. Suciu. Deciding Containment for Queries with Complex Objects. In PODS, pages 20-31, 1997.
29. W. Litwin and T. Risch. Main Memory Oriented Optimization of OO Queries Using Typed Datalog with Foreign Predicates. TKDE, 4(6):517-528, 1992.
30. B. Marnette. Generalized Schema-Mappings: From Termination to Tractability. In PODS, pages 13-22, 2009.
31. M. Meier, M. Schmidt, and G. Lausen. On Chase Termination Beyond Stratification. PVLDB, 2(1), 2009.
32. M. Meier, M. Schmidt, and G. Lausen. On Chase Termination Beyond Stratification. Technical Report, 2009.
33. T. Milo and D. Suciu. Type Inference for Queries on Semistructured Data. In PODS, pages 215-226, 1999.
34. D. Olteanu, J. Huang, and C. Koch. SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases. In ICDE, pages 640-651, 2009.
35. Y. Papakonstantinou, H. Garcia-Molina, and J. Widom. Object Exchange Across Heterogeneous Information Sources. In ICDE, pages 251-260, 1995.
36. L. Popa, A. Deutsch, A. Sahuguet, and V. Tannen. A Chase Too Far? In SIGMOD, pages 273-284, 2000.
37. L. Popa and V. Tannen. An Equational Chase for Path-Conjunctive Queries, Constraints, and Views. In ICDT, pages 39-57, 1999.
38. M. Schäfer and O. de Moor. Type inference for datalog with complex type hierarchies. In POPL, pages 145-156, 2010.
39. M. Schmidt, M. Meier, and G. Lausen. Foundations of SPARQL Query Optimization. In ICDT, 2010.
40. L. Stockmeyer. The polynomial-time hierarchy. Theor. Comput. Sci., 3:1-22, 1976.
41. D. Toman and G. E. Weddell. On Path-functional Dependencies as First-class Citizens in Description Logics. In Description Logics, 2005.
42. D. Zook, E. Pasalic, and B. Sarna-Starosta. Typed Datalog. In PADL, pages 162-182, 2009.