Tyler Neely
Tyler Neely
we're super space inefficient when storing sets of page IDs in the `SegmentAccountant`, currently using `BTreeSet`s and `HashSet`s. the bitset implementation needs the following properties: * starts in "grow-only" mode...
calls to SA::next can often avoid coordination as long as we don't need to bump the file tip, in which case we might need to wait for some file truncation...
in order to reduce special-casing in the PageCache, Meta and Counter can be folded into a special Tree
To fully support high-level transactions that can execute consistent scans in addition to reads and writes, we need to be able to materialize phantom conflicts. (background on phantoms included at...
similar to the space amplification test, we should compare the db's total number of written bytes against a definitely-too-high constant
[master < Epic] PR - [x] Check, and update documentation if necessary - [x] Update [changelog](https://docs.memgraph.com/memgraph/changelog) - [x] Write E2E tests - [ ] Compare the [benchmarking results](https://bench-graph.memgraph.com/) between the...