Semanto-Relational Data Model (SRDM)
The semanto-relational data model or SRDM is based on a simple idea: Any information can be expressed as a list of typified relations between two entities. Which implies that the most fundamental bit of information is a typified relation. Consequently, information expressed using SRDM is nothing but a list of typified relations between otherwise unspecified semantic identifiers, which can be rendered as a graph.
While it might seem counter-intuitive to express any information as a list of relations amongst its parts, we believe that it is one of the most powerful ideas in information technology. The semanto-relational data model has highly desirable properties that make it arguably the most flexible model we know today (see post Universal Data for more information).
SRDM is a semantic data model and is conceptually related to RDF, with a few technical differences though. Mainly, SRDM uses fixed length binary identifiers instead of URIs. These binary identifiers are named GNU or Global Numeric Unit. GNUs themselves are closely related to UUIDs but are somewhat more versatile.
SRDM includes the basic semantic data model as well as the concepts and functionality required to create, store and manage universal data. Parts of SRDM are buckets and sources, containers that can hold universal data. It also defines low-level data encryption, digital signatures and data access security.
SRDM is the underlying framework for Havel. If comparing Havel to a natural language one can say that SRDM is like the concept of characters and words for Havel (not the characters and words themselves though, that would be universal data).
This post is part of a comprehensive introduction into SRDM, graph languages and Havel.
Continue reading: Universal Data
Comments