{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T23:05:25Z","timestamp":1746313525100},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233053"},{"type":"electronic","value":"9783540301929"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30192-9_13","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:02:43Z","timestamp":1267534963000},"page":"133-143","source":"Crossref","is-referenced-by-count":8,"title":["An Access Structure for Similarity Search in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Vlastislav","family":"Dohnal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.-P.: The pyramid-technique: Towards breaking the curse of dimensionality. In: ACM SIGMOD 1998, pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/328939.328959","volume":"24","author":"T. Bozkaya","year":"1999","unstructured":"Bozkaya, T., \u00d6zsoyoglu, Z.M.: Indexing large metric spaces for similarity search queries. ACM TODS\u00a024(3), 361\u2013404 (1999)","journal-title":"ACM TODS"},{"key":"13_CR3","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: VLDB 1995, pp. 574\u2013584 (1995)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/SCCC.2001.972629","volume-title":"SCCC 2001, Proceedings of the XXI Conference of the Chilean Computer Science Society","author":"B. Bustos","year":"2001","unstructured":"Bustos, B., Navarro, G., Ch\u00e1vez, E.: Pivot selection techniques for proximity searching in metric spaces. In: SCCC 2001, Proceedings of the XXI Conference of the Chilean Computer Science Society, pp. 33\u201340. IEEE CS Press, Los Alamitos (2001)"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB 1997, pp. 426\u2013435 (1997)","DOI":"10.1145\/275487.275495"},{"key":"13_CR7","unstructured":"Dohnal, V., Gennaro, C., Savino, P., Zezula, P.: Separable splits in metric data sets. In: Proceedings of 9-th Italian Symposium on Advanced Database Systems, SEBD 2001, pp. 45\u201362 (2001)"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1025026030880","volume":"21","author":"V. Dohnal","year":"2003","unstructured":"Dohnal, V., Gennaro, C., Savino, P., Zezula, P.: D-Index: Distance searching index for metric data sets. Multimedia Tools and Applications\u00a021(1), 9\u201333 (2003)","journal-title":"Multimedia Tools and Applications"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-46439-5_4","volume-title":"Advances in Database Technology - EDBT 2000","author":"C. Traina Jr.","year":"2000","unstructured":"Traina Jr., C., Traina, A.J.M., Seeger, B., Faloutsos, C.: Slim-Trees: High performance metric trees minimizing overlap between nodes. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 51\u201365. Springer, Heidelberg (2000)"},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040(4), 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"13_CR11","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, pp. 311\u2013321 (1993)"},{"key":"13_CR12","unstructured":"Yianilos, P.N.: Excluded middle vantage point forests for nearest neighbor search. In: 6th DIMACS Implementation Challenge, ALENEX 1999 (1999)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/3-540-44674-5","volume-title":"Databases in Telecommunications II","author":"C. Yu","year":"2001","unstructured":"Yu, C., Ooi, B.C., Tan, K.-L., Jagadish, H.V.: Indexing the distance: An efficient method to KNN processing. In: Jonker, W. (ed.) VLDB-WS 2001 and DBTel 2001. LNCS, vol.\u00a02209, pp. 421\u2013430. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Current Trends in Database Technology - EDBT 2004 Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30192-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T11:14:20Z","timestamp":1711278860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30192-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233053","9783540301929"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30192-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}