Gregory's Server@grishka @liaizon Be aware though that normal DHTs with a chaotic, flat addressing scheme are only suitable for tag searching, but not for more complex search queries or fuzzy search.
During my research I stumbled upon papers building overlay networks where you can AND and OR several queries together, I can point you to papers in case you're interested. But their assumptions and performance cahracteristics go into a different direction than what I needed.
|
Top-level
 No comments
|
@schmittlauch @liaizon I know, they're Hash Tables after all. My initial application for them is going to be importing your existing friend lists from centralized services, and they do work well for this. For text-based search, one could split the query into words and search for each word as a tag, then intersect the resulting lists. This begs for some experimentation though.