Grail: a C++ library for automata and expressions
Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
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
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
An Optimization Technique for Answering Regular Path Queries
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
View-Based Query Processing and Constraint Satisfaction
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Answering Regular Path Queries Using Views
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
View-based query processing: On the relationship between rewriting, answering and losslessness
Theoretical Computer Science
Preferentially annotated regular path queries
ICDT'07 Proceedings of the 11th international conference on Database Theory
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 |
Regular path queries (RPQ's) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ's have received great attention in the context of semistructured data, which are data whose structure is irregular, partially known, or subject to frequent changes. One of the most important problems in databases today is the integration of semistructured data from multiple sources modeled as views. The well-know paradigm of computing first a view-based rewriting of the query, and then evaluating the rewriting on the view extensions is indeed possible for RPQ's. However, computing the rewriting is computationally hard as it can only be done (in the worst case) in not less than 2EXPTIME. In this paper, we provide practical evidence that computing the rewriting is hard on the average as well. On the positive side, we propose automata-theoretic techniques, which efficiently compute and utilize instead the complement of the rewriting. Notably using the latter, it is possible to answer a query, and this makes the view-based answering of RPQ's fairly feasible in practice.