A Persistent Labeling Scheme for Dynamic Ordered XML Trees

Khaing, Aye Aye; Thein, Ni Lar

doi:10.1109/wi.2006.23

Cited by 15 publications

(15 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It is easy to determine the relationship between nodes by checking whether one label contains another [28,16,12]. For instance, nodes may be labeled with a number range expressed as two numbers.…”

Section: Nested Set Modelmentioning

confidence: 99%

Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases

Morozov

Saiedian

Wang

2014

CIT

View full text Add to dashboard Cite

Hierarchical data structures are important for many computing and information science disciplines including data mining, terrain modeling, and image analysis. There are many specialized hierarchical data management systems, but they are not always available. Alternatively, relational databases are far more common and offer superior reliability, scalability, and performance. However, relational databases cannot natively store and manage hierarchical data. Labeling schemes resolve this issue by labeling all nodes with alphanumeric strings that can be safely stored and retrieved from a database. One such scheme uses prime numbers for its labeling purposes, however the performance and space utilization of this method are not optimal. We propose a more efficient and compact version of this approach.

show abstract

Section: Nested Set Modelmentioning

confidence: 99%

Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases

Morozov

Saiedian

Wang

2014

CIT

View full text Add to dashboard Cite

show abstract

“…For example, the positional identifier aaaaabcbcbcdddde would be rewritten as 5a3(bc)4de. In [12] a labelling scheme very similar to LSDX is proposed and differs only in the method to determine the positional identifier of a node. However, LSDX and the two labelling schemes derived from it do not always produce unique node labels for several corner-case update scenarios and therefore they are unsuitable for use as dynamic labelling schemes for XML.…”

Section: Prefix Schemesmentioning

confidence: 99%

Desirable properties for XML update mechanisms

O’Connor

Roantree

2010

Proceedings of the 2010 EDBT/ICDT Workshops

View full text Add to dashboard Cite

The adoption of XML as the default data interchange format and the standardisation of the XPath and XQuery languages has resulted in significant research in the development and implementation of XML databases capable of processing queries efficiently. The ever-increasing deployment of XML in industry and the real-world requirement to support efficient updates to XML documents has more recently prompted research in dynamic XML labelling schemes. In this paper, we provide an overview of the recent research in dynamic XML labelling schemes. Our motivation is to define a set of properties that represent a more holistic dynamic labelling scheme and present our findings through an evaluation matrix for most of the existing schemes that provide update functionality.

show abstract

“…However, the factorization is still quite expensive. In [18], it was reported that the ORDPATH method [17] achieves both better structural information extraction and storage consumption than the existing prefix-based labeling methods such as LSDX [8] and persistent labeling schemes [9,12]. Other two update-friendly labeling schemes, namely QED [14] and CDBS [15], are more efficient than the ORDPATH method in respect to data updates.…”

Section: Related Workmentioning

confidence: 99%

“…ORDPATH, which is implemented in Microsoft R SQL Server T M 2005, is also an update-friendly labeling method based on the DO number. [18] reported that ORDPATH achieves both better structural information extraction and storage consumption than the existing prefix-based labeling methods such as LSDX [8] and persistent labeling schemes [9,12]. DO-VLEI achieves efficient structural information extraction as ORDPATH does.…”

Section: Introductionmentioning

confidence: 99%

A Low-Storage-Consumption XML Labeling Method for Efficient Structural Information Extraction

Liang

Takahashi

Yokota

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Recently, labeling methods to extract and reconstruct the structural information of XML data, which are important for many applications such as XPath query and keyword search, are becoming more attractive. To achieve efficient structural information extraction, in this paper we propose C-DO-VLEI code, a novel update-friendly bit-vector encoding scheme, based on register-length bit operations combining with the properties of Dewey Order numbers, which cannot be implemented in other relevant existing schemes such as ORDPATH. Meanwhile, the proposed method also achieves lower storage consumption because it does not require either prefix schema or any reserved codes for node insertion. We performed experiments to evaluate and compare the performance and storage consumption of the proposed method with those of the ORDPATH method. Experimental results show that the execution times for extracting depth information and parent node labels using the C-DO-VLEI code are about 25% and 15% less, respectively, and the average label size using the C-DO-VLEI code is about 24% smaller, comparing with ORDPATH.

show abstract

A Persistent Labeling Scheme for Dynamic Ordered XML Trees

Cited by 15 publications

References 5 publications

Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases

Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases

Desirable properties for XML update mechanisms

A Low-Storage-Consumption XML Labeling Method for Efficient Structural Information Extraction

Contact Info

Product

Resources

About