[p2p-hackers] p2p query method and implementation

[Aaron Harwood]

We are using a publish/subscribe system built on efficient
P2P range query techniques on a DHT. It depends a lot on what kind
of information that you are querying for and what index is usable
for that information.
--Aaron


On 22/09/2005, at 2:07 AM, Tiago Macambira wrote:

> On 9/21/05, Marco Ceci <marco.ceci at gmail.com> wrote:
>
>> Hi, I need to inquiry every node of the network for the presence of
>> information, obviusly make this in a full mesh scheme would be
>> impossible. The problem is, imho, simpler that file retrieving  
>> becouse
>> i only need to know if an information exist on nodes and count the
>> reply. Do you know any existent (even efficient) java implementation
>> to make this?
>>
>
> Perhaps a DHT is what you are looking for. There are java
> implementation of various DHT algorithms. I would look for a chord
> implementation if the datasets and nodes are fairly stable or for
> kademlia if both nodes and datasets are very volatiles.
>
> If the amount of information every node stores/returns to queries is
> huge or depends on some calculation a hierarchical scheme would be
> better...