{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:55Z","timestamp":1725860815899},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319420882"},{"type":"electronic","value":"9783319420899"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42089-9_18","type":"book-chapter","created":{"date-parts":[[2016,6,30]],"date-time":"2016-06-30T10:36:30Z","timestamp":1467282990000},"page":"246-260","source":"Crossref","is-referenced-by-count":0,"title":["On Optimizing Partitioning Strategies for Faster Inverted Index Compression"],"prefix":"10.1007","author":[{"given":"Xingshen","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuexiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,1]]},"reference":[{"key":"18_CR1","unstructured":"Anh, V.N., Moffat, A.: Index compression using fixed binary codewords. In: Proceedings of the 15th Australasian Database Conference, vol. 27, pp. 61\u201367. Australian Computer Society, Inc. (2004)"},{"issue":"1","key":"18_CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/B:INRT.0000048490.99518.5c","volume":"8","author":"VN Anh","year":"2005","unstructured":"Anh, V.N., Moffat, A.: Inverted index compression using word-aligned binary codes. Inf. Retr. 8(1), 151\u2013166 (2005)","journal-title":"Inf. Retr."},{"issue":"2","key":"18_CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/spe.948","volume":"40","author":"VN Anh","year":"2010","unstructured":"Anh, V.N., Moffat, A.: Index compression using 64-bit words. Softw. Pract. Exp. 40(2), 131\u2013147 (2010)","journal-title":"Softw. Pract. Exp."},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-319-06028-6_30","volume-title":"Advances in Information Retrieval","author":"M Catena","year":"2014","unstructured":"Catena, M., Macdonald, C., Ounis, I.: On inverted index compression for search engine efficiency. In: de Rijke, M., Kenter, T., de Vries, A.P., Zhai, C.X., de Jong, F., Radinsky, K., Hofmann, K. (eds.) ECIR 2014. LNCS, vol. 8416, pp. 359\u2013371. Springer, Heidelberg (2014)"},{"key":"18_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"18_CR6","unstructured":"Delbru, R., Campinas, S., Samp, K., Tummarello, G.: Adaptive frame of reference for compressing inverted lists. Technical report, DERI-Digital Enterprise Research Institute, December 2010"},{"issue":"1","key":"18_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00453-010-9437-6","volume":"61","author":"P Ferragina","year":"2011","unstructured":"Ferragina, P., Nitto, I., Venturini, R.: On optimally partitioning a text to improve its compression. Algorithmica 61(1), 51\u201374 (2011)","journal-title":"Algorithmica"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Goldstein, J., Ramakrishnan, R., Shaft, U.: Compressing relations and indexes. In: Proceedings of 14th International Conference on Data Engineering, pp. 370\u2013379. IEEE (1998)","DOI":"10.1109\/ICDE.1998.655800"},{"issue":"1","key":"18_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/spe.2203","volume":"45","author":"D Lemire","year":"2015","unstructured":"Lemire, D., Boytsov, L.: Decoding billions of integers per second through vectorization. Softw. Pract. Exp. 45(1), 1\u201329 (2015)","journal-title":"Softw. Pract. Exp."},{"key":"18_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fctze, H., et al.: Introduction to Information Retrieval, vol. 1. Cambridge university press, Cambridge (2008)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Ottaviano, G., Tonellotto, N., Venturini, R.: Optimal space-time tradeoffs for inverted indexes. In: Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, pp. 47\u201356. ACM (2015)","DOI":"10.1145\/2684822.2685297"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Ottaviano, G., Venturini, R.: Partitioned elias-fano indexes. In: Proceedingsof the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval, pp. 273\u2013282. ACM (2014)","DOI":"10.1145\/2600428.2609615"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Silvestri, F., Venturini, R.: Vsencoding: efficient coding and fast decoding of integer lists via dynamic programming. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 1219\u20131228. ACM (2010)","DOI":"10.1145\/1871437.1871592"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Stepanov, A.A., Gangolli, A.R., Rose, D.E., Ernst, R.J., Oberoi, P.S.:SIMD-based decoding of posting lists. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, pp. 317\u2013326. ACM (2011)","DOI":"10.1145\/2063576.2063627"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Trotman, A.: Compression, SIMD, and postings lists. In: Proceedings of the 2014 Australasian Document Computing Symposium, p. 50. ACM (2014)","DOI":"10.1145\/2682862.2682870"},{"key":"18_CR16","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"IH Witten","year":"1999","unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, San Francisco (1999)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Yan, H., Ding, S., Suel, T.: Inverted index compression and query processing with optimized document ordering. In: Proceedings of the 18th International Conference on World Wide Web, pp. 401\u2013410. ACM (2009)","DOI":"10.1145\/1526709.1526764"},{"issue":"2","key":"18_CR18","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/1132956.1132959","volume":"38","author":"J Zobel","year":"2006","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comput. Surv. (CSUR) 38(2), 6 (2006)","journal-title":"ACM Comput. Surv. (CSUR)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications -- ICCSA 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42089-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T01:08:30Z","timestamp":1718672910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42089-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420882","9783319420899"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42089-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}