{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T10:40:11Z","timestamp":1736678411932,"version":"3.32.0"},"publisher-location":"Boston, MA","reference-count":22,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387346335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-34735-6_13","type":"book-chapter","created":{"date-parts":[[2006,12,14]],"date-time":"2006-12-14T18:32:32Z","timestamp":1166121152000},"page":"115-129","source":"Crossref","is-referenced-by-count":3,"title":["An Algorithm to Reduce the Communication Traffic for Multi-Word Searches in a Distributed Hash Table"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Sei","sequence":"first","affiliation":[]},{"given":"Kazutaka","family":"Matsuzaki","sequence":"additional","affiliation":[]},{"given":"Shinichi","family":"Honiden","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Gnutella, http:\/\/gnutella.wego.com\/"},{"key":"13_CR2","unstructured":"Google, http:\/\/google.com\/"},{"key":"13_CR3","unstructured":"ISO\/IEC TR 15938-8:2002: Information technology, multimedia content description interface, part8: Extraction and use of mpeg-7 descriptionscISO\/IEC\/JTC 1\/SC 29, 2002."},{"key":"13_CR4","unstructured":"Massachusetts institute of technology, http:\/\/mit.edu\/"},{"key":"13_CR5","unstructured":"Napster, http:\/\/www.napster.com\/"},{"key":"13_CR6","unstructured":"Wordnet, http:\/\/wordnet.princeton.edu\/"},{"key":"13_CR7","unstructured":"World-wide web consortium: Resource description framework, http:\/\/www.w3.org\/rdf"},{"issue":"7","key":"13_CR8","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. H. Bloom","year":"1970","unstructured":"Burton H. Bloom. Space\/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422\u2013426, 1970.","journal-title":"Commun. ACM"},{"key":"13_CR9","unstructured":"A. Broder and M. Mitzemnacher. Network applications of bloom filters: A survey. In Proceedings of ~Oth Annual Allerton Conference on Communication, Control, and Computing, pages 636\u2013646, 2002."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Min Cai and Martin Prank. Rdfpeers: a scalable distributed rdf repository based on a structured peer-to-peer network. In WWW\u2019 04: Proceedings of the 13th international conference on World Wide Web, pages 650\u2013657, New York, NY, USA, 2004. ACM Press.","DOI":"10.1145\/988672.988760"},{"key":"13_CR11","unstructured":"Austin T. Clements, Dan R. K. Ports, and David R. Karger. Arpeggio: Metadata searching and content sharing with chord."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"D. Eastlake3rd and P. Jones. US Secure Hash Algorithm 1 (SHA1). RFC 3174, September 2001.","DOI":"10.17487\/rfc3174"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"J. LI, B. LOO, J. HELLERSTEIN, F. KAASHOEK, D. KARGER, and R. MORRIS. the feasibility of peer-to-peer web indexing and search, 2003.","DOI":"10.1007\/978-3-540-45172-3_19"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Gang Peng, Shanping Li, Hairong Jin, and Tianchi Ma. M-can: a lookup protocol for mobile peer-to-peer environment. In ISPAN, pages 544\u2013550, 2004.","DOI":"10.1109\/ISPAN.2004.1300535"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Schenker. A scalable content-addressable network. In Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pages 161\u2013172, August 2001.","DOI":"10.1145\/383059.383072"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Patrick Reynolds and Amin Vahdat. Efficient peer-to-peer keyword searching. In Middleware, pages 21\u201340, 2003.","DOI":"10.1007\/3-540-44892-6_2"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Antony I. T. Rowstron and Peter Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Symposium on Operating Systems Principles, pages 188\u2013201, 2001.","DOI":"10.1145\/502034.502053"},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1093\/comjnl\/32.3.212","volume":"32","author":"M. A. Shepherd","year":"1989","unstructured":"Michael A. Shepherd, William J. Phillips, and C.-K. Chu. A fixed-size bloom filter for searching textual documents. Comput. J., 32(3):212\u2013219, 1989.","journal-title":"Comput. J."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Ion Stoica, Robert, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149\u2013160, 2001.","DOI":"10.1145\/383059.383071"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Chunqiang Tang, Zhichen Xu, and Sandhya Dwarkadas. Peer-to-peer information retrieval using self-organizing semantic overlay networks. In SIGCOMM, pages 175\u2013186, 2003.","DOI":"10.1145\/863955.863976"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Jiangong Zhang and Torsten Suel. Efficient query evaluation on large textual collections in a peer-to-peer environment. In Peer-to-Peer Computing, pages 225\u2013233, 2005.","DOI":"10.1109\/P2P.2005.7"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Ben Y. Zhao, Ling Huang, Anthony D. Joseph, and John Kubiatowicz. Rapid mobility via type indirection. In IPTPS, pages 64\u201374, 2004.","DOI":"10.1007\/978-3-540-30183-7_7"}],"container-title":["IFIP International Federation for Information Processing","Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-34735-6_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T10:22:39Z","timestamp":1736677359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-34735-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387346335"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-34735-6_13","relation":{},"subject":[]}}