420 |
(``...:4-6``). |
(``...:4-6``). |
421 |
|
|
422 |
Our current implementation shows only links between documents |
Our current implementation shows only links between documents |
423 |
that are in memory at the same time (Fig. [ref-buoyframe]_, |
that are currently stored on the local disk (Fig. [ref-buoyframe]_, |
424 |
discussed in [lukka03xupdf-submitted]_). |
discussed in [lukka03xupdf-submitted]_). |
425 |
In the future, we will implement a global distributed index on top of |
In the future, we will implement a global distributed index on top of |
426 |
a distributed hashtable (Section 5). |
a distributed hashtable (Section 5). |
438 |
the spans themselves can not be used as hashtable keys. |
the spans themselves can not be used as hashtable keys. |
439 |
However, we keep the number of spans with the same prefix |
However, we keep the number of spans with the same prefix |
440 |
relatively small (limited by the amount of text |
relatively small (limited by the amount of text |
441 |
the user enters between two saves of a document). Therefore, we hope |
the user enters between two saves of a document). Therefore, |
442 |
that this will not be a major scalability problem. Otherwise, |
this should not be a major scalability problem. Otherwise, |
443 |
systems that allow range queries, such as skip graphs [AspnesS2003]_, |
systems that allow range queries, such as skip graphs [AspnesS2003]_, |
444 |
may prove useful. |
may prove useful. |
445 |
|
|