{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:27Z","timestamp":1763468247557},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,1]]},"abstract":"<jats:p>To mitigate the impact of the widening gap between the memory needs of CPUs and what standard memory technology can deliver, system architects have introduced a new class of memory technology termed persistent memory. Persistent memory is byte-addressable, but exhibits asymmetric I\/O: writes are typically one order of magnitude more expensive than reads. Byte addressability combined with I\/O asymmetry render the performance profile of persistent memory unique. Thus, it becomes imperative to find new ways to seamlessly incorporate it into database systems. We do so in the context of query processing. We focus on the fundamental operations of sort and join processing. We introduce the notion of write-limited algorithms that effectively minimize the I\/O cost. We give a high-level API that enables the system to dynamically optimize the workflow of the algorithms; or, alternatively, allows the developer to tune the write profile of the algorithms. We present four different techniques to incorporate persistent memory into the database processing stack in light of this API. We have implemented and extensively evaluated all our proposals. Our results show that the algorithms deliver on their promise of I\/O-minimality and tunable performance. We showcase the merits and deficiencies of each implementation technique, thus taking a solid first step towards incorporating persistent memory into query processing.<\/jats:p>","DOI":"10.14778\/2732269.2732277","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"413-424","source":"Crossref","is-referenced-by-count":53,"title":["Write-limited sorts and joins for persistent memory"],"prefix":"10.14778","volume":"7","author":[{"given":"Stratis D.","family":"Viglas","sequence":"first","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,1]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1243418.1243429"},{"key":"e_1_2_1_2_1","volume-title":"CIDR","author":"Chen S.","year":"2011","unstructured":"S. Chen Rethinking database algorithms for phase change memory . In CIDR , 2011 . S. Chen et al. Rethinking database algorithms for phase change memory. In CIDR, 2011."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11802167_41"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950380"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629589"},{"key":"e_1_2_1_6_1","volume-title":"The Wisconsin Benchmark: Past, Present, and Future","author":"DeWitt D. J.","year":"1993","unstructured":"D. J. DeWitt . The Wisconsin Benchmark: Past, Present, and Future , 1993 . D. J. DeWitt. The Wisconsin Benchmark: Past, Present, and Future, 1993."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1565694.1565696"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767918"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00450-011-0186-9"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/33.4.365"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1534530.1534544"},{"key":"e_1_2_1_12_1","volume-title":"A New Measure of Rank Correlation. Biometrica, 30: 81--89","author":"Kendall M.","year":"1938","unstructured":"M. Kendall . A New Measure of Rank Correlation. Biometrica, 30: 81--89 , 1938 . M. Kendall. A New Measure of Rank Correlation. Biometrica, 30: 81--89, 1938."},{"key":"e_1_2_1_13_1","volume-title":"ISCA","author":"Kevin L.","year":"2009","unstructured":"L. Kevin Disaggregated memory for expansion and sharing in blade servers . In ISCA , 2009 . L. Kevin et al. Disaggregated memory for expansion and sharing in blade servers. In ISCA, 2009."},{"key":"e_1_2_1_14_1","volume-title":"FAST","author":"Kim H.","year":"2008","unstructured":"H. Kim and S. Ahn . BPLRU: a buffer management scheme for improving random writes in flash storage . In FAST , 2008 . H. Kim and S. Ahn. BPLRU: a buffer management scheme for improving random writes in flash storage. In FAST, 2008."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2002.1010143"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453913"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989455"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989325"},{"key":"e_1_2_1_19_1","volume-title":"MIT","author":"Myers D.","year":"2007","unstructured":"D. Myers . On the use of NAND flash memory in high-performance relational databases. Master Thesis , MIT , 2007 . D. Myers. On the use of NAND flash memory in high-performance relational databases. Master Thesis, MIT, 2007."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1565694.1565698"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1176760.1176789"},{"key":"e_1_2_1_22_1","volume-title":"Morgan & Claypool Publiishers","author":"Qureshi M. K.","year":"2012","unstructured":"M. K. Qureshi Phase Change Memory: from devices to systems . Morgan & Claypool Publiishers , 2012 . M. K. Qureshi et al. Phase Change Memory: from devices to systems. Morgan & Claypool Publiishers, 2012."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559854"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950379"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2732269.2732277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:28:03Z","timestamp":1672223283000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732269.2732277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["10.14778\/2732269.2732277"],"URL":"https:\/\/doi.org\/10.14778\/2732269.2732277","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}