{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:12:01Z","timestamp":1725541921670},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642113673"},{"type":"electronic","value":"9783642113680"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11368-0_9","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T06:09:04Z","timestamp":1260252544000},"page":"110-121","source":"Crossref","is-referenced-by-count":0,"title":["Flexible Bloom Filters for Searching Textual Objects"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Sei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazutaka","family":"Matsuzaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinichi","family":"Honiden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Stoica, I., Robert, K.D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149\u2013160 (2001)","DOI":"10.1145\/383059.383071"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, August 2001, pp. 161\u2013172 (2001)","DOI":"10.1145\/383059.383072"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Rowstron, A.I.T., Druschel, P.: Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Symposium on Operating Systems Principles, pp. 188\u2013201 (2001)","DOI":"10.1145\/502034.502053"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Peer-to-Peer Systems II","author":"J. Li","year":"2003","unstructured":"Li, J., Loo, B.T., Hellerstein, J.M., Kaashoek, F., Karger, D.R., Morris, R.: On the feasibility of peer-to-peer web indexing and search. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"issue":"7","key":"9_CR5","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"9_CR6","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. In: Proceedings of 40th Annual Allerton Conference on Communication, Control, and Computing, pp. 636\u2013646 (2002)"},{"key":"9_CR7","unstructured":"Zhang, J., Suel, T.: Efficient query evaluation on large textual collections in a peer-to-peer environment. In: Peer-to-Peer Computing, pp. 225\u2013233 (2005)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-44892-6_2","volume-title":"Middleware 2003","author":"P. Reynolds","year":"2003","unstructured":"Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. In: Endler, M., Schmidt, D.C. (eds.) Middleware 2003. LNCS, vol.\u00a02672, pp. 21\u201340. Springer, Heidelberg (2003)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Sei, Y., Matsuzaki, K., Honiden, S.: An algorithm to reduce the communication traffic for multi-word search in a distributed hash table. In: Proceedings of 4th IFIP International Conference on Theoretical Computer Science, pp. 115\u2013129 (2006)","DOI":"10.1007\/978-0-387-34735-6_13"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1093\/comjnl\/30.4.343","volume":"30","author":"J.K. Mullin","year":"1987","unstructured":"Mullin, J.K.: Accessing textual documents using compressed indexes of arrays of small bloom filters. Computer Journal\u00a030(4), 343\u2013348 (1987)","journal-title":"Computer Journal"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1093\/comjnl\/32.3.212","volume":"32","author":"M.A. Shepherd","year":"1989","unstructured":"Shepherd, M.A., Phillips, W.J., Chu, C.K.: A fixed-size bloom filter for searching textual documents. Computer Journal\u00a032(3), 212\u2013219 (1989)","journal-title":"Computer Journal"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Compressed bloom filters. In: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, pp. 144\u2013150 (2001)","DOI":"10.1145\/383962.384004"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Adler, M., Chakrabarti, S., Mitzenmacher, M., Rasmussen, L.: Parallel randomized load balancing, pp. 238\u2013247 (1995)","DOI":"10.1145\/225058.225131"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Miller, G.: Wordnet an on-line lexical database. International Journal of Lexicographer 3(4), (special issue) (1990)","DOI":"10.1093\/ijl\/3.4.235"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Eastlake III, D., Jones, P.: US Secure Hash Algorithm 1 (SHA1). RFC 3174 (September 2001)","DOI":"10.17487\/rfc3174"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1142\/S0129156497000068","volume":"8","author":"A. Moffat","year":"1997","unstructured":"Moffat, A., Bell, T., Witten, I.: Lossless compression for text and images. International Journal of High Speed Electronics and Systems\u00a08(1), 179\u2013231 (1997)","journal-title":"International Journal of High Speed Electronics and Systems"},{"key":"9_CR17","unstructured":"ISO\/IEC TR 15938-8:2002: Information technology. Multimedia content description interface. part 8: Extraction and use of mpeg-7 descriptions, ISO\/IEC\/JTC 1\/SC 29 (2002)"}],"container-title":["Lecture Notes in Computer Science","Agents and Peer-to-Peer Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11368-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:11Z","timestamp":1606185611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11368-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642113673","9783642113680"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11368-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}