Cache-aware Hashing

Cache-Aware Hashing is a hash table organization method that optimizes data placement and access patterns by explicitly taking into account the hierarchical structure and performance characteristics of the underlying memory cache to minimize cache misses and improve retrieval efficiency.

11

Publications

878

Citations

33

Authors

15

Institutions

Publications per year

2017–2026

2

Authors

33

  1. PB
    Phillip B. Gibbons

    Carnegie Mellon University, United States

    2 publications · 222 citations

    2

    h-index

  2. TC
    Todd C. Mowry

    Carnegie Mellon University, United States

    2 publications · 222 citations

    2

    h-index

  3. AA
    Anastassia Ailamaki

    Carnegie Mellon University, United States

    2 publications · 222 citations

    2

    h-index

  4. BP
    Balaji Prabhakar

    Stanford University, United States

    1 publications · 42 citations

    1

    h-index

  5. OA
    Oriol Arcas-Abella

    Universitat Politècnica de Catalunya, Spain

    1 publications · 20 citations

    1

    h-index

1–5 of 33

Venues

  1. Allerton Conference on Communication, Control, and Computing

    Conference · 1 publications · 42 citations

    1

    h-index

  2. ACM Transactions on Database Systems

    TODS · 1 publications · 133 citations

    1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 11 citations

    1

    h-index

  4. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 134 citations

    1

    h-index

  5. Architectures for Networking and Communications Systems

    Conference · 1 publications · 83 citations

    1

    h-index

1–5