Pure OCaml B-tree implementation for persistent storage
btree: update README
+8
-3
+8
-3
README.md
+8
-3
README.md
···
2
2
3
3
Pure OCaml B-tree implementation for persistent storage.
4
4
5
+
> **Note:** This library currently implements SQLite's specific B-tree file
6
+
> format (page layout, varint encoding, record serialisation). It is not a
7
+
> generic B-tree library. A future version may abstract the serialisation
8
+
> scheme to support other formats.
9
+
5
10
## Overview
6
11
7
-
A B-tree implementation supporting SQLite-compatible page-based storage:
12
+
A B-tree implementation using SQLite's page-based storage format:
8
13
9
14
- **Table B-trees**: 64-bit integer keys with data in leaves
10
15
- **Index B-trees**: Arbitrary keys, no data (for secondary indexes)
···
96
101
97
102
## Related Work
98
103
99
-
- [SQLite](https://www.sqlite.org/fileformat.html) - Reference B-tree implementation
104
+
- [SQLite file format](https://www.sqlite.org/fileformat.html) - The specification this library implements
100
105
- [Limbo](https://github.com/tursodatabase/limbo) - Rust SQLite implementation
101
-
- [ocaml-btree (ctk21)](https://github.com/ctk21/ocaml-btree) - In-memory B-tree
106
+
- [ocaml-btree (ctk21)](https://github.com/ctk21/ocaml-btree) - Generic in-memory B-tree (different use case)
102
107
103
108
## License
104
109