skip to main content
10.1145/3055399.3079076acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
invited-talk

Optimizing tree pattern queries: why cutting is not enough (invited talk)

Published:19 June 2017Publication History

ABSTRACT

Tree pattern queries are a natural language for querying graph- and tree-structured data. A central question for understanding their optimization problem was whether they can be minimized by cutting away redundant parts. This question has been studied since the early 2000's and was recently resolved.

References

  1. W. Czerwiński, W. Martens, M. Niewerth, and P. Parys. Minimization of Tree Pattern Queries. In PODS, pages 43–54, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. W. Czerwiński, W. Martens, M. Niewerth, and P. Parys. Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data. Sigmod RECORD, 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Flesca, F. Furfaro, and E. Masciari. On the minimization of XPath queries. J. ACM, 55(1), 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. B. Kimelfeld and Y. Sagiv. Revisiting redundancy and minimization in an XPath fragment. In EDBT, pages 61–72, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. G. Miklau and D. Suciu. Containment and equivalence for a fragment of XPath. J. ACM, 51(1), 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Abstract 1 The Counterexample in a Nutshell ReferencesGoogle ScholarGoogle Scholar

Index Terms

  1. Optimizing tree pattern queries: why cutting is not enough (invited talk)

      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
        STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
        June 2017
        1268 pages
        ISBN:9781450345286
        DOI:10.1145/3055399

        Copyright © 2017 Owner/Author

        Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 19 June 2017

        Check for updates

        Qualifiers

        • invited-talk

        Acceptance Rates

        Overall Acceptance Rate1,469of4,586submissions,32%

        Upcoming Conference

        STOC '24
        56th Annual ACM Symposium on Theory of Computing (STOC 2024)
        June 24 - 28, 2024
        Vancouver , BC , Canada
      • Article Metrics

        • Downloads (Last 12 months)2
        • Downloads (Last 6 weeks)1

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader