{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:06Z","timestamp":1772164026047,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,11]]},"DOI":"10.1145\/3192366.3192420","type":"proceedings-article","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T08:16:01Z","timestamp":1528791361000},"page":"283-295","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["To-many or to-one? all-in-one! efficient purely functional multi-maps with type-heterogeneous hash-tries"],"prefix":"10.1145","author":[{"given":"Michael J.","family":"Steindorfer","sequence":"first","affiliation":[{"name":"Delft University of Technology, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurgen J.","family":"Vinju","sequence":"additional","affiliation":[{"name":"CWI, Netherlands \/ Eindhoven University of Technology, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Ullman","author":"Aho Alfred V.","year":"1986","unstructured":"Alfred V. Aho , Ravi Sethi , and Jeffrey D . Ullman . 1986 . Compilers : Principles, Techniques, and Tools. Addison-Wesley . Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley."},{"key":"e_1_3_2_2_4_1","volume-title":"Storage Strategies for Collections in Dynamically Typed Languages. In OOPSLA '13","author":"Bolz Carl Friedrich","year":"2013","unstructured":"Carl Friedrich Bolz , Lukas Diekmann , and Laurence Tratt . 2013 . Storage Strategies for Collections in Dynamically Typed Languages. In OOPSLA '13 . ACM. Carl Friedrich Bolz, Lukas Diekmann, and Laurence Tratt. 2013. Storage Strategies for Collections in Dynamically Typed Languages. In OOPSLA '13. ACM."},{"key":"e_1_3_2_2_5_1","volume-title":"File Searching Using Variable Length Keys. In IRE-AIEE-ACM '59 (Western). ACM.","author":"de la Briandais Rene","year":"1959","unstructured":"Rene de la Briandais . 1959 . File Searching Using Variable Length Keys. In IRE-AIEE-ACM '59 (Western). ACM. Rene de la Briandais. 1959. File Searching Using Variable Length Keys. In IRE-AIEE-ACM '59 (Western). ACM."},{"key":"e_1_3_2_2_6_1","volume-title":"Making Data Structures Persistent. In STOC '86","author":"Driscoll James R.","unstructured":"James R. Driscoll , Neil Sarnak , Daniel D. Sleator , and Robert E. Tarjan . 1986 . Making Data Structures Persistent. In STOC '86 . ACM. James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan. 1986. Making Data Structures Persistent. In STOC '86. ACM."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Edward Fredkin. 1960. Trie Memory. Commun. ACM 3 9 (1960).   Edward Fredkin. 1960. Trie Memory. Commun. ACM 3 9 (1960).","DOI":"10.1145\/367390.367400"},{"key":"e_1_3_2_2_8_1","volume-title":"Statistically Rigorous Java Performance Evaluation. In OOPSLA '07","author":"Georges Andy","year":"2007","unstructured":"Andy Georges , Dries Buytaert , and Lieven Eeckhout . 2007 . Statistically Rigorous Java Performance Evaluation. In OOPSLA '07 . ACM. Andy Georges, Dries Buytaert, and Lieven Eeckhout. 2007. Statistically Rigorous Java Performance Evaluation. In OOPSLA '07. ACM."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00119"},{"key":"e_1_3_2_2_10_1","volume-title":"Smaller Footprint for Java Collections. In ECOOP '12","author":"Gil Joseph","year":"2012","unstructured":"Joseph Gil and Yuval Shimron . 2012 . Smaller Footprint for Java Collections. In ECOOP '12 . Springer-Verlag. Joseph Gil and Yuval Shimron. 2012. Smaller Footprint for Java Collections. In ECOOP '12. Springer-Verlag."},{"key":"e_1_3_2_2_11_1","volume-title":"Monocopy and Associative Algorithms in Extended Lisp","author":"Goto Eiichi","unstructured":"Eiichi Goto . 1974. Monocopy and Associative Algorithms in Extended Lisp . University of Toyko . Technical Report. Eiichi Goto. 1974. Monocopy and Associative Algorithms in Extended Lisp. University of Toyko. Technical Report."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596527.1596528"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR-WCRE.2014.6747217"},{"key":"e_1_3_2_2_14_1","volume-title":"On Variance-Based Subtyping for Parametric Types. In ECOOP '02","author":"Igarashi Atsushi","year":"2002","unstructured":"Atsushi Igarashi and Mirko Viroli . 2002 . On Variance-Based Subtyping for Parametric Types. In ECOOP '02 . Springer-Verlag. Atsushi Igarashi and Mirko Viroli. 2002. On Variance-Based Subtyping for Parametric Types. In ECOOP '02. Springer-Verlag."},{"key":"e_1_3_2_2_15_1","volume-title":"Rigorous Benchmarking in Reasonable Time. In ISMM '13","author":"Kalibera Tomas","year":"2013","unstructured":"Tomas Kalibera and Richard Jones . 2013 . Rigorous Benchmarking in Reasonable Time. In ISMM '13 . ACM. Tomas Kalibera and Richard Jones. 2013. Rigorous Benchmarking in Reasonable Time. In ISMM '13. ACM."},{"key":"e_1_3_2_2_16_1","volume-title":"ICDE '13","author":"Leis V.","unstructured":"V. Leis , A. Kemper , and T. Neumann . 2013. The adaptive radix tree: ARTful indexing for main-memory databases . In ICDE '13 . V. Leis, A. Kemper, and T. Neumann. 2013. The adaptive radix tree: ARTful indexing for main-memory databases. In ICDE '13."},{"key":"e_1_3_2_2_17_1","volume-title":"Purely Functional Data Structures","author":"Okasaki Chris","unstructured":"Chris Okasaki . 1999. Purely Functional Data Structures . Cambridge University Press . Chris Okasaki. 1999. Purely Functional Data Structures. Cambridge University Press."},{"key":"e_1_3_2_2_18_1","article-title":"The Haskell 98 Language and Libraries","volume":"13","author":"Jones Simon Peyton","year":"2003","unstructured":"Simon Peyton Jones . 2003 . The Haskell 98 Language and Libraries . Journal of Functional Programming 13 , 1 (2003). Simon Peyton Jones. 2003. The Haskell 98 Language and Libraries. Journal of Functional Programming 13, 1 (2003).","journal-title":"Journal of Functional Programming"},{"key":"e_1_3_2_2_19_1","volume-title":"Proc. ACM Program. Lang. 1, ICFP, Article 16","author":"Bolivar Puente Juan Pedro","year":"2017","unstructured":"Juan Pedro Bolivar Puente . 2017 . Persistence for the Masses: RRB-vectors in a Systems Language . Proc. ACM Program. Lang. 1, ICFP, Article 16 (2017). Juan Pedro Bolivar Puente. 2017. Persistence for the Masses: RRB-vectors in a Systems Language. Proc. ACM Program. Lang. 1, ICFP, Article 16 (2017)."},{"key":"e_1_3_2_2_20_1","volume-title":"Tarjan","author":"Sarnak Neil","year":"1986","unstructured":"Neil Sarnak and Robert E . Tarjan . 1986 . Planar Point Location Using Persistent Search Trees. Communications of the ACM 29, 7 (1986). Neil Sarnak and Robert E. Tarjan. 1986. Planar Point Location Using Persistent Search Trees. Communications of the ACM 29, 7 (1986)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2903142"},{"key":"e_1_3_2_2_23_1","volume-title":"GPCE '14","author":"Michael","unstructured":"Michael J. Steindorfer and Jurgen J. Vinju. 2014. Code Specialization for Memory Efficient Hash Tries (Short Paper) . In GPCE '14 . ACM. Michael J. Steindorfer and Jurgen J. Vinju. 2014. Code Specialization for Memory Efficient Hash Tries (Short Paper). In GPCE '14. ACM."},{"key":"e_1_3_2_2_24_1","volume-title":"Optimizing Hasharray Mapped Tries for Fast and Lean Immutable JVM Collections. In OOPSLA '15","author":"Michael","unstructured":"Michael J. Steindorfer and Jurgen J. Vinju. 2015 . Optimizing Hasharray Mapped Tries for Fast and Lean Immutable JVM Collections. In OOPSLA '15 . ACM. Michael J. Steindorfer and Jurgen J. Vinju. 2015. Optimizing Hasharray Mapped Tries for Fast and Lean Immutable JVM Collections. In OOPSLA '15. ACM."},{"key":"e_1_3_2_2_25_1","volume-title":"GPCE '16","author":"Michael","unstructured":"Michael J. Steindorfer and Jurgen J. Vinju. 2016. Towards a Software Product Line of Trie-based Collections . In GPCE '16 . ACM. Michael J. Steindorfer and Jurgen J. Vinju. 2016. Towards a Software Product Line of Trie-based Collections. In GPCE '16. ACM."},{"key":"e_1_3_2_2_26_1","volume-title":"RRB Vector: A Practical General Purpose Immutable Sequence. In ICFP '15","author":"Stucki Nicolas","year":"2015","unstructured":"Nicolas Stucki , Tiark Rompf , Vlad Ureche , and Phil Bagwell . 2015 . RRB Vector: A Practical General Purpose Immutable Sequence. In ICFP '15 . ACM. Nicolas Stucki, Tiark Rompf, Vlad Ureche, and Phil Bagwell. 2015. RRB Vector: A Practical General Purpose Immutable Sequence. In ICFP '15. ACM."},{"key":"e_1_3_2_2_27_1","volume-title":"Clojure Cookbook: Recipes for Functional Programming","author":"VanderHart L.","year":"2014","unstructured":"L. VanderHart and R. Neufeld . 2014 . Clojure Cookbook: Recipes for Functional Programming . O'Reilly Media . L. VanderHart and R. Neufeld. 2014. Clojure Cookbook: Recipes for Functional Programming. O'Reilly Media."},{"key":"e_1_3_2_2_28_1","volume-title":"POPL '89","author":"Wadler P.","unstructured":"P. Wadler and S. Blott . 1989. How to Make Ad-hoc Polymorphism Less Ad Hoc . In POPL '89 . ACM. P. Wadler and S. Blott. 1989. How to Make Ad-hoc Polymorphism Less Ad Hoc. In POPL '89. ACM."}],"event":{"name":"PLDI '18: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Philadelphia PA USA","acronym":"PLDI '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3192366.3192420","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3192366.3192420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:07:54Z","timestamp":1750198074000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3192366.3192420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":25,"alternative-id":["10.1145\/3192366.3192420","10.1145\/3192366"],"URL":"https:\/\/doi.org\/10.1145\/3192366.3192420","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3296979.3192420","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}