Friday, March 2, 2012
What's next for the semantic processor?
Get a better B Tree than the one offered by Sqlite3. Get a B Tree, or optimize the Sqlite3 B Tree so it is adapted to nested stores, has more flexibility in the rowid. Also a B Tree that has something like the Stepping API the processor uses. Where can I get one? Wait, some of the uiversities are working on one, it will come. A B Tree optimized around the rowid and key value matches will soon be here. The issue is navigation by key word, not navigation by URL as the rdf folks have it. So a B Tree focused on the triple form that recognizes that key words are sually short, perhaps with a special type called matchable. This particular implementation will just be tweeked to keep up with Json naming and search syntax.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment