[Gzz-commits] manuscripts ./gzigzag.bib storm/article.rst

[Benja Fallenstein]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Benja Fallenstein <address@hidden>      03/02/15 10:23:42

Modified files:
        .              : gzigzag.bib 
        storm          : article.rst 

Log message:
        xupdf figure

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/gzigzag.bib.diff?tr1=1.38&tr2=1.39&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/storm/article.rst.diff?tr1=1.164&tr2=1.165&r1=text&r2=text

Patches:
Index: manuscripts/gzigzag.bib
diff -u manuscripts/gzigzag.bib:1.38 manuscripts/gzigzag.bib:1.39
--- manuscripts/gzigzag.bib:1.38        Sat Feb 15 10:03:33 2003
+++ manuscripts/gzigzag.bib     Sat Feb 15 10:23:41 2003
@@ -54,6 +54,12 @@
  publisher = {ACM Press},
  }
 
address@hidden,
+ author = {Tuomas J. Lukka and Janne V. Kujala and Matti Katila and Benja 
Fallenstein},
+ title = {Buoys, break lines, and unique backgrounds for non-disruptive 
bidirectional spatial links},
+ year = {2003},
+ howpublished = {Submitted to Hypertext'03.}
+}
 
 @misc{fallenstein02urn5,
     author = {Benja Fallenstein},
Index: manuscripts/storm/article.rst
diff -u manuscripts/storm/article.rst:1.164 manuscripts/storm/article.rst:1.165
--- manuscripts/storm/article.rst:1.164 Sat Feb 15 10:19:06 2003
+++ manuscripts/storm/article.rst       Sat Feb 15 10:23:42 2003
@@ -413,14 +413,20 @@
 (``...:4-6``).
 
 Our current implementation shows only links between documents
-that are in memory at the same time [screenshot of xupdf, perhaps ref too
-(submitted) antont: was thinking the same, it would illustrate this well].
+that are in memory at the same time (Fig. [ref-buoyframe]_,
+discussed in [lukka03xupdf-submitted]_).
 In the future, we will implement a global distributed index on top of
 a distributed hashtable (Section 5).
 To find the transclusions of a span, the system will retrieve
 all transclusions of any span with the same prefix (``...:``), then
 sort out those that do not overlap the span in question.
 
+.. figure:: buoyframe0.ps
+   :label: buoyframe
+
+   Our current implementation showing a PDF file with links
+   and transclusions.
+
 Since the problem is to search for overlapping ranges,
 the spans themselves can not be used as hashtable keys. 
 However, we keep the number of spans with the same prefix
@@ -718,7 +724,7 @@
     getItems(block) -> 
         set of (key, value) pairs
 
-This callback processes a block and returns a set of 
+This callback analyzes a block and returns a set of 
 hashtable items (key/value pairs) to be placed into the index. 
 The Storm pool, in turn, provides 
 the following interface to the application::
@@ -734,12 +740,13 @@
 because binding items to blocks makes it easy for pools
 to e.g. remove associated items when deleting a block.
 
-As an example, the ``getItems()`` method of our Xanalogical 
-storage implementation will, for a block containing a document,
-collect all the spans in a document, and return items
-from their scroll blocks' IDs to the spans and their positions
-in the document. When we want to find the transclusions of
-a span, we use ``get()`` to get the items for the ID of 
+As an example, the ``getItems()`` method of our Xanalogical storage 
+implementation will, for a block containing a document, 
+first collect all the spans in a document.
+For each span, it will then return an item mapping the span's scroll
+block id to the span's position in the document.
+When we want to find the transclusions of
+a span, we use ``get()`` to find transclusions from
 that span's scroll block, and load the document blocks referenced
 by the items.