HashFile: An efficient index structure for multimedia data

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 1103-1114

  Zhang, Dongxiang ^a   Agrawal, Divyakant ^b   Chen, Gang ^c   Tung, Anthony K H ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b University of California   (United States)

^c ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE RATIO; CURSE OF DIMENSIONALITY; DATA POINTS; DISK I/O; EUCLIDEAN DISTANCE; FALSE POSITIVE; HASH TABLE; HASH VALUE; HIGH DIMENSIONAL SPACES; HIGH PROBABILITY; INDEX STRUCTURE; LOCALITY SENSITIVE HASHING; MULTIMEDIA DATA; MULTIMEDIA DATABASE; MULTIMEDIA OBJECT; MULTIMEDIA RETRIEVAL; NEAREST NEIGHBOR SEARCHES; PRECISION AND RECALL; QUERY OBJECT; QUERY POINTS; QUERY RESULTS; RANDOM PROJECTIONS; SEARCH ALGORITHMS; TOP-DOWN MANNER; TREE STRUCTURES;

HASH FUNCTIONS; IMAGE RETRIEVAL; PLANT EXTRACTS; TREES (MATHEMATICS);

SEARCH ENGINES;

EID: 79957804884     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767837     Document Type: Conference Paper

References (29)

1. D. Achlioptas. Database-friendly random projections: Johnsonlindenstrauss with binary coins. J. Comput. Syst. Sci., 66(4) :671-687, 2003 .
2. C. C. Aggarwal, A. Hinneburg, and D. A. Keim. On the surprising behavior of distance metrics in high dimensional spaces. In ICD T '01 : Proceedings of the 8th International Conference on Database Theory, pages 420-434, London, UK, 2001 . Springer-Verlag. (Pubitemid 33213340)
3. S. Berchtold, C. Biihm, H. V. Jagadish, H. -P. Kriegel, J. Sander, and J. S. Independent quantization: An index compression technique for high-dimensional data spaces. In In ICDE, pages 577-588,2000. (Pubitemid 30585711)
4. S . Berchtold, C. Biihm, and H.-P. Kriegal. The pyramid-technique: towards breaking the curse of dimensionality. In Proceedings of the 1998 ACM SIGMOD international conference on Management of data, SIGMOD '98, pages 142-153, New York, NY, USA, 1998. ACM . (Pubitemid 128655964)
5. S . Berchtold, D. A. Keim, and H.-P. Kriegel. The x-tree: A n index structure for high-dimensional data. In VLDB '96: Proceedings of the 22th International Conference on Very Large Data Bases, pages 28-39, San Francisco, CA, USA, 1996. Morgan Kaufmann Publishers Inc.
6. E. Bingham and H. Mannila. Random projection in dimensionality reduction: applications to image and text data. In KDD '01 : Proceedings of the seventh ACM SIGKDD international coriference on Knowledge discovery and data mining, pages 245-250, New York, NY, USA, 2001 . ACM.
7. R. Cai, C. Zhang, L. Zhang, and w.-Y. Ma. Scalable music recommendation by search. In MULTIMEDIA '07: Proceedings of the 15th international conference on Multimedia, pages 1065-1074, New York, NY, USA, 2007. ACM.
8. T.-S. Chua, J. Tang, R. Hong, H. Li, Z. Luo, and Y.-T. Zheng. Nuswide: A real-world web image database from national university of singapore. In Proc. of ACM Can! on Image and Video Retrieval (CIVR '09), Santorini, Greece., July 8-1 0, 2009 .
9. W. Dong, Z. Wang, M. Charikar, and K. Li. Efficiently matching sets of features with random histograms. In MM '08: Proceeding of the 16th ACM international coriference on Multimedia, pages 179-188, New York, NY, USA, 2008. ACM.
10. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases, pages 518-529, San Francisco, CA, USA, 1999. Morgan Kaufmann Publishers Inc.
11. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 604-613, New York, NY, USA, 1998 . ACM.
12. H. V. Jagadish, B. C. Ooi, K.-L. Tan, C. Yu, and R. Zhang. idistance: An adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst., 30(2) : 364-397, 2005 . (Pubitemid 41204994)
13. W. Johnson and J. Lindenstrauss. Extensions of lipschitz mapping into hilbert space. Contemporary Mathematics, 26: 189-206, 1984.
14. N. Katayama and S . Satoh. The sr-tree: an index structure for highdimensional nearest neighbor queries. In SIGMOD '97: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pages 369-380, New York, NY, USA, 1997. ACM. (Pubitemid 127456800)
15. Y. Ke, R. Sukthankar, L. Huston, Y. Ke, and R. Sukthankar. Efficient near-duplicate detection and sub-image retrieval. In In ACM Multimedia, pages 869-876, 2004. (Pubitemid 40211882)
16. J. M. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. In STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 599-608, New York, NY, USA, 1997. ACM.
17. N. Koudas, B. C. Ooi, H. T. Shen, and A. K. H. Tung. Ldc : Enabling search by partial distance in a hyper-dimensional space, 2004.
18. Y.-H. Kuo, K.-T. Chen, C.-H. Chiang, and W. H. Hsu. Query expansion for hash-based image object retrieval. In MM '09: Proceedings of the seventeen ACM international conference on Multimedia, pages 65-74, New York, NY, USA, 2009 . ACM.
19. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. In STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 614-623, New York, NY, USA, 1998 . ACM.
20. K.-I. Lin, H. V. Jagadish, and C. Faloutsos. The tv-tree: an index structure for high-dimensional data. Technical report, College Park, MD, USA, 1994.
21. D. G. Lowe. Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vision, 60(2) : 91-110, 2004.
22. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li. Multi-probe Ish: efficient indexing for high-dimensional similarity search. In Proceedings of the 33rd international conference on Very large data bases, VLDB '07, pages 950-961 . VLDB Endowment, 2007.
23. J. T. Robinson. The k-d-b-tree: a search structure for large multidimensional dynamic indexes. In SIGMOD '81 : Proceedings of the 1981 ACM SIGMOD international conference on Management of data, pages 10-18, New York, NY, USA, 1981 . ACM.
24. Y. Sakurai, M. Yoshikawa, S . Uemura, and H. Kojima. The a-tree: An index structure for high-dimensional spaces using relative approximation. In Proceedings of the 26th International Conference on Very Large Data Bases, VLDB ' 00, pages 516-526, San Francisco, CA, USA, 2000. Morgan Kaufmann Publishers Inc.
25. B. Stein. Principles of hash-based text retrieval. In SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pages 527-534, New York, NY, USA, 2007 . ACM. (Pubitemid 350165001)
26. G . Stockman and L. G . Shapiro. Computer Vision. Prentice Hall PTR, Upper Saddle River, NJ, USA, 2001 .
27. Y. Tao, K . Yi, C . Sheng, and P. Kalnis. Quality and efficiency in high dimensional nearest neighbor search. In SIGMOD '09: Proceedings of the 35th SIGMOD international conference on Management of data, pages 563-576, New York, NY, USA, 2009. ACM.
28. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases, pages 194-205, San Francisco, CA, USA, 1998 . Morgan Kaufmann Publishers Inc .
29. C. Yu, B. C. Ooi, K.-L. Tan, and H. V. Jagadish. Indexing the distance: An efficient method to knn processing. In VLDB '01 : Proceedings of the 27th International Conference on Very Large Data Bases, pages 421-430, San Francisco, CA, USA, 2001 . Morgan Kaufmann Publishers Inc.