Persistent Hash Tables
Persistent Hash Tables is a persistent data structure that enables efficient, immutable access to past versions of a hash table while supporting updates through the creation of new versions without altering existing ones.
8
Publications
443
Citations
29
Authors
11
Institutions
Publications per year
2017–2026
5
Parents
8
Persistent memory hash indexes
Daokun Hu, Zhiwen Chen, Jianbing Wu et al. · Proceedings of the VLDB Endowment · 2021 · 44 citations
Yihe Huang, Matej Pavlovič, Virendra J. Marathe et al. · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 2018 · 34 citations · Full text
1–5 of 8
29
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 29
11

Hunan University
Changsha, China
2 h-index
10 publications
375 citations
Wuhan National Laboratory for Optoelectronics
Wuhan, China
1 h-index
4 publications
52 citations
Harvard University
Cambridge, United States
1 h-index
1 publications
34 citations

National University of Defense Technology
Changsha, China
1 h-index
1 publications
13 citations
Boston University
Boston, United States
1 h-index
1 publications
20 citations
University of Chicago
Chicago, United States
1 h-index
1 publications
141 citations

Harvard University Press
Cambridge, United States
1 h-index
1 publications
34 citations

Illinois Institute of Technology
Chicago, United States
1 h-index
7 publications
987 citations
1–8 of 11
Repository · 2 publications · 48 citations
2
h-index
PVLDB · 1 publications · 44 citations
1
h-index
JSA · 1 publications · 13 citations
1
h-index
TKDE · 1 publications · 20 citations
1
h-index
Conference · 1 publications · 31 citations
1
h-index
1–5