Blazegraph functions as a triplestore (RDF) and graph database. As a graph database, Blazegraph uses a graph structure of nodes and edges to represent data. Blazegraph also supports the triplestore (RDF) data model, which can be viewed as a specialized version of graph databases that is optimized for storing and retrieving triples.
Hash Join Index Nested Loop Join
Blazegraph supports both nested index joins (referred to as pipelined joins) and hash joins. Nested index joins are considered to be "zero investment" joins when used for an RDF (triplestore) database. Hash joins are built dynamically during query evaluation. Blazegraph supports hash join operators that run on JVM heap, as well as hash join operators that run on the native process heap. The former is more appropriate for lower volumes of data, while the latter is more appropriate for higher volumes.
Multi-version Concurrency Control (MVCC) Optimistic Concurrency Control (OCC)
Blazegraph supports transactions. Blazegraph uses Multi-Version Concurrency Control (MVCC), which can be viewed as a version of Optimistic Concurrency Control (OCC).
Blazegraph uses snapshot isolation. Read-only transactions are always supported and returns a fully consistent view of the database state as of the user-specified commit point. Read-write transactions buffer writes on isolated indices and commit only if the write set has been validated.
https://github.com/blazegraph/database
SYSTAP, LLC.
2006
Bigdata
C, C++, Java, JavaScript, PHP, Python, Ruby