Safety and translation of relational calculus
ACM Transactions on Database Systems (TODS)
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
Query optimization in the presence of limited access patterns
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The complexity of ordering subgoals
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Query containment for data integration systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering queries with useful bindings
ACM Transactions on Database Systems (TODS)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
E-services: a look behind the curtain
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
BIRN-M: a semantic mediator for solving real-world neuroscience problems
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Computing complete answers to queries in the presence of limited access patterns
The VLDB Journal — The International Journal on Very Large Data Bases
Compiling abstract scientific workflows into web service workflows
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficiently ordering subgoals with access constraints
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting queries using views with access patterns under integrity constraints
Theoretical Computer Science
Conjunctive Query Containment under Access Limitations
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Querying data sources that export infinite sets of views
Proceedings of the 12th International Conference on Database Theory
Proceedings of the 13th International Conference on Extending Database Technology
Determining relevance of accesses at runtime
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting queries using views with access patterns under integrity constraints
ICDT'05 Proceedings of the 10th international conference on Database Theory
Querying schemas with access restrictions
Proceedings of the VLDB Endowment
Access patterns and integrity constraints revisited
Proceedings of the 16th International Conference on Database Theory
Hi-index | 0.00 |
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query which can be executed observing the access patterns restrictions. If so, we say that Q is feasible. We define feasible for first-order queries---previous definitions handled only some existential cases---and characterize the complexity of many first-order query classes. For each of them, we show that deciding feasibility is as hard as deciding containment. Since feasibility is undecidable in many cases and hard to decide in some others, we also define an approximation to it which can be computed in NP for any first-order query and in P for unions of conjunctive queries with negation. Finally, we outline a practical overall strategy for processing first-order queries under limited access patterns.