Proc. of the first international conference on Rewriting techniques and applications
A system for semantic query optimization
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Logic-based approach to semantic query optimization
ACM Transactions on Database Systems (TODS)
Using integrity constraints to provide intensional answers to relational queries
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Constraints and redundancy in datalog
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of querying indefinite data about linearly ordered domains
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Some results on the containment and minimization of (in)equality queries
Information Processing Letters
Semantic query optimization in Datalog programs (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Independence of logic database queries and update
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth 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)
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Functional and inclusion dependencies a graph theoretic approach
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inclusion dependencies and the universal instance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inference rules for functional and inclusion dependencies
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Semantic Query Optimization in Recursive Databases
Proceedings of the Fourth International Conference on Data Engineering
Constraints for Improving the Generation of Intensional Answers in a Deductive Database
Proceedings of the Fifth International Conference on Data Engineering
Constraint-Based Reasoning in Deductive Databases
Proceedings of the Seventh International Conference on Data Engineering
An Efficient Semantic Query Optimization Algorithm
Proceedings of the Seventh International Conference on Data Engineering
Optimizatioin of a Subclass of Conjunctive Queries
ICDT '90 Proceedings of the Third International Conference on Database Theory
BNCOD 10 Proceedings of the 10th British National Conference on Databases: Advanced Database Systems
On the Maintenance of Implication Integrity Constraints
DDEXA '93 Proceedings of the 4th International Conference on Database and Expert Systems Applications
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Answering queries using views with arithmetic comparisons
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finite Satisfiability of Integrity Constraints in Object-Oriented Database Schemas
IEEE Transactions on Knowledge and Data Engineering
Optimizing Queries in Extended Relational Databases
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Reasoning with Disjunctive Constrained Tuple-Generating Dependencies
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Unraveling the duplicate-elimination problem in XML-to-SQL query translation
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Checking query containment with the CQC method
Data & Knowledge Engineering
Equivalence of queries combining set and bag-set semantics
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantic optimization techniques for preference queries
Information Systems
Binary equality implication constraints, normal forms and data redundancy
Information Processing Letters
Efficient XML-to-SQL query translation: where to add the intelligence?
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Validation of mappings between schemas
Data & Knowledge Engineering
Providing Explanations for Database Schema Validation
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
A unified apriori-like algorithm for conjunctive query containment
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Journal of Computer and System Sciences
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Query containment in entity SQL
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
In this paper, we address the issue of reasoning with two classes of commonly used semantic integrity constraints in database and knowledge-base systems: implication constraints and referential constraints. We first consider a central problem in this respect, the IRC-refuting problem, which is to decide whether a conjunctive query always produces an empty relation on (finite) database instances satisfying a given set of implication and referential constraints. Since the general problem is undecidable, we only consider acyclic referential constraints. Under this assumption, we prove that the IRC-refuting problem is decidable, and give a novel necessary and sufficient condition for it. Under the same assumption, we also study several other problems encountered in semantic query optimization, such as the semantics-based query containment problem, redundant join problem, and redundant selection-condition problem, and show that they are polynomially equivalent or reducible to the IRC-refuting problem. Moreover, we give results on reducing the complexity for some special cases of the IRC-refuting problem.