A new approach to text searching
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
Algebras for querying text regions (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 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
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
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
ViST: a dynamic index method for querying XML data by tree structures
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
On the Integration of Structure Indexes and Inverted Lists
ICDE '04 Proceedings of the 20th 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
BLAS: an efficient XPath processing system
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient processing of XML twig queries with OR-predicates
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
Proceedings of the thirteenth ACM international conference on Information and knowledge management
On the Sequencing of Tree Structures for XML Indexing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
TJFast: effective processing of XML twig pattern matching
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
On boosting holism in XML twig pattern matching using structural indexing techniques
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Lazy XML updates: laziness as a virtue, of update and structural join efficiency
Proceedings of the 2005 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
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Node labeling schemes for dynamic XML documents reconsidered
Data & Knowledge Engineering
A space efficient XML DOM parser
Data & Knowledge Engineering
Index structures for matching XML twigs using relational query processors
Data & Knowledge Engineering
From tree patterns to generalized tree patterns: on efficient evaluation of XQuery
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Dynamic interval-based labeling scheme for efficient XML query and update processing
Journal of Systems and Software
Region clustering based evaluation of multiple top-N selection queries
Data & Knowledge Engineering
XML twig pattern matching using version tree
Data & Knowledge Engineering
Efficient updates in dynamic XML data: from binary string to quaternary string
The VLDB Journal — The International Journal on Very Large Data Bases
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Distributed Structural Relaxation of XPath Queries
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Efficient Distribution of Full-Fledged XQuery
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Mining closed patterns in multi-sequence time-series databases
Data & Knowledge Engineering
On evolutionary spectral clustering
ACM Transactions on Knowledge Discovery from Data (TKDD)
Twiglist: make twig pattern matching fast
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Efficient processing of ordered XML twig pattern
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Faster twig pattern matching using extended dewey ID
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
An approximate duplicate elimination in RFID data streams
Data & Knowledge Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
Finding all the occurrences of a tree pattern in an XML database is a core operation for efficient evaluation of XML queries. The Dewey labeling scheme is commonly used to label an XML document to facilitate XML query processing by recording information on the path of an element. In order to improve the efficiency of XML tree pattern matching, we introduce a novel labeling scheme, called extended Dewey, which effectively extends the existing Dewey labeling scheme to combine the types and identifiers of elements in a label, and to avoid the scan of labels for internal query nodes to accelerate query processing (in I/O cost). Based on extended Dewey, we propose a series of holistic XML tree pattern matching algorithms. We first present TJFast to answer an XML twig pattern query. To efficiently answer a generalized XML tree pattern, we then propose GTJFast, an optimization that exploits the non-output nodes. In addition, we propose TJFastTL and GTJFastTL based on the tag+level data partition scheme to further reduce I/O costs by level pruning. Finally, we report our comprehensive experimental results to show that our set of XML tree pattern matching algorithms are superior to existing approaches in terms of the number of elements scanned, the size of intermediate results and query performance.