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

XPath evaluation in linear time with polynomial combined complexity

Published:29 June 2009Publication History

ABSTRACT

We consider a fragment of XPath 1.0, where attribute and text values may be compared. We show that for any unary query in this fragment, the set of nodes that satisfy the query can be calculated in time linear in the document size and polynomial in the size of the query. The previous algorithm for this fragment also had linear data complexity but exponential complexity in the query size.

References

  1. M.A. Bender and M. Farach-Colton. The LCA problem revisited. In Latin American Theoretical Informatics, pages 88--94, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Benedikt and C. Koch. XPath leashed. ACM Computing Surveys. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. BojaDczyk and P. Parys. XPath evaluation in linear time. In PODS, pages 241--250, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Clark and S. DeRose. XML Path language (XPath) version 1.0, W3C recommendation. Technical report, W3C, 1999.Google ScholarGoogle Scholar
  5. G. Gottlob, C. Koch, and R. Pichler. XPath query evaluation: Improving time and space eficiency. In ICDE'03, pages 379--390, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  6. G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems, 30(2):444--491, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Harel and R. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338--355, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Kärkkäinen and P. Sanders. Simple linear work suffix array construction. In International Conference on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 943--955, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. XPath evaluation in linear time with polynomial combined complexity

      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 '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
        June 2009
        298 pages
        ISBN:9781605585536
        DOI:10.1145/1559795
        • General Chair:
        • Jan Paredaens,
        • Program Chair:
        • Jianwen Su

        Copyright © 2009 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 29 June 2009

        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!