WiscKey
WiscKey is a research key-value store that keeps keys and value references in an LSM-tree while appending records to a separate value log.
The FAST 2016 prototype separates sorting from value reclamation. Its tail collector consults the index to identify surviving records before relocation. [1]
Reclaiming the old space requires persistent replacement records and updated references. This ordering is distinct from acknowledging a foreground write. [1]
HashKV changes the cleaning lookup path; it is not another name for WiscKey. [2]
Relations
- related
- Bitcask, Key-value separation, Value log, HashKV
Limitations
- The paper's recovery argument assumes append-prefix filesystem behavior. Historical evaluation does not establish performance or crash guarantees for arbitrary current storage stacks. [1]
Citations
- Lu, Pillai, A. C. Arpaci-Dusseau and R. H. Arpaci-Dusseau. WiscKey. FAST 2016, pp. 133-148, sections 3.2-3.4.
- Chan, Li, Lee and Xu. HashKV. USENIX ATC 2018, sections 2.2 and 3.3.
Further reading
Sources & caveats
- Source review, not a new WiscKey execution, crash experiment or benchmark.