Hamming Tree: The Case for Memory-Aware Bit Flipping Reduction for NVM Indexing
Summary: Hamming Tree: a memory-aware index augmentation that routes writes to locations minimizing bit flips to extend NVM endurance. Plug-compatible with existing indexes, it cuts bit flips up to 93% versus memory-agnostic techniques with minimal structural change. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Saeed Kargar (University of California Santa Cruz)
- 2. Faisal Nawab (University of California Santa Cruz)
BibTeX Citation
@inproceedings{kargar_cidr21,
address = {Amsterdam, Netherlands},
series = {{CIDR} '21},
title = {{Hamming Tree: The Case for Memory-Aware Bit Flipping Reduction for NVM Indexing}},
booktitle = {Proceedings of the {Conference} on {Innovative} {Data} {Systems} {Research}},
author = {Kargar, Saeed and Nawab, Faisal},
year = {2021}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,833 | Hamming Tree: The Case for Energy-Aware Indexing for NVMs | 2023 | SIGMOD | 5.3599647e-05 |
| 9,423 | Extending the Lifetime of NVM: Challenges and Opportunities | 2021 | VLDB | 5.2717556e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 491 | FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory | 2016 | SIGMOD | 0.00017575163 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,423 | Extending the Lifetime of NVM: Challenges and Opportunities | 2021 | VLDB |
| 2 | 2,246 | DPTree: Differential Indexing for Persistent Memory | 2020 | VLDB |
| 3 | 1,823 | LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory | 2020 | VLDB |
| 4 | 3,256 | To Lock, Swap, or Elide: On the Interplay of Hardware Transactional Memory and Lock-Free Indexing | 2015 | VLDB |
| 5 | 1,258 | Managing Non-Volatile Memory in Database Systems | 2018 | SIGMOD |
| 6 | 961 | Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices | 2009 | VLDB |
| 7 | 948 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB |
| 8 | 5,954 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD |
| 9 | 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB |
| 10 | 8,833 | Hamming Tree: The Case for Energy-Aware Indexing for NVMs | 2023 | SIGMOD |