A decidable class of bounded recursions
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Optimization of large join queries
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Subtree-elimination algorithms in deductive databases
Subtree-elimination algorithms in deductive databases
Equivalence of datalog queries is undecidable
Journal of Logic Programming
A logic programming view of CLP
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
The Araneus Web-based management system
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Capability based mediation in TSIMMIS
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
The complexity of query reliability
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An adaptive query execution system for data integration
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Query optimization in the presence of limited access patterns
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Computing capabilities of mediators
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
An algorithm for ordering subgoals in NAIL?
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
On computing restricted projections of representative instances
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Querying partially sound and complete data sources
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering queries with useful bindings
ACM Transactions on Database Systems (TODS)
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
On the Semantics of Rule-Based Expert Systems with Uncertainty
ICDT '88 Proceedings of the 2nd International Conference on Database Theory
Optimizing Queries Across Diverse Data Sources
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Measuring the Complexity of Join Enumeration in Query Optimization
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Obtaining Complete Answers from Incomplete Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Using Probabilistic Information in Data Integration
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Accessing Heterogeneous Data Through Homogenization and Integration Mediators
COOPIS '97 Proceedings of the Second IFCIS International Conference on Cooperative Information Systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Query Planning with Limited Source Capabilities
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Query planning and optimization in information integration
Query planning and optimization in information integration
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Processing first-order queries under limited access patterns
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting queries using views with access patterns under integrity constraints
Theoretical Computer Science
Mobile join operators for restricted sources
Mobile Information Systems
Assessing query privileges via safe and efficient permission composition
Proceedings of the 15th ACM conference on Computer and communications security
Conjunctive Query Containment under Access Limitations
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Relative information completeness
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantic Annotations and Querying of Web Data Sources
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Proceedings of the 13th International Conference on Extending Database Technology
Relative information completeness
ACM Transactions on Database Systems (TODS)
Determining relevance of accesses at runtime
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Cooperative data access in multi-cloud environments
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
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
RDF pattern matching using sortable views
Proceedings of the 21st ACM international conference on Information and knowledge management
Access patterns and integrity constraints revisited
Proceedings of the 16th International Conference on Database Theory
Hi-index | 0.00 |
Abstract.In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attributes in order to retrieve data from a relation. As a consequence, we cannot retrieve all tuples from these relations. In this article we study the problem of computing the complete answer to a query, i.e., the answer that could be computed if all the tuples could be retrieved. A query is stable if for any instance of the relations in the query, its complete answer can be computed using the access patterns permitted by the relations. We study the problem of testing stability of various classes of queries, including conjunctive queries, unions of conjunctive queries, and conjunctive queries with arithmetic comparisons. We give algorithms and complexity results for these classes of queries. We show that stability of datalog programs is undecidable, and give a sufficient condition for stability of datalog queries. Finally, we study data-dependent computability of the complete answer to a nonstable query, and propose a decision tree for guiding the process to compute the complete answer.