{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:23:46Z","timestamp":1742999026900,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030276171"},{"type":"electronic","value":"9783030276188"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-27618-8_1","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Looking into the Peak Memory Consumption of Epoch-Based Reclamation in Scalable in-Memory Database Systems"],"prefix":"10.1007","author":[{"given":"Hitoshi","family":"Mitake","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Yamada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuo","family":"Nakajima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Leiserson, W., Matveev, A., Shavit, N.: Forkscan: conservative memory reclamation for modern operating systems. In: Proceedings of the Twelfth European Conference on Computer Systems, EuroSys 2017, pp. 483\u2013498 (2017)","DOI":"10.1145\/3064176.3064214"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Brown, T.A.: Reclaiming memory for lock-free data structures: there has to be a better way. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, pp. 261\u2013270 (2015)","DOI":"10.1145\/2767386.2767436"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with YCSB. In: Proceedings of the 1st ACM Symposium on Cloud Computing, SoCC 2010, pp. 143\u2013154 (2010)","DOI":"10.1145\/1807128.1807152"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Diaconu, C., et al.: Hekaton: SQL server\u2019s memory- optimized OLTP engine. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, pp. 1243\u20131254 (2013)","DOI":"10.1145\/2463676.2463710"},{"key":"1_CR5","unstructured":"Fraser, K.: Practical lock-freedom. Ph.D. thesis, Cambridge University. Technical Report UCAM-CL-TR-579 (2004)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Gidra, L., Thomas, G., Sopena, J., Shapiro, M.: A study of the scalability of stop-the-world garbage collectors on multicores. In: Proceedings of the Eighteenth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2013, pp. 229\u2013240 (2013)","DOI":"10.1145\/2499368.2451142"},{"issue":"12","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1016\/j.jpdc.2007.04.010","volume":"67","author":"TE Hart","year":"2007","unstructured":"Hart, T.E., McKenney, P.E., Brown, A.D., Walpole, J.: Performance of memory reclamation for lockless synchronization. J. Parallel Distrib. Comput. 67(12), 1270\u20131285 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR8","unstructured":"Jemalloc wiki: Use Case: Basic Allocator Statistics. https:\/\/goo.gl\/GdX1FB. Accessed 2 June 2019"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Kemper, A., Neumann, T.: HyPer: A hybrid OLTP & OLAP main memory database system based on virtual memory snapshots. In: Proceedings of the 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011, pp. 195\u2013206 (2011)","DOI":"10.1109\/ICDE.2011.5767867"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Kim, K., Wang, T., Johnson, R., Pandis, I.: ERMIA: Fast memory- optimized database system for heterogeneous workloads. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD 2016, pp. 1675\u20131687 (2016)","DOI":"10.1145\/2882903.2882905"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Lim, H., Kaminsky, M., Andersen, D.G.: Cicada: dependably fast multi-core in-memory transactions. In: Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD 2017, pp. 21\u201335 (2017)","DOI":"10.1145\/3035918.3064015"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Mao, Y., Kohler, E., Morris, R.T.: Cache craftiness for fast multicore key-value storage. In: Proceedings of the 7th ACM European Conference on Computer Systems, EuroSys 2012, pp. 183\u2013196 (2012)","DOI":"10.1145\/2168836.2168855"},{"key":"1_CR13","unstructured":"McKenney, P.E., Sarma, D., Arcangeli, A., Kleen, A., Krieger, O., Russell, R.: Read-copy update. In: Proceedings of Ottawa Linux Symposium (2002)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Mitake, H., Yamada, H., Nakajima, T.: Analyzing the tradeoff between throughput and latency in multicore scalable in-memory database systems. In: Proceedings of the 7th ACM SIGOPS Asia-Pacific Workshop on Systems, APSys 2016, pp. 17:1\u201317:9 (2016)","DOI":"10.1145\/2967360.2967361"},{"key":"1_CR15","first-page":"210","volume-title":"Intelligent Distributed Computing XIII","author":"Hitoshi Mitake","year":"2019","unstructured":"Mitake, H., Yamada, H., Nakajima, T.: A highly scalable index structure for multicore in-memory database systems. In: Proceedings of the International Conference on the 13th International Symposium on Intelligent Distributed Computing (2019)"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/2806887","volume":"33","author":"J Ousterhout","year":"2015","unstructured":"Ousterhout, J., et al.: The RAMCloud storage system. ACM Trans. Comput. Syst. 33(3), 7:1\u20137:55 (2015)","journal-title":"ACM Trans. Comput. Syst."},{"key":"1_CR17","unstructured":"McKenney, P.E.: Is parallel programming hard, and, if so, what can you do about it? https:\/\/goo.gl\/THnFNb. Accessed 24 Aug 2018"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Prasad, A., Gopinath, K.: Prudent memory reclamation in procrastination-based synchronization. In: Proceedings of the 21st International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 99\u2013112 (2016)","DOI":"10.1145\/2954680.2872405"},{"key":"1_CR19","unstructured":"Scalable memory allocation using jemalloc. https:\/\/goo.gl\/skcwvS. Accessed 24 Aug 2018"},{"key":"1_CR20","unstructured":"Silo. https:\/\/github.com\/stephentu\/silo. Accessed 2 June 2019"},{"key":"1_CR21","unstructured":"Stonebraker, M., Madden, S., Abadi, D.J., Harizopoulos, S., Hachem, N., Helland, P.: The end of an architectural era: (it\u2019s time for a complete rewrite). In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 1150\u20131160 (2007)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Tu, S., Zheng, W., Kohler, E., Liskov, B., Madden, S.: Speedy transactions in multicore in-memory databases. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP 2013, pp. 18\u201332 (2013)","DOI":"10.1145\/2517349.2522713"},{"issue":"7","key":"1_CR23","doi-asserted-by":"publisher","first-page":"781","DOI":"10.14778\/3067421.3067427","volume":"10","author":"Y Wu","year":"2017","unstructured":"Wu, Y., Arulraj, J., Lin, J., Xian, R., Pavlo, A.: An empirical evaluation of in-memory multi-version concurrency control. Proc. VLDB Endow. 10(7), 781\u2013792 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"1_CR24","unstructured":"https:\/\/www.samsung.com\/semiconductor\/global.semi.static\/Data_Processing_with_Samsung_Advanced_DRAM_and_SSD_Solutions_Whitepaper-0.pdf. Accessed 2 2019"},{"key":"1_CR25","unstructured":"https:\/\/aws.amazon.com\/ec2\/instance-types\/high-memory\/?nc1=h_ls. Accessed 2 June 2019"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27618-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:27:45Z","timestamp":1710350865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27618-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030276171","9783030276188"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27618-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Linz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mixed (Single-blind and Double-blind)","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfDriver","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","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":"32","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":"34","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":"20% - 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":"4-6","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":"3-4","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)"}}]}}