Skip to main content
SpringerLink
Log in

Efficient Peer-To-Peer Searches Using Result-Caching

  • Conference paper
Peer-to-Peer Systems II (IPTPS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2735))

Included in the following conference series:

Abstract

Existing peer-to-peer systems implement a single function well: data lookup. There is now a wealth of research describing how to reliably disseminate, and to later retrieve, data in a scalable and load-balanced manner.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2429, p. 242. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Reynolds, P., Vahdat, A.: Efficient Peer-to-Peer Keyword Searching (unpublished)

    Google Scholar 

  3. 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–201 (2000)

    Google Scholar 

  4. Tang, C., Xu, Z., Mahalingam, M.: pSearch: Information retrieval in structured overlays. SIGCOMM Computer Communication Review 33(1) (January 2003)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)

    Article  MATH  Google Scholar 

  7. Stonebraker, M.: Concurrency control and consistency of multiple copies of data in distributed INGRES. IEEE Transactions on Software Engineering 5(3), 188–194 (1979)

    Article  Google Scholar 

  8. 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–441 (1996)

    Google Scholar 

  9. Minsky, Y., Trachtenberg, A., Zippel, R.: Set reconciliation with nearly optimal communications complexity. In: IEEE International Symposium on Information Theory, Washington DC (June 2001)

    Google Scholar 

  10. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1997)

    Google Scholar 

  11. Wegener, I.: The Complexity of Boolean Functions. Wiley & Sons Ltd., and B.G. Teubner, Stuttgart (July 1987) ISBN: 0-471-91555-6

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, Maryland, USA

    Bobby Bhattacharjee, Sudarshan Chawathe, Vijay Gopalakrishnan, Pete Keleher & Bujor Silaghi

Authors
  1. Bobby Bhattacharjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sudarshan Chawathe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vijay Gopalakrishnan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pete Keleher
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bujor Silaghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Massachusetts Institute of Technology, Massachusetts

    M. Frans Kaashoek

  2. CS Division, EECS Department, University of California, 637 Soda Hall, CA 94270, Berkeley, USA

    Ion Stoica

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bhattacharjee, B., Chawathe, S., Gopalakrishnan, V., Keleher, P., Silaghi, B. (2003). Efficient Peer-To-Peer Searches Using Result-Caching. In: Kaashoek, M.F., Stoica, I. (eds) Peer-to-Peer Systems II. IPTPS 2003. Lecture Notes in Computer Science, vol 2735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45172-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45172-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40724-9

  • Online ISBN: 978-3-540-45172-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation