Towards non-directional Xpath evaluation in a RDBMS

Authors:
Sourav S. Bhowmick;Curtis Dyreson;Erwin Leonardi;Zhifeng Ng
Affiliations:
Nanyang Technological University, Singapore, Singapore;Utah State University, Logan, UT, USA;Nanyang Technological University, Singapore, Singapore;Nanyang Technological University, Singapore, Singapore
Venue:
Proceedings of the 18th ACM conference on Information and knowledge management
Year:
2009

Citing 12
Cited 2

Tree Pattern Relaxation

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
FleXPath: flexible structure and full-text querying for XML

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient keyword search for smallest LCAs in XML databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Symmetrically exploiting XML

Proceedings of the 15th international conference on World Wide Web
Identifying meaningful return information for XML keyword search

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Why off-the-shelf RDBMSs are better at XPath than you might expect

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficiently Querying Large XML Data Repositories: A Survey

IEEE Transactions on Knowledge and Data Engineering
XSEarch: a semantic search engine for XML

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Schema-free XQuery

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient evaluation of high-selective xml twig patterns with parent child edges in tree-unaware rdbms

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Reasoning and identifying relevant matches for XML keyword search

Proceedings of the VLDB Endowment
Efficient support for ordered xpath processing in tree-unaware commercial relational databases

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications

SINBAD: towards structure-independent querying of common neighbors in XML databases

DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
An approach to define flexible structural constraints in XQuery

AMT'12 Proceedings of the 8th international conference on Active Media Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML query languages use directional path expressions to locate data in an XML data collection. They are tightly coupled to the structure of a data collection, and can fail when evaluated on the same data in a different structure. This paper extends path expressions with a new non-directional axis called the rank-distance axis. Given a context node and two positive integers α and β, the rank-distance axis returns those nodes that are ranked between α and β in terms of closeness from the context node in any direction. This paper shows how to evaluate the rank-distance axis in a tree-unaware XML database. A tree-unaware implementation does not invade the database kernel to support XML queries, instead it uses an existing RDBMS such as Microsoft's SQL server as a back-end and provides a front-end layer to translate XML queries to SQL. This paper presents an overview of an algorithm that translates queries with a rank-distance axis to SQL.