{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:27:59Z","timestamp":1773329279352,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319079585","type":"print"},{"value":"9783319079592","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_28","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:44:25Z","timestamp":1402404265000},"page":"326-337","source":"Crossref","is-referenced-by-count":233,"title":["From Theory to Practice: Plug and Play with Succinct Data Structures"],"prefix":"10.1007","author":[{"given":"Simon","family":"Gog","sequence":"first","affiliation":[]},{"given":"Timo","family":"Beller","sequence":"additional","affiliation":[]},{"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Petri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-89097-3_18","volume-title":"String Processing and Information Retrieval","author":"F. Claude","year":"2008","unstructured":"Claude, F., Navarro, G.: Practical rank\/select queries over arbitrary sequences. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 176\u2013187. Springer, Heidelberg (2008)"},{"key":"28_CR2","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":"J.S. 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.\u00a06347, pp. 194\u2013205. Springer, Heidelberg (2010)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Culpepper, J.S., Petri, M., Scholer, F.: Efficient in-memory top-k document retrieval. In: Proc. SIGIR, pp. 225\u2013234 (2012)","DOI":"10.1145\/2348283.2348317"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Gonz\u00e1lez, R., Navarro, G., Venturini, R.: Compressed text indexes: From theory to practice. J. Experimental Alg.\u00a013 (2008)","DOI":"10.1145\/1412228.1455268"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Gog, S., Petri, M.: Optimized succinct data structures for massive data. In: Soft. Prac. & Exp. (2013) (to appear) , \n                    \n                      http:\/\/dx.doi.org\/10.1002\/spe.2198","DOI":"10.1002\/spe.2198"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-38527-8_3","volume-title":"Experimental Algorithms","author":"R. Grossi","year":"2013","unstructured":"Grossi, R., Ottaviano, G.: Design of practical succinct data structures for large data collections. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol.\u00a07933, pp. 5\u201317. Springer, Heidelberg (2013)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Hon, W.-K., Shah, R., Vitter, J.S.: Space-efficient framework for top-k string retrieval problems. In: Proc. FOCS, pp. 713\u2013722 (2009)","DOI":"10.1109\/FOCS.2009.19"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Konow, R., Navarro, G.: Faster compact top-k document retrieval. In: Proc. DCC, pp. 5\u201317 (2013)","DOI":"10.1109\/DCC.2013.43"},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.tcs.2007.07.017","volume":"387","author":"N. Jesper Larsson","year":"2007","unstructured":"Jesper Larsson, N., Sadakane, K.: Faster suffix sorting. Theor. Comp. Sc.\u00a0387(3), 258\u2013272 (2007)","journal-title":"Theor. Comp. Sc."},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11496656_5","volume-title":"Combinatorial Pattern Matching","author":"V. M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 45\u201356. Springer, Heidelberg (2005)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Moffat, A., Gog, S.: String search experimentation using massive data. Phil. Trans. Royal Soc. A (to appear, 2014)","DOI":"10.1098\/rsta.2013.0135"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Navarro, G., Nekrich, Y.: Top-k document retrieval in optimal time and linear space. In: Proc. SODA, pp. 1066\u20131078 (2012)","DOI":"10.1137\/1.9781611973099.84"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Spaces, trees and colors: The algorithmic landscape of document retrieval on sequences. ACM Comp. Surv. (to appear, 2014)","DOI":"10.1145\/2535933"},{"key":"28_CR14","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.\u00a07276, pp. 295\u2013306. Springer, Heidelberg (2012)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-20662-7_17","volume-title":"Experimental Algorithms","author":"G. Navarro","year":"2011","unstructured":"Navarro, G., Puglisi, S.J., Valenzuela, D.: Practical compressed document retrieval. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 193\u2013205. Springer, Heidelberg (2011)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Proc. ALENEX (2007)","DOI":"10.1137\/1.9781611972870.6"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Patil, M., Thankachan, S.V., Shah, R., Hon, W.-K., Vitter, J.S., Chandrasekaran, S.: Inverted indexes for phrases and strings. In: Proc. SIGIR, pp. 555\u2013564 (2011)","DOI":"10.1145\/2009916.2009992"},{"key":"28_CR18","unstructured":"Raman, R., Raman, V., Srinivasa Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. SODA, pp. 233\u2013242 (2002)"},{"issue":"2","key":"28_CR19","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.\u00a048(2), 294\u2013313 (2003)","journal-title":"J. Alg."},{"issue":"4","key":"28_CR20","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 Comp. Sys.\u00a041(4), 589\u2013607 (2007)","journal-title":"Theory Comp. Sys."},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-68552-4_12","volume-title":"Experimental Algorithms","author":"S. Vigna","year":"2008","unstructured":"Vigna, S.: Broadword implementation of rank\/select queries. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 154\u2013168. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:47:23Z","timestamp":1558907243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}