{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:20Z","timestamp":1725548960085},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_5","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:02:43Z","timestamp":1267552963000},"page":"44-53","source":"Crossref","is-referenced-by-count":4,"title":["Distributed and Scalable Similarity Searching in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Michal","family":"Batko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"5_CR1","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., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"5_CR2","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)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/3-540-36618-0_32","volume-title":"Advances in Information Retrieval","author":"V. Dohnal","year":"2003","unstructured":"Dohnal, V., Gennaro, C., Savino, P., Zezula, P.: Similarity join in metric spaces. In: Sebastiani, F. (ed.) ECIR 2003. LNCS, vol.\u00a02633, pp. 452\u2013467. Springer, Heidelberg (2003)"},{"issue":"4","key":"5_CR4","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 Trans. Database Syst.\u00a028(4), 517\u2013580 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ll, B., Widmayer, P.: Distributing a search tree among a growing number of processors. In: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data \/ SIGMOD 1994, Minneapolis, Minnesota, pp. 265\u2013276 (1994)","DOI":"10.1145\/191843.191891"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1145\/236711.236713","volume":"21","author":"W. Litwin","year":"1996","unstructured":"Litwin, W., Neimat, M.-A., Schneider, D.A.: LH* \u2013 A scalable, distributed data structure. TODS\u00a021(4), 480\u2013525 (1996)","journal-title":"TODS"},{"key":"5_CR7","unstructured":"Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-peer computing. Technical Report HPL-2002-57, HP Laboratories, Palo Alto (March 2002)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proc. of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 161\u2013172 (2001)","DOI":"10.1145\/383059.383072"},{"key":"5_CR9","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"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:28:01Z","timestamp":1558286881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30192-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233053","9783540301929"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30192-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}