{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:05Z","timestamp":1750221125972,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"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":[[2019,6,25]]},"DOI":"10.1145\/3299869.3319870","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"1207-1222","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Hyperion"],"prefix":"10.1145","author":[{"given":"Markus","family":"M\u00e4sker","sequence":"first","affiliation":[{"name":"Johannes Gutenberg University Mainz, Mainz, Germany"}]},{"given":"Tim","family":"S\u00fc\u00df","sequence":"additional","affiliation":[{"name":"University of Applied Science Fulda, Fulda, Germany"}]},{"given":"Lars","family":"Nagel","sequence":"additional","affiliation":[{"name":"Loughborough University, Loughborough, United Kingdom"}]},{"given":"Lingfang","family":"Zeng","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}]},{"given":"Andr\u00e9","family":"Brinkmann","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg University Mainz, Mainz, Germany"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Western Joint Computer Conference (Proceedings of the USSR Academy of Sciences (in Russian)). Soviet Math. Doklady, 1259 -- 1263","author":"Adelson-Velsky Georgy","year":"1962","unstructured":"Georgy Adelson-Velsky and Evgenii Landis . 1962 . An algorithm for the organization of information. In Papers Presented at the the March 3--5, 1959 , Western Joint Computer Conference (Proceedings of the USSR Academy of Sciences (in Russian)). Soviet Math. Doklady, 1259 -- 1263 . Georgy Adelson-Velsky and Evgenii Landis. 1962. An algorithm for the organization of information. In Papers Presented at the the March 3--5, 1959, Western Joint Computer Conference (Proceedings of the USSR Academy of Sciences (in Russian)). Soviet Math. Doklady, 1259 -- 1263."},{"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.1109\/ICDE.2015.7113370"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC). Ballarat","author":"Askitis Nikolas","year":"2007","unstructured":"Nikolas Askitis and Ranjan Sinha . 2007 . HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings . In Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC). Ballarat , Victoria, Australia, 97--105. http:\/\/crpit.com\/abstracts\/CRPITV62Askitis.html Nikolas Askitis and Ranjan Sinha. 2007. HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings. In Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC). Ballarat, Victoria, Australia, 97--105. http:\/\/crpit.com\/abstracts\/CRPITV62Askitis.html"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0183-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254766"},{"key":"e_1_3_2_1_7_1","unstructured":"Doug Baskins. 2002. A 10-minute description of how Judy arrays work and why they are so fast. http:\/\/judy.sourceforge.net\/doc\/10minutes.htm.  Doug Baskins. 2002. A 10-minute description of how Judy arrays work and why they are so fast. http:\/\/judy.sourceforge.net\/doc\/10minutes.htm."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289509"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196896"},{"key":"e_1_3_2_1_11_1","volume-title":"Ulrike Fischer, Dirk Habich, and Wolfgang Lehner.","author":"B\u00f6hm Matthias","year":"2011","unstructured":"Matthias B\u00f6hm , Benjamin Schlegel , Peter Benjamin Volk , Ulrike Fischer, Dirk Habich, and Wolfgang Lehner. 2011 . Efficient In-Memory Indexing with Generalized Prefix Trees. In Datenbanksysteme f\u00fcr Business, Technologie und Web (BTW), 14. Fachtagung des GI-Fachbereichs \"Datenbanken und Informationssysteme\" (DBIS). Kaiserslautern, Germany , 227--246. http:\/\/subs.emis.de\/LNI\/Proceedings\/Proceedings180\/ article22.html Matthias B\u00f6hm, Benjamin Schlegel, Peter Benjamin Volk, Ulrike Fischer, Dirk Habich, and Wolfgang Lehner. 2011. Efficient In-Memory Indexing with Generalized Prefix Trees. In Datenbanksysteme f\u00fcr Business, Technologie und Web (BTW), 14. Fachtagung des GI-Fachbereichs \"Datenbanken und Informationssysteme\" (DBIS). Kaiserslautern, Germany, 227--246. http:\/\/subs.emis.de\/LNI\/Proceedings\/Proceedings180\/ article22.html"},{"volume-title":"Redis in Action","author":"Carlson Josiah L","key":"e_1_3_2_1_12_1","unstructured":"Josiah L Carlson . 2013. Redis in Action . Manning Publications . Josiah L Carlson. 2013. Redis in Action. Manning Publications."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2474"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/320083.320102"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/319587.319618"},{"key":"e_1_3_2_1_16_1","unstructured":"Armon Dadgar. 2017. Adaptive Radix Tree Implementation version 0.9.8. https:\/\/github.com\/armon\/libart.  Armon Dadgar. 2017. Adaptive Radix Tree Implementation version 0.9.8. https:\/\/github.com\/armon\/libart."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1457838.1457895"},{"key":"e_1_3_2_1_18_1","unstructured":"Jason Evans. 2006. A scalable concurrent malloc(3) implementation for FreeBSD. (BSDCan - The Technical BSD Conference).  Jason Evans. 2006. A scalable concurrent malloc(3) implementation for FreeBSD. (BSDCan - The Technical BSD Conference)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/367390.367400"},{"key":"e_1_3_2_1_20_1","unstructured":"Sanjay Ghemawat and Paul Menage. 2005. TCMalloc: Thread-Caching Malloc. http:\/\/goog-perftools.sourceforge.net\/doc\/tcmalloc.html.  Sanjay Ghemawat and Paul Menage. 2005. TCMalloc: Thread-Caching Malloc. http:\/\/goog-perftools.sourceforge.net\/doc\/tcmalloc.html."},{"key":"e_1_3_2_1_21_1","unstructured":"Wolfram Gloger. 2006. Ptmalloc. http:\/\/www.malloc.de\/en.  Wolfram Gloger. 2006. Ptmalloc. http:\/\/www.malloc.de\/en."},{"key":"e_1_3_2_1_22_1","unstructured":"Google. 2013. Google Books Ngram Dataset Version 2 (CC BY 3.0). http:\/\/storage.googleapis.com\/books\/ngrams\/books\/datasetsv2.html.  Google. 2013. Google Books Ngram Dataset Version 2 (CC BY 3.0). http:\/\/storage.googleapis.com\/books\/ngrams\/books\/datasetsv2.html."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656370"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983358"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/506309.506312"},{"key":"e_1_3_2_1_26_1","unstructured":"Hewlett-Packard. 2004. Judy Arrays Implementation version 1.0.5. https:\/\/sourceforge.net\/projects\/judy\/.  Hewlett-Packard. 2004. Judy Arrays Implementation version 1.0.5. https:\/\/sourceforge.net\/projects\/judy\/."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321108"},{"key":"e_1_3_2_1_28_1","unstructured":"Daniel C. Jones. 2017. HAT-trie Implementation version 0.1.2. https: \/\/github.com\/dcjones\/hat-trie.  Daniel C. Jones. 2017. HAT-trie Implementation version 0.1.2. https: \/\/github.com\/dcjones\/hat-trie."},{"volume-title":"Memcached Design on High Performance RDMA Capable Interconnects. In International Conference on Parallel Processing (ICPP)","author":"Jose Jithin","key":"e_1_3_2_1_29_1","unstructured":"Jithin Jose , Hari Subramoni , Miao Luo , Minjia Zhang , Jian Huang , Md. Wasi-ur- Rahman , Nusrat S. Islam , Xiangyong Ouyang , Hao Wang , Sayantan Sur , and Dhabaleswar K. Panda . 2011 . Memcached Design on High Performance RDMA Capable Interconnects. In International Conference on Parallel Processing (ICPP) , Taipei, Taiwan, September 13--16. 743--752. Jithin Jose, Hari Subramoni, Miao Luo, Minjia Zhang, Jian Huang, Md. Wasi-ur-Rahman, Nusrat S. Islam, Xiangyong Ouyang, Hao Wang, Sayantan Sur, and Dhabaleswar K. Panda. 2011. Memcached Design on High Performance RDMA Capable Interconnects. In International Conference on Parallel Processing (ICPP), Taipei, Taiwan, September 13--16. 743--752."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807206"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2236584.2236587"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2017.201"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360258"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"e_1_3_2_1_36_1","volume-title":"Computation of Traffic Time Series for Large Populations of IoT Devices. Sensors 19, 1","author":"Daniel Morato Mikel Izal","year":"2018","unstructured":"Mikel Izal Daniel Morato , Eduardo Magana , and Santiago Garcia- Jimenez . 2018. Computation of Traffic Time Series for Large Populations of IoT Devices. Sensors 19, 1 ( 2018 ). Mikel Izal Daniel Morato, Eduardo Magana, and Santiago Garcia- Jimenez. 2018. Computation of Traffic Time Series for Large Populations of IoT Devices. Sensors 19, 1 (2018)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"},{"key":"e_1_3_2_1_38_1","volume-title":"Proceedings of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Nishtala Rajesh","year":"2013","unstructured":"Rajesh Nishtala , Hans Fugal , Steven Grimm , Marc Kwiatkowski , Herman Lee , Harry C. Li , Ryan McElroy , Mike Paleczny , Daniel Peek , Paul Saab , David Stafford , Tony Tung , and Venkateshwaran Venkataramani . 2013 . Scaling Memcache at Facebook . In Proceedings of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI) , Lombard, IL, USA, April 2--5. 385--398. Rajesh Nishtala, Hans Fugal, Steven Grimm, Marc Kwiatkowski, Herman Lee, Harry C. Li, Ryan McElroy, Mike Paleczny, Daniel Peek, Paul Saab, David Stafford, Tony Tung, and Venkateshwaran Venkataramani. 2013. Scaling Memcache at Facebook. In Proceedings of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI), Lombard, IL, USA, April 2--5. 385--398."},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of the Usenix","author":"Ousterhout John K.","year":"1990","unstructured":"John K. Ousterhout . 1990 . Why Aren't Operating Systems Getting Faster As Fast as Hardware? . In Proceedings of the Usenix Summer 1990 Technical Conference. Usenix, Anaheim, California, USA, 247--256. John K. Ousterhout. 1990. Why Aren't Operating Systems Getting Faster As Fast as Hardware?. In Proceedings of the Usenix Summer 1990 Technical Conference. Usenix, Anaheim, California, USA, 247--256."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/62032.77249"},{"key":"e_1_3_2_1_41_1","volume-title":"Proceedings of 25th International Conference on Very Large Data Bases (VLDB)","author":"Rao Jun","year":"1999","unstructured":"Jun Rao and Kenneth A. Ross . 1999. Cache Conscious Indexing for Decision-Support in Main Memory . In Proceedings of 25th International Conference on Very Large Data Bases (VLDB) . Edinburgh, Scotland, UK, 78--89. http:\/\/www.vldb.org\/conf\/ 1999 \/P7.pdf Jun Rao and Kenneth A. Ross. 1999. Cache Conscious Indexing for Decision-Support in Main Memory. In Proceedings of 25th International Conference on Very Large Data Bases (VLDB). Edinburgh, Scotland, UK, 78--89. http:\/\/www.vldb.org\/conf\/1999\/P7.pdf"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335449"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/216585.216588"},{"key":"e_1_3_2_1_44_1","unstructured":"Yao Yu. 2014. Scaling Redis at Twitter. https:\/\/www.youtube.com\/ watch?v=rP9EKvWt0zo  Yao Yu. 2014. Scaling Redis at Twitter. https:\/\/www.youtube.com\/ watch?v=rP9EKvWt0zo"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915222"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19"},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319870","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3319870","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:16Z","timestamp":1750208536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319870"}},"subtitle":["Building the Largest In-memory Search Tree"],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":45,"alternative-id":["10.1145\/3299869.3319870","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3319870","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}