/[gzz]/manuscripts/FutureVision/vision.rst
ViewVC logotype

Diff of /manuscripts/FutureVision/vision.rst

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.118 by benja, Thu Sep 18 16:57:09 2003 UTC revision 1.119 by benja, Thu Sep 18 17:06:52 2003 UTC
# Line 233  give their parents, children, and spouse Line 233  give their parents, children, and spouse
233    
234  XXX using hyperstructure for internal data  XXX using hyperstructure for internal data
235  XXX thus, explorability. Nelson: "Look under the world, find a turtle..."  XXX thus, explorability. Nelson: "Look under the world, find a turtle..."
236    XXX focus+context
237    
238  We use the term hyperstructure to **denote** a **storage model**  We use the term hyperstructure to **denote** a **storage model**
239  that allows different data structures to overlap, but to  that allows different data structures to overlap, but to
# Line 289  a 3-hypergraph. By interpreting the hype Line 290  a 3-hypergraph. By interpreting the hype
290  components are obtained by using different predicates (as dimensions)  components are obtained by using different predicates (as dimensions)
291  in different applitudes. XXX  in different applitudes. XXX
292    
293  - generally layouted as 2D graph = simulation of a drawing  Visualizations of RDF are generally a two-dimensional
294    on paper  layout of a whole graph, as if drawn on a sheet of paper.
295  - graphical editors such as IsaViz [ref] often provide tools  Graphical editors normally let the
296    for automatic graph layout, and generally allow humans  user position the individual nodes; additionally,
297    to layout graphs manually  many editors, such as IsaViz [XXXref] offer automatic
298  - no f+c  graph-layout algorithms.
299  - therefore, it's always a problem that some related items  
300    are on the other end of the graph  In this kind of visualization, when looking at a particular node,
301  - we describe our visualizations of rdf below (4.2.1)  it is often not easy to find the other nodes connected to it.
302    In particular in large graphs, the node you are looking for
303    may be in a completely different part of the image. Finding
304    anything in such a visualization representing *all* the items
305    a user stores in their computer seems bound to be a herculean task.
306    
307    We describe our focus+context visualizations of RDF
308    in section 4.2.1 [XXXlink], below.
309    
310    
311    

Legend:
Removed from v.1.118  
changed lines
  Added in v.1.119

savannah-hackers-public@gnu.org
ViewVC Help
Powered by ViewVC 1.1.26