Dynamic Hashing

Dynamic Hashing is a hashing technique that dynamically adjusts the hash function and table size in response to changes in data volume or distribution, thereby maintaining efficient access performance without requiring complete reorganization of the hash structure.

79

Publications

4.6K

Citations

199

Authors

95

Institutions

Publications per year

2017–2026

14

Authors

199

  1. RP
    Rasmus Pagh

    IT University of Copenhagen, Denmark

    3 publications · 1.3K citations

    3

    h-index

  2. FF
    Flemming Friche Rodler

    IT University of Copenhagen, Denmark

    3 publications · 1.3K citations

    3

    h-index

  3. HJ
    H. Jonathan Chao

    SUNY Polytechnic Institute, United States

    2 publications · 52 citations

    2

    h-index

  4. AI
    Arun Iyengar

    IBM Research - Thomas J. Watson Research Center, United States

    2 publications · 67 citations

    2

    h-index

  5. DX
    Di Xiao

    Chongqing University, China

    2 publications · 87 citations

    2

    h-index

1–5 of 199

Venues

  1. Very Large Data Bases

    Conference · 4 publications · 227 citations

    4

    h-index

  2. ACM Transactions on Database Systems

    TODS · 4 publications · 831 citations

    4

    h-index

  3. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 2 publications · 38 citations

    2

    h-index

  4. The Computer Journal

    2 publications · 68 citations

    2

    h-index

  5. BRICS Report Series

    2 publications · 46 citations

    2

    h-index

1–5