vt-tree · research · also Variable-Transmission tree

VT-tree

A VT-tree extends an LSM-tree with stitching that reuses eligible nonoverlapping block spans during merging.

Stitching builds a new index over retained spans and rewritten overlap. A minimum span length trades fewer copies for scan locality; retained blocks beside rewritten data can leave holes requiring cleaning. [1]

The design uses quotient filters so merging membership metadata need not reread skipped keys. This is a filter-maintenance constraint, not only a false-positive-rate choice. [1]

Relations

related
Log-structured merge-tree, LSM compaction, Quotient filter

Citations

  1. Shetty et al. Building Workload-Independent Storage with VT-Trees. FAST 2013, pp. 17-30, section 3.1. (accessed 2026-11-10)

Further reading

  1. Hesela: VT-tree stitching and filter-maintenance costs (accessed 2026-11-10)
Sources & caveats
  • FAST 2013 research design. Source synthesis, not a modern implementation benchmark or replication.

JSON: /data/terms/vt-tree.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. VT-tree. Hesela. 2026-11-10. https://hesela.dev/terms/vt-tree/