{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:34:53Z","timestamp":1768516493729,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"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,5,27]]},"DOI":"10.1145\/3183713.3196896","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"521-534","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":75,"title":["HOT"],"prefix":"10.1145","author":[{"given":"Robert","family":"Binna","sequence":"first","affiliation":[{"name":"University of Innsbruck, Innsbruck, Austria"}]},{"given":"Eva","family":"Zangerle","sequence":"additional","affiliation":[{"name":"University of Innsbruck, Innsbruck, Austria"}]},{"given":"Martin","family":"Pichl","sequence":"additional","affiliation":[{"name":"University of Innsbruck, Innsbruck, Austria"}]},{"given":"G\u00fcnther","family":"Specht","sequence":"additional","affiliation":[{"name":"University of Innsbruck, Innsbruck, Austria"}]},{"given":"Viktor","family":"Leis","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"97","volume-title":"Proceedings of the thirtieth Australasian conference on Computer science -","volume":"62","author":"Askitis N.","year":"2007","unstructured":"N. Askitis and R. Sinha . HAT-trie: a cache-conscious trie-based data structure for strings . Proceedings of the thirtieth Australasian conference on Computer science - Volume 62 , pages 97 -- 105 , 2007 . N. Askitis and R. Sinha. HAT-trie: a cache-conscious trie-based data structure for strings. Proceedings of the thirtieth Australasian conference on Computer science - Volume 62, pages 97--105, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1785162.1785216"},{"key":"e_1_3_2_1_3_1","first-page":"227","volume-title":"Proceedings of the 14th BTW conference on Database Systems for Business, Technology, and Web","author":"B\u00f6hm M.","year":"2011","unstructured":"M. B\u00f6hm , B. Schlegel , P. B. Volk , U. Fischer , D. Habich , and W. Lehner . Efficient In-Memory Indexing with Generalized Prefix Trees . In Proceedings of the 14th BTW conference on Database Systems for Business, Technology, and Web , pages 227 -- 246 , 2011 . M. B\u00f6hm, B. Schlegel, P. B. Volk, U. Fischer, D. Habich, and W. Lehner. Efficient In-Memory Indexing with Generalized Prefix Trees. In Proceedings of the 14th BTW conference on Database Systems for Business, Technology, and Web, pages 227--246, 2011."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375688"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/129888.129896"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806908"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000028"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/506309.506312"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963296"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454211"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767867"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807206"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746480"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2236584.2236587"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2003.11.004"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933349.2933352"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809990"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335449"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1565694.1565705"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196895"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.54"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915222"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564709"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196896","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:18Z","timestamp":1750210758000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196896"}},"subtitle":["A Height Optimized Trie Index for Main-Memory Database Systems"],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":31,"alternative-id":["10.1145\/3183713.3196896","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3196896","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}