{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:50:55Z","timestamp":1742993455469,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_18","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"207-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compact Indexes for Flexible Top-$$k$$ Retrieval"],"prefix":"10.1007","author":[{"given":"Simon","family":"Gog","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Petri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: MG4J at TREC 2005. In: Proceedings of the TREC (2005)","DOI":"10.6028\/NIST.SP.500-266.terabyte-umilano.vigna"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Carmel, D., Herscovici, H., Soffer, A., Zien, J.: Efficient query evaluation using a two-level retrieval process. In: Proceedings of the CIKM, pp. 426\u2013434 (2003)","DOI":"10.1145\/956863.956944"},{"issue":"1","key":"18_CR3","first-page":"22","volume":"16","author":"KW Church","year":"1990","unstructured":"Church, K.W., Hanks, P.: Word association norms, mutual information, and lexicography. Comput. Linguist. 16(1), 22\u201329 (1990)","journal-title":"Comput. Linguist."},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-15781-3_17","volume-title":"Algorithms \u2013 ESA 2010","author":"JS Culpepper","year":"2010","unstructured":"Culpepper, J.S., Navarro, G., Puglisi, S.J., Turpin, A.: Top-k ranked document search in general text databases. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol. 6347, pp. 194\u2013205. Springer, Heidelberg (2010)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Culpepper, J.S., Petri, M., Scholer, F.: Efficient in-memory top-k document retrieval. In: Proceedings of the SIGIR, pp. 225\u2013234 (2012)","DOI":"10.1145\/2348283.2348317"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2011.12.002","volume":"426","author":"T Gagie","year":"2012","unstructured":"Gagie, T., Navarro, G., Puglisi, S.J.: New algorithms on wavelet trees and applications to information retrieval. Theoret. Comput. Sci. 426, 25\u201341 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","volume-title":"Experimental Algorithms","author":"S Gog","year":"2014","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 326\u2013337. Springer, Heidelberg (2014)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Gog, S., Navarro, G.: Improved single-term top-k document retrieval. In: Proceedings of the ALENEX, pp. 24\u201332 (2015)","DOI":"10.1137\/1.9781611973754.3"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-319-16354-3_30","volume-title":"Advances in Information Retrieval","author":"S Gog","year":"2015","unstructured":"Gog, S., Moffat, A., Petri, M.: On identifying phrases using collection statistics. In: Hanbury, A., Kazai, G., Rauber, A., Fuhr, N. (eds.) ECIR 2015. LNCS, vol. 9022, pp. 278\u2013283. Springer, Heidelberg (2015)"},{"key":"18_CR10","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the SODA, pp. 841\u2013850 (2003)"},{"key":"18_CR11","unstructured":"Hagen, M., Potthast, M., Beyer, A., Stein, B.: Towards optimum query segmentation: in doubt without. In: Proceedings of the DIR, pp. 28\u201329 (2013). http:\/\/ceur-ws.org\/Vol-986\/paper_8.pdf"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2590774","volume":"61","author":"WK Hon","year":"2014","unstructured":"Hon, W.K., Shah, R., Thankachan, S.V., Vitter, J.S.: Space-efficient frameworks for top-k string retrieval. J. ACM 61(2), 1\u201336 (2014)","journal-title":"J. ACM"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Konow, R., Navarro, G.: Faster compact top-k document retrieval. In: Proceedings of the DCC, pp. 351\u2013360 (2013)","DOI":"10.1109\/DCC.2013.43"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-3-319-07566-2_25","volume-title":"Combinatorial Pattern Matching","author":"KG Larsen","year":"2014","unstructured":"Larsen, K.G., Munro, J.I., Nielsen, J.S., Thankachan, S.V.: On hardness of several string indexing problems. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 242\u2013251. Springer, Heidelberg (2014)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/spe.2203","volume":"45","author":"D Lemire","year":"2013","unstructured":"Lemire, D., Boytsov, L.: Decoding billions of integers per second through vectorization. Soft. Prac. Exp. 45, 1\u201329 (2013)","journal-title":"Soft. Prac. Exp."},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535933","volume":"46","author":"G Navarro","year":"2014","unstructured":"Navarro, G.: Spaces, trees and colors: the algorithmic landscape of document retrieval on sequences. ACM Comp. Surv. 46(4), 1\u201347 (2014)","journal-title":"ACM Comp. Surv."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Navarro, G., Nekrich, Y.: Top- k document retrieval in optimal time and linear space. In: Proceedings of the SODA, pp. 1066\u20131077 (2012)","DOI":"10.1137\/1.9781611973099.84"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-30850-5_26","volume-title":"Experimental Algorithms","author":"G Navarro","year":"2012","unstructured":"Navarro, G., Providel, E.: Fast, small, simple rank\/select on bitmaps. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 295\u2013306. Springer, Heidelberg (2012)"},{"issue":"2","key":"18_CR19","first-page":"1","volume":"19","author":"G Navarro","year":"2014","unstructured":"Navarro, G., Puglisi, S.J., Valenzuela, D.: General document retrieval in compact space. J. Experimental Alg. 19(2), 1\u201346 (2014)","journal-title":"J. Experimental Alg."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2014.05.005","volume":"542","author":"G Navarro","year":"2014","unstructured":"Navarro, G., Thankachan, S.V.: New space\/time tradeoffs for top-k document retrieval on sequences. Theor. Comput. Sci. 542, 83\u201397 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Ottaviano, G., Venturini, R.: Partitioned Elias-Fano indexes. In: Proceedings of the SIGIR, pp. 273\u2013282 (2014)","DOI":"10.1145\/2600428.2609615"},{"key":"18_CR22","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding $$k$$-ary trees and multisets. In: Proceedings of the SODA, pp. 233\u2013242 (2002)"},{"issue":"2","key":"18_CR23","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/S0196-6774(03)00087-7","volume":"48","author":"K Sadakane","year":"2003","unstructured":"Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. J. Alg. 48(2), 294\u2013313 (2003)","journal-title":"J. Alg."},{"issue":"4","key":"18_CR24","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theory Comput. Syst. 41(4), 589\u2013607 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jda.2006.03.011","volume":"5","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Succinct data structures for flexible text retrieval systems. J. Discrete Alg. 5(1), 12\u201322 (2007)","journal-title":"J. Discrete Alg."},{"key":"18_CR26","unstructured":"Strohman, T., Metzler, D., Turtle, H., Croft, W.B.: Indri: a language model-based search engine for complex queries. In: Proceedings of the International Conference on Intelligent Analysis (2005)"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Vigna, S.: Quasi-succinct indices. In: Proceedings of the WSDM, pp. 83\u201392 (2013)","DOI":"10.1145\/2433396.2433409"},{"key":"18_CR28","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 WWW, pp. 401\u2013410 (2009)","DOI":"10.1145\/1526709.1526764"},{"issue":"2","key":"18_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132956.1132959","volume":"38","author":"J Zobel","year":"2006","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comp. Surv. 38(2), 1\u201356 (2006)","journal-title":"ACM Comp. Surv."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T14:23:58Z","timestamp":1717943038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}