Storage Model

N-ary Storage Model (Row/Record)

Bedrock stores data in a SQLite database. This stores data in a row-wise, where each row is referred to as a tuple. The tuples are stored contiguously on each page, and can be stored across multiple pages.

Query Interface

SQL Command-line / Shell

Bedrock queries can be any SQLite compatible query. The result is returned in an HTTP-like / JSON format, as per user request. It also support the MySQL protocol, and hence the user can continue using the MySQL client of their choice. It also provides a PHP binding that one can use to work with it from the shell itself.

Storage Architecture

Disk-oriented

Bedrock is an embedded SQLite engine, and reads / writes to ordinary disk files.

Query Execution

Tuple-at-a-Time Model

Bedrock uses the same query execution model as used by SQLite. The Squery method in Bedrock calls the sqlite3_exec method, which is a one step query execution interface.

Data Model

Relational

Bedrock is a networking and distributed transaction layer built on top of SQLite. SQLite supports a relational data model.

Foreign Keys

Supported

Bedrock is built on top of SQLite, and hence supports foreign keys just as in SQLite. To enable foreign key support, SQLITE_OMIT_FOREIGN_KEY and SQLITE_OMIT_TRIGGER must not be defined at runtime.

Joins

Nested Loop Join

Bedrock uses the join algorithm used by SQLite. SQLite uses nested loop joins, and has been criticised previously for its slow performance.

Concurrency Control

Multi-version Concurrency Control (MVCC) Two-Phase Locking (Deadlock Prevention) Two-Phase Locking (Deadlock Detection)

Bedrock maintains page locks using Two-Phase Locking as done in SQLite. However, it has its own proprietary synchronization engine to support concurrency over multiple servers.

Bedrock's synchronization engine is a private distributed general ledger, i.e, a private blockchain. Each thread has an internal table called journal, which has 3 columns called id, query, hash. Each time a query is committed to the database, a new row is inserted into the journal. The new row records the query, and calculates the new incremental hash based on the previous row. When a server connects to a cluster, the most recent id and hash are broadcasted. If two servers disagree on the the hash corresponding to the id, then they know that they have "forked" at some point and stop communicating with each other. A Paxos-based election scheme decides which fork stands up to the new master.

Since Bedrock supports multi-threaded writes, it is prone to write conflicts. This is addressed by "sharding" the table, and querying all the journal tables in a UNION whenever the database is to be viewed as one.

Indexes

B+Tree R-Tree

Bedrock is built on top of SQLite. It supports indexes just as done in SQLite. The default index is a B Tree. There is an option to use an R Tree for range queries, in which case SQLITE_ENABLE_RTREE needs to be defined.

Hardware Acceleration

Custom

Bedrock is written for modern hardware with SSD-backed RAID drives and RAM file caches. It was made to be "simple", not requiring any esoteric hardware hacks as done by other systems. Hence, there is no standard hardware acceleration option.