Tag
index-maintenance
- Oct 18, 2026 Page Splits and the Write Cost of a Single B-Tree Insert What an insert actually writes when a leaf page has no room, why the split propagates to the root, and how fill factor and right-links change the count. databases
- Oct 8, 2026 Secondary Indexes Under MVCC: Version Chasing and Index Write Amplification Why every row version needs its own index entries, how a lookup follows pointers through superseded versions, and what a non-covering index costs in a versioned store. databases
- May 14, 2026 Keeping a Vector Index Current Without Rebuilding It How segments, tombstones, and compaction let an index absorb edits, why deletion is more expensive than insertion, and where the visible-lag window comes from. inference systems
- Nov 17, 2025 Tombstones, Merges, and the Cost of Keeping a Vector Index Current Why deleting from a proximity graph is harder than inserting, how segment-and-merge maintenance bounds the damage, and when a rebuild is cheaper than incremental repair. information retrieval