skip to main content
10.1145/1807085.1807102acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Semantic query optimization in the presence of types

Published:06 June 2010Publication History

ABSTRACT

Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their close connection, these two problems to date have always been studied separately. We present a unifying, logic-based framework for query optimization in the presence of data dependencies and type information. It builds upon the classical chase algorithm and extends existing query minimization techniques to considerably larger classes of queries and dependencies. In particular, our setting requires chasing conjunctive queries (possibly with union and negation) in the presence of dependencies containing negation and disjunction. We study the applicability of the chase in this setting, develop novel conditions that guarantee its termination, identify fragments for which minimal query computation is always possible (w.r.t. a generic cost function), and investigate the complexity of related decision problems.

References

  1. A. Deutsch, L. Popa and V. Tannen. Query Reformulation with Constraints. SIGMOD Record, 35(1):65--73, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Abiteboul, G. Lausen, H. Uphoff, and E. Waller. Methods and rules. In SIGMOD, pages 32--41, New York, NY, USA, 1993. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Beeri and M. Y. Vardi. A Proof Procedure for Data Dependencies. J. ACM, 31(4):718--741, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. P. Buneman, W. Fan, and S. Weinstein. Interaction between path and type constraints. ACM Trans. Comput. Logic, 4(4):530--577, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Cali, G. Gottlob, and M. Kifer. Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. In KR, 2008.Google ScholarGoogle Scholar
  7. A. Cali, G. Gottlob, and T. Lukasiewicz. A General Datalog-based Framework for Tractable Query Answering over Ontologies. In PODS, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Calvanese, G. De Giacomo, and M. Lenzerini. Conjunctive Query Containment and Answering under Description Logic Constraints. ACM Trans. Comput. Log., 9(3), 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. U. Chakravarthy, J. Grant, and J. Minker. Logic-based Approach to Semantic Query Optimization. TODS, 15(2):162--207, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. E. Chan. Containment and Minimization of Positive Conjunctive Queries in OODB's. In PODS, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Maier, A. Mendelzon and Y. Sagiv. Testing Implications of Data Dependencies. In SIGMOD, pages 152--152, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Deutsch, A. Nash, and J. Remmel. The Chase Revisited. In PODS, pages 149--158, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. G. Dong and J. Su. Conjunctive Query Containment with Respect to Views and Constraints. Inf. Process. Lett., 57(2):95--102, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. R. Fagin. Horn Clauses and Database Dependencies. J. ACM, 29(4):952--985, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. R. Fagin, P. Kolaitis, R. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. Theor. Comput. Sci., 336(1):89--124, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. J. ACM, 49(3):368--406, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T. Frühwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic Programs as Types for Logic Programs. In LICS, pages 300--309, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  21. A. Fuxman, P. Kolaitis, R. Miller, and W.-C. Tan. Peer Data Exchange. TODS, 31(4):1454--1498, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. A. Halevy. Answering Queries Using Views: A Survey. VLDB Journal, 10(4):270--294, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. J. Henriksson and J. Maluszynski. Static Type-Checking of Datalog with Ontologies. In PPSWR, pages 76--89, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  25. D. Johnson and A. Klug. Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies. In PODS, pages 164--169, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. M. Kifer, G. Lausen, and J. Wu. Logical Foundations of Object-Oriented and Frame-Based Languages. J. ACM, 42(4):741--843, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. M. Lenzerini. Data Integration: A Theoretical Perspective. In PODS, pages 233--246, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. A. Levy and D. Suciu. Deciding Containment for Queries with Complex Objects. In PODS, pages 20--31, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. B. Marnette. Generalized Schema-Mappings: From Termination to Tractability. In PODS, pages 13--22, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. M. Meier, M. Schmidt, and G. Lausen. On Chase Termination Beyond Stratification. PVLDB, 2(1), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. M. Meier, M. Schmidt, and G. Lausen. On Chase Termination Beyond Stratification. Technical Report, 2009.Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. T. Milo and D. Suciu. Type Inference for Queries on Semistructured Data. In PODS, pages 215--226, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Y. Papakonstantinou, H. Garcia-Molina, and J. Widom. Object Exchange Across Heterogeneous Information Sources. In ICDE, pages 251--260, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. L. Popa, A. Deutsch, A. Sahuguet, and V. Tannen. A Chase Too Far? In SIGMOD, pages 273--284, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. L. Popa and V. Tannen. An Equational Chase for Path-Conjunctive Queries, Constraints, and Views. In ICDT, pages 39--57, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. M. Schäfer and O. de Moor. Type inference for datalog with complex type hierarchies. In POPL, pages 145--156, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. M. Schmidt, M. Meier, and G. Lausen. Foundations of SPARQL Query Optimization. In ICDT, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. L. Stockmeyer. The polynomial-time hierarchy. Theor. Comput. Sci., 3:1--22, 1976.Google ScholarGoogle ScholarCross RefCross Ref
  41. D. Toman and G. E. Weddell. On Path-functional Dependencies as First-class Citizens in Description Logics. In Description Logics, 2005.Google ScholarGoogle Scholar
  42. D. Zook, E. Pasalic, and B. Sarna-Starosta. Typed Datalog. In PADL, pages 162--182, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Semantic query optimization in the presence of types

          Recommendations

          Comments

          Login options

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

          Sign in
          • Published in

            cover image ACM Conferences
            PODS '10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
            June 2010
            350 pages
            ISBN:9781450300339
            DOI:10.1145/1807085

            Copyright © 2010 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 6 June 2010

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            Overall Acceptance Rate476of1,835submissions,26%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!