Storing semistructured data with STORED
SIGMOD '99 Proceedings of the 1999 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)
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Accelerating XPath evaluation in any RDBMS
ACM Transactions on Database Systems (TODS)
Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation
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
Twig query processing over graph-structured XML data
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
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
Query translation from XPATH to SQL in the presence of recursive DTDs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Stack-based algorithms for pattern matching on DAGs
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
Querying xml data: efficiency and security issues
Querying xml data: efficiency and security issues
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Hash-base subgraph query processing method for graph-structured XML documents
Proceedings of the VLDB Endowment
VERT: a semantic approach for content search and content extraction in XML query processing
ER'07 Proceedings of the 26th international conference on Conceptual modeling
TwigTable: using semantics in XML twig pattern query processing
Journal on data semantics XV
Comments on "Stack-based Algorithms for Pattern Matching on DAGs"
Proceedings of the VLDB Endowment
Coloring based approach for matching unrooted and/or unordered trees
Pattern Recognition Letters
Hi-index | 0.00 |
ID/IDREF is an important and widely used feature in XML documents for eliminating data redundancy. Most existing algorithms consider an XML document with ID references as a graph and perform graph matching for queries involving ID references. Graph matching naturally brings higher complexity compared with original tree matching algorithms that process XML queries. In this paper, wemake use of semantics of ID/IDREF to reduce graph matching to tree matching to process queries involving ID references. Using our approach, an XML document with ID/IDREF is not treated as a graph, and a general query with ID references will be decomposed and processed using tree pattern matching techniques, which are more efficient than graph matching. Furthermore, our approach is able to handle complex ID references, such as cyclic references and sequential references, which cannot be handled efficiently by existing approaches. The experimental results show that our approach is 20-50% faster than MonetDB, an XQuery engine, and at least 100 times faster than TwigStackD, an existing graph matching algorithm.