<?xml version="1.0" encoding="US-ASCII"?>
<dblp>
<article key="journals/pacmmod/WangYLZ023" mdate="2025-08-08">
<author orcid="0000-0001-7943-3981">Ke Wang 0040</author>
<author orcid="0009-0008-0220-8426">Guanqun Yang</author>
<author orcid="0009-0000-7598-5025">Yiwei Li 0004</author>
<author orcid="0009-0001-4821-1558">Huanchen Zhang</author>
<author orcid="0000-0001-8433-7281">Mingyu Gao 0001</author>
<title>When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories.</title>
<pages>105:1-105:26</pages>
<year>2023</year>
<volume>1</volume>
<journal>Proc. ACM Manag. Data</journal>
<number>1</number>
<ee>https://doi.org/10.1145/3588959</ee>
<ee>https://www.wikidata.org/entity/Q130987310</ee>
<url>db/journals/pacmmod/pacmmod1.html#WangYLZ023</url>
</article>
</dblp>
