{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:05:22Z","timestamp":1725869122522},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319491080"},{"type":"electronic","value":"9783319491097"}],"license":[{"start":{"date-parts":[[2016,10,22]],"date-time":"2016-10-22T00:00:00Z","timestamp":1477094400000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-49109-7_9","type":"book-chapter","created":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T09:03:15Z","timestamp":1477040595000},"page":"93-104","source":"Crossref","is-referenced-by-count":0,"title":["A Heuristically Optimized Partitioning Strategy on Elias-Fano Index"],"prefix":"10.1007","author":[{"given":"Xingshen","family":"Song","sequence":"first","affiliation":[]},{"given":"Kun","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Yuexiang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,22]]},"reference":[{"key":"9_CR1","unstructured":"Anh, V.N., Moffat, A.: Index compression using fixed binary codewords. In: Proc. ADC. pp. 61\u201367 (2004)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Anh, V.N., Moffat, A.: Inverted index compression using word-aligned binary codes. Inform. Retrieval 8(1), 151\u2013166 (2005)","DOI":"10.1023\/B:INRT.0000048490.99518.5c"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Anh, V.N., Moffat, A.: Index compression using 64-bit words. Soft. Prac. & Exp. 40(2), 131\u2013147 (2010)","DOI":"10.1002\/spe.948"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Catena, M., Macdonald, C., Ounis, I.: On inverted index compression for search engine efficiency. In: Proc. ECIR. pp. 359\u2013371 (2014)","DOI":"10.1007\/978-3-319-06028-6_30"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Delbru, R., Campinas, S., Tummarello, G.: Searching web data: An entity retrieval and high-performance indexing model. J. Web Sem 10, 33\u201358 (2012)","DOI":"10.1016\/j.websem.2011.04.004"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Elias, P.: Efficient storage and retrieval by content and address of static files. Journal of the ACM (JACM) 21(2), 246\u2013260 (1974)","DOI":"10.1145\/321812.321820"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Lai, C., Moulin, C.: Semantic indexing modelling of resources within a distributed system. International Journal of Grid and Utility Computing 4(1), 21\u201339 (2013)","DOI":"10.1504\/IJGUC.2013.054488"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Lemire, D., Boytsov, L.: Decoding billions of integers per second through vectorization. Soft. Prac. & Exp 45(1), 1\u201329 (2015)","DOI":"10.1002\/spe.2203"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fctze, H., et al.: Introduction to information retrieval. Cambridge university press (2008)","DOI":"10.1017\/CBO9780511809071"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Navarro, G., Puglisi, S.J.: Dual-sorted inverted lists. In: Proc. SPIRE. pp. 309\u2013321 (2010)","DOI":"10.1007\/978-3-642-16321-0_33"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Ottaviano, G., Tonellotto, N., Venturini, R.: Optimal space-time tradeoffs for inverted indexes. In: Proc. WSDM. pp. 47\u201356 (2015)","DOI":"10.1145\/2684822.2685297"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Ottaviano, G., Venturini, R.: Partitioned elias-fano indexes. In: Proc. SIGIR. pp. 273\u2013282 (2014)","DOI":"10.1145\/2600428.2609615"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Petri, M., Moffat, A., Culpepper, J.S.: Score-safe term-dependency processing with hybrid indexes. In: Proc. SIGIR. pp. 899\u2013902 (2014)","DOI":"10.1145\/2600428.2609469"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Shorfuzzaman, M., Graham, P., Eskicioglu, R.: Allocating replicas in large-scale data grids using a qos-aware distributed technique with workload constraints. International Journal of Grid and Utility Computing 3(2-3), 157\u2013174 (2012)","DOI":"10.1504\/IJGUC.2012.047766"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Silvestri, F., Venturini, R.: Vsencoding: efficient coding and fast decoding of integer lists via dynamic programming. In: Proc. CIKM. pp. 1219\u20131228 (2010)","DOI":"10.1145\/1871437.1871592"},{"key":"9_CR16","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: Proc. CIKM. pp. 317\u2013326 (2011)","DOI":"10.1145\/2063576.2063627"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Trotman, A.: Compression, simd, and postings lists. In: Proc. ADCS. p. 50 (2014)","DOI":"10.1145\/2682862.2682870"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Tudor, D., Macariu, G., Schreiner, W., Cretu, V.I.: Experiences on grid shared data programming. International Journal of Grid and Utility Computing 1(4), 296\u2013307 (2009)","DOI":"10.1504\/IJGUC.2009.027919"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Vigna, S.: Quasi-succinct indices. In: Proc. WSDM. pp. 83\u201392 (2013)","DOI":"10.1145\/2433396.2433409"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Wang, Y., Ma, J., Lu, X., Lu, D., Zhang, L.: Efficiency optimisation signature scheme for time-critical multicast data origin authentication. International Journal of Grid and Utility Computing 7(1), 1\u201311 (2016)","DOI":"10.1504\/IJGUC.2016.073771"},{"key":"9_CR21","unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing gigabytes: compressing and indexing documents and images. Morgan Kaufmann (1999)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Yan, H., Ding, S., Suel, T.: Inverted index compression and query processing with optimized document ordering. In: Proc. WWW. pp. 401\u2013410 (2009)","DOI":"10.1145\/1526709.1526764"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, T., Cui, L., Xu, M.: A lns-based data placement strategy for data-intensive e-science applications. International Journal of Grid and Utility Computing 5(4), 249\u2013262 (2014)","DOI":"10.1504\/IJGUC.2014.065390"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comp. Surv. 38(2), 6 (2006)","DOI":"10.1145\/1132956.1132959"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances on P2P, Parallel, Grid, Cloud and Internet Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49109-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T21:59:51Z","timestamp":1568498391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49109-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,22]]},"ISBN":["9783319491080","9783319491097"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49109-7_9","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2016,10,22]]}}}