gzz-commits
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Gzz-commits] manuscripts/pointers article.rst


From: Benja Fallenstein
Subject: [Gzz-commits] manuscripts/pointers article.rst
Date: Thu, 06 Nov 2003 02:01:35 -0500

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Branch:         
Changes by:     Benja Fallenstein <address@hidden>      03/11/06 02:01:35

Modified files:
        pointers       : article.rst 

Log message:
        address XXX

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/pointers/article.rst.diff?tr1=1.138&tr2=1.139&r1=text&r2=text

Patches:
Index: manuscripts/pointers/article.rst
diff -u manuscripts/pointers/article.rst:1.138 
manuscripts/pointers/article.rst:1.139
--- manuscripts/pointers/article.rst:1.138      Thu Nov  6 01:51:43 2003
+++ manuscripts/pointers/article.rst    Thu Nov  6 02:01:35 2003
@@ -25,8 +25,8 @@
 Pointer records are shared and sought for
 through the network like ordinary files.
 We also present the Storm data model, 
-a common API for different types P2P networks and other
-storage media. Using pointer records and the Storm
+an API for P2P networks and other kinds of storage
+implementing hash-based addressing. Using pointer records and the Storm
 data model, several P2P networks can be used interoperably
 as a P2P Web (except, naturally, for dynamically generated pages), 
 and web pages
@@ -406,7 +406,12 @@
 *on top of* this basic model. A pointer record
 is simply a special kind of block. A pointer record index
 is used to publish mappings from pointer ids
-to the block ids of pointer records.
+to the block ids of pointer records. [#]_
+
+.. [#] It may be useful, though, to implement an optimization
+   in the P2P network that optionally only returns
+   the most current record, not all records, to make
+   loading pages with many past versions more efficient.
 
 The Storm model is *simple to implement* on top existing
 P2P overlays. It allows *simple synchronization*
@@ -564,9 +569,6 @@
 Conclusions
 ===========
 
-XXX somewhere explain about the optimization with
-DHT-level knowledge of pointer records
-
 We have presented *pointer records*, a novel method
 for implementing revision control in a peer-to-peer
 environment, which is simple, does not require
@@ -582,8 +584,8 @@
 (such as pointer records), and
 is easy to implement in a variety
 of ways on current systems, ranging
-from filesharing systems to (XXX) shared
-storage networks such as OceanStore to
+from filesharing systems to global persistent data stores
+like as OceanStore to
 simply burning blocks on a CD and using SneakerNet
 for file transfers.
 




reply via email to

[Prev in Thread] Current Thread [Next in Thread]