{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T09:30:47Z","timestamp":1775899847721,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T00:00:00Z","timestamp":1502064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EU H2020 Program INFRAIA-1-2014-2015","award":["654024 SoBigData"],"award-info":[{"award-number":["654024 SoBigData"]}]},{"name":"Pegaso Project","award":["POR FSE 2014-2020"],"award-info":[{"award-number":["POR FSE 2014-2020"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,7]]},"DOI":"10.1145\/3077136.3080798","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T19:35:01Z","timestamp":1501270501000},"page":"615-624","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Data Structures for Massive<i>N<\/i>-Gram Datasets"],"prefix":"10.1145","author":[{"given":"Giulio Ermanno","family":"Pibiri","sequence":"first","affiliation":[{"name":"University of Pisa &amp; ISTI-CNR, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rossano","family":"Venturini","sequence":"additional","affiliation":[{"name":"University of Pisa &amp; ISTI-CNR, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2006. Yahoo! N-Grams version 2.0. http:\/\/webscope.sandbox.yahoo.com\/catalog.php?datatype=l. 2006. Yahoo! N-Grams version 2.0. http:\/\/webscope.sandbox.yahoo.com\/catalog.php?datatype=l."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Ziv Bar-Yossef and Naama Kraus. 2011. Context-sensitive query auto-completion. In WWW. 107--116. Ziv Bar-Yossef and Naama Kraus. 2011. Context-sensitive query auto-completion. In WWW. 107--116.","DOI":"10.1145\/1963405.1963424"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2014.48"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_5_1","volume-title":"Technical Report LDC2006T13","author":"Brantz Thorsten","year":"2006"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Ciprian Chelba Tomas Mikolov Mike Schuster Qi Ge Thorsten Brants Phillipp Koehn and Tony Robinson. 2014. One billion word benchmark for measuring progress in statistical language modeling INTERSPEECH. 2635--2639. Ciprian Chelba Tomas Mikolov Mike Schuster Qi Ge Thorsten Brants Phillipp Koehn and Tony Robinson. 2014. One billion word benchmark for measuring progress in statistical language modeling INTERSPEECH. 2635--2639.","DOI":"10.21437\/Interspeech.2014-564"},{"key":"e_1_3_2_1_7_1","volume-title":"Chen and Joshua Goodman","author":"Stanley","year":"1996"},{"key":"e_1_3_2_1_9_1","volume":"199","author":"Clark David R.","journal-title":"J. Ian Munro."},{"key":"e_1_3_2_1_10_1","volume-title":"Search Engines: Information Retrieval in Practice","author":"Croft Bruce","year":"2009","edition":"1"},{"key":"e_1_3_2_1_11_1","unstructured":"Erik D. Demaine Thouis Jones and Mihai P\u0103tra\u00fbcu. 2004. Interpolation search for non-independent data. In SODA. 529--530. Erik D. Demaine Thouis Jones and Mihai P\u0103tra\u00fbcu. 2004. Interpolation search for non-independent data. In SODA. 529--530."},{"key":"e_1_3_2_1_12_1","volume-title":"On the number of bits required to implement an associative memory Memorandum 61","author":"Fano Robert Mario"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/367390.367400"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Edward Fredkin. 1960. Trie memory Communications of the ACM. 490--499. Edward Fredkin. 1960. Trie memory Communications of the ACM. 490--499.","DOI":"10.1145\/367390.367400"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Kimmo Fredriksson and Fedor Nikitin. 2007. Simple compression code supporting random access and fast string matching WEA. 203--216. Kimmo Fredriksson and Fedor Nikitin. 2007. Simple compression code supporting random access and fast string matching WEA. 203--216.","DOI":"10.1007\/978-3-540-72845-0_16"},{"key":"e_1_3_2_1_16_1","unstructured":"Kenneth Heafield. 2011. KenLM: Faster and smaller language model queries. WMT. 187--197. Kenneth Heafield. 2011. KenLM: Faster and smaller language model queries. WMT. 187--197."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935857"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Guy Jacobson. 1989. Space-efficient Static Trees and Graphs. In FOCS. 549--554. Guy Jacobson. 1989. Space-efficient Static Trees and Graphs. In FOCS. 549--554.","DOI":"10.1007\/978-1-4612-3694-8_36"},{"key":"e_1_3_2_1_20_1","volume-title":"Martin","author":"Jurafsky Dan","year":"2014"},{"key":"e_1_3_2_1_21_1","volume-title":"Europarl: A parallel corpus for statistical machine translation","author":"Koehn Philipp","year":"2005"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.7056"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806599"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Bhaskar Mitra and Nick Craswell. 2015. Query auto-completion for rare prefixes. In CIKM. 1755--1758. Bhaskar Mitra and Nick Craswell. 2015. Query auto-completion for rare prefixes. In CIKM. 1755--1758.","DOI":"10.1145\/2806416.2806599"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Bhaskar Mitra Milad Shokouhi Filip Radlinski and Katja Hofmann. 2014. On user interactions with query auto-completion. SIGIR. 1055--1058. Bhaskar Mitra Milad Shokouhi Filip Radlinski and Katja Hofmann. 2014. On user interactions with query auto-completion. SIGIR. 1055--1058.","DOI":"10.1145\/2600428.2609508"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Donald R. Morrison. 1968. PATRICIA: practical algorithm to retrieve information coded in alphanumeric JACM. 514--534. Donald R. Morrison. 1968. PATRICIA: practical algorithm to retrieve information coded in alphanumeric JACM. 514--534.","DOI":"10.1145\/321479.321481"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609615"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Giuseppe Ottaviano and Rossano Venturini. 2014. Partitioned Elias-Fano Indexes. In SIGIR. 273--282. Giuseppe Ottaviano and Rossano Venturini. 2014. Partitioned Elias-Fano Indexes. In SIGIR. 273--282.","DOI":"10.1145\/2600428.2609615"},{"key":"e_1_3_2_1_30_1","unstructured":"Adam Pauls and Dan Klein. 2011. Faster and Smaller N-gram Language Models. In ACL. 258--267. Adam Pauls and Dan Klein. 2011. Faster and Smaller N-gram Language Models. In ACL. 258--267."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-959-0"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390432"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Jangwon Seo and W. Bruce Croft. 2008. Local text reuse detection. In SIGIR. 571--578. Jangwon Seo and W. Bruce Croft. 2008. Local text reuse detection. In SIGIR. 571--578.","DOI":"10.1145\/1390334.1390432"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433409"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.3115\/1667583.1667689"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Taro Watanabe Hajime Tsukada and Hideki Isozaki. 2009. A succinct n-gram language model. In IJCNLP. 341--344. Taro Watanabe Hajime Tsukada and Hideki Isozaki. 2009. A succinct n-gram language model. In IJCNLP. 341--344.","DOI":"10.3115\/1667583.1667689"},{"key":"e_1_3_2_1_37_1","unstructured":"Susumu Yata. 2011. Prefix\/Patricia trie dictionary compression by nesting Prefix\/Patricia tries NLP. Susumu Yata. 2011. Prefix\/Patricia trie dictionary compression by nesting Prefix\/Patricia tries NLP."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Peter Elias. 1974. Efficient Storage and Retrieval by Content and Address of Static Files JACM. 246--260. Peter Elias. 1974. Efficient Storage and Retrieval by Content and Address of Static Files JACM. 246--260.","DOI":"10.1145\/321812.321820"}],"event":{"name":"SIGIR '17: The 40th International ACM SIGIR conference on research and development in Information Retrieval","location":"Shinjuku Tokyo Japan","acronym":"SIGIR '17","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3077136.3080798","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3077136.3080798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T18:42:19Z","timestamp":1750790539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3077136.3080798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,7]]},"references-count":37,"alternative-id":["10.1145\/3077136.3080798","10.1145\/3077136"],"URL":"https:\/\/doi.org\/10.1145\/3077136.3080798","relation":{},"subject":[],"published":{"date-parts":[[2017,8,7]]},"assertion":[{"value":"2017-08-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}