I have spent time looking at part of SQLITE B-Tree, and what it does to implement my virtual nested graph model. They have good B-Tree and sql maintains the absolute rowid. So looking into the B-tree page format I am wondering how simple it might be to substitute BSON for data cell, and extract the whole B-Tree library as a proposed open standard. I mean we have proof of concept that an SQL machine can implement a nested graph convolution, so start with the best SQL B-Tree implementation for the standard.
What is the semantic model, subject,predicate, object. But this is just a nested graph, the predicate containing a bit to define sets and descents, the object, really a bounding pointer equivalent to 'node id', built out of rowid. Any given enetity expression result in a linear sequence of atomic triples with self directing graph variables.
OK, so the bounding object pointer is built with sqlite3 rowid code. The sqlite3 rowid function, the B-Tree implementation, and a BSON data cell format, makes proposal number one for the semantic standards group, the B-Tree/Graph layer/interface.
No comments:
Post a Comment