Please use this identifier to cite or link to this item:
Title: Incremental XPath Evaluation
Authors: Bjorklund, Henrik
GELADE, Wouter 
Marquardt, Marcel
Issue Date: 2009
Publisher: ACM
Source: Fagin, Ronald (Ed.) Proceedings of the International Conference on Database Theory. p. 162-173.
Series/Report: ACM International Conference Proceeding Series
Series/Report no.: 361
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.
Keywords: XPath
Document URI:
Link to publication:
ISBN: 978-1-60558-423-2
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
icdt09.pdfPreprint260.28 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on Feb 24, 2022


checked on Feb 24, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.