Title :
A Strong Containment Problem for Queries in Conjunctive Form with Negation
Author_Institution :
Fac. of Inf., Alexandra loan Cuza Univ. of Iasi, Iasi
Abstract :
In this paper we define a new notion of containment for two queries, called strong containment. The strong containment implies the classical containment. A necessary and sufficient condition for the strong containment relation between two queries is given. The time complexity of the decision problem for two queries to be in strong containment relation is a linear function of the containment mappings number corresponding to the queries
Keywords :
computational complexity; query processing; conjunctive form; decision problem; linear function; strong query containment problem; time complexity; Databases; In vitro fertilization; Informatics; Model driven engineering; Radio frequency; Testing; Conjunctive queries; containment mappings; negation;
Conference_Titel :
Advances in Databases, Knowledge, and Data Applications, 2009. DBKDA '09. First International Conference on
Conference_Location :
Gosier
Print_ISBN :
978-1-4244-3467-1
Electronic_ISBN :
978-0-7695-3550-0
DOI :
10.1109/DBKDA.2009.23
