Fast similarity search in peer-to-peer networks

Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain functionality, such as search, repair, and message and data transfer. In particular, structured P2P networks perform an exact search in logarithmic time proportional to the number of peers. However, keyword similarity search in a structured P2P network remains a challenge. Similarity search for service discovery can significantly improve service management in a distributed environment. As services are often described informally in text form, keyword similarity search can find the required services or data items more reliably. This paper presents a fast similarity search algorithm for structured P2P systems. The new algorithm, called P2P Fast Similarity Search (P2PFastSS), finds similar keys in any distributed hash table (DHT) using the edit distance metric, and is independent of the underlying P2P routing algorithm. ...

• Type: Conference
• Year: 2008
• Where: NOMS
• Authors: Thomas Bocek, Ela Hunt, David Hausheer, Burkhard Stiller
• Keywords: Communications, Keyword Similarity Search, NOMS 2008, Similarity Search, Structured P2p