POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Catching the boat with Strudel: experiences with a Web-site management system
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Database techniques for the World-Wide Web: a survey
ACM SIGMOD Record
WWW '99 Proceedings of the eighth international conference on World Wide Web
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
On the content of materialized aggregate views
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Answering queries using views with arithmetic comparisons
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
IEEE Transactions on Knowledge and Data Engineering
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Tableau Techniques for Querying Information Sources through Global Schemas
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Minimizing View Sets without Losing Query-Answering Power
ICDT '01 Proceedings of the 8th International Conference on Database Theory
A Formal Perspective on the View Selection Problem
Proceedings of the 27th International Conference on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Reasoning on regular path queries
ACM SIGMOD Record
Supporting executable mappings in model management
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Fault-tolerant computation of distributed regular path queries
Theoretical Computer Science
Preferential Regular Path Queries
Fundamenta Informaticae
Approximate Rewriting of Queries Using Views
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Learning Link-Based Naïve Bayes Classifiers from Ontology-Extended Distributed Data
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II
The view selection problem for regular path queries
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Determinacy and query rewriting for conjunctive queries and views
Theoretical Computer Science
Preferentially annotated regular path queries
ICDT'07 Proceedings of the 11th international conference on Database Theory
An ECA rule rewriting mechanism for peer data management systems
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Preferential Regular Path Queries
Fundamenta Informaticae
Rewriting conjunctive queries determined by views
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Distributed multi-source regular path queries
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Hi-index | 0.00 |
As a result of the extensive research in view-based query processing, three notions have been identi.ed as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases consistent with the views. Rewriting consists in first reformulating the query in terms of the views and then evaluating the rewriting over the view extensions. Losslessness holds if we can answer the query by solely relying on the content of the views. While the mutual relationship between these three notions is easy to identify in the case of conjunctive queries, the terrain of notions gets considerably more complicated going beyond such a query class. In this paper, we revisit the notions of answering, rewriting, and losslessness and clarify their relationship in the setting of semistructured databases, and in particular for the basic query class in this setting, i.e., two-way regular path queries. Our .rst result is a clean explanation of the relationship between answering and rewriting, in which we characterize rewriting as a “linear approximations” of query answering. We show that applying this linear approximation to the constraint-satisfaction framework yields an elegant automata-theoretic approach to query rewriting. As for losslessness, we show that there are indeed two distinct interpretations for this