Efficient online top-k retrieval with arbitrary similarity measures

Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2008, Pages 356-367

  Deshpande, Prasad M ^a   Deepak, P ^a   Kummamuru, Krishna ^a  

^a IBM INDIA RESEARCH LAB   (India)

Author keywords

Index structures; K nearest neighbors; Similarity measures

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; INDEXING (OF INFORMATION); INFORMATION MANAGEMENT; MIDDLEWARE;

COMPUTATIONAL COSTS; INDEX STRUCTURES; SIMILARITY MEASURES;

INFORMATION RETRIEVAL;

EID: 43349104169     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1353343.1353388     Document Type: Conference Paper

References (23)

1. How fast is your disk? http://www. linuxinsight.com/how_fast_is-your- disk. html, January 2007.
2. 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.
3. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? Lecture Notes in Computer Science, 1540:217-235, 1999.
4. K. C.-C. Chang and S. won Hwang. Minimal probing: supporting expensive predicates for top-k queries. In SIGMOD Conference, pages 346-357, 2002.
5. W. Chung, Gray and Horst. Windows 2000 disk io performance. Microsoft Research Technical Report, MSTR-2000-55, June 2000.
6. C. B. D.J. Newman, S. Hettich and C. Merz. UCI repository of machine learning databases, 1998.
7. V. Dohnal, C. Gennaro, P. Savino, and P. Zezula. D-index: Distance searching index for metric data sets. Multimedia Tools Appl., 21(1):9-33, 2003.
8. R. Fagin. Combining fuzzy information from multiple systems. In PODS, pages 216-226. ACM Press, 1996.
9. R. Fagin. Combining fuzzy information: an overview. SIGMOD Record, 31(2):109-118, 2002.
10. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614-656, 2003.
11. K. Goh, B. Li, and E. Chang. Dyndex: A dynamic and nonmetric space indexer, 2002.
12. U. Guntzer, W.-T. Balke, and W. Kiesling. Towards efficient multi-feature queries in heterogeneous environments, itcc, 00:0622, 2001.
13. I. Kalantari and G. McDonald. A data structure and an algorithm for the nearest point problem. IEEE Trans. Software Eng., 9(5):631-634, 1983.
14. K. Kummamuru, R. Krishnapuram, and R. Agrawal. On learning asymmetric dissimilarity measures. In ICDM, pages 697-700. IEEE Computer Society, 2005.
15. N. Mamoulis, K. H. Cheng, M. L. Yiu, and D. W. Cheung. Efficient aggregation of ranked inputs. In L. Liu, A. Reuter, K.-Y. Whang, and J. Zhang, editors, ICDE, page 72. IEEE Computer Society, 2006.
16. T. Mandl. Learning similarity functions in information retrieval. In EUFIT, pages 771-775, 1998.
17. A. Marian, N. Bruno, and L. Gravano. Evaluating top-queries over web-accessible databases. ACM Trans. Database Syst., 29(2):319-362, 2004.
18. T. Skopal. On fast non-metric similarity search by metric access methods. In EDBT, pages 718-736, 2006.
19. M. Theobald, G. Weikum, and R. Schenkel. Top-k query evaluation with probabilistic guarantees. In M. A. Nascimento, M. T. Özsu, D. Kossmann, R. J. Miller, J. A. Blakeley, and K. B. Schiefer, editors, VLDB, pages 648-659. Morgan Kaufmann, 2004.
20. J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40(4):175-179, 1991.
21. E. Vidal. New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (aesa). Pattern Recognition Letters, 15(1):1-7, 1994.
22. D. Xin, J. Han, and K. C.-C. Chang. Progressive and selective merge: computing top-k with ad-hoc ranking functions. In SIGMOD Conference, pages 103-114, 2007.
23. P. Zesula, G. Amato, V. Dohnal, and M. Batko. Similarity Search - The Metric Space Approach. Springer, 1978.