{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:16:55Z","timestamp":1725556615687},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131356"},{"type":"electronic","value":"9783642131363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13136-3_25","type":"book-chapter","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T18:20:16Z","timestamp":1274811616000},"page":"244-253","source":"Crossref","is-referenced-by-count":1,"title":["iCTPH: An Approach to Publish and Lookup CTPH Digests in Chord"],"prefix":"10.1007","author":[{"given":"Zhang","family":"Jianzhong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pan","family":"Kai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Yuntao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Jingdong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"s1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.diin.2006.06.015","volume":"3","author":"J. Kornblum","year":"2006","unstructured":"Kornblum, J.: Identifying almost identical files using context triggered piecewise hashing. Digital Investigation\u00a03(s1), 91\u201397 (2006)","journal-title":"Digital Investigation"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., et al.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proc. of ACM SIGCOMM, USA, pp. 149\u2013160 (2001)","DOI":"10.1145\/383059.383071"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H.V. Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.-L., et al.: iDistance: An adaptive B-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems\u00a030(2), 364\u2013397 (2005)","journal-title":"ACM Transactions on Database Systems"},{"key":"25_CR4","unstructured":"SpamNet: \n                      \n                        http:\/\/razor.sourceforge.net"},{"key":"25_CR5","unstructured":"DCC: \n                      \n                        http:\/\/www.rhyolite.com\/anti-spam\/dcc"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/IAT.2006.91","volume-title":"Proc. of the IEEE\/WIC\/ACM international conference on Intelligent Agent Technology","author":"G. Mo","year":"2006","unstructured":"Mo, G., Zhao, W., et al.: Multi-agent Interaction Based Collaborative P2P System for Fighting Spam. In: Proc. of the IEEE\/WIC\/ACM international conference on Intelligent Agent Technology, pp. 428\u2013431. IEEE Computer Society, USA (2006)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/HPCC.2008.26","volume-title":"Proc. of the 10th IEEE International Conference on High Performance Computing and Communications","author":"J. Zhang","year":"2008","unstructured":"Zhang, J., Lu, H., Lan, X., et al.: DHTnil: An Approach to Publish and Lookup Nilsimsa Digests in DHT. In: Proc. of the 10th IEEE International Conference on High Performance Computing and Communications, pp. 213\u2013218. IEEE Computer Society, USA (2008)"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Computing Surveys\u00a023(3), 345\u2013405 (1991)","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13136-3_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:56:12Z","timestamp":1619769372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13136-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131356","9783642131363"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13136-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}