Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handbook of formal languages, vol. 1
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting of regular expressions and regular path queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query rewriting for semistructured data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Regular path queries with constraints
Journal of Computer and System Sciences
View-based query processing for regular path queries with inverse
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Tableau Techniques for Querying Information Sources through Global Schemas
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Algebraic Rewritings for Optimizing Regular Path Queries
ICDT '01 Proceedings of the 8th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
An Optimization Technique for Answering Regular Path Queries
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Answering Regular Path Queries Using Views
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Query containment and rewriting using views for regular path queries under constraints
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting of visibly pushdown languages for xml data integration
Proceedings of the 17th ACM conference on Information and knowledge management
Certain answers and rewritings for local regular path queries on graph-structured data
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Hi-index | 0.00 |
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those regular expressions is very expensive. In this paper, we introduce the "maximal partial rewritings" (MPR's) for regular path queries using views. The MPR's are always exact and more useful for the optimization of the regular path queries than other rewritings from previously known methods. We develop an algorithm for computing MPR's and prove, through a complexity theoretic analysis, that our algorithm is essentially optimal. Also, we present query answering algorithms that utilize exact partial rewritings for regular path queries and conjunctive regular path queries respectively.