Hamming Tree: The Case for Energy-Aware Indexing for NVMs

Summary: Hamming Tree: a software-level, memory-aware index for NVMs that minimizes bit flips by steering writes to segments, saving energy and wear. On Optane, it achieves up to 67.8% energy reduction, underscoring energy-aware indexing for NVM endurance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6747
Venue: SIGMOD
Year: 2023
Pagerank: 5.3599647e-05
Overall Rank: 8,833 | 39.40%
DOI: 10.1145/3589327

Incoming Non-self Citations Over Time

Authors

1. Saeed Kargar (University of California Santa Cruz)
2. Faisal Nawab (University of California Irvine)

BibTeX Citation

@inproceedings{kargar_sigmod23,
        title = {{Hamming Tree: The Case for Energy-Aware Indexing for NVMs}},
        author = {Kargar, Saeed and Nawab, Faisal},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3589327},
        url = {https://dl.acm.org/doi/10.1145/3589327},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,742	Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index	2024	VLDB	5.7862414e-05
11,220	Sorting on Byte-Addressable Storage: The Resurgence of Tree Structure	2024	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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
621	Persistent B+-Trees in Non-Volatile Main Memory	2015	VLDB	0.00015695264
841	Let’s Talk About Storage & Recovery Methods for Non-Volatile Memory Database Systems	2015	SIGMOD	0.00013677356
9,423	Extending the Lifetime of NVM: Challenges and Opportunities	2021	VLDB	5.2717556e-05
11,623	Hamming Tree: The Case for Memory-Aware Bit Flipping Reduction for NVM Indexing	2021	CIDR	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	948	BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory	2018	VLDB
2	1,823	LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory	2020	VLDB
3	5,954	When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories	2023	SIGMOD
4	2,246	DPTree: Differential Indexing for Persistent Memory	2020	VLDB
5	840	Storage Management in the NVRAM Era	2014	VLDB
6	1,258	Managing Non-Volatile Memory in Database Systems	2018	SIGMOD
7	9,423	Extending the Lifetime of NVM: Challenges and Opportunities	2021	VLDB
8	621	Persistent B+-Trees in Non-Volatile Main Memory	2015	VLDB
9	961	Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices	2009	VLDB
10	11,623	Hamming Tree: The Case for Memory-Aware Bit Flipping Reduction for NVM Indexing	2021	CIDR