论文信息 - Efficient Peer-To-Peer Searches Using Result-Caching

Efficient Peer-To-Peer Searches Using Result-Caching

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.

[1] Fred S. Annexstein,et al. Indexing techniques for file sharing in scalable peer-to-peer networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[2] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .

[3] Scott Shenker,et al. Complex Queries in Dht-based Peer-to-peer Networks , 2002 .

[4] Michael Stonebraker,et al. Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres , 1979, IEEE Transactions on Software Engineering.

[5] Zhichen Xu,et al. pSearch: information retrieval in structured overlays , 2003, CCRV.

[6] Amin Vahdat,et al. Efficient Peer-to-Peer Keyword Searching , 2003, Middleware.

[7] Ben Y. Zhao,et al. OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[8] Yaron Minsky,et al. Set reconciliation with nearly optimal communication complexity , 2003, IEEE Trans. Inf. Theory.

[9] Peter Slavík. A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.

[10] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.