{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:58Z","timestamp":1750306918246,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T00:00:00Z","timestamp":1351468800000},"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":[[2012,10,29]]},"DOI":"10.1145\/2396761.2396765","type":"proceedings-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T16:38:00Z","timestamp":1352997480000},"page":"4-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Compressed data structures with relevance"],"prefix":"10.1145","author":[{"given":"Jeffrey Scott","family":"Vitter","sequence":"first","affiliation":[{"name":"The University of Kansas, Lawrence, KS, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796543"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082039"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198513.1198521"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. ACM-SIAM Symp. on Discrete Algorithms","author":"Grossi R.","year":"2003","unstructured":"R. Grossi , A. Gupta , and J. S. Vitter . High-order entropy-compressed text indexes . In Proc. ACM-SIAM Symp. on Discrete Algorithms , January 2003 . R. Grossi, A. Gupta, and J. S. Vitter. High-order entropy-compressed text indexes. In Proc. ACM-SIAM Symp. on Discrete Algorithms, January 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335351"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402354"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.19"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1875737.1875761"},{"key":"e_1_3_2_1_9_1","volume-title":"Succinct static data structures","author":"Jacobson G.","year":"1989","unstructured":"G. Jacobson . Succinct static data structures . Technical Report Carnegie Mellon University-CS-89--112, Dept. of Computer Science, Carnegie-Mellon University , January 1989 . G. Jacobson. Succinct static data structures. Technical Report Carnegie Mellon University-CS-89--112, Dept. of Computer Science, Carnegie-Mellon University, January 1989."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778666.1778687"},{"key":"e_1_3_2_1_11_1","first-page":"657","volume-title":"Proc. ACM-SIAM Symp. on Discrete Algorithms","author":"Muthukrishnan S.","year":"2002","unstructured":"S. Muthukrishnan . Efficient Algorithms for Document Retrieval Problems . In Proc. ACM-SIAM Symp. on Discrete Algorithms , pages 657 -- 666 , 2002 . S. Muthukrishnan. Efficient Algorithms for Document Retrieval Problems. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 657--666, 2002."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1216370.1216372"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095200"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646343.689570"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00087-7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1198-x"},{"key":"e_1_3_2_1_17_1","volume-title":"July","author":"Shah R.","year":"2012","unstructured":"R. Shah , C. Sheng , S. V. Thankachan , and J. S. Vitter . On optimal top-k string retrieval , July 2012 . arXiv:1207.2632v1 {cs.DS}. R. Shah, C. Sheng, S. V. Thankachan, and J. S. Vitter. On optimal top-k string retrieval, July 2012. arXiv:1207.2632v1 {cs.DS}."},{"key":"e_1_3_2_1_18_1","unstructured":"J. S. Vitter. Online publication library http:\/\/www.ittc.ku.edu\/~jsv\/Papers\/catalog\/.  J. S. Vitter. Online publication library http:\/\/www.ittc.ku.edu\/~jsv\/Papers\/catalog\/."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000014"}],"event":{"name":"CIKM'12: 21st ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Maui Hawaii USA","acronym":"CIKM'12"},"container-title":["Proceedings of the 21st ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396765","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2396761.2396765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:18Z","timestamp":1750235718000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,29]]},"references-count":19,"alternative-id":["10.1145\/2396761.2396765","10.1145\/2396761"],"URL":"https:\/\/doi.org\/10.1145\/2396761.2396765","relation":{},"subject":[],"published":{"date-parts":[[2012,10,29]]},"assertion":[{"value":"2012-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}