@ -102,7 +102,7 @@ On a 2020 Mac Mini with the RocksDB persistent storage engine (Cozo supports man
* Running OLTP queries for a relation with 1.6M rows, you can expect around 100K QPS (queries per second) for mixed read/write/update transactional queries, and more than 250K QPS for read-only queries, with database peak memory usage around 50MB.
* Running OLTP queries for a relation with 1.6M rows, you can expect around 100K QPS (queries per second) for mixed read/write/update transactional queries, and more than 250K QPS for read-only queries, with database peak memory usage around 50MB.
* Speed for backup is around 1M rows per second, for restore is around 400K rows per second, and is insensitive to relation (table) size.
* Speed for backup is around 1M rows per second, for restore is around 400K rows per second, and is insensitive to relation (table) size.
* For OLAP queries, it takes around 1 second (within a factor of 2, depending on the exact operations) to scan a table with 1.6M rows. The time a query takes scales roughly with the number of rows the query touches, with memory usage determined mainly by the size of the return set.
* For OLAP queries, it takes around 1 second (within a factor of 2, depending on the exact operations) to scan a table with 1.6M rows. The time a query takes scales roughly with the number of rows the query touches, with memory usage determined mainly by the size of the return set.
* Two-hop graph traversal completes in less than 1ms for a graph with 31M edges.
* Two-hop graph traversal completes in less than 1ms for a graph with 1.6M vertices and 31M edges.
* The Pagerank algorithm completes in around 50ms for a graph with 10K vertices and 120K edges, around 1 second for a graph with 100K vertices and 1.7M edges, and around 30 seconds for a graph with 1.6M vertices and 32M edges.
* The Pagerank algorithm completes in around 50ms for a graph with 10K vertices and 120K edges, around 1 second for a graph with 100K vertices and 1.7M edges, and around 30 seconds for a graph with 1.6M vertices and 32M edges.
For more numbers and further details, we have a writeup
For more numbers and further details, we have a writeup
@ -116,10 +116,9 @@ a complete Cozo instance in your browser, at near-native speed for most operatio
So open up the [Cozo in WASM page](https://www.cozodb.org/wasm-demo/), and then:
So open up the [Cozo in WASM page](https://www.cozodb.org/wasm-demo/), and then:
* Start learning from the [tutorial](https://docs.cozodb.org/en/latest/tutorial.html) for the finer points.
* Follow the [tutorial](https://docs.cozodb.org/en/latest/tutorial.html).
After you have decided that Cozo is worth experimenting with for your next project, you can scroll down to learn
Or you can skip ahead for the information about installing Cozo into your favourite environment first.
how to use it embedded (or not) in your favourite environment.
### Teasers
### Teasers
@ -341,8 +340,7 @@ only Golang wraps the C API directly.
## Status of the project
## Status of the project
Cozo is very young and **not** production-ready yet,
Cozo is still very young, but we encourage you to try it out for your use case.
but we encourage you to try it out for your use case.
Any feedback is welcome.
Any feedback is welcome.
Versions before 1.0 do not promise syntax/API stability or storage compatibility.
Versions before 1.0 do not promise syntax/API stability or storage compatibility.
@ -350,4 +348,4 @@ Versions before 1.0 do not promise syntax/API stability or storage compatibility
## Licensing and contributing
## Licensing and contributing
This project is licensed under MPL-2.0 or later.
This project is licensed under MPL-2.0 or later.
See [here](CONTRIBUTING.md) if you are interested in contributing to the project.
See [here](CONTRIBUTING.md) if you are interested in contributing to the project.