DataPower · An open benchmark
5 systems. Same data. Same operations. 2 CPU cores, 8 GB of memory.*
520DP
DataPower at 3M elements
TETRAbase scored 520. PostgreSQL 16.15 scored 198 and SQLite 3.53.4 scored 112.*
6.5×
Score growth, 300K to 3M elements
TETRAbase rose from 80 to 520 as the data grew tenfold. PostgreSQL 16.15 rose from 98 to 198.*
376ops/s
Useful throughput at 3M
TETRAbase completed 376 correct operations a second, adjusted for slow responses, with 4 clients. PostgreSQL 16.15 completed 230.*
2.9ms
CPU per operation at 3M
TETRAbase used 2.9 ms of processor time per operation. PostgreSQL 16.15 used 7.5 ms and SQLite 3.53.4 used 9.1 ms.*
* Measurements from Nov. 1, 2026. See the specs.
01 · The results
Choose a dataset size to compare all five databases. Click a database's name to follow it through the charts below.
| Score | |||||
| DataPower* | 520.2 | 197.5 | 112.3 | 67.2 | 25.5 |
| DP-Read, reads only | 1,000.0 | 140.3 | 178.3 | 67.7 | 36.4 |
| DP-Write, writes only | 193.0 | 682.9 | 176.0 | 1,254.2 | 5.3 |
| Work | |||||
| Data elements, E | 3 million | 3 million | 3 million | 3 million | 3 million |
| Useful throughput, T | 375.8 ops/s | 230.1 ops/s | 113.1 ops/s | 54.9 ops/s | 27.7 ops/s |
| Clients at best throughput | 4 | 4 | 4 | 4 | 1 |
| Latency score at best throughput, Q | 0.65 | 0.89 | 0.56 | 0.73 | 0.65 |
| Hardware | |||||
| Resource units, R | 2.167 | 2.056 | 2.015 | 2.228 | 2.414 |
| CPU cores | 2 | 2 | 2 | 2 | 2 |
| Average memory, M | 1.33 GiB | 0.41 GiB | 0.11 GiB | 1.67 GiB | 3.31 GiB |
| Disk, D | 0.23 GiB | 0.91 GiB | 0.19 GiB | 3.92 GiB | 0.11 GiB |
| Disk per data element | 82 bytes | 325 bytes | 66 bytes | 1,402 bytes | 39 bytes |
| CPU time per operation | 2.94 ms | 7.54 ms | 9.09 ms | 25.89 ms | 27.89 ms |
| Minimum memory | 8 GiB | 1 GiB | 8 GiB | 2 GiB | 4 GiB |
| Setup | |||||
| Setup points | 0 | 14 | 10 | 2 | 7 |
| Setup multiplier, O | 1.00 | 1.70 | 1.50 | 1.10 | 1.35 |
| Checks | |||||
| Wrong answers | 0 | 0 | 0 | 0 | 0 |
| Writes that did not read back | 0 | 0 | 0 | 0 | 0 |
| Sources | |||||
| Test run | Report →results.json | Report →results.json | Report →results.json | Report →results.json | Report →results.json |
02 · Test runs
Every report gives the score and its parts, response times for each kind of operation, memory and disk use, and a timeline from the cold start to the final checks. The results.json under each score holds the raw data.
| System | 300K elements | 1M elements | 3M elements |
|---|---|---|---|
| TETRAbase v0development build | 80.2DPReport → results.json | 264.6DPReport → results.json | 520.2DPReport → results.json |
| PostgreSQL 16.15relational | 97.7DPReport → results.json | 172.0DPReport → results.json | 197.5DPReport → results.json |
| SQLite 3.53.4embedded, relational | 73.9DPReport → results.json | 109.2DPReport → results.json | 112.3DPReport → results.json |
| Neo4j 5.26Community, graph | 33.1DPReport → results.json | 54.7DPReport → results.json | 67.2DPReport → results.json |
| lance-csr 0.5.1embedded, graph on Lance | 6.3DPReport → results.json | 12.3DPReport → results.json | 25.5DPReport → results.json |
The comparison charts all five databases from 300K to 3M elements, from 1 to 64 clients, and from a cold start.
03 · How the score works
TETRA CA PBC maintains DataPower and its test harness, dpbench. A database scores higher when it holds more data and completes more useful work each second, and lower when it needs more hardware or more setup.
E
E counts the data, in millions of elements. Each table row is one element, and so is each link from one row to another.
E = elements ÷ 1,000,000
T
T counts correct operations per second, discounted for slow responses. We run 1, 4, 16 and 64 clients and measure X, correct answers per second, and Q, a latency score from 0 to 1. T is the highest X × Q.
T = max (X × Q)
R
R counts the hardware. Each CPU core adds 1, each 8 GiB of memory adds 1, and each 200 GiB of disk adds 1.
R = cores + M ÷ 8 + D ÷ 200
O
O counts the setup. Each index, tuned setting, hand-sized cache, maintenance job, extra service or runtime adds 1 or 2 points, and each point adds 5%.
O = 1 + 0.05 × points
At 3M data elements. Every database holds the same data, so E is equal, and the 2 CPU cores make up most of R. T and O decide the ranking.
Each kind of operation has a time limit that 99% of its requests should meet. An operation within its limit scores 1. An operation over its limit scores the limit divided by its time, so an operation at twice the limit scores 0.5. Q multiplies these scores, weighted by how often each operation runs, so one slow operation pulls down the whole score.
M is the database's average memory. The harness samples it ten times a second while the database alternates between busy and idle minutes. A database that releases memory when idle scores better.
D is the size of the data on disk, after loading or after the writes, whichever is larger.
DP-Read and DP-Write apply the same formula to reads alone and to writes alone. DataPower covers the full mix.
TETRAbase v0 at 3M did its most useful work with 4 clients: T = 375.8 operations a second. With 64 clients it answered 552.0 a second, but its latency score fell to 0.18.
The calculation for TETRAbase v0 at 3M data elements
Report →results.jsonT = X 581.6 × Q 0.646 = 375.8, with 4 clients, the peak in the chart above
R = 2 cores + 1.33 GiB ÷ 8 + 0.23 GiB ÷ 200 = 2.167
O = 1 + 0.05 × 0 points = 1.00
DP = 3 × 375.8 ÷ (2.167 × 1.00) = 520.2
Next version
The next version starts the clock at the cold start, so start-up, warm-up and caching count toward the score.
dpbench works with any database that can load the data and run the operations. Book a call, and we'll run it on yours.