Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using templates with binding patterns (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering recursive queries using views
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
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-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
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
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Automated Selection of Materialized Views and Indexes in SQL Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Describing and Using Query Capabilities of Heterogeneous Sources
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Generalized Implicit Definitions on Finite Structures
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Physical Data Independence, Constraints, and Optimization with Universal Plans
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Query Transformation for PSJ-Queries
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The logical complexity of queries on unordered graphs
The logical complexity of queries on unordered graphs
Supporting executable mappings in model management
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Compiling mappings to bridge applications and databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Queries determined by views: pack your views
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Artificial Intelligence
Validation of mappings between schemas
Data & Knowledge Engineering
Compiling mappings to bridge applications and databases
ACM Transactions on Database Systems (TODS)
Ontologies and databases: myths and challenges
Proceedings of the VLDB Endowment
Relative information completeness
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Effective query rewriting with ontologies over DBoxes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The view selection problem for regular path queries
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Static analysis of schema-mappings ensuring oblivious termination
Proceedings of the 13th International Conference on Database Theory
Views and queries: Determinacy and rewriting
ACM Transactions on Database Systems (TODS)
Capturing missing tuples and missing values
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Relative information completeness
ACM Transactions on Database Systems (TODS)
Determinacy and query rewriting for conjunctive queries and views
Theoretical Computer Science
Checking query completeness over incomplete data
Proceedings of the 4th International Workshop on Logic in Databases
Determinacy and rewriting of conjunctive queries over unary database schemas
Proceedings of the 2011 ACM Symposium on Applied Computing
View determinacy for preserving selected information in data transformations
Information Systems
Determinacy and rewriting of conjunctive queries using views: a progress report
ICDT'07 Proceedings of the 11th international conference on Database Theory
Privacy in GLAV information integration
ICDT'07 Proceedings of the 11th international conference on Database Theory
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Incomplete databases: missing records and missing values
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Rewriting conjunctive queries determined by views
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Completeness of queries over SQL databases
Proceedings of the 21st ACM international conference on Information and knowledge management
Hi-index | 0.00 |
We investigate the question of whether a query Q can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines Q if V provides enough information to uniquely determine the answer to Q. Next, we look at the problem of rewriting Q in terms of V using a specific language. Given a view language V and query language Q, we say that a rewriting language R is complete for Vto-Q rewritings if every Q ε Q can be rewritten in terms of V ε v using a query in R, whenever V determines Q. While query rewriting using views has been extensively investigated for some specific languages, the connection to the information-theoretic notion of determinacy, and the question of completeness of a rewriting language, have received little attention. In this paper we investigate systematically the notion of determinacy and its connection to rewriting. The results concern decidability of determinacy for various view and query languages, as well as the power required of complete rewriting languages. We consider languages ranging from first-order to conjunctive queries.