Solving satisfiability and implication problems in database systems

@article{Guo1996SolvingSA,
  title={Solving satisfiability and implication problems in database systems},
  author={Sha Guo and Wei Sun and Mark Allen Weiss},
  journal={ACM Trans. Database Syst.},
  year={1996},
  volume={21},
  pages={270-293}
}
Satisfiability, implication, and equivalence problems involving conjunctive inequalities are important and widely encountered database problems that need to be efficiently and effectively processed. In this article we consider two popular types of arithmetic inequalities, (<italic>X<bold>op</bold>Y</italic>) and (<italic>X</italic> <bold>op</bold> <italic>C</italic>), where <italic>X</italic> and <italic>Y</italic> are attributes, <italic>C</italic> is a constant of the domain or <italic>X… Expand
On Satisfiability, Equivalence, and Impication Problems Involving Conjunctive Queries in Database Systems
TLDR
A novel concept of the "module closure" and a set of sound and complete axioms with respect to the " module closure" are proposed to infer all correct and necessary inequalities from a given query. Expand
TESTING SATISFIABILITY OF A CONJUNCTION OF INEQUALITIES 1
Conjunctions of inequality predicates, or inequalities fo r short, have been utilized to represent conjunctive queries and semantic integrity co nstraints in semantic query processing systems (KlugExpand
Semantic optimization techniques for preference queries
TLDR
It is demonstrated that the problems of containment and satisfaction of order axioms can be captured as specific instances of constraint-generating dependency entailment, making it possible to formulate necessary and sufficient conditions for the applicability of techniques as constraint validity problems. Expand
Deciding equivalences among conjunctive aggregate queries
Equivalence of aggregate queries is investigated for the class of conjunctive queries with comparisons and the aggregate operators count, count-distinct, min, max, and sum. Essentially, this classExpand
Constraint-Generating Dependencies
TLDR
The main technical results in the paper are a general decision procedure for the implication and consistency problems for constraint-generating dependencies, and complexity results for specific classes of such dependencies over given domains. Expand
Constraint-Generating Dependencies
TLDR
The main technical results in the paper are a general decision procedure for the implication and consistency problems for constraint-generating dependencies and complexity results for specific classes of such dependencies over given domains. Expand
Translation of relational queries into Description Logic for semantic cache query processing
TLDR
This paper proposes an algorithm to translate relational queries in to description logic ALC(D), so that DL subsumption algorithms can be applied on these translated queries to find query containment. Expand
A minimal-state processing search algorithm for satisfiability problems
TLDR
This paper presents an approximation algorithm, called a minimal-state processing search algorithm for SAT (MIPS-SAT), which repeatedly transits minimal states in terms of the cost function for searching a solution through a construction stage and a refinement stage. Expand
Technical Correspondence: “Differential Dependencies: Reasoning and Discovery” Revisited
TLDR
A detailed analysis of the correctness of a number of results claimed in the recent article &ldquoDifferential Dependencies: Reasoning and Discovery&rdquo shows there are either fundamental errors in the proof or the result is false. Expand
Preference formulas in relational queries
TLDR
A simple, natural embedding of preference formulas into relational algebra (and SQL) through a single winnow operator parameterized by a preference formula is proposed, which makes possible the formulation of complex preference queries by piggybacking on existing SQL constructs. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 60 REFERENCES
On Satisfiability, Equivalence, and Impication Problems Involving Conjunctive Queries in Database Systems
TLDR
A novel concept of the "module closure" and a set of sound and complete axioms with respect to the " module closure" are proposed to infer all correct and necessary inequalities from a given query. Expand
An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities
  • Wei Sun, M. Weiss
  • Mathematics, Computer Science
  • IEEE Trans. Knowl. Data Eng.
  • 1994
TLDR
The problem is reduced to matrix multiplication, thus improving the time bound to O(n/sup 2.376/), and the possibility of directly adopting many practical results for managing matrices and their operations, such as parallel computation and efficient representation of sparse matrices. Expand
Processing Conjunctive Predicates and Queries
TLDR
This work considers predicates that are conjunctions of =, , and >= comparisons, where a variable can be compared with a constant or with another variable, possibly offset by a constant, and shows that when unequal comparisons between variables are allowed, satisfiability, equivalence, and minimization are NP-hard. Expand
Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies
TLDR
It is shown that there are substantial special cases where the presence of inclusion dependencies does not make the basic problems of optimization any harder than they are when there are no dependencies at all, and a “finite controllability” theorem is proved. Expand
Processing Implication on Queries
TLDR
It is proved that the general implication problem is NP-hard and theoretical results show that for some special cases the polynomial complexity nlgorithn can solve the implication problem which allows the “ # ” operator or disjunctions in the predicates. Expand
Optimization of Nonrecursive Queries
TLDR
A formal model and a precise statement of the optimization problem that delineates the assumptions and limitations of the previous approaches are presented, and a quadratic-tinie algorithm determines the optimum join order for acyclic queries is proposed. Expand
Optimizing Conjunctive Queries that Contain Untyped Variables
TLDR
This paper addresses questions of efficiency in relational databases by presenting polynomial time algorithms for minimizing and testing equivalence of what they call “fan-out free” queries, a more general and more powerful subclass of the conjunctive queries than those previously studied. Expand
Testing containment of conjunctive queries under functional and inclusion dependencies
TLDR
It is shown that the problem of containment (and hence those of equivalence and non-minimality) is in NP when either there are no functional dependencies or the set of dependencies is what the authors call key-based. Expand
On conjunctive queries containing inequalities
TLDR
Algorithms for containment and equivalence of such “inequality queries” are given, under the assumption that the data domains are dense and totally ordered. Expand
Semantic Query Optimization for Tree and Chain Queries
TLDR
It is proved that it is /spl Nscr//spl Pscr/-/spl Cscr/omplete to eliminate as many unnecessary joins as possible for various types of acyclic queries with the exception of the closure chain queries whose query graphs are chains and all equi-join attributes are distinct. Expand
...
1
2
3
4
5
...