On 04.01.2015 23:49, Serguei Osokine wrote: > Bonus is given for page ranking implementation on DHT, and superbonus - > for finding misspelled queries (fuzzy logic and distance in word space > metrics to be used?) and for real-time search suggestions. Basically, > the idea is to put Google search out of business. Then finally we won't > see any DMCA-removed results when looking stuff up. :)
For misspelled queries you can use FastSS (http://fastss.csg.uzh.ch/). With that you can find a misspelled word with edit distance of 1 and partially edit distance 2 with low overhead. > Request for comments: what are the open topics in DHTs? > > I'm asking on behalf of a 4th year CS student preparing to do the final > year project; with possible extension into Masters. Having worked with > DHTs, the bug appears to have struck... Our current work at UZH that involves DHT are: * vDHT - adding versions to DHT for making consistent updates (https://files.ifi.uzh.ch/CSG/staff/bocek/extern/theses/MA-Sebastian-Golaszewski.pdf). With versions in the DHT we can do forks and merges for particular values. * NAT - we are currently working on hole-punching, where the rendez-vous peer is selected based on your neighbor set. The rendez-vous peer will also handle the routing for the NATed peer. * DHT on Androind - we are playing with delay tolerant messages with google cloud messaging in DHTs (routing excluded) to save energy. This is work is also in progress. * A port of TomP2P to .NET with a set of benchmark tools to optimize the DHT performance. All of these work will be (or already are) included in TomP2P (http://tomp2p.net/). Regards, Thomas _______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
