Baguette
/
dodb.cr
3
0
Fork 1
Code Issues Pull Requests Releases Wiki Activity

Graph: a few more sentenses.

toying-with-ramdb
Philippe PITTOLI 2024-05-13 03:38:41 +02:00
parent 71d8fa53d5
commit a986e56264
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
graphs/graphs.ms
View File

@ -12,9 +12,6 @@ on the disk.
See the \f[CW]README\f[] for a longer explanation.
This document briefly presents an experiment to understand the performances we can get with this approach.
.br
.UL Status :
WIP
.ABSTRACT2
.SECTION Experimental scenario
.LP
@ -67,6 +64,11 @@ end
.SECTION Basic indexes (1 to 1 relations)
.LP
An index enables to match a single value based on a small string.
In our example, each \f[CW]car\f[] has an unique \fIname\f[] which is used as an index.
The following graph represents the result of 100 queries of a car based on its name.
The experiment starts with a database containing 1,000 cars and goes up to 250,000 cars.
Since there is only one value to retrieve, the request is quick and time is almost constant.
When the value and the index are kept in memory (see \f[CW]RAM only\f[] and \f[CW]Cached db\f[]), the retrieval is almost instantaneous (about 50 to 120 ns).
In case the value is on the disk, deserialization takes about 15 µs (see \f[CW]Uncached db, cached index\f[]).