When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories

This paper addresses the challenge of reducing random reads for index structures on persistent memories by combining tree and hash-based approaches for improved performance.

Recommended citation: Wang, K., Yang, G., Li, Y., Zhang, H., & Gao, M. (2023). When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories. ACM SIGMOD 2023.
Download Paper