{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:31Z","timestamp":1750308571336,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T00:00:00Z","timestamp":1465862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Singapore Ministry of Education","award":["MOE2012-T2-2-067","2013-T1-002-123"],"award-info":[{"award-number":["MOE2012-T2-2-067","2013-T1-002-123"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,14]]},"DOI":"10.1145\/2882903.2882908","type":"proceedings-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T19:01:52Z","timestamp":1466103712000},"page":"647-662","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A Study of Sorting Algorithms on Approximate Memory"],"prefix":"10.1145","author":[{"given":"Shuang","family":"Chen","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University & Nanyang Technological University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunning","family":"Jiang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University & Nanyang Technological University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueyan","family":"Tang","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593667"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465355"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1809028.1806620"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732227"},{"issue":"1","key":"e_1_3_2_1_5_1","first-page":"217","article-title":"A bipolar-selected phase change memory featuring multi-level cell storage. Solid-State Circuits","volume":"44","author":"Bedeschi F.","year":"2009","unstructured":"F. Bedeschi , R. Fackenthal , C. Resta , E. M. Donze , M. Jagasivamani , E. C. Buda , F. Pellizzer , D. W. Chow , A. Cabrini , G. Calvi , A bipolar-selected phase change memory featuring multi-level cell storage. Solid-State Circuits , IEEE Journal of , 44 ( 1 ): 217 -- 227 , 2009 . F. Bedeschi, R. Fackenthal, C. Resta, E. M. Donze, M. Jagasivamani, E. C. Buda, F. Pellizzer, D. W. Chow, A. Cabrini, G. Calvi, et al. A bipolar-selected phase change memory featuring multi-level cell storage. Solid-State Circuits, IEEE Journal of, 44(1):217--227, 2009.","journal-title":"IEEE Journal of"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1227161.1227164"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MTDT.2009.11"},{"key":"e_1_3_2_1_8_1","first-page":"521","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE), 2012","author":"Cai Y.","year":"2012","unstructured":"Y. Cai , E. F. Haratsch , O. Mutlu , and K. Mai . Error patterns in mlc nand flash memory: Measurement, characterization, and analysis. In Design , Automation & Test in Europe Conference & Exhibition (DATE), 2012 , pages 521 -- 526 . IEEE, 2012 . Y. Cai, E. F. Haratsch, O. Mutlu, and K. Mai. Error patterns in mlc nand flash memory: Measurement, characterization, and analysis. In Design, Automation & Test in Europe Conference & Exhibition (DATE), 2012, pages 521--526. IEEE, 2012."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190160"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2012.11"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375694"},{"key":"e_1_3_2_1_12_1","first-page":"21","volume-title":"CIDR","author":"Chen S.","year":"2011","unstructured":"S. Chen , P. B. Gibbons , and S. Nath . Rethinking database algorithms for phase change memory . In CIDR , pages 21 -- 31 , 2011 . S. Chen, P. B. Gibbons, and S. Nath. Rethinking database algorithms for phase change memory. In CIDR, pages 21--31, 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752947"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627369.2627630"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488873"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1950815.1950821"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.50"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2248487.2151008"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2012.48"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/146370.146381"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2751205.2751212"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063977"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114252.1114254"},{"key":"e_1_3_2_1_24_1","volume-title":"VLDB","author":"Garofalakis M. N.","year":"2001","unstructured":"M. N. Garofalakis and P. B. Gibbons . Approximate query processing: Taming the terabytes . In VLDB , 2001 . M. N. Garofalakis and P. B. Gibbons. Approximate query processing: Taming the terabytes. In VLDB, 2001."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142511"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ETS.2013.6569370"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732961"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1620585.1620588"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735970.1736023"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2012.6169027"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228519"},{"key":"e_1_3_2_1_32_1","volume-title":"sorting and searching","author":"Knuth D. E.","year":"1998","unstructured":"D. E. Knuth . The art of computer programming : sorting and searching , volume 3 . Pearson Education , 1998 . D. E. Knuth. The art of computer programming: sorting and searching, volume 3. Pearson Education, 1998."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950413.1950427"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555815.1555758"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961296.1950391"},{"key":"e_1_3_2_1_36_1","volume-title":"Sparkk: Quality-scalable approximate storage in dram","author":"Lucas J.","year":"2014","unstructured":"J. Lucas , M. Alvarez-Mesa , M. Andersch , and B. Juurlink . Sparkk: Quality-scalable approximate storage in dram . 2014 . J. Lucas, M. Alvarez-Mesa, M. Andersch, and B. Juurlink. Sparkk: Quality-scalable approximate storage in dram. 2014."},{"key":"e_1_3_2_1_37_1","unstructured":"Micron. MLC NAND Flash. http:\/\/www.micron.com\/products\/nand-flash\/mlc-nand 2015.  Micron. MLC NAND Flash. http:\/\/www.micron.com\/products\/nand-flash\/mlc-nand 2015."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELPHY.2008.4558857"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199607)26:7%3C781::AID-SPE35%3E3.3.CO;2-2"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594233.1594282"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1840845.1840921"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688072"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEDM.2007.4418973"},{"key":"e_1_3_2_1_44_1","volume-title":"Proceedings of EPCOS","author":"Pantazi A.","year":"2009","unstructured":"A. Pantazi , A. Sebastian , N. Papandreou , M. Breitwisch , C. Lam , H. Pozidis , and E. Eleftheriou . Multilevel phase change memory modeling and experimental characterization . Proceedings of EPCOS , 2009 . A. Pantazi, A. Sebastian, N. Papandreou, M. Breitwisch, C. Lam, H. Pozidis, and E. Eleftheriou. Multilevel phase change memory modeling and experimental characterization. Proceedings of EPCOS, 2009."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610522"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1816038.1815981"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555815.1555760"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/2755753.2757158"},{"key":"e_1_3_2_1_49_1","volume-title":"Database Management Systems. Osborne\/McGraw-Hill","author":"Ramakrishnan R.","year":"2000","unstructured":"R. Ramakrishnan and J. Gehrke . Database Management Systems. Osborne\/McGraw-Hill , Berkeley, CA, USA , 2 nd edition, 2000 . R. Ramakrishnan and J. Gehrke. Database Management Systems. Osborne\/McGraw-Hill, Berkeley, CA, USA, 2nd edition, 2000.","edition":"2"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995896.1995911"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744799"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2597809.2597812"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993316.1993518"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540712"},{"key":"e_1_3_2_1_55_1","first-page":"299","volume-title":"Classic Papers in Combinatorics","author":"Schensted C.","year":"1987","unstructured":"C. Schensted . Longest increasing and decreasing subsequences. In Classic Papers in Combinatorics , pages 299 -- 311 . Springer , 1987 . C. Schensted. Longest increasing and decreasing subsequences. In Classic Papers in Combinatorics, pages 299--311. Springer, 1987."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508857.1508860"},{"issue":"8","key":"e_1_3_2_1_57_1","first-page":"1228","article-title":"A multipage cell architecture for high-speed programming multilevel nand flash memories. Solid-State Circuits","volume":"33","author":"Takeuchi K.","year":"1998","unstructured":"K. Takeuchi , T. Tanaka , and T. Tanzawa . A multipage cell architecture for high-speed programming multilevel nand flash memories. Solid-State Circuits , IEEE Journal of , 33 ( 8 ): 1228 -- 1238 , 1998 . K. Takeuchi, T. Tanaka, and T. Tanzawa. A multipage cell architecture for high-speed programming multilevel nand flash memories. Solid-State Circuits, IEEE Journal of, 33(8):1228--1238, 1998.","journal-title":"IEEE Journal of"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.27"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.902699"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540710"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627369.2627613"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.5555\/2485288.2485615"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732277"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732960"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2245276.2232078"},{"key":"e_1_3_2_1_66_1","first-page":"167","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies, FAST'15","author":"Yang J.","year":"2015","unstructured":"J. Yang , Q. Wei , C. Chen , C. Wang , K. L. Yong , and B. He . Nv-tree: Reducing consistency cost for nvm-based single level systems . In Proceedings of the 13th USENIX Conference on File and Storage Technologies, FAST'15 , pages 167 -- 181 , Berkeley, CA, USA , 2015 . USENIX Association. J. Yang, Q. Wei, C. Chen, C. Wang, K. L. Yong, and B. He. Nv-tree: Reducing consistency cost for nvm-based single level systems. In Proceedings of the 13th USENIX Conference on File and Storage Technologies, FAST'15, pages 167--181, Berkeley, CA, USA, 2015. USENIX Association."},{"key":"e_1_3_2_1_67_1","volume-title":"the 10th Ann. Workshop on Duplicating, Deconstructing and Debunking (WDDD)","author":"Yeo S.","year":"2012","unstructured":"S. Yeo , N. H. Seong , and H.-H. S. Lee . Can multi-level cell pcm be reliable and usable? analyzing the impact of resistance drift . In the 10th Ann. Workshop on Duplicating, Deconstructing and Debunking (WDDD) , 2012 . S. Yeo, N. H. Seong, and H.-H. S. Lee. Can multi-level cell pcm be reliable and usable? analyzing the impact of resistance drift. In the 10th Ann. Workshop on Duplicating, Deconstructing and Debunking (WDDD), 2012."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593092"}],"event":{"name":"SIGMOD\/PODS'16: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"San Francisco California USA","acronym":"SIGMOD\/PODS'16"},"container-title":["Proceedings of the 2016 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2882908","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2882903.2882908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:28Z","timestamp":1750273468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2882908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":68,"alternative-id":["10.1145\/2882903.2882908","10.1145\/2882903"],"URL":"https:\/\/doi.org\/10.1145\/2882903.2882908","relation":{},"subject":[],"published":{"date-parts":[[2016,6,14]]},"assertion":[{"value":"2016-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}