{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:08:15Z","timestamp":1764331695398},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403173"},{"type":"electronic","value":"9783540448921"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44892-6_2","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T06:51:40Z","timestamp":1187247100000},"page":"21-40","source":"Crossref","is-referenced-by-count":147,"title":["Efficient Peer-to-Peer Keyword Searching"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Reynolds","sequence":"first","affiliation":[]},{"given":"Amin","family":"Vahdat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/322234.322238","volume":"28","author":"P. Bernstein","year":"1981","unstructured":"Philip Bernstein and Dah-Ming Chiu. Using semi-joins to solve relational queries. Journal of the Association for Computing Machinery, 28(1):25\u201340, January 1981.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"7","key":"2_CR2","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. Communications of the ACM, 13(7):422\u2013426, 1970.","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Sergey Brin and Lawrence Page. The anatomy of a large-scale hypertextual web search engine. In 7th International World Wide Web Conference, 1998.","key":"2_CR3","DOI":"10.1016\/S0169-7552(98)00110-X"},{"unstructured":"Junghoo Cho and Hector Garcia-Molina. The evolution of the web and implications for an incremental crawler. In The VLDB Journal, September 2000.","key":"2_CR4"},{"unstructured":"I. Clarke. A distributed decentralised information storage and retrieval system, 1999.","key":"2_CR5"},{"doi-asserted-by":"crossref","unstructured":"Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP\u201901), October 2001.","key":"2_CR6","DOI":"10.1145\/502051.502054"},{"doi-asserted-by":"crossref","unstructured":"Li Fan, Pei Cao, Jussara Almeida, and Andrei Broder. Summary cache: A scalable wide-area web cache sharing protocol. In Proceedings of ACM SIGCOMM\u201998, pages 254\u2013265, 1998.","key":"2_CR7","DOI":"10.1145\/285237.285287"},{"unstructured":"Gnutella. http:\/\/gnutella.wego.com\/ .","key":"2_CR8"},{"unstructured":"T. Hong. Freenet: A distributed anonymous information storage and retrieval system. In ICSI Workshop on Design Issues in Anonymity and Unobservability, 2000.","key":"2_CR9"},{"doi-asserted-by":"crossref","unstructured":"David R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, and Daniel Lewin. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In ACM Symposium on Theory of Computing, pages 654\u2013663, 1997.","key":"2_CR10","DOI":"10.1145\/258533.258660"},{"doi-asserted-by":"crossref","unstructured":"David Liben-Nowell, Hari Balakrishnan, and David Karger. Analysis of the evolution of peer-to-peer systems. In Proceedings of ACM Conference on Principles of Distributed Computing (PODC), 2002.","key":"2_CR11","DOI":"10.1145\/571825.571863"},{"doi-asserted-by":"crossref","unstructured":"Lothar Mackert and Guy Lohman. R* optimizer validation and performance evaluation for local queries. In ACM-SIGMOD Conference on Management of Data, 1986.","key":"2_CR12","DOI":"10.1145\/16894.16863"},{"issue":"5","key":"2_CR13","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/32.52778","volume":"16","author":"J. Mullin","year":"1990","unstructured":"James Mullin. Optimal semijoins for distributed database systems. IEEE Transactions on Software Engineering, 16(5):558\u2013560, May 1990.","journal-title":"IEEE Transactions on Software Engineering"},{"unstructured":"Napster. http:\/\/www.napster.com\/ .","key":"2_CR14"},{"unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford University, 1998.","key":"2_CR15"},{"doi-asserted-by":"crossref","unstructured":"Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM\u201901, 2001.","key":"2_CR16","DOI":"10.1145\/383059.383072"},{"doi-asserted-by":"crossref","unstructured":"Antony Rowstron and Peter Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP\u2019 01), 2001.","key":"2_CR17","DOI":"10.1145\/502034.502053"},{"doi-asserted-by":"crossref","unstructured":"Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proceedings of Multimedia Computing and Networking 2002 (MMCN\u201902), January 2002.","key":"2_CR18","DOI":"10.1117\/12.449977"},{"doi-asserted-by":"crossref","unstructured":"Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of ACM SIGCOMM\u201901, 2001.","key":"2_CR19","DOI":"10.1145\/383059.383071"},{"unstructured":"Beverly Yang and Hector Garcia-Molina. Efficient search in peer-to-peer networks. Technical Report 2001-47, Stanford University, October 2001.","key":"2_CR20"}],"container-title":["Lecture Notes in Computer Science","Middleware 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44892-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:24:18Z","timestamp":1556756658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44892-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403173","9783540448921"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44892-6_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}