Reuse or Never Reuse the Deleted Labels in XML Query Processing Based on Labeling Schemes [chapter]

Changqing Li, Tok Wang Ling, Min Hu
2006 Lecture Notes in Computer Science  
To facilitate the XML query processing, several kinds of labeling schemes have been proposed. Based on the labeling schemes, the ancestordescendant and parent-child relationships in XML queries can be quickly determined without accessing the original XML file. Recently, more researches are focused on how to update the labels when nodes are inserted into the XML. However how to process the deleted labels are not discussed previously. We think that the deleted labels can be processed in two
more » ... ent directions: (1) reuse all the deleted labels to control the label size increasing speed and improve the query performance; (2) never reuse the deleted labels to query different versions of the XML data based on labeling schemes. In this paper, we firstly introduce our previous work, called QED, which can completely avoid the relabeling in XML updates. Secondly based on QED we propose a new algorithm, called Reuse, which can reuse all the deleted labels to control the label size increasing speed; meanwhile the Reuse algorithm can completely avoid the re-labeling also. Thirdly to query different versions of the XML data, we propose another new algorithm, called NeverReuse, which is the only approach that never reuses any deleted labels. Extensive experimental results show that the algorithms proposed in this paper can control the label size increasing speed when reusing all the deleted labels, and is the only approach to query different versions of the XML data based on labeling schemes.
doi:10.1007/11733836_46 fatcat:rbp5gjwj6vdwrbmfzrc3g6kwri