Efficient Peer to Peer keyword searching
Multiple keywords use DHT to store each one. For a query with multiple keywords need contact multiple hosts and do intersection operation on each of them. Waste on bandwidth and latency. To limit bandwidth 3 solutions: 1 bloom filter, 2 cache, 3 incremental results.
Bloom filter: for results from very host, transfer the BF instead of consents to next host to do the intersection.
Incremental results: divide the results into several chunks, and send each chunk by BF.
