Graph Shape Sorting

On Sunday I posted about how constrained views of RDF can be useful in order to document the inputs into an application, validate those inputs, and also manage updates via application of set algebra. I explored the idea that a system may support many such views or “document types” without blessing any as the primary view of the data. And, importantly, that this approach doesn’t ultimately constrain the range of data that you can put into a triple store.
It just occured to me that there’s another way to explain the concept: a shape sorter.
Photo by ellas dad
A shape sorter can contain many different sizes, shapes, and colours of block. Each can only be put into the box through a specific hole, but once in they’re all mixed together. And one can reach in and pick out any or all of them. Depending on which face of the shape sorter you’re looking at the options may look quite limited. But the sorter has a whole has a lot of different faces and options.
The inside of the box is the triple store. It can contain many different things. Each block is a specific data format or the shape of a specific sub-graph. Passing a block through a shape is the validation process, and the shape sorter offers many different forms of validation.
Useful alternate explanation or excuse to post a pointer to a pretty picture?