Efficient peer-to-peer searches using result-caching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2735, Issue , 2003, Pages 225-236

  Bhattacharjee, Bobby ^a   Chawathe, Sudarshan ^a   Gopalakrishnan, Vijay ^a   Keleher, Pete ^a   Silaghi, Bujor ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846594813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45172-3_21     Document Type: Article

References (11)

1. M. Harren, J. M. Hellerstein, R. Huebsch, B. T. Loo, S. Shenker, and I. Stoica, "Complex queries in dht-based peer-to-peer networks," in The 1st International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA, March 2002.
2. P. Reynolds and A. Vahdat, "Efficient Peer-to-Peer Keyword Searching," unpublished.
3. th International Conference on Architectural Support for Programming Languages and Operating Systems, Cambridge, MA, November 2000, pp. 190-201.
4. C. Tang, Z. Xu, and M. Mahalingam, "pSearch: Information retrieval in structured overlays," SIGCOMM Computer Communication Review, vol. 33, no. 1, January 2003.
5. th IEEE International Conference on Computer Communications and Networks, Miami, FL, October 2002.
6. B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Communications of the ACM, 13(7):422-426, 1970.
7. M. Stonebraker, "Concurrency control and consistency of multiple copies of data in distributed INGRES," IEEE Transactions on Software Engineering, vol. 5, no. 3, pp. 188-194, May 1979.
8. P. Slavik, "A tight analysis of the greedy algorithm for set cover," in ACM Symposium on Theory of Computing, Philadelphia, PA, May 1996, pp. 435-441.
9. Y. Minsky, A. Trachtenberg, and R. Zippel, "Set reconciliation with nearly optimal communications complexity," in IEEE International Symposium on Information Theory, Washington DC, June 2001.
10. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, Massachusetts, 1997.
11. I. Wegener, The Complexity of Boolean Functions, John Wiley & Sons Ltd., and B. G. Teubner, Stuttgart, July 1987, ISBN: 0-471-91555-6.