Snapcompact: SoTA Compaction – Instant, Local, Free
Snapcompact is a new compaction algorithm that achieves state-of-the-art performance, operating instantly, locally, and free of cost, offering significant improvements over existing methods.
Background
- This is a technical blog post about a new database compaction algorithm called Snapcompact, likely related to storage engines like LSM-trees (Log-Structured Merge-Trees), which are used in databases such as LevelDB, RocksDB, and Apache Cassandra.
- "SoTA" stands for "State of the Art." Compaction is the process of merging and cleaning up data files to reclaim space and maintain read performance; it is typically background work that can be slow and resource-intensive.
- The post claims Snapcompact achieves compaction that is "instant, local, free"—meaning it is fast, happens on the same node without network overhead, and has minimal CPU/IO cost. This would be significant because compaction is often a major source of latency and operational burden in LSM-based storage systems.
- The author is likely Can (can.ac), a known blogger in the systems/infrastructure space, possibly affiliated with a database or distributed systems project.