Abstract
Dominant features for the content-based image retrieval usually have high-dimensionality. So far, many researches have been done to index such values to support fast retrieval. Still, many existing indexing schemes are suffering from performance degradation due to the curse of dimensionality problem. As an alternative, heuristic algorithms have been proposed to calculate the answer with ‘high probability’ at the cost of accuracy. In this paper, we propose a new hash tree-based indexing structure called tertiary hash tree for indexing high-dimensional feature data. Tertiary hash tree provides several advantages compared to the traditional extendible hash structure in terms of resource usage and search performance. Through extensive experiments, we show that our proposed index structure achieves outstanding performance.
Similar content being viewed by others
References
Beckmann N, Seeger B (2009) A revised r*-tree in comparison with related index structures. ACM SIGMOD Conf. on Management of Data, pp 799–812
Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-Tree: an Efficient and Robust Access Method for Points and Rectangles. Proc. of the ACM SIGMOD Conf. on Management of Data, pp 322–331
Berchtold S, Keim D, Kriegel H-P (1996) The X-tree: an index structure for high-dimensional data. Proc. of the Conf. on Very Large Databases, pp 28–39
Berchtold S, Boehm C, Jagadish HV, Kriegel HP, Sander J (2000) Independent quantization: an index compression technique for high-dimensional data spaces. ICDE, pp 577–588
Chakrabarti K, Mehrotra S (1999) The hybrid Tree: an index structure for high dimensional feature spaces. Proc. of the 15th Conf. on Data Engineering, pp 440–447
Fagin R, Nievergelt J, Pippenger N, Strong H (1979) Extendible hashing—a fast access method for dynamic files. ACM Trans Database Syst 4(3):315–344
Faloutsos C, Lin K (1995) FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. Proc. of the ACM SIGMOD Conf. on Management of Data, pp 163–174
Guttman A (1984) R-trees: a dynamic index structure for spatial searching. Proc. of the ACM SIGMOD Conf. on Management of Data, pp 47–57
Ip Lin K, Jagadish HV, Faloutsos C (1994) The TV-tree: an index structure for high-dimensional data. VLDB Journal 3(4):517–542
Katayama N, Satoh S (1997) The SR-Tree: an index structure for high dimensional nearest neighbor queries. Proc. of the ACM SIGMOD Conf. on Management of Data, pp 69–380
Lin S, Ozsu M, Oria V, Ng R (2001) An extendible hash for multi-precision similarity querying of image databases. Proc. of the Conf. on Very Large Data Bases, pp 221–230
Sellis T, Roussopoulos N, Faloutsos C (1987) The R+-Tree: a dynamic index for multi-dimensional objects. Proc. of the Conf. on Very Large Data Bases
Slaney M, Casey M (2008) Locality-sensitive hashing for finding nearest neighbors. IEEE Signal Process Mag 25(2):128–131
Tak Y, Hwang E (2009) Indexing and matching scheme for recognizing 3D objects from single 2D image. IMSA, pp 60–67
Wang H, Perng C-S (2001) The S2-Tree: an index structure for subsequence matching of spatial objects. Proc. of Fifth Pacific-Asic Conf. on Knowledge Discovery and Data Mining
White DA, Jain R (1996) Similarity indexing with the SS-Tree. Proc. of the 12th Conf. on Data Engineering, pp 516–523
Yianilos, Peter N (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. Proc. of the 4th ACM-SIAM Symposium on Discrete algorithms, pp 311–321
Acknowledgement
This research was supported by the MKE (Ministry of Knowledge Economy), Korea, under the ITRC (Information Technology Research Center) support program supervised by the NIPA (National IT Industry Promotion Agency) (NIPA-2010-C1090-1001-0008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tak, YS., Rho, S., Hwang, E. et al. Tertiary hash tree-based index structure for high dimensional multimedia data. Multimed Tools Appl 61, 51–68 (2012). https://doi.org/10.1007/s11042-010-0687-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-010-0687-8