copernic.space: versioned triple store (for big data?)

• From: Amirouche Boubekki <amirouche.boubekki@gmail.com>
• Date: Thu, 20 Feb 2020 22:19:27 +0100
• To: W3C AIKR CG <public-aikr@w3.org>
• Message-ID: <CAL7_Mo8ZpexLuawgOOKyRaQzJ-1VH=F+HJ1ZwiW=-equAyqhNw@mail.gmail.com>

I reworked my Scheme LISP code into Python Django and the result is
available at:

  http://copernic.space/query/?uid0=uid%3F&key0=title&value0=copernic&uid1=uid%3F&key1=key%3F&value1=value%3F

That is an pattern matching query, in the spirit of linked data
fragment, similar to the following SPARQL query:

SELECT ?uid ?key ?value WHERE {
  ?uid <http://title> "copernic" .
  ?uid ?key ?value
}

The code is available at: https://github.com/amirouche/copernic

A quick video tour is available at: https://youtu.be/wqbYfuOhG9w

Unlike previous iterations, this code is fine tuned to work in the
large. I dropped support for git-like DAG history. Instead, changes
are "stashed" when a change is applied, the code will swap `None` with
a timestamp that will serialize history.  The history is a single
branch.

The code still rely on generic tuple store.

Received on Thursday, 20 February 2020 21:19:52 UTC