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

XPath evaluation in linear time

Published:09 June 2008Publication History

ABSTRACT

We consider a fragment of XPath where attribute values can only be tested for equality. We show that for any fixed unary query in this fragment, the set of nodes that satisfy the query can be calculated in time linear in the document size.

References

  1. M. Bojańczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning. In Principles of Database Systems, pages 10 -- 19, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. T. Colcombet. A combinatorial theorem for trees. In ICALP'07, Lecture Notes in Computer Science. Springer-Verlag, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. T. Colcombet. Factorisation forests for infinite words. In FCT'07, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T. Colcombet. On Factorization Forests. Technical Report hal-00125047, Irisa Rennes, 2007.Google ScholarGoogle Scholar
  5. R. Pichler G. Gottlob, C. Koch. Xpath query evaluation: Improving time and space efficiency. In ICDE'03, pages 379--390, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  6. R. Pichler G. Gottlob, C. Koch. Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems, 30(2):444--491, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Koch M. Benedikt. XPath leashed. ACM Computing Surveys. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. I. Simon. Factorization forests of finite height. Theoretical Computer Science, 72:65 -- 94, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. XPath evaluation in linear time

        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 '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
          June 2008
          330 pages
          ISBN:9781605581521
          DOI:10.1145/1376916

          Copyright © 2008 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 9 June 2008

          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!