A DTD-conscious sparse numbering scheme

Focusing on the rapid locating techniques on XML ordered tree, the paper presents a DTD-conscious sparse numbering scheme. Combining the validation on elements defined by DTD and the elements´ actual appearance in the XML file to be loaded, our scheme relies on a sparse range function defined in this paper to decide the parameters for file numbering. With the function´s sparse adjustment, our scheme is able to reserve some range of ids for those positions where node insertion may happen, thus reduces file renumbering caused by node insertion and improves the overall efficiency of XML data operations.