-
1
-
-
0036346553
-
Predicting internet network distance with coordinates-based approaches
-
T. S. Eugene Ng and Hui Zhang, "Predicting internet network distance with coordinates-based approaches," in Proceedings of INFOCOM'02, 2002.
-
(2002)
Proceedings of INFOCOM'02
-
-
Eugene Ng, T.S.1
Zhang, H.2
-
2
-
-
84908483942
-
Content-Based Retrieval of Music in Scalable Peer-to-Peer Networks
-
Baltimore, MD, July
-
J. Gao, G. Tzanetakis, and P. Steenkiste, "Content-Based Retrieval of Music in Scalable Peer-to-Peer Networks," in Proceedings of ICME 2003, Baltimore, MD, July 2003.
-
(2003)
Proceedings of ICME 2003
-
-
Gao, J.1
Tzanetakis, G.2
Steenkiste, P.3
-
4
-
-
0034782005
-
Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications
-
San Diego, CA, August
-
Ion Stoica et al, "Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications," in Proceedings of SIGCOMM 2001, San Diego, CA, August 2001, pp. 149-160.
-
(2001)
Proceedings of SIGCOMM 2001
, pp. 149-160
-
-
Stoica, I.1
-
5
-
-
17744391383
-
An adaptive protocol for efficient support of range queries in dht-based systems
-
Berlin, Germany, Oct
-
Jun Gao and Peter Steenkiste, "An adaptive protocol for efficient support of range queries in dht-based systems," in Proceedings of ICNP 2004, Berlin, Germany, Oct. 2004.
-
(2004)
Proceedings of ICNP 2004
-
-
Gao, J.1
Steenkiste, P.2
-
6
-
-
10444228400
-
Range queries over dhts,
-
Tech. Rep. IRB-TR-03-009, Intel Corp, June
-
S. Ratnasamy, J. Hellerstein, and S. Shenker, "Range queries over dhts," Tech. Rep. IRB-TR-03-009, Intel Corp., June 2003.
-
(2003)
-
-
Ratnasamy, S.1
Hellerstein, J.2
Shenker, S.3
-
7
-
-
2442624245
-
Complex queries in dht-based peer-to-peer networks
-
March
-
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 Proceedings of IPTPS'02, March 2002.
-
(2002)
Proceedings of IPTPS'02
-
-
Harren, M.1
Hellerstein, J.M.2
Huebsch, R.3
Loo, B.T.4
Shenker, S.5
Stoica, I.6
-
8
-
-
0000681228
-
A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
-
August
-
R. Weber, H.J. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," in Proceedings of VLDB'98, August 1998, pp. 194-205.
-
(1998)
Proceedings of VLDB'98
, pp. 194-205
-
-
Weber, R.1
Schek, H.J.2
Blott, S.3
-
9
-
-
0032083561
-
Multidimensional access methods
-
June
-
V. Gaede and O. Gunther, "Multidimensional access methods," ACM Computing Surveys, vol. 30, no. 2, June 1998.
-
(1998)
ACM Computing Surveys
, vol.30
, Issue.2
-
-
Gaede, V.1
Gunther, O.2
-
10
-
-
0003007594
-
Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems
-
Heidelberg, Germany, November
-
A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems," in Proceedings of Middleware 2001, Heidelberg, Germany, November 2001.
-
(2001)
Proceedings of Middleware 2001
-
-
Rowstron, A.1
Druschel, P.2
-
11
-
-
38549095761
-
-
Ph.D. thesis, Carnegie Mellon University, CMU Technical Report, CMU-CS-04-170
-
Jun Gao, A Distributed and Scalable Peer-to-Peer Content Discovery System Supporting Complex Queries, Ph.D. thesis, Carnegie Mellon University, 2004, CMU Technical Report, CMU-CS-04-170.
-
(2004)
A Distributed and Scalable Peer-to-Peer Content Discovery System Supporting Complex Queries
-
-
Gao, J.1
-
12
-
-
84945709355
-
An algorithm for finding best matches in logarithmic expected time
-
J. H. Friedman, J. L. Bentley, and R. A. Finkkel, "An algorithm for finding best matches in logarithmic expected time," ACM Transactions on Mathematical Software, vol. 3, no. 3, pp. 209-226, 1977.
-
(1977)
ACM Transactions on Mathematical Software
, vol.3
, Issue.3
, pp. 209-226
-
-
Friedman, J.H.1
Bentley, J.L.2
Finkkel, R.A.3
-
13
-
-
0025447750
-
The r*-tree: An efficient and robust access method for points and rectangles
-
N. Beckmann, H. Schneider, and B. Seeger, "The r*-tree: an efficient and robust access method for points and rectangles," in Proceedings of SIGMOD, 1990.
-
(1990)
Proceedings of SIGMOD
-
-
Beckmann, N.1
Schneider, H.2
Seeger, B.3
-
14
-
-
0742303982
-
Design and evaluation of a distributed scalable content discovery system
-
January
-
Jun Gao and Peter Steenkiste, "Design and evaluation of a distributed scalable content discovery system," IEEE Journal on Selected Areas in Communications, vol. 22, no. 1, pp. 54-66, January 2004.
-
(2004)
IEEE Journal on Selected Areas in Communications
, vol.22
, Issue.1
, pp. 54-66
-
-
Gao, J.1
Steenkiste, P.2
-
15
-
-
0016557674
-
Multidimensional binary search used for associative searching
-
J.L. Bentley, "Multidimensional binary search used for associative searching," ACM Comm., 1975.
-
(1975)
ACM Comm
-
-
Bentley, J.L.1
-
17
-
-
0034775826
-
A Scalable Content-Addressable Network
-
San Diego, CA, August
-
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker, "A Scalable Content-Addressable Network," in Proceedings of SIGCOMM 2001, San Diego, CA, August 2001, pp. 161-172.
-
(2001)
Proceedings of SIGCOMM 2001
, pp. 161-172
-
-
Ratnasamy, S.1
Francis, P.2
Handley, M.3
Karp, R.4
Shenker, S.5
-
18
-
-
3042749011
-
Peer-to-peer information retrieval using self-organizing semantic overlay networks
-
C. Tang, Z. Xu, and S. Dwarkadas, "Peer-to-peer information retrieval using self-organizing semantic overlay networks," in Proceedings of Sigcomm 2003, 2003.
-
(2003)
Proceedings of Sigcomm 2003
-
-
Tang, C.1
Xu, Z.2
Dwarkadas, S.3
-
20
-
-
36248939308
-
Multi-dimensional indexing in peer-to-peer systems
-
Paris, France, June
-
Prasanna Ganesan, Beverly Yang, and Hector Garcia-Molina, "Multi-dimensional indexing in peer-to-peer systems," in Proceedings of International Workshop on the Web and Databases (WebDB), Paris, France, June 2004.
-
(2004)
Proceedings of International Workshop on the Web and Databases (WebDB)
-
-
Ganesan, P.1
Yang, B.2
Garcia-Molina, H.3
-
21
-
-
38549096281
-
Ezsearch: Fast and scalable similarity search in peer-to-peer networks
-
Trondheim, Norway
-
D. Tran, H. Nguyen, and T. Nguyen, "Ezsearch: Fast and scalable similarity search in peer-to-peer networks," in Proceedings of the 31st VLDB Conference, Trondheim, Norway, 2005.
-
(2005)
Proceedings of the 31st VLDB Conference
-
-
Tran, D.1
Nguyen, H.2
Nguyen, T.3
-
23
-
-
0001944742
-
Similarity search in high dimensions via hashing
-
P. Indyk et al, "Similarity search in high dimensions via hashing," in Proceedings of the VLDB, 1999.
-
(1999)
Proceedings of the VLDB
-
-
Indyk, P.1
|