/[gzz]/gzz/Documentation/misc/hemppah-progradu/research_problems
ViewVC logotype

Diff of /gzz/Documentation/misc/hemppah-progradu/research_problems

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.19 by hemppah, Fri Jan 17 14:09:27 2003 UTC revision 1.20 by hemppah, Mon Jan 20 07:20:20 2003 UTC
# Line 107  Notice: pros and cons are not presented Line 107  Notice: pros and cons are not presented
107  +adaptive: doesn't need to know keyspace size before hand, instead of many DHTs, which require a priori knowledge about the size of the system or its keyspace  +adaptive: doesn't need to know keyspace size before hand, instead of many DHTs, which require a priori knowledge about the size of the system or its keyspace
108  +support for range queries, e.g. natural for version control: 'find latest news from yesterday', 'find largest key < news:12/12/2002', 'find all related objects nearby'  +support for range queries, e.g. natural for version control: 'find latest news from yesterday', 'find largest key < news:12/12/2002', 'find all related objects nearby'
109  (in DHTs this is a open problem)  (in DHTs this is a open problem)
110  +There are not hotspots in skip graphs  +There are not hotspots in skip graphs (query/routing hotsports)
111  -not network/geographical locality  -not network/geographical locality
112    -for us purposes, Skip Graps could be used (sensible) only for block IDs, not for URNs: in Skip Graps, there have to be total order for data elements --> for URNs, there cannot be a total order
113    -for range queries, we would have to use local sensitive hashing, *if* we want fetch blocks like 'next block = i + 1'. SHA-1 is a (secure) random hash of content (it won't help for us in this case)
114    
115    
116    
117  See summary table for performance details  See summary table for performance details
118    

Legend:
Removed from v.1.19  
changed lines
  Added in v.1.20

savannah-hackers-public@gnu.org
ViewVC Help
Powered by ViewVC 1.1.26