{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T06:05:36Z","timestamp":1791266736452,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540287117","type":"print"},{"value":"9783540287124","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11549819_3","type":"book-chapter","created":{"date-parts":[[2010,3,15]],"date-time":"2010-03-15T12:11:13Z","timestamp":1268655073000},"page":"25-44","source":"Crossref","is-referenced-by-count":18,"title":["Similarity Grid for Searching in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Michal","family":"Batko","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudio","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavel","family":"Zezula","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/763693.763696","volume":"21","author":"G. Amato","year":"2003","unstructured":"Amato, G., Rabitti, F., Savino, P., Zezula, P.: Region proximity in metric spaces and its use for approximate similarity search. ACM TOIS\u00a021(2), 192\u2013227 (2003)","journal-title":"ACM TOIS"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bustos, B., Navarro, G., Ch\u00e1vez, E.: Pivot selection techniques for proximity searching in metric spaces. In: Proc. of the XXI Conference of the Chilean Computer Science Society (SCCC 2001), pp. 33\u201340 (2001)","DOI":"10.1109\/SCCC.2001.972629"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Chavez","year":"2001","unstructured":"Chavez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.: Proximity searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"3_CR4","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proc. of 23rd International Conference on Very Large Data Bases (VLDB), pp. 426\u2013435 (1997)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-57301-1_7","volume-title":"Foundations of Data Organization and Algorithms","author":"R. Devine","year":"1993","unstructured":"Devine, R.: Design and implementation of DDH: A distributed dynamic hashing algorithm. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol.\u00a0730, pp. 101\u2013114. Springer, Heidelberg (1993)"},{"issue":"1","key":"3_CR6","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\u201313 (2003)","journal-title":"Multimedia Tools and Applications"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Gennaro, C., Savino, P., Zezula, P.: Similarity search in metric databases through hashing. In: Proc. of the 3rd Work. on Multimedia Inf. Retrieval, pp. 1\u20135 (2001)","DOI":"10.1145\/500933.500935"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G.R. Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces. ACM Transactions on Database Systems\u00a028(4), 517\u2013580 (2003)","journal-title":"ACM Transactions on Database Systems"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Johnson, T., Krishna, P.: Lazy updates for distributed search structure. In: Proc. of the ACM SIGMOD, vol.\u00a022(2), pp. 337\u2013346 (1993)","DOI":"10.1145\/170036.170085"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ll, B., Widmayer, P.: Distributing a search tree among a growing number of processors. In: Proc. of the ACM SIGMOD, vol.\u00a023(2), pp. 265\u2013276 (1994)","DOI":"10.1145\/191843.191891"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1145\/236711.236713","volume":"21","author":"W. Litwin","year":"1996","unstructured":"Litwin, W., Neimat, M., Schneider, D.A.: LH* - a scalable, distributed data structure. ACM Transactions on Database Systems\u00a021(4), 480\u2013525 (1996)","journal-title":"ACM Transactions on Database Systems"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. of ACM SIGCOMM 2001, pp. 161\u2013172 (2001)","DOI":"10.1145\/964723.383072"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proc. of Conference on Applications, tech., archit., and protocols for computer communications, pp. 175\u2013186 (2003)","DOI":"10.1145\/863973.863976"},{"key":"3_CR14","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. IPL: Information Processing Letters\u00a040, 175\u2013179 (1991)","journal-title":"IPL: Information Processing Letters"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Zezula, P., Savino, P., Rabitti, F., Amato, G., Ciaccia, P.: Processing m-trees with parallel resources. In: Proc. of the 8th International Workshop on Research Issues in Data Engineering (RIDE 1998), Orlando, FL, February 1998, pp. 147\u2013154 (1998)","DOI":"10.1109\/RIDE.1998.658289"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549819_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T13:09:20Z","timestamp":1739970560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549819_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287117","9783540287124"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11549819_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}