![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Raghav Kaushik 2 Jin-yi Cai , Venkatesan T. Chakaravarthy , Raghav Kaushik, Jeffrey F. Naughton : On the Complexity of Join Predicates. PODS 2001 1 Karthikeyan Ramasamy , Jignesh M. Patel , Jeffrey F. Naughton , Raghav Kaushik: Set Containment Joins: The Good, The Bad and The Ugly. VLDB 2000 : 351-362 DiSC'01 Copyright ©2002 ACM Inc. |