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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on knowledge and data engineering Vol. 8; no. 4; pp. 604 - 616
Main Authors:	Sha Guo, Wei Sun, Weiss, M.A.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.08.1996 IEEE Computer Society
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!