{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:48Z","timestamp":1772164068220,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T00:00:00Z","timestamp":1402531200000},"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":[[2014,6,12]]},"DOI":"10.1145\/2602988.2602998","type":"proceedings-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T08:50:25Z","timestamp":1402390225000},"page":"35-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Sticky tries"],"prefix":"10.1145","author":[{"given":"Pramod G.","family":"Joisha","sequence":"first","affiliation":[{"name":"Hewlett-Packard, Palo Alto, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Mar.","author":"ADVANCED MICRO DEVICES INC","year":"2012","unstructured":"ADVANCED MICRO DEVICES , INC . AMD64 Architecture Programmer's Manual: System Programming (Vol. 2) , Mar. 2012 . ADVANCED MICRO DEVICES, INC. AMD64 Architecture Programmer's Manual: System Programming (Vol. 2), Mar. 2012."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/329.295"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90068-K"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380190206"},{"key":"e_1_3_2_1_5_1","first-page":"19","volume-title":"Proc. Linux Symposium (July","author":"ARCANGELI A.","year":"2009","unstructured":"ARCANGELI , A. , EIDUS , I. , AND WRIGHT , C. Increasing Memory Density by Using KSM . In Proc. Linux Symposium (July 2009 ), pp. 19 -- 28 . ARCANGELI, A., EIDUS, I., AND WRIGHT, C. Increasing Memory Density by Using KSM. In Proc. Linux Symposium (July 2009), pp. 19--28."},{"key":"e_1_3_2_1_6_1","volume-title":"Oct.","author":"BAGWELL P.","year":"2001","unstructured":"BAGWELL , P. Ideal Hash Trees. Research Report LAMP-REPORT- 2001-001, -- \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne , Oct. 2001 . BAGWELL, P. Ideal Hash Trees. Research Report LAMP-REPORT- 2001-001, -- \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Oct. 2001."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029873.1029891"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/512429.512452"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_10_1","volume-title":"Understanding the Linux Kernel","author":"BOVET D. P.","year":"2005","unstructured":"BOVET , D. P. , AND CESATI , M. Understanding the Linux Kernel , third ed. O'Reilly Media, Inc. , 2005 . BOVET, D. P., AND CESATI, M. Understanding the Linux Kernel, third ed. O'Reilly Media, Inc., 2005."},{"key":"e_1_3_2_1_11_1","first-page":"85","volume-title":"H. The Region Trap Library: Handling Traps on Application-Defined Regions of Memory. In Proc. USENIX Annual Technical Conference (June","author":"BRECHT T.","year":"1999","unstructured":"BRECHT , T. , AND SANDHU , H. The Region Trap Library: Handling Traps on Application-Defined Regions of Memory. In Proc. USENIX Annual Technical Conference (June 1999 ), pp. 85 -- 100 . BRECHT, T., AND SANDHU, H. The Region Trap Library: Handling Traps on Application-Defined Regions of Memory. In Proc. USENIX Annual Technical Conference (June 1999), pp. 85--100."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024393.1024421"},{"key":"e_1_3_2_1_13_1","first-page":"1","volume":"29","author":"CLEMENT J.","year":"2001","unstructured":"CLEMENT , J. , FLAJOLET , P. , AND VALL\u00c9E , B. Dynamical Sources in Information Theory: A General Analysis of Trie Structures. Algorithmica 29 , 1 -- 2 ( Feb. 2001 ), 307--369. CLEMENT, J., FLAJOLET, P., AND VALL\u00c9E, B. Dynamical Sources in Information Theory: A General Analysis of Trie Structures. Algorithmica 29, 1--2 (Feb. 2001), 307--369.","journal-title":"Dynamical Sources in Information Theory: A General Analysis of Trie Structures. Algorithmica"},{"key":"e_1_3_2_1_14_1","volume-title":"Introduction to Algorithms","author":"CORMEN T. H.","year":"2007","unstructured":"CORMEN , T. H. , LEISERSON , C. E. , RIVEST , R. L. , AND STEIN , C. Introduction to Algorithms , second ed. The MIT Press , 2007 . CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. Introduction to Algorithms, second ed. The MIT Press, 2007."},{"key":"e_1_3_2_1_15_1","first-page":"13","volume-title":"M. Concurrent Remembered Set Refinement in Generational Garbage Collection. In Proc. Java Virtual Machine Research and Technology Symposium (Aug.","author":"DETLEFS D.","year":"2002","unstructured":"DETLEFS , D. , KNIPPEL , R. , CLINGER , W. D. , AND JACOB , M. Concurrent Remembered Set Refinement in Generational Garbage Collection. In Proc. Java Virtual Machine Research and Technology Symposium (Aug. 2002 ), pp. 13 -- 26 . DETLEFS, D., KNIPPEL, R., CLINGER, W. D., AND JACOB, M. Concurrent Remembered Set Refinement in Generational Garbage Collection. In Proc. Java Virtual Machine Research and Technology Symposium (Aug. 2002), pp. 13--26."},{"key":"e_1_3_2_1_16_1","volume-title":"Feb.","author":"DICE D.","year":"2011","unstructured":"DICE , D. False Sharing Induced by Card Table Marking. At https:\/\/blogs.oracle.com\/dave\/entry\/false sharing induced by card , Feb. 2011 . DICE, D. False Sharing Induced by Card Table Marking. At https:\/\/blogs.oracle.com\/dave\/entry\/false sharing induced by card, Feb. 2011."},{"key":"e_1_3_2_1_17_1","first-page":"519","volume-title":"Proc. USENIX Winter Technical Conference (Jan.","author":"DOUGLIS F.","year":"1993","unstructured":"DOUGLIS , F. The Compression Cache: Using On-line Compression to Extend Physical Memory . In Proc. USENIX Winter Technical Conference (Jan. 1993 ), pp. 519 -- 529 . DOUGLIS, F. The Compression Cache: Using On-line Compression to Extend Physical Memory. In Proc. USENIX Winter Technical Conference (Jan. 1993), pp. 519--529."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/367390.367400"},{"key":"e_1_3_2_1_19_1","volume-title":"The GNU C++ Library Manual","author":"FREE SOFTWARE FOUNDATION","year":"2011","unstructured":"FREE SOFTWARE FOUNDATION . The GNU C++ Library Manual , 2011 . FREE SOFTWARE FOUNDATION. The GNU C++ Library Manual, 2011."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1621947.1621952"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/506309.506312"},{"key":"e_1_3_2_1_22_1","volume-title":"June","author":"HEWLETT-PACKARD COMPANY","year":"2001","unstructured":"HEWLETT-PACKARD COMPANY . Programming with Judy: C Language Judy Version 4.0 , June 2001 . Part Number: B6841--90001. HEWLETT-PACKARD COMPANY. Programming with Judy: C Language Judy Version 4.0, June 2001. Part Number: B6841--90001."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/141936.141946"},{"key":"e_1_3_2_1_24_1","volume-title":"Addendum to OOPSLA\/ECOOP'90 Proceedings (Oct.","author":"HUDSON R. L.","year":"1990","unstructured":"HUDSON , R. L. , AND DIWAN , A. Adaptive Garbage Collection for Modula-3 and Smalltalk . In Addendum to OOPSLA\/ECOOP'90 Proceedings (Oct. 1990 ), E. Jul and N.-C. Juul, Eds . HUDSON, R. L., AND DIWAN, A. Adaptive Garbage Collection for Modula-3 and Smalltalk. In Addendum to OOPSLA\/ECOOP'90 Proceedings (Oct. 1990), E. Jul and N.-C. Juul, Eds."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v33:2"},{"key":"e_1_3_2_1_26_1","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"KNUTH D. E.","year":"2011","unstructured":"KNUTH , D. E. The Art of Computer Programming: Sorting and Searching , second ed., vol. 3 . Addison-Wesley , 2011 . KNUTH, D. E. The Art of Computer Programming: Sorting and Searching, second ed., vol. 3. Addison-Wesley, 2011."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360258"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380240303"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"},{"key":"e_1_3_2_1_31_1","first-page":"1","volume":"5","author":"NEBEL","year":"2002","unstructured":"NEBEL , M. E. The Stack-Size of Combinatorial Tries Revisited. Discrete Mathematics and Theoretical Computer Science 5 , 1 ( 2002 ), 1--16. NEBEL, M. E. The Stack-Size of Combinatorial Tries Revisited. Discrete Mathematics and Theoretical Computer Science 5, 1 (2002), 1--16.","journal-title":"The Stack-Size of Combinatorial Tries Revisited. Discrete Mathematics and Theoretical Computer Science"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/070685531"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145836"},{"key":"e_1_3_2_1_34_1","first-page":"336","volume-title":"T. D. M. Compressing Tries for Storing Dictionaries. In Proc. Symposium on Applied Computing (Apr.","author":"PURDIN","year":"1990","unstructured":"PURDIN , T. D. M. Compressing Tries for Storing Dictionaries. In Proc. Symposium on Applied Computing (Apr. 1990 ), pp. 336 -- 340 . PURDIN, T. D. M. Compressing Tries for Storing Dictionaries. In Proc. Symposium on Applied Computing (Apr. 1990), pp. 336--340."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.42197"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815288"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","DOI":"10.21236\/ADA290169","volume-title":"A Lifetime-Based Garbage Collector for LISP Systems on General-Purpose Computers","author":"SOBALVARRO P. G.","year":"1988","unstructured":"SOBALVARRO , P. G. A Lifetime-Based Garbage Collector for LISP Systems on General-Purpose Computers , 1988 . BS thesis. SOBALVARRO, P. G. A Lifetime-Based Garbage Collector for LISP Systems on General-Purpose Computers, 1988. BS thesis."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/359863.359887"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/366552.366600"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359175"},{"key":"e_1_3_2_1_41_1","volume-title":"At https:\/\/ww w.kernel.org\/doc\/Documentation\/vm\/ksm.txt","year":"2009","unstructured":"How to Use the Kernel SamepageMerging Feature. At https:\/\/ww w.kernel.org\/doc\/Documentation\/vm\/ksm.txt , 2009 . How to Use the Kernel SamepageMerging Feature. At https:\/\/ww w.kernel.org\/doc\/Documentation\/vm\/ksm.txt, 2009."},{"key":"e_1_3_2_1_42_1","first-page":"237","volume-title":"T. Adaptive Main Memory Compression. In Proc. USENIX Annual Technical Conference (Apr.","author":"TUDUCE I. C.","year":"2005","unstructured":"TUDUCE , I. C. , AND GROSS , T. Adaptive Main Memory Compression. In Proc. USENIX Annual Technical Conference (Apr. 2005 ), pp. 237 -- 250 . TUDUCE, I. C., AND GROSS, T. Adaptive Main Memory Compression. In Proc. USENIX Annual Technical Conference (Apr. 2005), pp. 237--250."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950379"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/122167.122173"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147086"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2258996.2259004"}],"event":{"name":"ISMM '14: International Symposium on Memory Management","location":"Edinburgh United Kingdom","acronym":"ISMM '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2014 international symposium on Memory management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2602988.2602998","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2602988.2602998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:01:17Z","timestamp":1750215677000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2602988.2602998"}},"subtitle":["fast insertions, fast lookups, no deletions for large key universes"],"short-title":[],"issued":{"date-parts":[[2014,6,12]]},"references-count":46,"alternative-id":["10.1145\/2602988.2602998","10.1145\/2602988"],"URL":"https:\/\/doi.org\/10.1145\/2602988.2602998","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2775049.2602998","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,6,12]]},"assertion":[{"value":"2014-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}