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ženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on knowledge and data engineering Ročník 8; číslo 4; s. 604 - 616
Hlavní autoři:	Sha Guo, Wei Sun, Weiss, M.A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.08.1996 IEEE Computer Society
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!