On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Accelerating XPath location steps
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
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
PRIX: Indexing And Querying XML Using Prüfer Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient processing of XML twig queries with OR-predicates
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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 boosting holism in XML twig pattern matching using structural indexing techniques
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
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Using semantics in XML query processing
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Performing grouping and aggregate functions in XML queries
Proceedings of the 18th international conference on World wide web
Reducing graph matching to tree matching for XML queries with ID references
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
TP+Output: modeling complex output information in XML twig pattern query
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
TwigTable: using semantics in XML twig pattern query processing
Journal on data semantics XV
Object-oriented XML keyword search
ER'11 Proceedings of the 30th international conference on Conceptual modeling
Hi-index | 0.00 |
Processing a twig pattern query in XML document includes structural search and content search. Most existing algorithms only focus on structural search. They treat content nodes the same as element nodes during query processing with structural joins. Due to the high variety of contents, to mix content search and structural search suffers from management problem of contents and low performance. Another disadvantage is to find the actual values asked by a query, they have to rely on the original document. In this paper, we propose a novel algorithm V alue Extraction with Relational T able (VERT) to overcome these limitations. The main technique of V ERT is introducing relational tables to store document contents instead of treating them as nodes and labeling them. Tables in our algorithm are created based on semantic information of documents. As more semantics is captured, we can further optimize tables and queries to significantly enhance efficiency. Last, we show by experiments that besides solving different content problems, V ERT also has superiority in performance of twig pattern query processing compared with existing algorithms.