{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:38Z","timestamp":1759638938073},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_17","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"170-183","source":"Crossref","is-referenced-by-count":12,"title":["Compact Rich-Functional Binary Relation Representations"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Claude","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"1","volume-title":"Recent Advances in Applied Probability","author":"R. Baeza-Yates","year":"2004","unstructured":"Baeza-Yates, R., Navarro, G.: Modeling text databases. In: Recent Advances in Applied Probability, pp. 1\u201325. Springer, Heidelberg (2004)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-77120-3_29","volume-title":"Algorithms and Computation","author":"J. Barbay","year":"2007","unstructured":"Barbay, J., Aleardi, L.C., He, M., Munro, J.I.: Succinct representation of labeled graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 316\u2013328. Springer, Heidelberg (2007)"},{"issue":"3","key":"17_CR3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.tcs.2007.07.015","volume":"387","author":"J. Barbay","year":"2007","unstructured":"Barbay, J., Golynski, A., Munro, I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. TCS\u00a0387(3), 284\u2013297 (2007)","journal-title":"TCS"},{"key":"17_CR4","unstructured":"Barbay, J., He, M., Munro, I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: SODA, pp. 680\u2013689 (2007)"},{"key":"17_CR5","unstructured":"Barbay, J., Navarro, G.: Compressed representations of permutations, and applications. In: STACS. pp. 111\u2013122 (2009)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: compression techniques. In: WWW, pp. 595\u2013602 (2004)","DOI":"10.1145\/988672.988752"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-642-03367-4_9","volume-title":"WADS 2009","author":"P. Bose","year":"2009","unstructured":"Bose, P., He, M., Maheshwari, A., Morin, P.: Succinct orthogonal range search structures on a grid with applications to text indexing. In: Dehne, F., Gavrilova, M.L., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 98\u2013109. Springer, Heidelberg (2009)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Chien, Y.F., Hon, W.K., Shah, R., Vitter, J.: Geometric Burrows-Wheeler transform: Linking range searching and text indexing. In: DCC. pp. 252\u2013261 (2008)","DOI":"10.1109\/DCC.2008.67"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: KDD, pp. 219\u2013228 (2009)","DOI":"10.1145\/1557019.1557049"},{"key":"17_CR10","unstructured":"Clark, D.: Compact Pat Trees. Ph.D. thesis, Univ. of Waterloo, Canada (1996)"},{"key":"17_CR11","unstructured":"Claude, F.: Compressed Data Structures for Web Graphs. MSc. thesis, U. Chile (2008)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-75530-2_11","volume-title":"String Processing and Information Retrieval","author":"F. Claude","year":"2007","unstructured":"Claude, F., Navarro, G.: A fast and compact Web graph representation. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol.\u00a04726, pp. 105\u2013116. Springer, Heidelberg (2007)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-03816-7_21","volume-title":"Mathematical Foundations of Computer Science 2009","author":"F. Claude","year":"2009","unstructured":"Claude, F., Navarro, G.: Self-indexed text compression using straight-line programs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 235\u2013246. Springer, Heidelberg (2009)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/1240233.1240243","volume":"3","author":"P. Ferragina","year":"2007","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM TALG 3(2), article 20 (2007)","journal-title":"ACM TALG"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Golynski, A., Munro, J.I., Rao, S.S.: Rank\/select operations on large alphabets: a tool for text indexing. In: SODA, pp. 368\u2013373 (2006)","DOI":"10.1145\/1109557.1109599"},{"key":"17_CR16","unstructured":"Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: SODA. pp. 841\u2013850 (2003)"},{"key":"17_CR17","unstructured":"K\u00e4rkk\u00e4inen, J.: Repetition-Based Text Indexing. Ph.D. thesis, U. Helsinki, Finland (1999)"},{"issue":"3","key":"17_CR18","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.tcs.2007.07.013","volume":"387","author":"V. M\u00e4kinen","year":"2007","unstructured":"M\u00e4kinen, V., Navarro, G.: Rank and select revisited and extended. TCS\u00a0387(3), 332\u2013347 (2007)","journal-title":"TCS"},{"issue":"3","key":"17_CR19","first-page":"32","volume":"4","author":"V. M\u00e4kinen","year":"2008","unstructured":"M\u00e4kinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. ACM TALG 4(3), article 32 (2008)","journal-title":"ACM TALG"},{"issue":"1","key":"17_CR20","first-page":"87","volume":"2","author":"G. Navarro","year":"2004","unstructured":"Navarro, G.: Indexing text using the Ziv-Lempel trie. JDA\u00a02(1), 87\u2013114 (2004)","journal-title":"JDA"},{"key":"17_CR21","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA, pp. 233\u2013242 (2002)"},{"key":"17_CR22","volume-title":"Managing Gigabytes","author":"I. Witten","year":"1999","unstructured":"Witten, I., Moffat, A., Bell, T.: Managing Gigabytes, 2nd edn. Morgan Kaufmann Publishers, San Francisco (1999)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:51:13Z","timestamp":1606186273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}