LLS: level-based labeling scheme for XML databases

Authors:
Samir Mohammad;Patrick Martin
Affiliations:
Queen's University, Kingston, Ontario, Canada;Queen's University, Kingston, Ontario, Canada
Venue:
Proceedings of the 2010 Conference of the Center for Advanced Studies on Collaborative Research
Year:
2010

Citing 20
Cited 1

Data on the Web: from relations to semistructured data and XML

Data on the Web: from relations to semistructured data and XML
On supporting containment queries in relational database management systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Labeling dynamic XML trees

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Covering indexes for branching path queries

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Storing and querying ordered XML using a relational database system

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Index Structures for Path Expressions

ICDT '99 Proceedings of the 7th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
A Fast Index for Semistructured Data

Proceedings of the 27th International Conference on Very Large Data Bases
The XML benchmark project

The XML benchmark project
ViST: a dynamic index method for querying XML data by tree structures

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
D(k)-index: an adaptive structural summary for graph-structured data

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
PRIX: Indexing And Querying XML Using Prüfer Sequences

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
ORDPATHs: insert-friendly XML node labels

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
LSDX: a new labelling scheme for dynamically updating XML data

ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Efficient processing of XML path queries using the disk-based F&B Index

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Dynamic labeling schemes for ordered XML based on type information

ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Efficiently Querying Large XML Data Repositories: A Survey

IEEE Transactions on Knowledge and Data Engineering

LTIX: a compact level-based tree to index XML databases

Proceedings of the Fourteenth International Database Engineering & Applications Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Labeling nodes of XML trees to reflect the structure is useful for indexing and retrieving XML data. Current labeling schemes can be divided into two groups: interval labeling and prefix labeling schemes. In this paper we first discuss the advantages and disadvantages of the two groups. We then propose a novel labeling scheme, Level-based Labeling Scheme (LLS), which has the advantages of the two types of schemes while eliminating the main disadvantages. The LLS is based on the levels of the nodes in XML trees and the summary of an XML tree. We provide a set of experiments that indicate the performance benefits of our proposed scheme compared with interval labeling schemes using different mappings to relational tables to implement the indices.