A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
On reducing redundancy and improving efficiency of XML labeling schemes
2005
Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05
The basic relationships to be determined in XML query processing are ancestor-descendant (A-D), parent-child (P-C), sibling and ordering relationships. The containment labeling scheme can determine the A-D, P-C and ordering relationships fast, but it is very expensive in determining the sibling relationship. The prefix labeling scheme can determine all the four basic relationships fast if the XML tree is shallow. However, if the XML tree is deep, the prefix scheme is inefficient since the
doi:10.1145/1099554.1099599
dblp:conf/cikm/LiLLY05
fatcat:prrhooclm5aipb7pnrbrhcxebe