Technical Reports

The ICICS/CS Reading Room


UBC CS TR-2004-11 Summary

Index-Trees for Descendant Tree Queries in the Comparison Model, July 27, 2004 Jeremy Barbay, 17 pages

Considering indexes and algorithms to answer XPath queries over XML data, we propose an index structure and a related algorithm, both adapted to the comparison model, where elements can be accessed non-sequentially. The indexing scheme uses classical labelling techniques, but structurally represents the ancestor-descendant relationships of nodes of each type, in order to allow exponential searches. The algorithm performs XPath location steps along the descendant axis, and it generates few intermediate results. The complexity of the algorithm is proved worst-case optimal in an adaptive comparison model where the index is given, and where the instances are grouped by the number of comparisons needed to check their answer.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.