{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T08:20:42Z","timestamp":1789978842700,"version":"4.0.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Multimedia Tools and Applications"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1025026030880","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T22:24:47Z","timestamp":1063751087000},"page":"9-33","source":"Crossref","is-referenced-by-count":99,"title":["D-Index: Distance Searching Index for Metric Data Sets"],"prefix":"10.1007","volume":"21","author":[{"given":"Vlastislav","family":"Dohnal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudio","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pasquale","family":"Savino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavel","family":"Zezula","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"5140129_CR1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/328939.328959","volume":"24","author":"T. Bozkaya","year":"1999","unstructured":"T. Bozkaya and Ozsoyoglu, \u201cIndexing large metric spaces for similarity search queries,\u201d ACM TODS, Vol. 24, No. 3, pp. 361\u2013404, 1999.","journal-title":"ACM TODS"},{"key":"5140129_CR2","doi-asserted-by":"crossref","unstructured":"B. Bustos, G. Navarro, and E. Chavez, \u201cPivot selection techniques for proximity searching in metric spaces,\u201d in Proceedings of the XXI Conference of the Chielan Computer Science Society (SCCC01), IEEE CS Press, 2001, pp. 33\u201340.","DOI":"10.1109\/SCCC.2001.972629"},{"issue":"2","key":"5140129_CR3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1011343115154","volume":"14","author":"E. Chavez","year":"2001","unstructured":"E. Chavez, J. Marroquin, and G. Navarro, \u201cFixed queries array: A fast and economical data structure for proximity searching,\u201d Multimedia Tools and Applications, Vol. 14, No. 2, pp. 113\u2013135, 2001.","journal-title":"Multimedia Tools and Applications"},{"issue":"3","key":"5140129_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Chavez","year":"2001","unstructured":"E. Chavez, G. Navarro, R. Baeza-Yates, and J. Marroquin, \u201cProximity searching in metric spaces,\u201d ACM Computing Surveys. Vol. 33, No. 3, pp. 273\u2013321, 2001.","journal-title":"ACM Computing Surveys"},{"key":"5140129_CR5","unstructured":"P. Ciaccia, M. Patella, and P. Zezula, \u201cM-tree: An efficient access method for similarity search in metric spaces,\u201d in Proceedings of the 23rd VLDB Conference, Athens, Greece, 1997, pp. 426\u2013435."},{"key":"5140129_CR6","doi-asserted-by":"crossref","unstructured":"R.F.S. Filho, A. Traina, C. Traina Jr., and C. Faloutsos, \u201cSimilarity search without tears: The OMNI-family of all-purpose access methods,\u201d in Proceedings of the 17th ICDE Conference, Heidelberg, Germany, 2001, pp. 623\u2013630.","DOI":"10.1109\/ICDE.2001.914877"},{"key":"5140129_CR7","unstructured":"V. Dohnal, C. Gennaro, P. Savino, and P. Zezula, \u201cSeparable splits in metric data sets,\u201d in Proceedings of 9-th Italian Symposium on Advanced Database Systems, Venice, Italy, June 2001, pp. 45\u201362, LCM Selecta Group\u2014Milano."},{"key":"5140129_CR8","doi-asserted-by":"crossref","unstructured":"C. Gennaro, P. Savino, and P. Zezula, \u201cSimilarity search in metric databases through Hashing,\u201d in Proceedings of ACM Multimedia 2001 Workshops, Oct. 2001, Ottawa, Canada, pp. 1\u20135.","DOI":"10.1145\/500933.500935"},{"key":"5140129_CR9","unstructured":"J.M. Hellerstein, J.F. Naughton, and A. Pfeffer, \u201cGeneralized search trees for database systems,\u201d in Proceedings of the 21st VLDB Conference, 1995, pp. 562\u2013573."},{"key":"5140129_CR10","unstructured":"B. Seeger, P. Larson, and R. McFayden, \u201cReading a set of disk pages,\u201d in Proceedings of the 19th VLDB Conference, 1993, pp. 592\u2013603."},{"key":"5140129_CR11","unstructured":"P.N. Yianilos, \u201cData structures and algorithms for nearest neighbor search in general metric spaces,\u201d ACMSIAM Symposium on Discrete Algorithms (SODA), 1993, pp. 311\u2013321."},{"key":"5140129_CR12","unstructured":"P.N. Yianilos, \u201cExcluded middle vantage point forests for nearest neighbor search,\u201d Tech. rep., NEC Research Institute, 1999, Presented at Sixth DIMACS Implementation Challenge: Nearest Neighbor Searchesworkshop, Jan. 15, 1999."},{"key":"5140129_CR13","unstructured":"C. Yu, B.C. Ooi, K.L. Tan, and H.V. Jagadish, \u201cIndexing the Distance: Anefficient method toKNNprocessing,\u201d in Proceedings of the 27th VLDB Conference, Roma, Italy, 2001, pp. 421\u2013430."}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025026030880.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025026030880\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025026030880.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T06:30:51Z","timestamp":1748241051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025026030880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5140129"],"URL":"https:\/\/doi.org\/10.1023\/a:1025026030880","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}