92 |
the definition of hyperstructure above, then discuss it |
the definition of hyperstructure above, then discuss it |
93 |
in light of the "connotations" of hyperstructure. |
in light of the "connotations" of hyperstructure. |
94 |
|
|
95 |
|
.. The RDF structure (`Lassila and Swick 1999`_) is a graph containing |
96 |
|
three types of nodes: Nodes identified globally by a URI, |
97 |
|
"blank" nodes with identifiers local to a graph, and |
98 |
|
*literals* (explicit values such as strings and numbers). |
99 |
|
An RDF graph is a set of triples containing a *subject*, |
100 |
|
*predicate* and *object* nodes (literals can only occur |
101 |
|
as objects), which are interpreted as edges in the graph; |
102 |
|
the subject and object are vertices, the predicate |
103 |
|
is a label. |
104 |
|
|
105 |
|
|
106 |
|
|
107 |
|
Our work is based on using the Resource Description Framework |
108 |
|
(RDF, `Lassila and Swick 1999`_) as a hyperstructure. |
109 |
|
In the examples we have given above, we have assumed the use of RDF. |
110 |
|
|
111 |
|
RDF is a directed labelled graph structure in which nodes and edge labels |
112 |
|
are identified by URIs. Nodes can also be blank, that is, |
113 |
|
have identifiers local to a particular graph, or literal |
114 |
|
(explicit values such as strings and numbers, rather than URIs). |
115 |
|
An RDF graph can be seen as a set of *(subject, predicate, |
116 |
|
object)* triples, where each triple is an edge between the |
117 |
|
subject and the object and with the predicate as its label. |
118 |
|
|
119 |
|
While the zzstructure is simple to browse locally, |
120 |
|
programming is often easier in RDF, because many-to-many |
121 |
|
relationships can be represented more naturally. |
122 |
|
|
123 |
|
Using RDF as a hyperstructure, items are nodes. |
124 |
|
Two data structures can independently connect information |
125 |
|
to the same item by using different properties. Properties |
126 |
|
are the RDF equivalent to zzstructure's dimensions. |
127 |
|
|
128 |
|
Visualizations of RDF... [keep current paragraphs here] |
129 |
|
...herculean task. |
130 |
|
|
131 |
|
[Ontorama cloning technique and problems with that] |
132 |
|
|
133 |
|
These visualizations are therefore not useful for using |
134 |
|
RDF as a hyperstructure as introduced above. |
135 |
|
However, it is quite possible to build focus+context |
136 |
|
views for RDF; we discuss our RDF visualizations |
137 |
|
in `Section 4.2.1`_. |
138 |
|
|
139 |
Then go on to discuss visualization, as currently. |
Then go on to discuss visualization, as currently. |
140 |
|
|
141 |
[24] Discuss the GraphViz library, which at least two RDF |
[24] Discuss the GraphViz library, which at least two RDF |
150 |
[30] Examples: |
[30] Examples: |
151 |
|
|
152 |
- Expanding on the Carli example (also explaining |
- Expanding on the Carli example (also explaining |
153 |
how to handle large number of neighbours in e-mail case) |
how to handle large number of neighbours in e-mail case) [6] |
154 |
- Real-world example (poems) |
- Real-world example (poems) |
155 |
- Connecting thoughts (better than paper). |
- Connecting thoughts (better than paper). |
156 |
|
|
157 |
Use RDF to concretify the examples. |
Use RDF to concretify the examples. |
158 |
|
|
159 |
|
Need to drive home through this how this can "help us |
160 |
|
organize our lives." |
161 |
|
|
162 |
Refer to FenPDF section below as giving another example. |
Refer to FenPDF section below as giving another example. |
163 |
|
|
164 |
|
|
188 |
|
|
189 |
(or move related to 5.4?) [24],[26] |
(or move related to 5.4?) [24],[26] |
190 |
|
|
191 |
|
Also details about how to handle large numbers of neighbours |
192 |
|
belong here. [6] |
193 |
|
|
194 |
|
|
195 |
4.2.2 Buoys |
4.2.2 Buoys |
196 |
""""""""""" |
""""""""""" |