/[gzz]/gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
ViewVC logotype

Diff of /gzz/Documentation/misc/hemppah-progradu/masterthesis.tex

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

revision 1.197 by hemppah, Wed Mar 26 15:00:22 2003 UTC revision 1.198 by hemppah, Thu Mar 27 07:04:16 2003 UTC
# Line 351  Currently, all proposed tightly structur Line 351  Currently, all proposed tightly structur
351  poly--loga-rithmical data lookup operations. However, there are some key  poly--loga-rithmical data lookup operations. However, there are some key
352  differences between the data structures representing the identifier space.  differences between the data structures representing the identifier space.
353  For example, Chord \cite{stoica01chord}, Skip graphs \cite{AspnesS2003} and SkipNet \cite{harvey03skipnet2} maintain a  For example, Chord \cite{stoica01chord}, Skip graphs \cite{AspnesS2003} and SkipNet \cite{harvey03skipnet2} maintain a
354  distributed data structure which resembles the Skip list \cite{78977}.  distributed data structure which resembles skip lists \cite{78977}.
355  In figure \ref{fig:structured_query}, we present an overview of Chord's data lookup process.  In figure \ref{fig:structured_query}, we present an overview of Chord's data lookup process.
356  On the right side of Chord's lookup process, the same data lookup process  On the right side of Chord's lookup process, the same data lookup process
357  is shown as a binary-tree abstraction.  It can be noticed, that in each step, the distance  is shown as a binary-tree abstraction.  It can be noticed, that in each step, the distance

Legend:
Removed from v.1.197  
changed lines
  Added in v.1.198

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