I have some code that needs to store 10s of thousands of terms (a global symbol table). After a few experiments, I ended up using library(rbtrees). (I didn’t try @EricGT 's suggestion of N+K trees.) I also wrote some custom code to read and write them quickly, using library(fastrw).
Related topics
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| How to delete all records in a database using 'The recorded database' predicates? | 4 | 440 | July 15, 2023 | |
| Persistent predicates based on RocksDB | 108 | 3543 | February 8, 2025 | |
| Querying facts database with records | 8 | 227 | May 14, 2024 | |
| Database micro-benchmark (Discussion) | 22 | 892 | April 25, 2020 | |
| Assertion Creep | 17 | 1618 | December 16, 2020 |