@@ -0,0 +1,158 @@
9+Graph Store is a gall implementation of a tree with additional virtual edges by allowing nodes to reference other nodes. It is most comparable to modern NoSQL databases in structure, though it allows for schemas to be written in the form of marks. It is used as the backend for an increasing number of Landscape applications, and is considered to be best used for social data.
13+`graphs` is a map of `resource` to `marked-graph`
15+`resource` is a pair of ship and term which is where the graph is hosted and the name of the resource. Every graph is it's own resource.
17+`marked-graph` is a pair of `graph` and `(unit mark)`. The semantics of a graph are defined by the mark. This is just for validating the structure of the graph.
19+`graph` is a `mop`, a mold builder for order map, of an atom and a `node`.
21+`node` is a pair of `post` and `children`.
23+`post` is defined in `sur/post`. It contains:
30+ contents=(list content)
37+Most of these elements are self explanatory.
39+`contents` is a `list` of `content` where `content` is a tagged union of text, url, code, or reference. This is where the contents of a publish post or an entry from links would be stored.
41+`hash` is a `sham` hash of `validated-portion` which includes the parent hash, author, time sent, and contents.
43+`signatures` is a set of `signature` which is used to cryptographically sign graph-store messages.
45+When interacting with `graph-store` you will need to create an `update`
47+`update` is a tagged union that currently only has one option
49+`[%0 p=time q=update-0]`
51+The reason this is a union is to serve as future proofing for version changes.
53+An `update-0` can either be logged in the case of adding/removing nodes or signatures, or non-logged as in the case of adding/removing a graph. This logging refers to if this action adds an entry to the update log that is used to synchronize state between ships.
55+Below is an excerpt of `sur/graph-store.hoon` at the time of writing, showing the definition of `logged-update-0` and `update-0` which should now be readable.
59+ $% [%add-nodes =resource nodes=(map index node)]
60+ [%remove-nodes =resource indices=(set index)]
61+ [%add-signatures =uid =signatures]
62+ [%remove-signatures =uid =signatures]
67+ [%add-graph =resource =graph mark=(unit mark)]
68+ [%remove-graph =resource]
70+ [%add-tag =term =resource]
71+ [%remove-tag =term =resource]
73+ [%archive-graph =resource]
74+ [%unarchive-graph =resource]
75+ [%run-updates =resource =update-log]
77+ :: NOTE: cannot be sent as pokes
80+ [%tags tags=(set term)]
81+ [%tag-queries =tag-queries]
88+Graph Store can be poked with a `graph-update`, which can:
89+ - add and remove a graph
91+ `[%add-graph =resource =graph mark=(unit mark)]`
93+ `[%remove-graph =resource]`
95+ - add and remove a node to a graph
97+ `[%add-nodes =resource nodes=(map index node)]`
99+ `[%remove-nodes =resource indices=(set index)]`
101+ - add and remove signatures
103+ `[%add-signatures =uid =signatures]`
105+ `[%remove-signatures =uid =signatures]`
107+ - add and remove tags
109+ `[%add-tag =term =resource]`
111+ `[%remove-tag =term =resource]`
113+ - archive and unarchive a graph
115+ `[%archive-graph =resource]`
117+ `[%unarchive-graph =resource]`
121+What follows is a summary of the scrys available in graph-store
130+ `[%x %tag-queries ~]`
132+- Fetch a specific graph by resource
135+- Archive a specific graph by resource
136+ `[%x %archive @ @ ~]`
138+- Fetch a subset of the graph by resource and start and end indices
139+ `[%x %graph-subset @ @ @ @ ~]`
141+- Select a node from a graph by resource and index
142+ `[%x %node @ @ @ *]`
144+- Fetch a subset of the children of a node by resource, index, and start and end indices
145+ `[%x %node-children-subset @ @ @ @ @ *]`
147+- Fetch a subset of the update log by resource and start and end indices
148+ `[%x %update-log-subset @ @ @ @ ~]`
150+- Fetch the update log by resource
151+ `[%x %update-log @ @ ~]`
153+- Fetch the time of the last entry of the update log
154+ `[%x %peek-update-log @ @ ~]`
158+There are marks in `mar/graph/validator` that are worth reviewing. They are each short enough to read quickly. They are used to validate the shapes of various nouns to be stored in the graph-store.