{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T18:56:05Z","timestamp":1768589765560,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030157111","type":"print"},{"value":"9783030157128","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-15712-8_22","type":"book-chapter","created":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T03:27:59Z","timestamp":1554607679000},"page":"339-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Compressing Inverted Indexes with Recursive Graph Bisection: A Reproducibility Study"],"prefix":"10.1007","author":[{"given":"Joel","family":"Mackenzie","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Mallia","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Petri","sequence":"additional","affiliation":[]},{"given":"J. Shane","family":"Culpepper","sequence":"additional","affiliation":[]},{"given":"Torsten","family":"Suel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,7]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Arguello, J., Diaz, F., Lin, J., Trotman, A.: SIGIR 2015 workshop on reproducibility, inexplicability, and generalizability of results (RIGOR). In: Proceedings of SIGIR, pp. 1147\u20131148 (2015)","DOI":"10.1145\/2766462.2767858"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-31865-1_27","volume-title":"Advances in Information Retrieval","author":"R Blanco","year":"2005","unstructured":"Blanco, R., Barreiro, \u00c1.: Document identifier reassignment through dimensionality reduction. In: Losada, D.E., Fern\u00e1ndez-Luna, J.M. (eds.) ECIR 2005. LNCS, vol. 3408, pp. 375\u2013387. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31865-1_27"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Blanco, R., Barreiro, \u00c1.: Characterization of a simple case of the reassignment of document identifiers as a pattern sequencing problem. In: Proceedings of SIGIR, pp. 587\u2013588 (2005)","DOI":"10.1145\/1076034.1076141"},{"issue":"4","key":"22_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s10791-006-6614-y","volume":"9","author":"R Blanco","year":"2006","unstructured":"Blanco, R., Barreiro, \u00c1.: TSP and cluster-based solutions to the reassignment of document identifiers. Inf. Retr. 9(4), 499\u2013517 (2006)","journal-title":"Inf. Retr."},{"key":"22_CR5","unstructured":"Blandford, D., Blelloch, G.: Index compression through document reordering. In: Proceedings DCC 2002, Data Compression Conference, pp. 342\u2013352 (2002)"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"AZ Broder","year":"2000","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. J. Comput. Syst. Sci. 60(3), 630\u2013659 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: Proceedings of SIGKDD, pp. 219\u2013228 (2009)","DOI":"10.1145\/1557019.1557049"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Crane, M., Culpepper, J.S., Lin, J., Mackenzie, J., Trotman, A.: A comparison of Document-at-a-Time and Score-at-a-Time query evaluation. In: Proceedings of WSDM, pp. 201\u2013210 (2017)","DOI":"10.1145\/3018661.3018726"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Dean, J.: Challenges in building large-scale information retrieval systems: invited talk. In: Proceedings of WSDM, pp. 1\u20131 (2009)","DOI":"10.1145\/1498759.1498761"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Dhulipala, L., Kabiljo, I., Karrer, B., Ottaviano, G., Pupyrev, S., Shalita, A.: Compressing graphs and indexes with recursive graph bisection. In: Proceedings of SIGKDD, pp. 1535\u20131544 (2016)","DOI":"10.1145\/2939672.2939862"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Ding, S., Suel, T.: Faster top-$$k$$ document retrieval using block-max indexes. In: Proceedings of SIGIR, pp. 993\u20131002 (2011)","DOI":"10.1145\/2009916.2010048"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Ding, S., Attenberg, J., Suel, T.: Scalable techniques for document identifier assignment in inverted indexes. In: Proceedings of the WWW, pp. 311\u2013320 (2010)","DOI":"10.1145\/1772690.1772723"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1002\/spe.2314","volume":"46","author":"K Fredriksson","year":"2016","unstructured":"Fredriksson, K., Kilpel\u00e4inen, P.: Practically efficient array initialization. Soft. Prac. Exp. 46(4), 435\u2013467 (2016)","journal-title":"Soft. Prac. Exp."},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-319-30671-1_32","volume-title":"Advances in Information Retrieval","author":"F Hasibi","year":"2016","unstructured":"Hasibi, F., Balog, K., Bratsberg, S.E.: On the reproducibility of the TAGME entity linking system. In: Ferro, N., Crestani, F., Moens, M.-F., Mothe, J., Silvestri, F., Di Nunzio, G.M., Hauff, C., Silvello, G. (eds.) ECIR 2016. LNCS, vol. 9626, pp. 436\u2013449. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30671-1_32"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Hawking, D., Jones, T.: Reordering an index to speed query processing without loss of effectiveness. In: Proceedings of ADCS, pp. 17\u201324 (2012)","DOI":"10.1145\/2407085.2407088"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Kane, A., Tompa, F.W.: Split-lists and initial thresholds for WAND-based search. In: Proceedings of SIGIR, pp. 877\u2013880 (2018)","DOI":"10.1145\/3209978.3210066"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2017.09.011","volume":"130","author":"D Lemire","year":"2018","unstructured":"Lemire, D., Kurz, N., Rupp, C.: Stream vbyte: faster byte-oriented integer compression. Inf. Proc. Lett. 130, 1\u20136 (2018)","journal-title":"Inf. Proc. Lett."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Mallia, A., Ottaviano, G., Porciani, E., Tonellotto, N., Venturini, R.: Faster BlockMax WAND with variable-sized blocks. In: Proceedings of SIGIR, pp. 625\u2013634 (2017)","DOI":"10.1145\/3077136.3080780"},{"issue":"1","key":"22_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1013002601898","volume":"3","author":"A Moffat","year":"2000","unstructured":"Moffat, A., Stuiver, L.: Binary interpolative coding for effective index compression. Inf. Retr. 3(1), 25\u201347 (2000)","journal-title":"Inf. Retr."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Ottaviano, G., Venturini, R.: Partitioned Elias-Fano indexes. In: Proceedings of SIGIR, pp. 273\u2013282 (2014)","DOI":"10.1145\/2600428.2609615"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Richardson, M., Prakash, A., Brill, E.: Beyond pagerank: machine learning for static ranking. In: Proceedings of WWW, pp. 707\u2013715 (2006)","DOI":"10.1145\/1135777.1135881"},{"issue":"1","key":"22_CR22","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0306-4573(02)00020-1","volume":"39","author":"W-Y Shieh","year":"2003","unstructured":"Shieh, W.-Y., Chen, T.-F., Shann, J.J.-J., Chung, C.-P.: Inverted file compression through document identifier reassignment. Inf. Proc. Man. 39(1), 117\u2013131 (2003)","journal-title":"Inf. Proc. Man."},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-71496-5_12","volume-title":"Advances in Information Retrieval","author":"F Silvestri","year":"2007","unstructured":"Silvestri, F.: Sorting out the document identifier assignment problem. In: Amati, G., Carpineto, C., Romano, G. (eds.) ECIR 2007. LNCS, vol. 4425, pp. 101\u2013112. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71496-5_12"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Yan, H., Ding, S., Suel, T.: Inverted index compression and query processing with optimized document ordering. In: Proceedings of WWW, pp. 401\u2013410 (2009)","DOI":"10.1145\/1526709.1526764"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15712-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:10:53Z","timestamp":1710346253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-15712-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030157111","9783030157128"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15712-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"7 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECIR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cologne","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecir2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}