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

Efficient evaluation for a temporal logic on changing XML documents

Published:13 June 2011Publication History

ABSTRACT

We consider a sequence t1,...,tk of XML documents that is produced by a sequence of local edit operations. To describe properties of such a sequence, we use a temporal logic. The logic can navigate both in time and in the document, e.g. a formula can say that every node with label a eventually gets a descendant with label b. For every fixed formula, we provide an evaluation algorithm that works in time O(k ⋅ log(n)), where k is the number of edit operations and n is the maximal size of document that is produced. In the algorithm, we represent formulas of the logic by a kind of automaton, which works on sequences of documents. The algorithm works on XML documents of bounded depth.

References

  1. Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, and Mayank Saksena. Regular model checking for LTL(MSO). In CAV, volume 3114 of Lecture Notes in Computer Science, pages 348--360. Springer, 2004.Google ScholarGoogle Scholar
  2. Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Mayank Saksena. A survey of regular model checking. In CONCUR, volume 3170 of Lecture Notes in Computer Science, pages 35--48. Springer, 2004.Google ScholarGoogle Scholar
  3. Serge Abiteboul, Laurent Herr, and Jan Van den Bussche. Temporal connectives versus explicit timestamps to query temporal databases. J. Comput. Syst. Sci., 58(1):54--68, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Andrey Balmin, Yannis Papakonstantinou, and Victor Vianu. Incremental validation of XML documents. ACM Trans. Database Syst., 29(4):710--751, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Denilson Barbosa, Alberto O. Mendelzon, Leonid Libkin, Laurent Mignet, and Marcelo Arenas. Efficient incremental validation of XML documents. In ICDE, pages 671--682, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Henrik Bjorklund, Wouter Gelade, Marcel Marquardt, and Wim Martens. Incremental XPath evaluation. In ICDT, pages 162--173, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Bojanczyk and I. Walukiewicz. Forest algebras. In Automata and Logic: History and Perspectives, pages 107--132. Amsterdam University Press, 2007.Google ScholarGoogle Scholar
  8. Miko laj Bojanczyk and Pawel Parys. XPath evaluation in linear time. In PODS, pages 241--250, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ghislain Fourny, Daniela Florescu, Donald Kossmann, and Markos Zacharioudakis. A time machine for XML: PUL composition. In XML Prague, 2010.Google ScholarGoogle Scholar
  10. David Gabelaia, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. Products of 'transitive' modal logics. J. Symb. Log., 70(3):993--1021, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  11. Leonid Libkin. Logics for unranked trees: An overview. Logical Methods in Computer Science, 2(3), 2006.Google ScholarGoogle Scholar
  12. Bernd-Holger Schlingloff. Expressive completeness of temporal logic of trees. Journal of Applied Non-Classical Logics, 2(2), 1992.Google ScholarGoogle ScholarCross RefCross Ref
  13. Luc Segoufin. Automata and logics for words and trees over an infinite alphabet. In CSL, pages 41--57, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Efficient evaluation for a temporal logic on changing XML documents

      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 '11: Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
        June 2011
        332 pages
        ISBN:9781450306607
        DOI:10.1145/1989284

        Copyright © 2011 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 13 June 2011

        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!