Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Journal of Logic Programming
A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
Efficient and extensible algorithms for multi query optimization
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient evaluation of XML middle-ware queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Translating XSLT programs to Efficient SQL queries
Proceedings of the 11th international conference on World Wide Web
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Moving Selections into Linear Least Fixpoint Queries
Proceedings of the Fourth International Conference on Data Engineering
Optimizing Regular Path Expressions Using Graph Schemas
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
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
Querying XML Views of Relational Data
Proceedings of the 27th International Conference on Very Large Data Bases
A comprehensive XQuery to SQL translation using dynamic interval encoding
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
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 XML-to-SQL query translation: where to add the intelligence?
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Xpath on steroids: exploiting relational engines for xpath performance
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
XTRON: An XML data management system using relational databases
Information and Software Technology
Using a relational database for scalable XML search
The Journal of Supercomputing
Pattern based processing of XPath queries
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
A service-oriented system for distributed data querying and integration on Grids
Future Generation Computer Systems
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Query translation from XPath to SQL in the presence of recursive DTDs
The VLDB Journal — The International Journal on Very Large Data Bases
Rewriting XPath Expressions Depending on Path Summary
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
From XQuery to relational logics
ACM Transactions on Database Systems (TODS)
A bi-labeling based XPath processing system
Information Systems
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
Optimizing XML-to-SQL query translation for analytical databases using intelligent path derivation
Proceedings of the 48th Annual Southeast Regional Conference
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
XML-to-SQL query mapping in the presence of multi-valued schema mappings and recursive XML schemas
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Hi-index | 0.00 |
The interaction between recursion in XPATH and recursion in DTDS makes it challenging to answer XPATH queries on XML data that is stored in an RDBMS via schema-based shredding. We present a new approach to translating XPATH queries into SQL queries with a simple least fixpoint (LFP) operator, which is already supported by most commercial RDBMS. The approach is based on our algorithm for rewriting XPATH queries into regular XPATH expressions, which are capable of capturing both DTD recursion and XPATH queries in a uniform framework. Furthermore, we provide an algorithm for translating regular XPATH queries to SQL queries with LFP, and optimization techniques for minimizing the use of the LFP operator. The novelty of our approach consists in its capability to answer a large class of XPATH queries by means of only low-end RDBMS features already available in most RDBMS. Our experimental results verify the effectiveness of our techniques.