{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:16:35Z","timestamp":1778249795270,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441380","type":"print"},{"value":"9783540457107","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45710-0_15","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T20:29:40Z","timestamp":1181680180000},"page":"177-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Similarity Search in Feature Spaces with the Q-Tree"],"prefix":"10.1007","author":[{"given":"Elena","family":"Jurado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Barrena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Multidimensional Declustering Methods for Multiprocesor Database","author":"M. Barrena","year":"1996","unstructured":"M. Barrena, J. Hernandez, J.M. Martinez, A. Polo, P. de Miguel, and M. Nieto. Multidimensional Declustering Methods for Multiprocesor Database. Proceedings EURO-PAR\u201996 Conference, SpringerLNCS, (1124), 1996."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings ACM SIGMOD Conference, pages 322\u2013331, Atlantic City, NJ, 1990.","DOI":"10.1145\/93597.98741"},{"key":"15_CR3","unstructured":"S. Berchtold, C. B\u00f6hm, H.V. Jagadish, H.P. Kriegel, and J. Sander. Independent Quantization: An index compression technique for high-dimensional data spaces. In Proceedings 16th IEEE ICDE Conference, San Diego, CA, 2000."},{"key":"15_CR4","unstructured":"S. Berchtold, D.A. Keim, and H.P. Kriegel. The X-tree: An index structure for high dimensional data.In Proceedings 22nd VLDB Conference, pages 28\u201339, Bombay, India, 1996."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is nearest neighbor meaningful? In Proceedings ICDT Conference, pages 217\u2013235, 1999.","DOI":"10.1007\/3-540-49257-7_15"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"K. Chakrabarti and S. Mehrotra. The Hybrid tree: An index structure for high dimensional feature spaces. In Proceedings 15th IEEE ICDE Conference, pages 440\u2013447, 1999.","DOI":"10.1109\/ICDE.1999.754960"},{"key":"15_CR7","unstructured":"P. Ciaccia, M. Patella, and P. Zezula. M-tree. An efficient access method for similarity search in metric spaces. In Proceedings 23rd VLDB Conference, pages 426\u2013435, Athens, Greece, 1997."},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. G\u00fcnther. Multidimensional Access Methods. ACM Computing Surveys, 30(2):170\u2013231, June 1998.","journal-title":"ACM Computing Surveys"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"A. Henrich. The LSDh-tree. An access structure for feature vectors. In Proceedings IEEE ICDE Conference, pages 362\u2013369, Athens, Greece, 1998.","DOI":"10.1109\/ICDE.1998.655799"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"G.R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Transactions on Database Systems, 24:265\u2013318, June 1999.","journal-title":"ACM Transactions on Database Systems"},{"key":"15_CR11","unstructured":"R. Jain and D.A. White. Similarity indexing: Algorithms and performance. In Proceedings SPIE Storage and Retrieval for Image and Video DataBase IV, pages 62\u201375, 1996."},{"key":"15_CR12","unstructured":"E. Jurado and M. Barrena. Similarity Search Using the Q-tree. Technical report, Universidad de Extremadura, E. Polit\u00e9cnica. TR-5\/02, Mar 2002. http:\/\/webepcc.unex.es\/barrena\/ftp\/similarity.pdf"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"N. Katayama and S. Satoh. The SR-tree: An index structure for high dimensional nearest neighbor queries.In Proceedings ACM SIGMOD Conference pages 369\u2013380, Tucson, AZ, 1997.","DOI":"10.1145\/253262.253347"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.I. Lin","year":"1994","unstructured":"K.I. Lin, H.V. Jagadish, and C. Faloustos. The TV-tree: An index structure for high dimensional data. The VLDB Journal 3(4):517\u2013542, October 1994.","journal-title":"The VLDB Journal"},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1145\/99935.99949","volume":"14","author":"D. Lomet","year":"1990","unstructured":"D. Lomet and B. Salzberg. The hB-tree: A multiattribute indexing method with good guaranteed performance. ACM Transactions on Database Systems 14(4):625\u2013658, December 1990.","journal-title":"ACM Transactions on Database Systems"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proceedings ACM SIGMOD Conference pages 71\u201379, San Jose, CA, 1995.","DOI":"10.1145\/568271.223794"},{"key":"15_CR17","unstructured":"Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An index structure for high-dimensional spaces using relative approximation. In Proceedings 26th VLDB Conference pages 516\u2013526, Cairo, Egypt, 2000."},{"issue":"4","key":"15_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"J.K. Uhlmann. Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters 40(4):175\u2013179, November 1991.","journal-title":"Information Processing Letters"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"D.A. White and R. Jain. Similarity indexing with the SS-tree. In Proceedings 12th IEEE ICDE Conference pages 516\u2013523, NewOrleans, LO, 1996.","DOI":"10.1109\/ICDE.1996.492202"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45710-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:52:28Z","timestamp":1778248348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45710-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441380","9783540457107"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45710-0_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"23 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}