{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:45:19Z","timestamp":1761324319045,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030602444"},{"type":"electronic","value":"9783030602451"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60245-1_2","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T08:06:00Z","timestamp":1601453160000},"page":"15-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Sorting and Join on NVM-Based Hybrid Memory"],"prefix":"10.1007","author":[{"given":"Yongping","family":"Luo","sequence":"first","affiliation":[]},{"given":"Zhaole","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Peiquan","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Shouhong","family":"Wan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,29]]},"reference":[{"key":"2_CR1","volume-title":"Database System Implementation","author":"H Garcia-Molina","year":"2010","unstructured":"Garcia-Molina, H., Ullman, J.D., Widom, J.: Database System Implementation, 2nd edn. Prentice Hall, Upper Saddle River (2010)","edition":"2"},{"issue":"1\u20132","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1900000058","volume":"8","author":"F Faerber","year":"2017","unstructured":"Faerber, F., Kemper, A., Larson, P., Levandoski, J.J., Neumann, T., Pavlo, A.: Main memory database systems. Found. Trends Databases 8(1\u20132), 1\u2013130 (2017)","journal-title":"Found. Trends Databases"},{"key":"2_CR3","unstructured":"Renen, A., et al.: Managing non-volatile memory in database systems. In: SIGMOD, pp. 1541\u20131555 (2018)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Psaropoulos, G., Oukid, I., Legler, T., May, N., Ailamaki, A.: Bridging the latency gap between NVM and DRAM for latency-bound operations. In: DaMoN, 13:1\u201313:8 (2019)","DOI":"10.1145\/3329785.3329917"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-662-44917-2_10","volume-title":"Network and Parallel Computing","author":"K Chen","year":"2014","unstructured":"Chen, K., Jin, P., Yue, L.: A novel page replacement algorithm for the hybrid memory architecture involving PCM and DRAM. In: Hsu, C.-H., Shi, X., Salapura, V. (eds.) NPC 2014. LNCS, vol. 8707, pp. 108\u2013119. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44917-2_10"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-319-63564-4_27","volume-title":"Web and Big Data","author":"D Zhang","year":"2017","unstructured":"Zhang, D., Jin, P., Wang, X., Yang, C., Yue, L.: DPHSim: a flexible simulator for DRAM\/PCM-based hybrid memory. In: Chen, L., Jensen, C.S., Shahabi, C., Yang, X., Lian, X. (eds.) APWeb-WAIM 2017. LNCS, vol. 10367, pp. 319\u2013323. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63564-4_27"},{"issue":"5","key":"2_CR7","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00778-015-0406-1","volume":"25","author":"P Jin","year":"2016","unstructured":"Jin, P., Yang, C., Jensen, C.S., Yang, P., Yue, L.: Read\/write-optimized tree indexing for solid-state drives. VLDB J. 25(5), 695\u2013717 (2016)","journal-title":"VLDB J."},{"key":"2_CR8","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen, T., Leiserson, C., Rivest, R., et al.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"issue":"1","key":"2_CR9","first-page":"307","volume":"65-I","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Li, K., Zhang, J., Li, K.: Energy optimization for data allocation with hybrid SRAM+NVM SPM. IEEE Trans. Circ. Syst. 65-I(1), 307\u2013318 (2018)","journal-title":"IEEE Trans. Circ. Syst."},{"issue":"8","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1109\/TC.2019.2906597","volume":"68","author":"R Salkhordeh","year":"2019","unstructured":"Salkhordeh, R., Mutlu, O., Asadi, H.: An analytical model for performance and lifetime estimation of hybrid DRAM-NVM main memories. IEEE Trans. Comput. 68(8), 1114\u20131130 (2019)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-46922-5_28","volume-title":"Databases Theory and Applications","author":"L Li","year":"2016","unstructured":"Li, L., Jin, P., Yang, C., Wan, S., Yue, L.: XB+-tree: a novel index for PCM\/DRAM-based hybrid memory. In: Cheema, M.A., Zhang, W., Chang, L. (eds.) ADC 2016. LNCS, vol. 9877, pp. 357\u2013368. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46922-5_28"},{"key":"2_CR12","unstructured":"Chen, S., Gibbons, P.B., Nath, S.: Rethinking database algorithms for phase change memory. In: CIDR (2011)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Viglas, S.: Adapting the B+-tree for asymmetric I\/O. In: ADBIS, pp. 399\u2013412 (2012)","DOI":"10.1007\/978-3-642-33074-2_30"},{"issue":"5","key":"2_CR14","doi-asserted-by":"publisher","first-page":"413","DOI":"10.14778\/2732269.2732277","volume":"7","author":"S Viglas","year":"2014","unstructured":"Viglas, S.: Write-limited sorts and joins for persistent memory. Proc. VLDB Endow. 7(5), 413\u2013424 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Fineman, J.T., Gibbons, P.B., Gu, Y., Shun, J.: Sorting with asymmetric read and write costs. In: SPAA, pp. 1\u201312 (2015)","DOI":"10.1145\/2755573.2755604"},{"key":"2_CR16","unstructured":"OFTC: Persistent Memory Development Kit, 25 March 2020. \nhttps:\/\/pmem.io\/pmdk\/"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Volos, H., Tack, A.J., Swift, M.M.: Mnemosyne: lightweight persistent memory. In: ASPLOS, pp. 91\u2013104 (2011)","DOI":"10.1145\/1961296.1950379"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-662-44917-2_8","volume-title":"Network and Parallel Computing","author":"Z Wu","year":"2014","unstructured":"Wu, Z., Jin, P., Yang, C., Yue, L.: APP-LRU: a new page replacement method for PCM\/DRAM-based hybrid memory systems. In: Hsu, C.-H., Shi, X., Salapura, V. (eds.) NPC 2014. LNCS, vol. 8707, pp. 84\u201395. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44917-2_8"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-15576-5_33","volume-title":"Advances in Databases and Information Systems","author":"Y Ou","year":"2010","unstructured":"Ou, Y., H\u00e4rder, T., Jin, P.: CFDC: a flash-aware buffer management algorithm for database systems. In: Catania, B., Ivanovi\u0107, M., Thalheim, B. (eds.) ADBIS 2010. LNCS, vol. 6295, pp. 435\u2013449. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15576-5_33"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Yang, L., Jin, P., Wan, S.: BF-join: an efficient hash join algorithm for DRAM-NVM-based hybrid memory systems. In: ISPA, pp. 875\u2013882 (2019)","DOI":"10.1109\/ISPA-BDCloud-SustainCom-SocialCom48970.2019.00128"},{"issue":"3","key":"2_CR21","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10619-014-7157-7","volume":"33","author":"P Jin","year":"2015","unstructured":"Jin, P., Yang, P., Yue, L.: Optimizing B+-tree for hybrid storage systems. Distrib. Parallel Databases 33(3), 449\u2013475 (2015)","journal-title":"Distrib. Parallel Databases"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60245-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T08:12:06Z","timestamp":1601453526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-60245-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030602444","9783030602451"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60245-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cloud-conf.net\/ica3pp2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"495","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"142","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"305","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}