Ian Clarke schrieb:
>
> I have given some thought to the issue of searching, and I have come up
> with some ideas which I would like to get your opinions on.
eh, i had similar thoughts at the same time ;-)
how do you think to use the search-requests?
should they be handled like key-requests or should the reply be
a (sorted) list of similar keys?
> I started thinking about what if you could search for something like:
>
> contains("tori amos") and (contains("little earthquakes") or
> contains("girl"))
>
> When a node received such a request it would rate all of its keys
> against this search using a scoring system.
it may send such request to it's neighbor-nodes if it doesn't found
anything really well (how well exactly?) matching.
>
[*snip*]
>
> This scoring system could then be used to determine which of the keys in
> the datastore are closest to the data we are seeking.
this sytem convinced me (mainly because it's tollerant with misspelled
keys or requests)
>
> Before implementing this we must test it out on one (or more) of the
> simulation systems currently being developed.
right
>
> Ian.
>
1723
_______________________________________________
Freenet-dev mailing list
Freenet-dev at lists.sourceforge.net
http://lists.sourceforge.net/mailman/listinfo/freenet-dev
