Associative search in Peer to Peer networks: harnessing latent semantics
Based on unstructured architectures. Exploits associations to steer the search process to peers that are more likely to have an answer to the query. Every peer maintains certain number of rules, which is simply a keyword the corresponding peer possessing those keywords. To get a rule, a peer just choose a keyword and do blind flooding, then remember nodes who has the keywords. To search a keyword, the peer just choose an rule and search inside peers in the rule.
The underlying intuition taken from research in data-mining and text retrieval [][], that peers that share items are more likely to satisfy each other’s queries than random peers.
