Theory of answering queries using views
ACM SIGMOD Record
A formal perspective on the view selection problem
The VLDB Journal — The International Journal on Very Large Data Bases
Materializing views with minimal size to answer queries
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Algebraic rewritings for optimizing regular path queries
Theoretical Computer Science - Database theory
Answering Regular Path Queries Using Views
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
The limitedness problem on distance automata: Hashiguchi's method revisited
Theoretical Computer Science
Views and queries: determinacy and rewriting
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query caching and view selection for XML databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Boundedness of Regular Path Queries in Data Integration Systems
IDEAS '07 Proceedings of the 11th International Database Engineering and Applications Symposium
Answering xpath queries over networks by sending minimal views
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Syntactic semiring and language equations
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
View-based query processing: on the relationship between rewriting, answering and losslessness
ICDT'05 Proceedings of the 10th international conference on Database Theory
| Hi-index | 0.00 |
The view selection problem consists of finding a set of views to materialize that can answer the given set of workload queries and is optimal in some sense. In this paper we study the view selection problem for regular path queries over semistructured data and two specific view-based query rewriting formalisms, namely single-word and arbitrary regular rewritings. We present an algorithm that for a given finite set of workload queries, i.e. for a set of regular languages, computes a set of views that can answer every query in the workload and has minimal possible cardinality. If, in addition, a database instance is given then one can construct a viewset such that its size, i.e. amount of space required to store results, is minimal on the database instance.