Sakura · partner database

Facts that bloom
after winter.

db.skr

% schemas as modules
:- module[public] {
  % a durable relation in Sakura
  :- sakura:persisted {
    relation[Name].
    attribute[Relation_name, Attr_name, Domain_name].
  }.
}.

% query the database 
db:public:attribute['predicate', Attr, Domain]?

Answers

Attr = 'name'

Domain = 'relations'

Persisted predicates follow the same theory the application-layer ones do: relational theory. Even better: properties like totality being targeted by Sakura.

Kernel

Relations, not tables

Sakura is a subsystem leveraging the RNT kernel; a Windows-NT-inspired kernel built using relations. Sakure may interact with other RNT-based subsystems in the future.

One language

Everywhere

Shared syntax for the language entities that are semantically the same. Karuta being embeddable in RNT is planned! Stored procedures are coming!

Database

Properties

Persisted data is finite. Hence, totality can be exploited. The more guarantees the better. A database that halts makes the world a better place.

Rooted in Theory

One tree,
many branches

Researchers like Fabian Pascal, Edgar F. Codd, C.J Date, and David McGovern paved the foundation for the study of the applied theory of relational databases. We are here to learn and materialize their findings in a software artifact.

Plant
Sakura

Terminal

$ git clone https://src.symbolic.engineering/Sakura/