EHS: An Efficient Hashing Scheme for Persistent Memory

Dereje Regassa, Dongkyu Sung, Sunggon Kim, Heon Young Yeom, Yongseok Son

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

This paper presents an efficient hashing scheme called EHS to improve the performance and space efficiency on PM. In our scheme, we delay expensive rehashing operations by using the free space in buckets maximally. To do this, 1) we search and utilize the available spaces in all the buckets 2) we devise metadata of the bucket to manage and track the available spaces in all the buckets. This scheme enables to delay the full table rehashing and use the full space in the hash table efficiently. We implement and evaluate EHS on a real device such as Intel Optane® DC Persistent Memory (DCPMM). The experiment result shows EHS improves the performance by up to 53% and 14% in the case of insert operation compared with state-of-art schemes such as CCEH and Dash, respectively. It also improves the load factor by up to 91.8% and 87% compared with CCEH and Dash, respectively.

Original languageEnglish
Title of host publicationProceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, SAC 2023
PublisherAssociation for Computing Machinery
Pages301-304
Number of pages4
ISBN (Electronic)9781450395175
DOIs
StatePublished - 27 Mar 2023
Event38th Annual ACM Symposium on Applied Computing, SAC 2023 - Tallinn, Estonia
Duration: 27 Mar 202331 Mar 2023

Publication series

NameProceedings of the ACM Symposium on Applied Computing

Conference

Conference38th Annual ACM Symposium on Applied Computing, SAC 2023
Country/TerritoryEstonia
CityTallinn
Period27/03/2331/03/23

Keywords

  • directory doubling
  • dynamic hashing
  • extendible hashing
  • key-value store
  • persistent memory

Fingerprint

Dive into the research topics of 'EHS: An Efficient Hashing Scheme for Persistent Memory'. Together they form a unique fingerprint.

Cite this