{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:46Z","timestamp":1750220626948,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T00:00:00Z","timestamp":1600041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,9,14]]},"DOI":"10.1145\/3409256.3409827","type":"proceedings-article","created":{"date-parts":[[2020,9,5]],"date-time":"2020-09-05T10:13:32Z","timestamp":1599300812000},"page":"41-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing Hyper-Phrase Queries"],"prefix":"10.1145","author":[{"given":"Dhruv","family":"Gupta","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Berberich","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics & Saarbruecken University of Applied Sciences (htw saar), Saarbruecken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,9,14]]},"reference":[{"volume-title":"English Gigaword","year":"2011","key":"e_1_3_2_2_1_1","unstructured":"English Gigaword Fifth Edition. https:\/\/catalog.ldc.upenn.edu\/LDC 2011 T07 English Gigaword Fifth Edition. https:\/\/catalog.ldc.upenn.edu\/LDC2011T07"},{"key":"e_1_3_2_2_2_1","unstructured":"The GDELT Project. https:\/\/www.gdeltproject.org  The GDELT Project. https:\/\/www.gdeltproject.org"},{"volume-title":"https:\/\/catalog.ldc.upenn.edu\/LDC2008T19","author":"The New York Times Annotated Corp","key":"e_1_3_2_2_3_1","unstructured":"The New York Times Annotated Corp us. https:\/\/catalog.ldc.upenn.edu\/LDC2008T19 The New York Times Annotated Corpus. https:\/\/catalog.ldc.upenn.edu\/LDC2008T19"},{"volume-title":"The Free Encyclopedia. https:\/\/www.wikipedia.org","key":"e_1_3_2_2_4_1","unstructured":"Wikipedia : The Free Encyclopedia. https:\/\/www.wikipedia.org Wikipedia: The Free Encyclopedia. https:\/\/www.wikipedia.org"},{"key":"e_1_3_2_2_5_1","unstructured":"Wikidata: The Free Knowledge Base. https:\/\/www.wikidata.org  Wikidata: The Free Knowledge Base. https:\/\/www.wikidata.org"},{"key":"e_1_3_2_2_6_1","unstructured":"D. Lemire. JavaFastPFOR: A Simple Integer Compression Library in Java. https:\/\/github.com\/lemire\/JavaFastPFOR  D. Lemire. JavaFastPFOR: A Simple Integer Compression Library in Java. https:\/\/github.com\/lemire\/JavaFastPFOR"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453960"},{"key":"e_1_3_2_2_8_1","first-page":"1","article-title":"Practical Variable Length Gap Pattern Matching","author":"Bader J.","year":"2016","unstructured":"J. Bader Practical Variable Length Gap Pattern Matching . In SEA 2016 . 1 -- 16 . J. Bader et al. Practical Variable Length Gap Pattern Matching. In SEA 2016. 1--16.","journal-title":"SEA"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.029"},{"volume-title":"Introduction to Algorithms","author":"Cormen T. H.","key":"e_1_3_2_2_10_1","unstructured":"T. H. Cormen Introduction to Algorithms , Second Edition .The MIT Press and McGraw-Hill Book Company . T. H. Cormen et al. Introduction to Algorithms, Second Edition .The MIT Press and McGraw-Hill Book Company."},{"key":"e_1_3_2_2_11_1","first-page":"1","article-title":"Approximate String Matching with Gaps","volume":"9","author":"Crochemore M.","year":"2002","unstructured":"M. Crochemore Approximate String Matching with Gaps . Nord. J. Comput. , Vol. 9 , 1 ( 2002 ), 54--65. M. Crochemore et al. Approximate String Matching with Gaps. Nord. J. Comput., Vol. 9, 1 (2002), 54--65.","journal-title":"Nord. J. Comput."},{"key":"e_1_3_2_2_12_1","first-page":"1","volume":"29","author":"Culpepper J. S.","year":"2010","unstructured":"J. S. Culpepper and A. Moffat . Efficient Set Intersection for Inverted Indexing. ACM Trans. Inf. Syst. , Vol. 29 , 1 ( 2010 ), 1:1--1:25. J. S. Culpepper and A. Moffat. Efficient Set Intersection for Inverted Indexing. ACM Trans. Inf. Syst., Vol. 29, 1 (2010), 1:1--1:25.","journal-title":"Efficient Set Intersection for Inverted Indexing. ACM Trans. Inf. Syst."},{"key":"e_1_3_2_2_13_1","first-page":"2","article-title":"ROXXI: Reviving witness dOcuments to eXplore eXtracted Information","volume":"3","author":"Elbassuoni S.","year":"2010","unstructured":"S. Elbassuoni ROXXI: Reviving witness dOcuments to eXplore eXtracted Information . PVLDB , Vol. 3 , 2 ( 2010 ), 1589--1592. S. Elbassuoni et al. ROXXI: Reviving witness dOcuments to eXplore eXtracted Information. PVLDB, Vol. 3, 2 (2010), 1589--1592.","journal-title":"PVLDB"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-008-9054-z"},{"key":"e_1_3_2_2_15_1","first-page":"487","author":"Gupta D.","year":"2018","unstructured":"D. Gupta and K. Berberich . GYANI: An Indexing Infrastructure for Knowledge-Centric Tasks. In CIKM 2018 . 487 -- 496 . D. Gupta and K. Berberich. GYANI: An Indexing Infrastructure for Knowledge-Centric Tasks. In CIKM 2018. 487--496.","journal-title":"GYANI: An Indexing Infrastructure for Knowledge-Centric Tasks. In CIKM"},{"key":"e_1_3_2_2_16_1","first-page":"794","author":"Gupta D.","year":"2019","unstructured":"D. Gupta and K. Berberich . Structured Search in Annotated Document Collections. In WSDM 2019 . 794 -- 797 . D. Gupta and K. Berberich. Structured Search in Annotated Document Collections. In WSDM 2019. 794--797.","journal-title":"Structured Search in Annotated Document Collections. In WSDM"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142504"},{"key":"e_1_3_2_2_18_1","first-page":"55","article-title":"The Stanford CoreNLP Natural Language Processing Toolkit","author":"Manning C. D.","year":"2014","unstructured":"C. D. Manning The Stanford CoreNLP Natural Language Processing Toolkit . In ACL 2014 . 55 -- 60 . C. D. Manning et al. The Stanford CoreNLP Natural Language Processing Toolkit. In ACL 2014. 55--60.","journal-title":"ACL"},{"key":"e_1_3_2_2_19_1","volume-title":"CIKM","author":"Metzger S.","year":"2011","unstructured":"S. Metzger : Seeking Statement-Supporting Top-k Witnesses . In CIKM 2011 . 37--46. S. Metzger et al. S3K: Seeking Statement-Supporting Top-k Witnesses. In CIKM 2011. 37--46."},{"key":"e_1_3_2_2_20_1","first-page":"194","year":"2009","unstructured":"Fan Min . Pattern Matching with Independent Wildcard Gaps. In DASC 2009 . 194 -- 199 . Fan Min et al. Pattern Matching with Independent Wildcard Gaps. In DASC 2009. 194--199.","journal-title":"Pattern Matching with Independent Wildcard Gaps. In DASC"},{"key":"e_1_3_2_2_21_1","volume-title":"WISE","author":"Panev K.","year":"2014","unstructured":"K. Panev and K. Berberich . 2014. Phrase Queries with Inverted+Direct Indexes . In WISE 2014 . 156--169. K. Panev and K. Berberich. 2014. Phrase Queries with Inverted+Direct Indexes. In WISE 2014. 156--169."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028099.1028102"},{"key":"e_1_3_2_2_24_1","volume-title":"Super-Scalar RAM-CPU Cache Compression. In ICDE","author":"Zukowski M.","year":"2006","unstructured":"M. Zukowski Super-Scalar RAM-CPU Cache Compression. In ICDE 2006 , 59--59. M. Zukowski et al. Super-Scalar RAM-CPU Cache Compression. In ICDE 2006, 59--59."}],"event":{"name":"ICTIR '20: The 2020 ACM SIGIR International Conference on the Theory of Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Norway","acronym":"ICTIR '20"},"container-title":["Proceedings of the 2020 ACM SIGIR on International Conference on Theory of Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409256.3409827","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409256.3409827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:33Z","timestamp":1750197693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409256.3409827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,14]]},"references-count":24,"alternative-id":["10.1145\/3409256.3409827","10.1145\/3409256"],"URL":"https:\/\/doi.org\/10.1145\/3409256.3409827","relation":{},"subject":[],"published":{"date-parts":[[2020,9,14]]},"assertion":[{"value":"2020-09-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}