research-article

Free access

Incremental XPath evaluation

Authors:

Henrik Björklund,

Marcel Marquardt,

Wim MartensAuthors Info & Claims

ICDT '09: Proceedings of the 12th International Conference on Database Theory

Pages 162 - 173

https://doi.org/10.1145/1514894.1514915

Published: 23 March 2009 Publication History

Abstract

We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. Our main results are that downward XPath queries can be incrementally maintained in time O(depth(D) · poly(Q)) and conjunctive forward XPath queries in time O(depth(D)· log(width(D))·poly(Q)), where D is the size of the database, Q the size of the query, and depth(D) and width(D) are the nesting depth and maximum number of siblings in the database, respectively. The auxiliary data structures for maintenance are linear in D and polynomial in Q in all these cases.

References

[1]

A. Balmin, Y. Papakonstantinou, and V. Vianu. Incremental validation of XML documents. ACM TODS, 29(4):710--751, 2004.

Digital Library

[2]

Z. Bar-Yossef, M. Fontoura, and V. Josifovski. On the memory requirements of XPath evaluation over XML streams. JCSS, 73(3):391--441, 2007.

Digital Library

[3]

D. Barbosa, A. O. Mendelzon, L. Libkin, L. Mignet, and M. Arenas. Efficient incremental validation of XML documents. In ICDE, pages 671--682, 2004.

Digital Library

[4]

M. Benedikt and C. Koch. XPath leashed. ACM Comp. Surveys, 2008. To appear.

Digital Library

[5]

M. Bojańczyk and P. Parys. XPath evaluation in linear time. In PODS, pages 241--250, 2008.

Digital Library

[6]

G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. ACM TODS, 30(2):444--491, 2005.

Digital Library

[7]

G. Gottlob, C. Koch, R. Pichler, and L. Segoufin. The complexity of XPath query evaluation and XML typing. J. ACM, 52(2):284--335, 2005.

Digital Library

[8]

M. Götz, C. Koch, and W. Martens. Efficient algorithms for the tree homeomorphism problem. In DBPL, pages 17--31, 2007.

Digital Library

[9]

M. Grohe, C. Koch, and N. Schweikardt. Tight lower bounds for query processing on streaming and external memory data. TCS, 380(1--2):199--217, 2007.

Digital Library

[10]

A. Gupta, I. Singh Mumick, and V. S. Subrahmanian. Maintaining views incrementally. In SIGMOD, pages 157--166, 1993.

Digital Library

[11]

Leonid Libkin and Cristina Sirangelo. Reasoning about XML with temporal logics and automata. In LPAR, pages 97--112, 2008.

Digital Library

[12]

H. Matsumura and K. Tajima. Incremental evaluation of a monotone XPath fragment. In CIKM, pages 245--246, 2005.

Digital Library

[13]

P. E. O'Neil, E. J. O'Neil, S. Pal, I. Cseri, G. Schaller, and N. Westbury. ORDPATHs: Insert-friendly XML node labels. In SIGMOD, pages 903--908, 2004.

Digital Library

[14]

M. Onizuka, F. Yee Chan, R. Michigami, and T. Honishi. Incremental maintenance for materialized XPath/XSLT views. In WWW, pages 671--681, 2005.

Digital Library

[15]

S. Patnaik and N. Immerman. Dyn-FO: A parallel, dynamic complexity class. JCSS, 55(2):199--209, 1997.

Digital Library

[16]

A. Sawires, J. Tatemura, O. Po, D. Agrawal, A. El Abbadi, and K. Selçuk Candan. Maintaining XPath views in loosely coupled systems. In VLDB, pages 583--594, 2006.

Digital Library

[17]

A. Sawires, J. Tatemura, O. Po, D. Agrawal, and K. Selçuk Candan. Incremental maintenance of path-expression views. In SIGMOD, pages 443--454, 2005.

Digital Library

[18]

N. Schweikardt. Machine models and lower bounds for query processing. In PODS, pages 41--52, 2007.

Digital Library

[19]

T. Schwentick. XPath query containment. Sigmod RECORD, 33(1):101--109, 2004.

Digital Library

[20]

O. Shmueli and A. Itai. Incremental view maintenance. In SIGMOD, pages 240--255, 1984.

[21]

B. ten Cate and C. Lutz. The complexity of query containment in expressive fragments of XPath 2.0. In PODS, pages 73--82, 2007.

Digital Library

Cited By

Duc Luong DQuang Phuong VTung H(2023)AN IMPROVED INDEXING METHOD FOR QUERYING BIG XML FILESJournal of Computer Science and Cybernetics10.15625/1813-9663/19018(323-342)Online publication date: 25-Dec-2023
https://doi.org/10.15625/1813-9663/19018
Gillani SPicard GLaforest FGal AWeidlich MKalogeraki VVenkasubramanian N(2016)Continuous graph pattern matching over knowledge graph streamsProceedings of the 10th ACM International Conference on Distributed and Event-based Systems10.1145/2933267.2933306(214-225)Online publication date: 13-Jun-2016
https://dl.acm.org/doi/10.1145/2933267.2933306
Arroyuelo DClaude FManeth SMäkinen VNavarro GNguyen KSirén JVälimäki N(2015)Fast in-memory XPath search using compressed indexesSoftware—Practice & Experience10.1002/spe.222745:3(399-434)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1002/spe.2227
Show More Cited By

Recommendations

Incremental XPath evaluation

Incremental view maintenance for XPath queries asks to maintain a materialized XPath view over an XML database. It assumes an underlying XML database D and a query Q. One is given a sequence of updates U to D, and the problem is to compute the result of ...
Incremental evaluation of a monotone XPath fragment
CIKM '05: Proceedings of the 14th ACM international conference on Information and knowledge management

This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the database, only deletion (insertion, resp.) may occur to query answers. For ...
Incremental maintenance for materialized XPath/XSLT views
WWW '05: Proceedings of the 14th international conference on World Wide Web

This paper proposes an incremental maintenance algorithm that efficiently updates the materialized XPath/XSLT views defined using XPath expressions in XP^{([],*,//,vars)}. The algorithm consists of two processes. 1) The dynamic execution flow of an XSLT ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICDT '09: Proceedings of the 12th International Conference on Database Theory

March 2009

334 pages

ISBN:9781605584232

DOI:10.1145/1514894

Editor:
Ronald Fagin
IBM Research

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 March 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Deutsche Forschungsgemeinschaft

Conference

EDBT/ICDT '09

EDBT/ICDT '09: EDBT/ICDT '09 joint conference

March 23 - 25, 2009

St. Petersburg, Russia

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
266
Total Downloads

Downloads (Last 12 months)49
Downloads (Last 6 weeks)7

Reflects downloads up to 07 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Duc Luong DQuang Phuong VTung H(2023)AN IMPROVED INDEXING METHOD FOR QUERYING BIG XML FILESJournal of Computer Science and Cybernetics10.15625/1813-9663/19018(323-342)Online publication date: 25-Dec-2023
https://doi.org/10.15625/1813-9663/19018
Gillani SPicard GLaforest FGal AWeidlich MKalogeraki VVenkasubramanian N(2016)Continuous graph pattern matching over knowledge graph streamsProceedings of the 10th ACM International Conference on Distributed and Event-based Systems10.1145/2933267.2933306(214-225)Online publication date: 13-Jun-2016
https://dl.acm.org/doi/10.1145/2933267.2933306
Arroyuelo DClaude FManeth SMäkinen VNavarro GNguyen KSirén JVälimäki N(2015)Fast in-memory XPath search using compressed indexesSoftware—Practice & Experience10.1002/spe.222745:3(399-434)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1002/spe.2227
Bonifati AGoodfellow MManolescu ISileo D(2013)Algebraic incremental maintenance of XML viewsACM Transactions on Database Systems (TODS)10.1145/2508020.250802138:3(1-45)Online publication date: 5-Sep-2013
https://dl.acm.org/doi/10.1145/2508020.2508021
Gelade WMarquardt MSchwentick T(2012)The dynamic complexity of formal languagesACM Transactions on Computational Logic10.1145/2287718.228771913:3(1-36)Online publication date: 28-Aug-2012
https://dl.acm.org/doi/10.1145/2287718.2287719
Bojanczyk MFigueira DLenzerini MSchwentick T(2011)Efficient evaluation for a temporal logic on changing XML documentsProceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1989284.1989317(259-270)Online publication date: 13-Jun-2011
https://dl.acm.org/doi/10.1145/1989284.1989317
Bonifati AGoodfellow MManolescu ISileo D(2011)Algebraic incremental maintenance of XML viewsProceedings of the 14th International Conference on Extending Database Technology10.1145/1951365.1951388(177-188)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.1145/1951365.1951388
Jin XLiao H(2010)An algorithm for incremental maintenance of materialized XPath viewProceedings of the 11th international conference on Web-age information management10.5555/1884017.1884080(513-524)Online publication date: 15-Jul-2010
https://dl.acm.org/doi/10.5555/1884017.1884080
Benedikt MCheney J(2010)Destabilizers and independence of XML updatesProceedings of the VLDB Endowment10.14778/1920841.19209563:1-2(906-917)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.14778/1920841.1920956
Björklund HGelade WMartens W(2010)Incremental XPath evaluationACM Transactions on Database Systems10.1145/1862919.186292635:4(1-43)Online publication date: 12-Oct-2010
https://dl.acm.org/doi/10.1145/1862919.1862926
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents