{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:05:06Z","timestamp":1742400306248},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291862"},{"type":"electronic","value":"9783540320012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11562382_59","type":"book-chapter","created":{"date-parts":[[2005,11,10]],"date-time":"2005-11-10T11:58:50Z","timestamp":1131623930000},"page":"626-634","source":"Crossref","is-referenced-by-count":2,"title":["Indexing Structures for Content-Based Retrieval of Large Image Databases: A Review"],"prefix":"10.1007","author":[{"given":"He","family":"Ling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu","family":"Lingda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cai","family":"Yichao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Yuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"crossref","unstructured":"Guattman, A.: R-tree:a dynamic index structure for spatial searching. In: ACM Sigmod Int.Conf.on Management of Data, Boston, MA, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"59_CR2","unstructured":"David, A., White, R.J.: Similarity indexing with the SS-tree. In: Proc.of the 12th IEEE Int.Conf.on Data Engineering (1996)"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: SR-tree:An index structure for high dimensional nearest neighbor queries. In: Proc. of the Int. Conf. on Management of data (1997)","DOI":"10.1145\/253260.253347"},{"key":"59_CR4","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R.: The R*-tree: An Efficient and robust access method for points and tectangles. In: Proc.1990 ACM SIGMOD Int.Conf. management of Data, AtlanticCity, NJ, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"59_CR5","unstructured":"Berchtold, S., Keim, D., Kriegel, H.-P.: The X-tree: An Index Structure for High-Dimensional Data. In: Proc. of the 22nd Int. Conf. on Very Large Data Bases, Mumbai, India (1996)"},{"key":"59_CR6","doi-asserted-by":"crossref","unstructured":"Lin, K.-I., Jagadish, H.V., Faloutsos, C.: The TV-tree:An index structure for high dimensional data. In: VLDB, vol.\u00a03, pp. 517\u2013549 (1994)","DOI":"10.1007\/BF01231606"},{"key":"59_CR7","doi-asserted-by":"crossref","unstructured":"Henrich, A.: The LSDh-tree: An access structure for feature vectors. In: Proc. 14th Int. Conf. Data Engineering, pp. 362\u2013369 (1998)","DOI":"10.1109\/ICDE.1998.655799"},{"key":"59_CR8","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Bohm, C., Kriegel, H.-P.: The Pyramid Technique: Towards Breaking the Curse of Dimensionality. In: Proc. of the Int. Conf. on Management of Data. ACM Press, New York (1998)","DOI":"10.1145\/276304.276318"},{"key":"59_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti, K., Mehrotra, S.: The Hybrid Tree: An index structure for high dimensional feature spaces. In: Proc. of the 15th Int. Conf. on Data Engineering, pp. 440\u2013447 (1999)","DOI":"10.1109\/ICDE.1999.754960"},{"key":"59_CR10","unstructured":"Sakurai, Y., Yoshikawa, M., Uemura, S.: The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation. In: Proc. of the 26th Int.Conf. on Very Large Data Bases (VLDB 2000) (2000)"},{"key":"59_CR11","unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. of the 24th Int. Conf. on Very Large Data Bases (VLDB 1998), NewYork, USA, pp. 194\u2013205 (1998)"},{"key":"59_CR12","unstructured":"Caicca, P., Patella, M.: Approximate similarity queries:a survey. University of Bologna, Italy (2001)"},{"key":"59_CR13","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Lin, K.-I.: Fastmap: A fast algorithm for indexing,data mining, and visualization of traditional and multimedia database. In: Sigmod Record, Proc. 1995 ACM SIGMOD Int.Conf.on Management of data (1995)","DOI":"10.1145\/223784.223812"},{"key":"59_CR14","unstructured":"Yu, C., Bressan, S., Ooi, B.C.: Querying high dimensional data in single dimensional space. VLDB Journal (2002)"},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Bohm, C., Jagadish, H.V.: Independent quantization: An index compression technique for high-dimensional data spaces. In: Proc. of the 16th Int.Conf. on Data Engineering (ICDE 2000), San Diego, USA, pp. 577\u2013588 (2000)","DOI":"10.1109\/ICDE.2000.839456"},{"key":"59_CR16","doi-asserted-by":"crossref","unstructured":"Cha, G.-H., Chung, C.-W.: The GC-tree: a high dimensional index structure for similarity in image databases. IEEE Transactions on multimedia\u00a04 (2002)","DOI":"10.1109\/TMM.2002.1017736"},{"key":"59_CR17","doi-asserted-by":"crossref","unstructured":"Wu, P., Manjunath, B.S.: An Adaptive Index Structure for Similarity Search in Large Image Databases. In: Proceedings of SPIE, vol.\u00a04519 (2001)","DOI":"10.1117\/12.434281"},{"key":"59_CR18","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D.: Vector approximation based indexing for non-Uniform high dimensional data sets. In: ACM International Conf. on Information and Knowledge Management (2000)","DOI":"10.1145\/354756.354820"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"Cha, G.-H., Zhu, X., Petkovic, D.: An Efficient Indexing Method for Nearest Neighbor Searches in High-Dimensional Image Databases. IEEE Transactions on multimedia\u00a04 (2002)","DOI":"10.1109\/6046.985556"},{"key":"59_CR20","doi-asserted-by":"crossref","unstructured":"Hutflesz, A., Six, H.W., Widmayer, P.: Globally order preserving multidimensional linear hashing. In: Proc. 4th IEEE Int. Conf. on Data Eng., pp. 572\u2013579 (1988)","DOI":"10.1109\/ICDE.1988.105505"},{"key":"59_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Efficient Query Processing in Geographic Information Systems","author":"B.C. Ooi","year":"1990","unstructured":"Ooi, B.C.: Efficient Query Processing in Geographic Information Systems. In: Ooi, B.-C. (ed.) Efficient Query Processing in Geographic Information Systems. LNCS, vol.\u00a0471. Springer, Heidelberg (1990)"},{"key":"59_CR22","unstructured":"Oosterom, P.: Reactive Data Structures for GIS. Ph.D. thesis, University of Leiden, The Netherlands (1990)"},{"key":"59_CR23","doi-asserted-by":"crossref","unstructured":"Seeger, B.: Performance comparison of segment access methods implemented on top of buddy tree. In: G\u00fcnther, O., Schek, H.-J. (eds.) SSD 1991. LNCS, vol.\u00a0525, pp. 277\u2013296. Springer, Heidelberg (1991)","DOI":"10.1007\/3-540-54414-3_43"},{"key":"59_CR24","unstructured":"Kamel, I., Faloustsos, C.: Hilbert R-tree: An improved R-tree using fractals. In: Proc. 20th Int. Conf. On Very Large Data Bases, pp. 500\u2013509 (1994)"},{"key":"59_CR25","unstructured":"Gaede, V., G\u00fcnther, O.: Survey on Multidimensional Access Method. Department of Economics and Business Administration, Humboldt University Berlin (1997) (revised version)"},{"key":"59_CR26","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/TKDE.2004.97","volume":"16","author":"J. Xu","year":"2004","unstructured":"Xu, J., Zheng, B., Lee, W.-C., Lee, D.L.: The D-Tree:An Index Structure for Planar Point Queries in Location-Based Wireless Services. IEEE Transactions on Knowledge and Data Engineering\u00a016, 1526\u20131542 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"59_CR27","doi-asserted-by":"crossref","unstructured":"Qian, G., Zhu, Q., Xue, Q., Pramanik, S.: The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces. In: Proceedings of the 29th VLDB Conference, Berlin, Germany (2003)","DOI":"10.1016\/B978-012722442-8\/50061-6"},{"key":"59_CR28","first-page":"372","volume":"3","author":"G. Lu","year":"2002","unstructured":"Lu, G.: Techniques and Data Structures for Efficient Multimedia Retrieval Based on similarity. IEEE Transactions on Multimedia\u00a03, 372\u2013384 (2002)","journal-title":"IEEE Transactions on Multimedia"}],"container-title":["Lecture Notes in Computer Science","Information Retrieval Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11562382_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:51:57Z","timestamp":1605624717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11562382_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291862","9783540320012"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11562382_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}