![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Parag Sarda Anoop Jain , Parag Sarda, Jayant R. Haritsa : Providing Diversity in K-Nearest Neighbor Query Results. PAKDD 2004 : 404-413 Parag Sarda, Jayant R. Haritsa : Green Query Optimization: Taming Query Optimization Overheads through Plan Recycling. VLDB 2004 : 1333-1336 Anoop Jain , Parag Sarda, Jayant R. Haritsa : Providing Diversity in K-Nearest Neighbor Query Results CoRR cs.DB/0310028 : (2003) 1 [ 1 ] [ 2 ] [ 3 ] 2 [ 1 ] [ 3 ] ![]() ©2005 Association for Computing Machinery |