Keyword Search in P2P Network Based on Trie Tree
In the past few years, keyword search is widely uses in the network. In the P2P networks it always uses an index table to implement. In this paper, the authors present a distributed index table can be performed efficiently to in locate the keyword. In the structured P2P networks, a virtual DHT (Distributed Hash Table) is consisted of the nodes in the overlay. The data is to assign to be stored in the specific node. Both the data and the nodes are mapped to a key (they called it DHTID) and a value.