Efficient RkNN retrieval with arbitrary non-metric similarity measures

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 1243-1254

  Deepak, P ^a   Deshpande, Prasad M ^a  

^a IBM RESEARCH INDIA   (India)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

AGGREGATION FUNCTIONS; ATTRIBUTE VALUES; BLOCK-BASED APPROACHES; DISK ACCESS COST; EMPIRICAL EVALUATIONS; REAL-WORLD DATASETS; SIMILARITY MEASURE; SYNTHETIC DATA;

QUERY PROCESSING;

CHARACTERISTICS; COMPUTATION; DATA PROCESSING; NEURAL NETWORKS;

EID: 79953840590     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920995     Document Type: Article

References (31)

1. How fast is your disk? http://www.linuxinsight.com/howfastisyourdisk.html, January 2007.
2. E. Achtert, C. Böhm, P. Kröger, P. Kunath, A. Pryakhin, and M. Renz. Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In SIGMOD Conference, pages 515-526, 2006.
3. E. Achtert, H.-P. Kriegel, P. Kröger, M. Renz, and A. Züfle. Reverse k-nearest neighbor search in dynamic and general metric databases. In EDBT, pages 886-897, 2009.
4. V. Athitsos, M. Potamias, P. Papapetrou, and G. Kollios. Nearest neighbor retrieval using distance-based hashing. In ICDE, 2008.
5. H. Bast, D. Majumdar, R. Schenkel, M. Theobald, and G. Weikum. Io-top-k: Index-access optimized top-k query processing. In VLDB, pages 475-486, 2006.
6. J. L. Bentley. Multidimensional binary search trees used for associative searching. CACM, 1975.
7. G.-H. Cha. Non-metric similarity ranking for image retrieval. In DEXA, pages 853-862, 2006.
8. H. Chen, R. Shi, K. Furuse, and N. Ohbo. Finding rknn straightforwardly with large secondary storage. In INGS, 2008.
9. O. Cheong, A. Vigneron, and J. Yon. Reverse nearest neighbor queries in fixed dimension. CoRR, abs/0905.4441, 2009.
10. L. Chung, Gray and Horst. Windows 2000 disk io performance. Microsoft Research TR, June 2000.
11. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, 1997.
12. E. Dellis and B. Seeger. Efficient computation of reverse skyline queries. In VLDB, pages 291-302, 2007.
13. P. M. Deshpande, D. P, and K. Kummamuru. Efficient online top-k retrieval with arbitrary similarity measures. In EDBT, pages 356-367, 2008.
14. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614-656, 2003.
15. K. Goh, B. Li, and E. Chang. Dyndex: A dynamic and nonmetric space indexer. In ACM Intl. Conference on Multimedia, 2002.
16. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, 1984.
17. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In SIGMOD Conference, pages 201-212, 2000.
18. H.-P. Kriegel, P. Kröger, M. Renz, A. Züfle, and A. Katzdobler. Reverse k-nearest neighbor search based on aggregate point access methods. In SSDBM, pages 444-460, 2009.
19. K. C. K. Lee, B. Zheng, and W.-C. Lee. Ranked reverse nearest neighbor search. IEEE TKDE, 20(7):894-910, 2008.
20. J. Lin, D. Etter, and D. DeBarr. Exact and approximate reverse nearest neighbor search for multimedia data. In SDM, pages 656-667, 2008.
21. G. Murphy and D. Medin. The role of theories in conceptual coherence. In Psychological Review, 1985.
22. D. P, P. M. Deshpande, D. Majumdar, and R. Krishnapuram. Efficient skyline retrieval with arbitrary similarity measures. In EDBT, 2009.
23. A. Singh, H. Ferhatosmanoglu, and A. S. Tosun. High dimensional reverse nearest neighbor queries. In CIKM, pages 91-98, 2003.
24. T. Skopal and J. Lokoc. Nm-tree: Flexible approximate similarity search in metric and non-metric spaces. In DEXA, pages 312-325, 2008.
25. I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In In SIGMOD Workshop on DMKD, pages 44-53, 2000.
26. Y. Tao, D. Papadias, and X. Lian. Reverse knn search in arbitrary dimensionality. In VLDB, 2004.
27. M. Vlachos, D. Gunopulos, and G. Kollios. Robust similarity measures for mobile object trajectories. In DEXA 2002, 2002.
28. C. Xia, W. Hsu, and M.-L. Lee. Erknn: efficient reverse k-nearest neighbors retrieval with local knn-distance estimation. In CIKM, 2005.
29. C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In ICDE, 2001.
30. J. L. Yanmin Luo, Canhong Lian and H. Chen. Finding rknn by compressed straightforward index. In ISKE, 2008.
31. M. L. Yiu and N. Mamoulis. Reverse nearest neighbors search in ad hoc subspaces. IEEE TKDE, 19(3):412-426, 2007.