32 |
This way, versions of a document |
This way, versions of a document |
33 |
stay available as long as anybody keeps a copy. |
stay available as long as anybody keeps a copy. |
34 |
|
|
|
.. We also present a simple model for storing only the |
|
|
differences between versions. |
|
|
|
|
35 |
.. raw:: latex |
.. raw:: latex |
36 |
|
|
37 |
\endabstract |
\endabstract |
205 |
in Gnutella or a DHT-based system, using an anonymized system |
in Gnutella or a DHT-based system, using an anonymized system |
206 |
like Achord [hazel02achord]_ if it contains controversial content. |
like Achord [hazel02achord]_ if it contains controversial content. |
207 |
|
|
|
.. An additional contribution of this paper is XXX diffs |
|
|
|
|
208 |
The remainder of this paper is structured as follows. |
The remainder of this paper is structured as follows. |
209 |
In Section 2, we introduce pointer records. |
In Section 2, we introduce pointer records. |
210 |
In Section 3, we propose a simple, hash-based data model |
In Section 3, we propose a simple, hash-based data model |
213 |
of pointer records, and Section 5 gives an overview of our |
of pointer records, and Section 5 gives an overview of our |
214 |
implementation. Section 6 concludes. |
implementation. Section 6 concludes. |
215 |
|
|
|
.. In Section 4, we introduce a scheme for storing only |
|
|
the differences between versions, built on our basic |
|
|
data model. |
|
|
|
|
216 |
|
|
217 |
|
|
218 |
Pointer records |
Pointer records |
356 |
algorithm) |
algorithm) |
357 |
|
|
358 |
|
|
|
.. Diffs |
|
|
===== |
|
|
|
|
|
- when storing all past versions, space may be a problem |
|
|
- (not for small text files-- practical experience: 30 MB |
|
|
in half a year of use-- but for things where each version |
|
|
takes 500 KB) |
|
|
- old idea: storing only differences |
|
|
- XXX |
|
|
|
|
|
|
|
359 |
Applications |
Applications |
360 |
============ |
============ |
361 |
|
|