Evaluation of XML Laveling Methodss using Endless Insertable Code VLEI
K. Kobayashi, Haruo Yokota · 2004
Recently, it is strongly demanded to search XML documents efficiently. Storing XML documents into a relational database is one of good approaches. A number of methods have been proposed to handle the XML parent-children relationship within the relational model. However, these methods do not well consider update operations. To reduce the cost of insertions, several methods keep intervals between labeling numbers, but they require whole database reconstruction when the intervals are used up. We have proposed the Variable Length Endless Insertable (VLEI) code to reduce the cost of reconstruction. In this paper, we propose methods to apply the VLEI code to XML labeling methods, preorder-postorder and Dewey order methods, and compare their performance for search and insertion operations.