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 |