![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Rada Chirkova 4 Rada Chirkova: The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views. PODS 2002 : 159-168 3 Rada Chirkova, Alon Y. Halevy , Dan Suciu : A Formal Perspective on the View Selection Problem. VLDB 2001 : 59-68 2 Rada Chirkova, Michael R. Genesereth : Linearly Bounded Reformulations of Conjunctive Databases. Computational Logic 2000 : 987-1001 1 Rada Chirkova, Michael R. Genesereth : Linearly Bounded Reformulations of Unary Databases. SARA 2000 : 144-163 ![]() DiSC'02 © 2003 Association for Computing Machinery |