{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:54Z","timestamp":1759638414824},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084039"},{"type":"electronic","value":"9783319084046"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08404-6_30","type":"book-chapter","created":{"date-parts":[[2014,6,25]],"date-time":"2014-06-25T03:55:08Z","timestamp":1403668508000},"page":"344-356","source":"Crossref","is-referenced-by-count":1,"title":["Ranked Document Selection"],"prefix":"10.1007","author":[{"given":"J. Ian","family":"Munro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","volume":"47","author":"M. Fredman","year":"1993","unstructured":"Fredman, M., Willard, D.: Surpassing the information theoretic barrier with fusion trees. J. Comp. Sys. Sci.\u00a047, 424\u2013436 (1993)","journal-title":"J. Comp. Sys. Sci."},{"key":"30_CR2","unstructured":"Grossi, R., Orlandi, A., Raman, R., Rao, S.S.: More haste, less waste: Lowering the redundancy in fully indexable dictionaries. In: STACS, pp. 517\u2013528 (2009)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-40273-9_22","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","author":"W.-K. Hon","year":"2013","unstructured":"Hon, W.-K., Patil, M., Shah, R., Thankachan, S.V., Vitter, J.S.: Indexes for document retrieval with relevance. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Ianfest-66. LNCS, vol.\u00a08066, pp. 351\u2013362. Springer, Heidelberg (2013)"},{"issue":"4","key":"30_CR4","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.jda.2010.08.003","volume":"8","author":"W.-K. Hon","year":"2010","unstructured":"Hon, W.-K., Patil, M., Shah, R., Wu, S.-B.: Efficient index for retrieving top-k most frequent documents. J. Discr. Alg.\u00a08(4), 402\u2013417 (2010)","journal-title":"J. Discr. Alg."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jda.2012.09.002","volume":"17","author":"W.-K. Hon","year":"2012","unstructured":"Hon, W.-K., Shah, R., Thankachan, S.V., Vitter, J.S.: On position restricted substring searching in succinct space. J. Discr. Alg.\u00a017, 109\u2013114 (2012)","journal-title":"J. Discr. Alg."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Hon, W.-K., Shah, R., Thankachan, S.V., Vitter, J.S.: Space-efficient framework for top-k string retrieval. J. of the ACM (to appear, 2014)","DOI":"10.1145\/2590774"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Hon, W.-K., Shah, R., Vitter, J.S.: Space-efficient framework for top-k string retrieval problems. In: FOCS, pp. 713\u2013722 (2009)","DOI":"10.1109\/FOCS.2009.19"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-40273-9_18","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","author":"M. Lewenstein","year":"2013","unstructured":"Lewenstein, M.: Orthogonal range searching for text indexing. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Ianfest-66. LNCS, vol.\u00a08066, pp. 267\u2013302. Springer, Heidelberg (2013)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/11682462_64","volume-title":"LATIN 2006: Theoretical Informatics","author":"V. M\u00e4kinen","year":"2006","unstructured":"M\u00e4kinen, V., Navarro, G.: Position-restricted substring searching. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 703\u2013714. Springer, Heidelberg (2006)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Munro, I.: Tables. In: FSTTCS, pp. 37\u201342 (1996)","DOI":"10.1007\/3-540-62034-6_35"},{"key":"30_CR11","unstructured":"Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: SODA, pp. 657\u2013666 (2002)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Spaces, trees and colors: The algorithmic landscape of document retrieval on sequences. ACM Computing Surveys\u00a046(4), article 52 (2014)","DOI":"10.1145\/2535933"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Navarro, G., Nekrich, Y.: Top-k document retrieval in optimal time and linear space. In: SODA, pp. 1066\u20131077 (2012)","DOI":"10.1137\/1.9781611973099.84"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-02432-5_28","volume-title":"String Processing and Information Retrieval","author":"G. Navarro","year":"2013","unstructured":"Navarro, G., Thankachan, S.V.: Faster top-k document retrieval in optimal space. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol.\u00a08214, pp. 255\u2013262. Springer, Heidelberg (2013)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Russo, L., Navarro, G., Oliveira, A.: Fully-compressed suffix trees. ACM Trans. Alg. 7(4), art. 53 (2011)","DOI":"10.1145\/2000807.2000821"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: SODA, pp. 134\u2013149 (2010)","DOI":"10.1137\/1.9781611973075.13"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/978-3-642-40450-4_68","volume-title":"Algorithms \u2013 ESA 2013","author":"R. Shah","year":"2013","unstructured":"Shah, R., Sheng, C., Thankachan, S.V., Vitter, J.S.: Top-k document retrieval in external memory. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 803\u2013814. Springer, Heidelberg (2013)"},{"issue":"12","key":"30_CR18","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.ipl.2013.03.012","volume":"113","author":"D. Tsur","year":"2013","unstructured":"Tsur, D.: Top-k document retrieval in optimal space. Inf. Process. Lett.\u00a0113(12), 440\u2013443 (2013)","journal-title":"Inf. Process. Lett."},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: SWAT (FOCS), pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08404-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T04:15:30Z","timestamp":1558930530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08404-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084039","9783319084046"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08404-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}