Efficient peer-to-peer searches using result-caching

被引：0

作者：

Bhattacharjee, B ^{[1
]}

Chawathe, S ^{[1
]}

Gopalakrishnan, V ^{[1
]}

Keleher, P ^{[1
]}

Silaghi, B ^{[1
]}

机构：

[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA

来源：

PEER-TO-PEER SYSTEMS II | 2003年 / 2735卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：225 / 236

页数：12

共 11 条

[1] ANNEXSTEIN FS, 2002, P 11 IEEE INT C COMP
[2] SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS
BLOOM, BH
[J]. COMMUNICATIONS OF THE ACM, 1970, 13 (07) : 422 - &
[3] Cormen T.H., 1997, Introduction to Algorithms
[4] HARREN M, 2002, 1 INT WORKSH PEER PE
[5] KUBIATOWICZ J, 2000, P 9 INT C ARCH SUPP, P190, DOI DOI 10.1145/378993.379239
[6] MINSKY Y, 2001, IEEE INT S INF THEOR
[7] REYNOLDS P, UNPUB EFFICIENT PEER
[8] SLAVIK P, 1996, ACM S THEOR COMP, P435
[9] CONCURRENCY CONTROL AND CONSISTENCY OF MULTIPLE COPIES OF DATA IN DISTRIBUTED INGRES
STONEBRAKER, M
[J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1979, 5 (03) : 188 - 194
[10] TANG C, 2003, SIGCOMM COMPUTER COM, V33