{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:57:34Z","timestamp":1725541054035},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642054402"},{"type":"electronic","value":"9783642054419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05441-9_7","type":"book-chapter","created":{"date-parts":[[2009,11,24]],"date-time":"2009-11-24T01:06:55Z","timestamp":1259024815000},"page":"71-81","source":"Crossref","is-referenced-by-count":1,"title":["M-KAD: A Scalable Peer-to-Peer System for Similarity Search in Metric Space"],"prefix":"10.1007","author":[{"given":"Dafan","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuefei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zi","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gongyi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/11549819_3","volume-title":"Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures","author":"M. Batko","year":"2005","unstructured":"Batko, M., Gennaro, C., Zezula, P.: Similarity grid for searching in metric spaces. In: T\u00fcrker, C., Agosti, M., Schek, H.-J. (eds.) Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures. LNCS, vol.\u00a03664, pp. 25\u201344. Springer, Heidelberg (2005)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-71661-7_9","volume-title":"Databases, Information Systems, and Peer-to-Peer Computing","author":"F. Falchi","year":"2007","unstructured":"Falchi, F., Gennaro, C., Zezula, P.: A content-addressable network for similarity search in metric spaces. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2005 and DBISP2P 2006. LNCS, vol.\u00a04125, p. 98. Springer, Heidelberg (2007)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Dong, D., Wu, Y., Wang, X., Luo, T., Huang, G., Wu, G.: Similarity Search in Metric Space over Content Addressable Network. In: 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008, pp. 702\u2013707 (2008)","DOI":"10.1109\/HPCC.2008.65"},{"key":"7_CR4","volume-title":"Proceedings of the 1st international conference on Scalable information systems","author":"D. Novak","year":"2006","unstructured":"Novak, D., Zezula, P.: M-Chord: A scalable distributed similarity search structure. In: Proceedings of the 1st international conference on Scalable information systems. ACM Press, New York (2006)"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H. Jagadish","year":"2005","unstructured":"Jagadish, H., Ooi, B., Tan, K., Yu, C., Zhang, R.: iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS)\u00a030(2), 364\u2013397 (2005)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45748-8_5","volume-title":"Peer-to-Peer Systems","author":"P. Maymounkov","year":"2002","unstructured":"Maymounkov, P., Mazi\u00e8res, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 53. Springer, Heidelberg (2002)"},{"key":"7_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity Search: the metric space approach","author":"P. Zezula","year":"2006","unstructured":"Zezula, P.: Similarity Search: the metric space approach. Springer, Heidelberg (2006)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Bookstein, A., Kulyukin, V., Raita, T.: Generalized hamming distance, pp. 353\u2013375 (2002)","DOI":"10.1023\/A:1020499411651"}],"container-title":["Studies in Computational Intelligence","Software Engineering Research, Management and Applications 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05441-9_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:51:47Z","timestamp":1606186307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05441-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054402","9783642054419"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05441-9_7","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}