TY - JOUR
T1 - Minimizing restricted-fanout queries
AU - Sagiv, Yehoshua
AU - Saraiya, Yatin
PY - 1992/12/10
Y1 - 1992/12/10
N2 - Conjunctive queries form an important subset of relational algebra. Each conjunctive query has a unique minimum equivalent (up to isomorphism). However, the computation of the minimum equivalent is complete for co-NP. Johnson and Klug have proposed a subclass of conjunctive queries, the fanout-free queries, for which minimization may be performed in polynomial time. In this paper, we show that a strict superclass of the fanout-free queries, the restricted-fanout queries, can be minimized in polynomial time.
AB - Conjunctive queries form an important subset of relational algebra. Each conjunctive query has a unique minimum equivalent (up to isomorphism). However, the computation of the minimum equivalent is complete for co-NP. Johnson and Klug have proposed a subclass of conjunctive queries, the fanout-free queries, for which minimization may be performed in polynomial time. In this paper, we show that a strict superclass of the fanout-free queries, the restricted-fanout queries, can be minimized in polynomial time.
UR - http://www.scopus.com/inward/record.url?scp=38249008878&partnerID=8YFLogxK
U2 - 10.1016/0166-218X(92)90032-6
DO - 10.1016/0166-218X(92)90032-6
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:38249008878
SN - 0166-218X
VL - 40
SP - 245
EP - 264
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 2
ER -