On reducing redundancy and improving efficiency of XML labeling schemes

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. Categories and Subject Descriptors H.2.4 [Database Management]: Systems – query processing General Terms Performance. Keywor...

• Type: Conference
• Year: 2005
• Where: CIKM
• Authors: Changqing Li, Tok Wang Ling, Jiaheng Lu, Tian Yu
• Keywords: Basic Relationships, CIKM 2005, Containment Labeling Scheme, Prefix Labeling Scheme