Re: Re: Search by urn ??

El Friday, 21 de March de 2008 06:23:05 Aaron Walkhouse escribió:
> I hope LimeWire will eventually get over the hurdles they must pass in
> order to work with hash searches.  I realize that upgrading query
> routing to meet the needed performance level may be more difficult in
> Java but sooner or later it will have bubble to the top of their deep
> todo list.  ;]

As far as I know LimeWire uses Kademlia technology (DHT) for Hash-searches, 
which is more efficient for non-keyword searches. 

For searches by keyword they use Gnutella, for searches by hash they use 
Kademlia, a strategy which sounds quite useful to me: Gnutella is heavily 
optimized for searching by tags, and using it for hash-searches would likely 
reduce its efficiency for keyword based searches. 

Kademlia on the other hand is very efficient for hash based searches, because 
its whole network structure builds on hashes - each node has a hash as ID, 
and it maintains info about the files whoose hash is most similar to its own 
hash (similarity: xor). 

I think that's quite a nice way of keeping with the "one network" philosophy: 
One tool for one task, and Hash based searching is fundamentally different 
from keyword based searching. 

Best wishes, 
Arne
-- 
Unpolitisch sein
Heißt politisch sein
Ohne es zu merken. 
- Arne Babenhauserheide ( http://draketo.de )
-- Weblog: http://blog.draketo.de

-- Mein öffentlicher Schlüssel (PGP/GnuPG): 
http://draketo.de/inhalt/ich/pubkey.txt


[Non-text portions of this message have been removed]