Michael Wiktowy wrote: > Solution: > Route search index inserts and search index requests via a combination > of keyword hash matches such that the focus is determined by the > combination of keywords rather than just one. > > For example: > Define, > HKWn = hash of keyword n > Nn = Node n > C(x,y) = closeness of x to y > ... > Comments? >
If we are routing by hash values, then will we be limiting the fuzzy matching we could use on plain text? i.e. if one of the search keywords is "Teletubbies", then we will be in some way routing towards the hash of the search keyword "Teletubbies". This has no guarantee of routing towards metadata including the keyword "The Teletubbies", since they hash completely differently. Otherwise it's a very cool idea. It would be interesting to create a simulation of this one. _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
