{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:15:27Z","timestamp":1779174927888,"version":"3.51.4"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T00:00:00Z","timestamp":1594857600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100008783","name":"National Research Council of Science and Technology","doi-asserted-by":"crossref","award":["B551179-12-04-00"],"award-info":[{"award-number":["B551179-12-04-00"]}],"id":[{"id":"10.13039\/501100008783","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2018R1A2B3006681, 2016M3C4A7952587"],"award-info":[{"award-number":["2018R1A2B3006681, 2016M3C4A7952587"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003696","name":"ETRI","doi-asserted-by":"crossref","award":["Grant 19ZS1220"],"award-info":[{"award-number":["Grant 19ZS1220"]}],"id":[{"id":"10.13039\/501100003696","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2020,8,31]]},"abstract":"<jats:p>\n            In this work, we propose\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            , a hybrid index for persistent memory that leverages the byte-addressability of the in-memory index and the page locality of B-trees. As in the byte-addressable in-memory index,\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            is updated by 8-byte store instructions. Also, as in disk-based index,\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            is failure-atomic since it makes every 8-byte store instruction transform a consistent index into another consistent index without the help of expensive logging. Since expensive logging becomes unnecessary, the number of cacheline flush instructions required for\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            is significantly reduced. Our performance study shows that\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            outperforms other state-of-the-art persistent indexes in terms of insert and delete performance. While\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            shows slightly worse performance for point query performance, the range query performance of\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            is 2x faster than FAST and FAIR B-tree because the leaf page size of\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            can be set to 8x larger than that of FAST and FAIR B-tree without degrading insertion performance. We also show that read transactions can access\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            without acquiring a shared lock because\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            remains always consistent while a sequence of 8-byte write operations are making changes to it. As a result,\n            <jats:italic>\n              B\n              <jats:sup>3<\/jats:sup>\n              -tree\n            <\/jats:italic>\n            provides high concurrency level comparable to FAST and FAIR B-tree.\n          <\/jats:p>","DOI":"10.1145\/3394025","type":"journal-article","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T12:32:29Z","timestamp":1594125149000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["<i>\n              B\n              <sup>3<\/sup>\n            <\/i>\n            -Tree"],"prefix":"10.1145","volume":"16","author":[{"given":"Hokeun","family":"Cha","sequence":"first","affiliation":[{"name":"Sungkyunkwan University, Jangan-gu, Suwon-si, Gyeonggi-do, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moohyeon","family":"Nam","sequence":"additional","affiliation":[{"name":"Ulsan National Institute of Science and Technology (UNIST), Ulsan Metropolitan City, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kibeom","family":"Jin","sequence":"additional","affiliation":[{"name":"Ulsan National Institute of Science and Technology (UNIST), Ulsan Metropolitan City, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiwon","family":"Seo","sequence":"additional","affiliation":[{"name":"Hanyang University, Wangsim-ri, Seongdong-gu, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beomseok","family":"Nam","sequence":"additional","affiliation":[{"name":"Sungkyunkwan University, Jangangu, Suwon-si, Gyeonggi-do, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,16]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. ACM, 707--722","author":"Arulraj Joy"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752947"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 24th ACM Symposium on Operating Systems Principles (SOSP).","author":"Chidambaram Vijay"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755579"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 22nd ACM Symposium on Operating Systems Principles (SOSP).","author":"Condit J."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767918"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_2_1_9_1","first-page":"33","article-title":"Spin-transfer torque MRAM (STT-MRAM): Challenges and prospects","volume":"18","author":"Huai Yiming","year":"2008","journal-title":"AAPPS Bulletin"},{"key":"e_1_2_1_10_1","first-page":"4","volume-title":"Proceedings of the VLDB Endowment 8","author":"Huang Jian","year":"2014"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 16th USENIX Conference on File and Storage (FAST).","author":"Hwang Deukyeon","year":"2018"},{"key":"e_1_2_1_12_1","unstructured":"Intel. 2018. Intel and Micron produce breakthrough memory technology. https:\/\/newsroom.intel.com\/news-releases\/intel-and-micron-produce-breakthrough-memory-technology.  Intel. 2018. Intel and Micron produce breakthrough memory technology. https:\/\/newsroom.intel.com\/news-releases\/intel-and-micron-produce-breakthrough-memory-technology."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 17th USENIX Conference on File and Storage (FAST).","author":"Kaiyrakhmet Olzhas","year":"2019"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807206"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872392"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 11th USENIX Conference on File and Storage Technologies (FAST).","author":"Kim Wook-Hee","year":"2014"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 21st International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS). 399--411","author":"Kolli Aasheesh"},{"key":"e_1_2_1_18_1","unstructured":"HP Enterprise Lab. 2018. Quartz. https:\/\/github.com\/HewlettPackard\/quartz.  HP Enterprise Lab. 2018. Quartz. https:\/\/github.com\/HewlettPackard\/quartz."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 11th USENIX Conference on File and Storage Technologies (FAST).","author":"Lee Eunji"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 15th USENIX Conference on File and Storage Technologies (FAST).","author":"Lee Se Kwon"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 2015 USENIX Anual Technical Conference.","author":"Lee Wongun","year":"2015"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319663"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816683"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372728"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2442980"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2324563"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/3323298.3323302"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824044"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2901318.2901324"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915251"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 25th International Conference on Very Large Data Bases (VLDB).","author":"Rao Jun"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335449"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 22nd International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS).","author":"Seo Jihye"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591305.2591333"},{"key":"e_1_2_1_35_1","unstructured":"Abraham Silberschatz Henry Korth and S. Sudarshan. 2005. Database Systems Concepts. McGraw-Hill.  Abraham Silberschatz Henry Korth and S. Sudarshan. 2005. Database Systems Concepts. McGraw-Hill."},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of IEEE 13th International Symposium on High Performance Computer Architecture (HPCA).","author":"Srinath Santhosh"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 9th USENIX Conference on File and Storage Technologies (FAST).","author":"Venkataraman Shivaram"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814576.2814806"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 16th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS).","author":"Volos Haris"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the 11th USENIX Conference on File and Storage (FAST).","author":"Won Youjip","year":"2018"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2070050"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST).","author":"Yang Jun","year":"2015"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2015.7208275"},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the 33rd International Conference on Massive Storage Systems and Technology (MSST).","author":"Zuo Pengfei","year":"2017"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394025","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:12Z","timestamp":1750193232000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394025"}},"subtitle":["Byte-Addressable Binary B-Tree for Persistent Memory"],"short-title":[],"issued":{"date-parts":[[2020,7,16]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,8,31]]}},"alternative-id":["10.1145\/3394025"],"URL":"https:\/\/doi.org\/10.1145\/3394025","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,16]]},"assertion":[{"value":"2019-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}