A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved labeling scheme for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Constructing Suffix Trees On-Line in Linear Time
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
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
XSeq: an indexing infrastructure for tree pattern queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
From region encoding to extended dewey: on efficient processing of XML twig pattern matching
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Tree-pattern queries on a lightweight XML processor
VLDB '05 Proceedings of the 31st international conference on Very large data bases
XML Document Indexes: A Classification
IEEE Internet Computing
Efficient indexing and querying of XML data using modified Prüfer sequences
Proceedings of the 14th ACM international conference on Information and knowledge management
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
LCS-TRIM: dynamic programming meets XML indexing and querying
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Using a relational database for scalable XML search
The Journal of Supercomputing
Lock-free consistency control for web 2.0 applications
Proceedings of the 17th international conference on World Wide Web
Faster path indexes for search in XML data
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
An Efficient XML Index Structure with Bottom-Up Query Processing
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Improving XML schema matching performance using Prüfer sequences
Data & Knowledge Engineering
XPath query evaluation based on the stack encoding
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Bottom-Up Evaluation of Twig Join Pattern Queries in XML Document Databases
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
A new algorithm for tree mapping in XML databases
IMSA '07 Proceedings of the Eleventh IASTED International Conference on Internet and Multimedia Systems and Applications
Principles of Holism for sequential twig pattern matching
The VLDB Journal — The International Journal on Very Large Data Bases
OTwig: An Optimised Twig Pattern Matching Approach for XML Databases
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Effective pruning for XML structural match queries
Data & Knowledge Engineering
Benchmarking holistic approaches to XML tree pattern query processing
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Indexing and querying XML using extended Dewey labeling scheme
Data & Knowledge Engineering
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Database and information retrieval techniques for XML
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
TwigStackList ¬: a holistic twig join algorithm for twig query with not-predicates on XML data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Exploit sequencing to accelerate XML twig query answering
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Full-text and structural XML indexing on b+-tree
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
On the query evaluation in document DBs
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Decomposing DAGs into disjoint chains
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Hi-index | 0.00 |
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. In this paper, we address the problem of query equivalence with respect to this transformation, and we introduce a performance-oriented principle for sequencing tree structures. With query equivalence, XML queries can be performed through subsequence matching without join operations, post-processing, or other special handling for problems such as false alarms. We identify a class of sequencing methods for this purpose, and we present a novel subsequence matching algorithm that observe query equivalence. Still, query equivalence is just a prerequisite for sequence-based XML indexing. Our goal is to find the best sequencing strategy with regard to the time and space complexity in indexing and querying XML data. To this end, we introduce a performance-oriented principle to guide the sequencing of tree structures. For any given XML dataset, the principle finds an optimal sequencing strategy according to its schema and its data distribution. We present a novel method that realizes this principle. In our experiments, we show the advantages of sequence-based indexing over traditional XML indexing methods, and we compare several sequencing strategies and demonstrate the benefit of the performance-oriented sequencing principle.