Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/9914

Title: Incremental XPath Evaluation
Authors: Bjorklund, Henrik
GELADE, Wouter
Marquardt, Marcel
Issue Date: 2009
Publisher: ACM
Citation: Fagin, Ronald (Ed.) Proceedings of the International Conference on Database Theory. p. 162-173.
Series/Report: ACM International Conference Proceeding Series, 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.
URI: http://hdl.handle.net/1942/9914
Link to publication: http://doi.acm.org/10.1145/1514894.1514915
ISBN: 978-1-60558-423-2
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Preprint260.28 kBAdobe PDF

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