{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:35:39Z","timestamp":1742398539635},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407249"},{"type":"electronic","value":"9783540451723"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45172-3_21","type":"book-chapter","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T13:40:01Z","timestamp":1295271601000},"page":"225-236","source":"Crossref","is-referenced-by-count":40,"title":["Efficient Peer-To-Peer Searches Using Result-Caching"],"prefix":"10.1007","author":[{"given":"Bobby","family":"Bhattacharjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudarshan","family":"Chawathe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Gopalakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pete","family":"Keleher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bujor","family":"Silaghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45748-8_23","volume-title":"Peer-to-Peer Systems","author":"M. Harren","year":"2002","unstructured":"Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex queries in dht-based peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 242. Springer, Heidelberg (2002)"},{"unstructured":"Reynolds, P., Vahdat, A.: Efficient Peer-to-Peer Keyword Searching (unpublished)","key":"21_CR2"},{"doi-asserted-by":"crossref","unstructured":"Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: Proc. of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems, Cambridge, MA, November 2000, pp. 190\u2013201 (2000)","key":"21_CR3","DOI":"10.1145\/378993.379239"},{"doi-asserted-by":"crossref","unstructured":"Tang, C., Xu, Z., Mahalingam, M.: pSearch: Information retrieval in structured overlays. SIGCOMM Computer Communication Review\u00a033(1) (January 2003)","key":"21_CR4","DOI":"10.1145\/774763.774777"},{"doi-asserted-by":"crossref","unstructured":"Annexstein, F.S., Berman, K.A., Jovanovic, M., Ponnavaikko, K.: Indexing techniques for file sharing in scalable peer-to-peer networks. In: Proc. the 11th IEEE International Conference on Computer Communications and Networks, Miami, FL (October 2002)","key":"21_CR5","DOI":"10.1109\/ICCCN.2002.1043038"},{"issue":"7","key":"21_CR6","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. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/TSE.1979.234180","volume":"5","author":"M. Stonebraker","year":"1979","unstructured":"Stonebraker, M.: Concurrency control and consistency of multiple copies of data in distributed INGRES. IEEE Transactions on Software Engineering\u00a05(3), 188\u2013194 (1979)","journal-title":"IEEE Transactions on Software Engineering"},{"doi-asserted-by":"crossref","unstructured":"Slavik, P.: A tight analysis of the greedy algorithm for set cover. In: ACM Symposium on Theory of Computing, Philadelphia, PA, May 1996, pp. 435\u2013441 (1996)","key":"21_CR8","DOI":"10.1145\/237814.237991"},{"doi-asserted-by":"crossref","unstructured":"Minsky, Y., Trachtenberg, A., Zippel, R.: Set reconciliation with nearly optimal communications complexity. In: IEEE International Symposium on Information Theory, Washington DC (June 2001)","key":"21_CR9","DOI":"10.1109\/ISIT.2001.936095"},{"key":"21_CR10","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1997","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1997)"},{"unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley & Sons Ltd., and B.G. Teubner, Stuttgart (July 1987) ISBN: 0-471-91555-6","key":"21_CR11"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems II"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45172-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T18:31:10Z","timestamp":1553365870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45172-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407249","9783540451723"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45172-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}