{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:48Z","timestamp":1750307148047,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,24]],"date-time":"2011-10-24T00:00:00Z","timestamp":1319414400000},"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":[[2011,10,24]]},"DOI":"10.1145\/2063576.2063628","type":"proceedings-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T10:40:21Z","timestamp":1321440021000},"page":"327-332","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Factorization-based lossless compression of inverted indices"],"prefix":"10.1145","author":[{"given":"George","family":"Beskales","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Fontoura","sequence":"additional","affiliation":[{"name":"Google Inc., Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Gurevich","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vanja","family":"Josifovski","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"TREC WT10g Dataset http:\/\/ir.dcs.gla.ac.uk\/test_collections\/wt10g.html.  TREC WT10g Dataset http:\/\/ir.dcs.gla.ac.uk\/test_collections\/wt10g.html."},{"key":"e_1_3_2_1_2_1","volume-title":"Linear Algebra and its Applications","author":"On","year":"2006","unstructured":"On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them. Linear Algebra and its Applications , 2006 . On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them. Linear Algebra and its Applications, 2006."},{"key":"e_1_3_2_1_3_1","volume-title":"Factorization-based lossless compression of inverted indices. Technical report","author":"Beskales G.","year":"2011","unstructured":"G. Beskales , M. Fontoura , M. Gurevich , S. Vassilvitskii , and V. Josifovski . Factorization-based lossless compression of inverted indices. Technical report , 2011 . http:\/\/arxiv.org\/abs\/1108.1956. G. Beskales, M. Fontoura, M. Gurevich, S. Vassilvitskii, and V. Josifovski. Factorization-based lossless compression of inverted indices. Technical report, 2011. http:\/\/arxiv.org\/abs\/1108.1956."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956944"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383958"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.09.001"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1044709"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.07.001"},{"key":"e_1_3_2_1_13_1","first-page":"556","volume-title":"NIPS","author":"Lee D. D.","year":"2001","unstructured":"D. D. Lee and H. S. Seung . Algorithms for non-negative matrix factorization . In In NIPS , pages 556 -- 562 . MIT Press , 2001 . D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In In NIPS, pages 556--562. MIT Press, 2001."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772760"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2004.2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"Manning C. D.","year":"2008","unstructured":"C. D. Manning , P. Raghavan , and H. Sch\u00fctze . Introduction to Information Retrieval . Cambridge University Press , 1 edition, 2008 . C. D. Manning, P. Raghavan, and H. Sch\u00fctze. Introduction to Information Retrieval. Cambridge University Press, 1 edition, 2008."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146847.1146848"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564416"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical Linear Algebra","author":"Trefethen L. N.","year":"1997","unstructured":"L. N. Trefethen and D. Bau . Numerical Linear Algebra . SIAM : Society for Industrial and Applied Mathematics , 1997 . L. N. Trefethen and D. Bau. Numerical Linear Algebra. SIAM: Society for Industrial and Applied Mathematics, 1997."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526764"}],"event":{"name":"CIKM '11: 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":"Glasgow Scotland, UK","acronym":"CIKM '11"},"container-title":["Proceedings of the 20th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063628","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2063576.2063628","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:11Z","timestamp":1750240451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,24]]},"references-count":21,"alternative-id":["10.1145\/2063576.2063628","10.1145\/2063576"],"URL":"https:\/\/doi.org\/10.1145\/2063576.2063628","relation":{},"subject":[],"published":{"date-parts":[[2011,10,24]]},"assertion":[{"value":"2011-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}