cceh · research · also CCEH

Cacheline-Conscious Extendible Hashing

CCEH is a persistent-memory hash index that groups cacheline-sized buckets into segments addressed through a directory.

Segments shrink the directory but enlarge the unit of splitting. Ordered metadata updates and directory recovery replace explicit logging in the paper's design. [1]

Relations

related
Persistent memory, FPTree, Persistence ordering

Limitations

  • The original evaluation emulates persistent memory with DRAM; lookup probing can access additional cachelines. [1]
  • Dash evaluates a modified CCEH implementation on Optane, including allocation and reclamation repairs. [2]

Citations

  1. Moohyeon Nam, Hokeun Cha, Young-ri Choi, Sam H. Noh and Beomseok Nam. Write-Optimized Dynamic Hashing for Persistent Memory. FAST 2019, pp. 31-44, sections 3-6. (accessed 2026-11-13)
  2. Lu, Hao, Wang and Lo. Dash: Scalable Hashing on Persistent Memory. PVLDB 13(8), 2020, sections 1.1, 6.1-6.2. DOI: 10.14778/3389133.3389134. (accessed 2026-11-13)

Further reading

  1. Hesela: CCEH lookup, split and recovery boundaries. (accessed 2026-11-13)
Sources & caveats
  • Primary-source review of FAST 2019 sections 3-6 and Dash sections 1.1, 6.1-6.2; no benchmark or crash-test reproduction. Historical implementation observations are not a claim about current repository defects.

JSON: /data/terms/cceh.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Cacheline-Conscious Extendible Hashing. Hesela. 2026-11-13. https://hesela.dev/terms/cceh/