On satisfiability, equivalence, and implication problems involving conjunctive queries in database systems

Satisfiability, equivalence, and implication problems involving conjunctive queries are important and widely encountered problems in database management systems. These problems need to be efficiently and effectively solved. In this paper, we consider queries which are conjunctions of the inequalitie...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on knowledge and data engineering Ročník 8; číslo 4; s. 604 - 616
Hlavní autori: Sha Guo, Wei Sun, Weiss, M.A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY IEEE 01.08.1996
IEEE Computer Society
Predmet:
Application software
Applied sciences
Arithmetic
Computer science; control theory; systems
Cost function
Database systems
Deductive databases
Distributed databases
Electrical capacitance tomography
Exact sciences and technology
Information systems. Data bases
Memory organisation. Data processing
Relational databases
Software
Sufficient conditions
Deductive database
Equivalence
Database query
Necessary and sufficient condition
NP hard problem
Database
Problem solving
Database management system
ISSN:1041-4347
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Satisfiability, equivalence, and implication problems involving conjunctive queries are important and widely encountered problems in database management systems. These problems need to be efficiently and effectively solved. In this paper, we consider queries which are conjunctions of the inequalities of the form (X op C), (X op Y), and/or (X op Y+C), where X and Y are two attributes, C is a constant, and op /spl epsiv/ {<, /spl les/, =,/spl ne/, >, /spl ges/}. These types of inequalities are widely used in database systems, since the first type is a selection, the second type is a /spl theta/-join, and the third type is a very popular clause in a deductive database system. The satisfiability, equivalence, and implication problems in the integer domain (for attributes and constants) have been shown to be NP-hard. However, we show that these problems can be solved efficiently in the real domain. The incorporation of the real domain is significant, because the real domain is practically and widely used in a database. Necessary and sufficient conditions and algorithms are presented. A novel concept of the "module closure" and a set of sound and complete axioms with respect to the "module closure" are also proposed to infer all correct and necessary inequalities from a given query. The proposed axioms generalize Ullman's axioms (1989) where queries only consist of /spl theta/-joins.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1041-4347
DOI:10.1109/69.536253