Keyword search in DHT-based peer-to-peer networks

Although search by keywords is particularly important for resource and service discovery in P2P networks, existing techniques for keyword search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unable to facilitate ranking and keyword expansion. In this paper, we present a general keyword index and search scheme for structured P2P networks that avoids these problems, and in which object insert, delete, and search can be efficiently performed. Some experimental results are also presented to support our claim.