Fast similarity search in peer-to-peer networks

NOMS 2008 - IEEE/IFIP Network Operations and Management Symposium: Pervasive Management for Ubiquitous Networks and Services

Volumn , Issue , 2008, Pages 240-247

  Bocek, Thomas ^a   Hunt, Ela ^b   Hausheer, David ^a   Stiller, Burkhard ^a,b  

^a UNIVERSITY OF ZURICH   (Switzerland)

^b ETH ZURICH   (Switzerland)

Author keywords

DHT; P2P; Service discovery; Similarity search

Indexed keywords

ALGEBRA; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SYSTEMS; DATA STORAGE EQUIPMENT; DATA TRANSFER; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; INDUSTRIAL ECONOMICS; LEARNING ALGORITHMS; MANAGEMENT; QUALITY ASSURANCE; QUERY PROCESSING; RELIABILITY; ROUTING ALGORITHMS; TELECOMMUNICATION NETWORKS; UBIQUITOUS COMPUTING;

CENTRALIZED SYSTEMS; DATA ITEMS; DHT; DISTRIBUTED ENVIRONMENTS; DISTRIBUTED HASH TABLE; EDIT DISTANCES; LARGE-SCALE NETWORKS; LOAD BALANCING; LOGARITHMIC TIME; NETWORK OPERATIONS; NEW ALGORITHM; P2P; P2P ROUTING; P2P STORAGE NETWORKS; PEER-TO-PEER NETWORKS; PEER-TO-PEER SYSTEMS; PERFORMANCE ANALYSES; SERVICE DESCRIPTION MATCHING; SERVICE DISCOVERY; SERVICE MANAGEMENT; SIMILARITY SEARCH; SIMILARITY SEARCHES; STRUCTURED P2P; STRUCTURED P2P SYSTEMS; UBIQUITOUS NETWORKS;

NETWORK MANAGEMENT;

EID: 51849144285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NOMS.2008.4575140     Document Type: Conference Paper

References (23)

1. K. Aberer; P-Grid: A Self-Organizing Access Structure for P2P Information Systems. Sixth International Conference on Cooperative Information Systems (CoopIS 2001), Lecture Notes in Computer Science, Volume 2172, pp 179-194, 2001.
2. I. Aekaterinidis and P. Triantafillou; Substring Matching in P2P Publish/Subscribe Data Management Networks. IEEE 23rd International Conference on Data Engineering (ICDE), pp 1390-1394, April 2007.
3. R. Ahmed and R. Boutaba; Distributed Pattern Matching: A Key to Flexible and Efficient P2P Search. IEEE Journal on Selected Areas in Communications, Volume 25, Issue 1, pp 73-83, January 2007.
4. F. Banaei-Kashani and C. Shahabi; SWAM: A Family of Access Methods for Similarity-Search in Peer-to-Peer Data Networks. CIKM '04: Proceedings of the thirteenth ACM international conference on Information and knowledge management, Washington, D.C., USA, pp 304-313, November 2004.
5. M. Bawa, T. Condie and P. Ganesan; LSH forest: self-tuning indexes for similarity search. WWW '05: Proceedings of the 14th international conference on World Wide Web, Chiba, Japan, pp 651-660, May 2005.
6. T. Bocek, E. Hunt and B. Stiller; Fast Similarity Search in Large Dictionaries. http://fastss.csg.uzh.ch/ifi-2007.02.pdf. Technical Report, University of Zurich, Number ifi-2007.02, April 2007.
7. E. Christensen, F. Curbera, G. Meredith and S. Weerawarana; Web Services Description Language (WSDL) 1.1. W3C, March 2001.
8. CORBA/IIOP Specification. http://www.omg.org/technology/documents/formal/ corba_iiop.htm, March 2004.
9. R. Huebsch, B. Chun, J. M. Hellerstein, B. T. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica and A. R. Yumerefendi; The Architecture of PIER: An Internet-Scale Query Processor. The Second Biennial Conference on Innovative Data Systems Research (CIDR), Asilomar, CA, USA, January 2005.
10. D. Hughes, G. Coulson and J. Walkerdine; Free Riding on Gnutella Revisited: The Bell Tolls? IEEE Distributed Systems Online, Number 6, Volume 6, pp 1, 2005.
11. Java Remote Method Invocation. http://java.sun.com/j2se/1.4.2/docs/guide/ rmi/spec/rmiTOC.html, last visited: 09.09.2007
12. M. Karnstedt, K. Sattler, M. Hauswirth and R. Schmidt; Similarity Queries on Structured Data in Structured Overlays. ICDEW '06: Proceedings of the 22nd International Conference on Data Engineering Workshops, April 2006.
13. V. I. Levenshtein; Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady, Number 8, Volume 10, pp 707-710, February 1966.
14. W. Litwin, R. Mokadem, P. Rigaux and T. Schwarz; Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures. Very Large Data Bases (VLDB) 2007, Vienna, Austria, September 2007.
15. P. Maymounkov and D. Mazieres; Kademlia: A peer-to-peer information system based on the XOR metric. In Proceedings of 1st International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA, USA, March 2002.
16. S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein and S. Shenker; Brief announcement: prefix hash tree. 23rd annual ACM Symposium on Principles of Distributed Computing (PODC'04), St. John's, Newfoundland, Canada, pp 368-368, July 2004.
17. S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker; A Scalable Content Addressable Network. ACM SIGCOMM 2001, San Diego, California, August 2001.
18. A. Rowstron and P. Druschel; Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp 329-350, November 2001.
19. I. Schmitt and S. Balko; Filter ranking in high-dimensional space. Data Knowledge Engineering, No. 3, Vol. 56, pp 245-286, 2006.
20. G. Skobeltsyn, T. Luu, I. P. Zarko, M. Rajman and K. Aberer; Web text retrieval with a P2P query-driven index. SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, Amsterdam, The Netherlands, pp 679-686, 2007.
21. I. Stoica, R. Morris, D. Karger, F. Kaashoek and H. Balakrishnan; Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. ACM SIGCOMM 2001, pp 149-160, San Diego, California, August 2001.
22. C. Tang, Z. Xu and S. Dwarkadas; Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks. ACM SIGCOMM 2003, Karlsruhe, Germany, pp 175-186, August 2003.
23. UDDI Version 3.0.2: UDDI Spec Technical Committee Draft. http://uddi.org/pubs/uddi_v3.htm, October 2004.