Expand description
QuaQue-inspired versioning for the knowledge graph.
Based on arXiv:2603.18654 — condensed relational model using bitstring validity.
Each entity/relation row carries a validity bitstring; bit position is determined
by a version’s bit_slot (0–63), NOT by its id. Slots are reclaimable: when a
version is deleted its slot is freed and the next create_version call reuses the
lowest available slot. A row belongs to version V when
(validity & (1 << V.bit_slot)) != 0. Version filtering uses bitwise operations.
Modules§
- diff
- Version comparison and entity history.
- merge
- Version merge operations — union and intersection strategies.
- query
- Version-filtered queries for entities, relations, and neighbor traversal.
- snapshot
- Version snapshot operations — add/remove entities and relations to/from versions.
- store
- Version CRUD operations.
Structs§
- Version
- Metadata for a named version/snapshot of the knowledge graph.
- Version
Diff - Result of comparing two versions.
Enums§
- Merge
Strategy - Strategy for merging versions.