Please use this identifier to cite or link to this item:
|Title:||An improved prefix labeling scheme: A binary string approach for dynamic ordered XML||Authors:||Li, C.
|Issue Date:||2005||Citation:||Li, C.,Ling, T.W. (2005). An improved prefix labeling scheme: A binary string approach for dynamic ordered XML. Lecture Notes in Computer Science 3453 : 125-137. ScholarBank@NUS Repository.||Abstract:||A number of labeling schemes have been designed to facilitate the query of XML, based on which the ancestor-descendant relationship between any two nodes can be determined quickly. Another important feature of XML is that the elements in XML are intrinsically ordered. However the label update cost is high based on the present labeling schemes. They have to re-label the existing nodes or re-calculate some values when inserting an order-sensitive element. Thus it is important to design a scheme that supports order-sensitive queries, yet it has low label update cost. In this paper, we design a binary string prefix scheme which supports order-sensitive update without any re-labeling or re-calculation. Theoretical analysis and experimental results also show that this scheme is compact compared to the existing dynamic labeling schemes, and it provides efficient support to both ordered and un-ordered queries. © Springer-Verlag Berlin Heidelberg 2005.||Source Title:||Lecture Notes in Computer Science||URI:||http://scholarbank.nus.edu.sg/handle/10635/41026||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.