Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
APEX: an adaptive path index for XML data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Representative Objects: Concise Representations of Semistructured, Hierarchial Data
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
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
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
On the integration of structure indexes and inverted lists
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Configurable indexing and ranking for XML information retrieval
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Using a compact tree to index and query XML data
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Prefiltering techniques for efficient XML document processing
Proceedings of the 2005 ACM symposium on Document engineering
XML Evolution: a two-phase XML processing model using XML prefiltering techniques
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
A co-training framework for searching XML documents
Information Systems
Faster path indexes for search in XML data
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
Journal of Systems and Software
Xistree: bottom-up method of XML indexing
BIS'07 Proceedings of the 10th international conference on Business information systems
KWilt: a semantic patchwork for flexible access to heterogeneous knowledge
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
An effective, efficient XML data broadcasting method in a mobile wireless network
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Semantic-based construction of content and structure XML index
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
Hi-index | 0.00 |
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at the element level. Group level mapping allows efficient pruning of a large search space while element level mapping provides fast access to the parent of an element. Due to the tree nature of XML data and queries, such fast child-to-parent access is essential for efficient XML query processing. Using group-based element reference, Ctree enables the clustering of inverted lists according to groups, which provides efficient join between inverted lists and structural index group extents. Our experiments reveal that Ctree is efficient for processing both single-path and branching queries with various value predicates.