This paper proposes a scheme for XML node numbering based on pre- and postorders, that enables efficient updating. We exploit the Range Labeling, where each node in an XML tree is assigned a range, consisting of two numbers, and the ancestor-descendant relationship between two nodes can be detected by the labels. Huge amount of XML data have already appeared, and in time to come, we make use of such XML data that would be updated frequently. Because spaces available for ranges are limited, when updating XML data, we need renumbering in order to retain relationships among node numbers. In this paper, we concentrate on the issue of renumbering. First, we make the basis for update by giving sparse numbers to nodes. Next, by managing node numbers, it becomes possible to update XML data continuously. Our method will be the basis of full-featured XML Labeling schemes.
展开▼
