{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T10:58:57Z","timestamp":1756897137902,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030576745"},{"type":"electronic","value":"9783030576752"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57675-2_29","type":"book-chapter","created":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T23:12:33Z","timestamp":1597705953000},"page":"458-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Compression-Based Design for Higher Throughput in a Lock-Free Hash Map"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3745-5845","authenticated-orcid":false,"given":"Pedro","family":"Moreno","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1589-3174","authenticated-orcid":false,"given":"Miguel","family":"Areias","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4502-8835","authenticated-orcid":false,"given":"Ricardo","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-48518-X_18","volume-title":"Algorithm Engineering and Experimentation","author":"A Acharya","year":"1999","unstructured":"Acharya, A., Zhu, H., Shen, K.: Adaptive algorithms for cache-efficient trie search. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol. 1619, pp. 300\u2013315. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48518-X_18"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Areias, M., Rocha, R.: Towards a lock-free, fixed size and persistent hash map design. In: International Symposium on Computer Architecture and High Performance Computing, pp. 145\u2013152. IEEE (2017)","DOI":"10.1109\/SBAC-PAD.2017.26"},{"key":"29_CR3","unstructured":"Bagwell, P.: Ideal hash trees. Es Grands Champs 1195 (2001)"},{"key":"29_CR4","unstructured":"Brown, T.: Techniques for Constructing Efficient Lock-free Data Structures. Ph.D. thesis, University of Toronto (2017)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Evans, J.: Tick tock, malloc needs a clock. In: Applicative 2015. ACM, New York, NY, USA (2015)","DOI":"10.1145\/2742580.2742807"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1962","unstructured":"Fredkin, E.: Trie memory. Commun. ACM 3, 490\u2013499 (1962)","journal-title":"Commun. ACM"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Grossi, R., Ottaviano, G.: Fast compressed tries through path decompositions. J. Exp. Algorithmics 19 (2015)","DOI":"10.1145\/2656332"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Wing, J.M.: Axioms for concurrent objects. In: ACM Symposium on Principles of Programming Languages, pp. 13\u201326. ACM (1987)","DOI":"10.1145\/41625.41627"},{"key":"29_CR9","volume-title":"The Art of Computer Programming: Volume 3: Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming: Volume 3: Sorting and Searching, 2nd edn. Addison-Wesley, Upper Saddle River (1998)","edition":"2"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Li, X., Andersen, D.G., Kaminsky, M., Freedman, M.J.: Algorithmic improvements for fast concurrent cuckoo hashing. In: Proceedings of the Ninth European Conference on Computer Systems, EuroSys \u201914. ACM (2014)","DOI":"10.1145\/2592798.2592820"},{"key":"29_CR11","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035179","volume-title":"Handbook of Data Structures and Applications","author":"DP Mehta","year":"2004","unstructured":"Mehta, D.P., Sahni, S.: Handbook of Data Structures and Applications. Chapman & Hall, London (2004)"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Moreno, P., Areias, M., Rocha, R.: Memory reclamation methods for lock-free hash tries. In: International Symposium on Computer Architecture and High Performance Computing, pp. 188\u2013195. IEEE (2019)","DOI":"10.1109\/SBAC-PAD.2019.00039"},{"key":"29_CR13","doi-asserted-by":"publisher","unstructured":"Moreno, P., Areias, M., Rocha, R.: Artifact and instructions to generate experimental results for conference proceeding 2020 paper: a compression-based design for higher throughput in a lock-free hash map (July 2020). https:\/\/doi.org\/10.6084\/m9.figshare.12560228. https:\/\/springernature.figshare.com\/articles\/software\/Artifactandinstructionstogenerateexperimentalresultsforconferenceproceeding2020paperACompression-BasedDesignforHigherThroughputinaLock-FreeHashMap\/12560228\/1","DOI":"10.6084\/m9.figshare.12560228"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Prokopec, A.: Cache-tries: concurrent lock-free hash tries with constant-time operations. In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 137\u2013151. ACM (2018)","DOI":"10.1145\/3200691.3178498"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Prokopec, A., Bronson, N.G., Bagwell, P., Odersky, M.: Concurrent tries with efficient non-blocking snapshots. In: ACM Symposium on Principles and Practice of Parallel Programming, pp. 151\u2013160. ACM (2012)","DOI":"10.1145\/2370036.2145836"},{"key":"29_CR16","volume-title":"Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism","author":"J Reinders","year":"2007","unstructured":"Reinders, J.: Intel Threading Building Blocks: Outfitting C++ for Multi-core Processor Parallelism. O\u2019Reilly, Sebastopol (2007)"},{"issue":"2","key":"29_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0022-0000(86)90021-8","volume":"33","author":"Y Sagiv","year":"1986","unstructured":"Sagiv, Y.: Concurrent operations on B*-trees with overtaking. J. Comput. Syst. Sci. 33(2), 275\u2013296 (1986)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2020: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57675-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,18]],"date-time":"2024-08-18T00:04:43Z","timestamp":1723939483000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57675-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030576745","9783030576752"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57675-2_29","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":"18 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The datasets and code generated during and\/or analysed during the current study are available in the Figshare repository: \n[].","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data Availability Statement"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2020.euro-par.org\/","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":"158","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":"39","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":"0","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":"25% - 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","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":"2.5","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)"}},{"value":"The conference was held virtually due to the coronavirus pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}