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

Authors

29

  1. JS
    Jianhua Sun

    Hunan University, China

    2 publications · 75 citations

    2

    h-index

  2. ZC
    Zhiwen Chen

    Central South University, China

    2 publications · 75 citations

    2

    h-index

  3. DH
    Daokun Hu

    Southern Medical University, China

    2 publications · 75 citations

    2

    h-index

  4. HC
    Hao Chen

    Hunan University, China

    2 publications · 75 citations

    2

    h-index

  5. XZ
    Xiaobing Zhou

    Yunnan University, China

    1 publications · 141 citations

    1

    h-index

1–5 of 29

Venues

  1. Infoscience (Ecole Polytechnique Fédérale de Lausanne)

    Repository · 2 publications · 48 citations

    2

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 44 citations

    1

    h-index

  3. Journal of Systems Architecture

    JSA · 1 publications · 13 citations

    1

    h-index

  4. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 1 publications · 20 citations

    1

    h-index

  5. 1

    h-index

1–5