Please use this identifier to cite or link to this item:
|Title:||On reducing redundancy and improving efficiency of XML labeling schemes|
|Citation:||Li, C.,Ling, T.W.,Lu, J.,Yu, T. (2005). On reducing redundancy and improving efficiency of XML labeling schemes. International Conference on Information and Knowledge Management, Proceedings : 225-226. ScholarBank@NUS Repository.|
|Abstract:||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 prefix is long. Furthermore, the prefix_label is repeated by all the siblings (only the self_labels of these siblings are different). Thus in this paper, we propose the P-Containment and P-Prefix schemes which can determine all the four basic relationships faster no matter what the XML structure is; meanwhile P-Prefix can reduce the redundancies in the prefix labeling scheme.|
|Source Title:||International Conference on Information and Knowledge Management, Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.