Change search
ReferencesLink to record
Permanent link

Direct link
Incremental XPath Evaluation
Umeå University, Faculty of Science and Technology, Department of Computing Science. (NFL)
2009 (English)In: Proceedings of the 12th international conference on database theory: March 23-25, 2009, Saint Petersbourgh, Russia / [ed] Ronald Fagin, 2009, 162-173 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
2009. 162-173 p.
, ACM International Conference Proceeding Series, 361
National Category
Computer Science
URN: urn:nbn:se:umu:diva-35541OAI: diva2:344988
International Conference on Database Theory (ICDT)
Available from: 2010-08-23 Created: 2010-08-23 Last updated: 2010-10-10Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Björklund, Henrik
By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 31 hits
ReferencesLink to record
Permanent link

Direct link