Cuckoo ring: Balancing workload for locality sensitive hash

Proceedings - 6th IEEE International Conference on Peer-to-Peer Computing, P2P 2006

Volumn , Issue , 2006, Pages 49-56

  Han, Dingyi ^a   Shen, Ting ^a   Meng, Shicong ^a   Yu, Yong ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Consistent Hash; Cuckoo Ring; Load Balance; Locality Sensitive Hash; Universal Hash

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

DISTRIBUTED HASH TABLES; DYNAMIC NATURE; IMBALANCE PROBLEM; LOAD-BALANCED; LOCALITY SENSITIVE HASH; PEER-TO-PEER SYSTEM; SIMILARITY INFORMATIONS; SIMILARITY QUERY;

PEER TO PEER NETWORKS;

EID: 72949107267     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2006.14     Document Type: Conference Paper

References (31)

1. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, 1999.
2. M. Bawa, T. Condie, and P. Ganesan. LSH forest: self-tuning indexes for similarity search. In WWW'05: Proceedings of the 14th international conference on World Wide Web, pages 651-660, New York, NY, USA, 2005. ACM Press.
3. I. Bhattacharya, S. R. Kashyap, and S. Parthasarathy. Similarity searching in peer-to-peer databases. In ICDCS'05: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, pages 329-338, Washington, DC, USA, 2005. IEEE Computer Society.
4. A. Z. Broder. On the resemblance and containment of documents. In Compression and Complexity of Sequences, pages 21-29, 1998.
5. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations (extended abstract). In STOC'98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 327-336, New York, NY, USA, 1998. ACM Press.
6. A. Brodnik and J. I. Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5):1627-1640, 1999.
7. J. Byers, J. Considine, and M. Mitzenmacher. Simple load balancing for distributed hash tables. Lecture Notes in Computer Science: the Second International Workshop on Peer-to-Peer Systems II: IPTPS 2003, 2005:80 - 87, 2003.
8. M. Cai, M. Frank, J. Chen, and P. Szekely. Maan: A multiattribute addressable network for grid information services. In GRID'03: Proceedings of the Fourth International Workshop on Grid Computing, page 184, Washington, DC, USA, 2003. IEEE Computer Society.
9. P. Cao and Z. Wang. Efficient top-k query calculation in distributed networks. In PODC'04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 206-215, New York, NY, USA, 2004. ACM Press.
10. M. S. Charikar. Similarity estimation techniques from rounding algorithms. In STOC'02: Proceedings of the thiryfourth annual ACM symposium on Theory of computing, pages 380-388, New York, NY, USA, 2002. ACM Press.
11. K. Clarkson. An algorithm for approximate closestpoint queries. In Proceedings of the Tenth Annual AChf Symposium on Computational Geometry, pages 160-164, 1994.
12. K. L. Clarkson. An algorithm for approximate closest-point queries. In Proceedings of the Tenth Annual ACM Symposium on Computational Geometry, pages 160-164, New York, NY, USA, 1994. ACM Press.
13. L. Devroye and P. Morin. Cuckoo hashing: Further analysis. Information Processing Letters, 86(4):215-219, 31 May 2003.
14. C. Fox. Lexical analysis and stop lists, chapter Information Retrieval - Data Structures & Algorithms, pages 102-130. Prentice-Hall, 1992.
15. P. Ganesan, M. Bawa, and H. Garcia-Molina. Online balancing of range-partitioned data with applications to peer-to-peer systems. In The VLDB Journal, pages 444-455, 2004.
16. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In The VLDB Journal, pages 518-529, 1999.
17. A. Gupta, D. Agrawal, and A. El Abbadi. Approximate range selection queries in peer-to-peer systems. In Proceedings of the First Biennial Conference on Innovative Data Systems Research, Asilomar, California, United States, January 2003.
18. H.-C. Hsiao and C.-T. King. Similarity discovery in structured p2p overlays. In ICPP03: Proceedings of the 2003 International Conference on Parallel Processing, pages 636 - 644, Washington, DC, USA, 2003. IEEE Computer Society.
19. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 604-613, New York, NY, USA, 1998. ACM Press.
20. D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In SPAA'04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 36-43, New York, NY, USA, 2004. ACM Press.
21. L. Lee. Measures of distributional similarity. In Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, pages 25-32, Morristown, NJ, USA, 1999. Association for Computational Linguistics.
22. N. Linial and O. Sasson. Non-expansive hashing. In STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 509-518, New York, NY, USA, 1996. ACM Press.
23. J. Lv and X. Cheng. Wongoo: a pure peer-to-peer full text information retrieval system based on semantic overlay networks. In NCA 2004: Proceedings of the Third IEEE International Symposium on Network Computing and Applications, pages 47- 54, Piscataway, NJ, USA, 2004. IEEE Press.
24. R. Pagh and F. F. Rodler. Cuckoo hashing. Lecture Notes in Computer Science, 2161:121-133, 2001.
25. M. F. Porter. An algorithm for suffix stripping. Program, 14(3):130-137, July 1980.
26. A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in structured p2p systems. Lecture Notes in Computer Science: the Second International Workshop on Peer-to-Peer Systems II: IPTPS 2003, 2005:68 - 79, 2003.
27. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In SIGCOMM'01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pages 161-172, New York, NY, USA, 2001. ACM Press.
28. O. D. Sahin, F. Emekci, D. Agrawal, and A. El Abbadi. Content-based similarity search over peer-to-peer systems. Lecture Notes in Computer Science: the Second International Workshop on Databases, Information Systems, and Peer-to-Peer Computing, DBISP2P 2004, 3367:61-78, 2005.
29. S. Saroiu, K. P. Gummadi, and S. D. Gribble. Measuring and analyzing the characteristics of napster and gnutella hosts. Multimedia Systems, 9:170C184, 2003.
30. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 11(1):17-32, 2003.
31. Y. Zhu, H. Wang, and Y. Hu. Integrating semantics-based access mechanisms with p2p file systems. In P2P'03: Proceedings of the 3rd International Conference on Peer-to-Peer Computing, page 118, Washington, DC, USA, 2003. IEEE Computer Society.