ACM Transactions on Database Systems (TODS)
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
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
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th 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
Efficient Relational Storage and Retrieval of XML Documents
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
A comprehensive XQuery to SQL translation using dynamic interval encoding
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
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A SQL: 1999 code generator for the pathfinder xquery compiler
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Staircase join: teach a relational DBMS to watch its (axis) steps
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Indexing XML data stored in a relational database
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A SQL: 1999 code generator for the pathfinder xquery compiler
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Pathfinder meets DB2®: relational XQuery optimization techniques
Ph.D. '08 Proceedings of the 2008 EDBT Ph.D. workshop
Pattern based processing of XPath queries
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Implementing filesystems by tree-aware DBMSs
Proceedings of the VLDB Endowment
Efficient XPath query processing
CASCON '08 Proceedings of the 2008 conference of the center for advanced studies on collaborative research: meeting of minds
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Cost based plan selection for xpath
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Metamodel-Based Optimisation of XPath Queries
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
Bitmap indexes for relational XML twig query processing
Proceedings of the 18th ACM conference on Information and knowledge management
Towards non-directional Xpath evaluation in a RDBMS
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient XQuery join processing in publish/subscribe systems
ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
Efficiently querying XML documents stored in RDBMS in the presence of Dewey-based labeling scheme
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
Classification of index partitions to boost XML query performance
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Efficient evaluation of NOT-twig queries in tree-unaware relational databases
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Stars on steroids: fast evaluation of multi-source star twig queries in RDBMS
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
ANDES: efficient evaluation of NOT-twig queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
Optimizing queries for web generated sensor data
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
Data & Knowledge Engineering
Hi-index | 0.00 |
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prevalent means to process XML data in relational databases, most notably the TwigStack[6], structural join[1], and staircase join[13] algorithms. However, the addition of these algorithms to existing systems depends on a significant invasion of the underlying database kernel, an option intolerable for most database vendors. Here, we demonstrate that we can achieve comparable XPath performance without touching the heart of the system. We carefully exploit existing database functionality and accelerate XPath navigation by purely relational means: partitioned B-trees bring access costs to secondary storage to a minimum, while aggregation functions avoid an expensive computation and removal of duplicate result nodes to comply with the XPath semantics. Experiments carried out on IBM DB2 confirm that our approach can turn off-the-shelf database systems into efficient XPath processors.