A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Covering indexes for branching path queries
2002
Proceedings of the 2002 ACM SIGMOD international conference on Management of data - SIGMOD '02
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tree-or graph-structured XML data. Our answer is yes --the forward-and-backward index already proposed in the literature can be viewed as a structure analogous to a summary table or covering index. We also show that it is the smallest such index that covers all branching path expression queries. While this index is very
doi:10.1145/564691.564707
dblp:conf/sigmod/KaushikBNK02
fatcat:cfla4lyxnzdd5jn4tm6idt7vpu