{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:12Z","timestamp":1759639092585},"reference-count":34,"publisher":"Oxford University Press (OUP)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"DOI":"10.1093\/comjnl\/bxw103","type":"journal-article","created":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T15:05:36Z","timestamp":1480604736000},"source":"Crossref","is-referenced-by-count":0,"title":["Compressed Bit vectors Based on Variable-to-Fixed Encodings"],"prefix":"10.1093","author":[{"given":"Seungbum","family":"Jo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stelios","family":"Joannou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daisuke","family":"Okanohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,12,28]]},"reference":[{"key":"2016122917101284000_bxw103v1.1","unstructured":"Clark, D.R. and Munro, J.I. (1996) Efficient Suffix Trees on Secondary Storage (Extended Abstract). In Proc. 7th Ann. Symp. Discrete Algorithms (SODA), Atlanta, GA, January 28\u201330, pp. 383\u2013391. SIAM."},{"key":"2016122917101284000_bxw103v1.2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1137\/S0097539700369909","article-title":"Low redundancy in static dictionaries with constant query time","volume":"31","author":"Pagh","year":"2001","journal-title":"SIAM J. Comput."},{"key":"2016122917101284000_bxw103v1.3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1290672.1290680","article-title":"Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets","volume":"3","author":"Raman","year":"2007","journal-title":"ACM Trans. Algorithms"},{"key":"2016122917101284000_bxw103v1.4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.tcs.2007.07.042","article-title":"Compressed data structures: dictionaries and data-aware measures","volume":"387","author":"Gupta","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"2016122917101284000_bxw103v1.5","doi-asserted-by":"crossref","unstructured":"Delpratt, O. , Rahman, N. and Raman, R. (2007) Compressed Prefix Sums. In Proc. 33rd Conf. Current Trends in Theory and Practice of Computer Science (SOFSEM), Harrachov, Czech Republic, January 20\u201326, pp. 235\u2013247. Springer.","DOI":"10.1007\/978-3-540-69507-3_19"},{"key":"2016122917101284000_bxw103v1.6","doi-asserted-by":"crossref","unstructured":"Delpratt, O. , Rahman, N. and Raman, R. (2006) Engineering the Louds Succinct Tree Representation. In Proc. 5th Int. Workshop on Experimental Algorithms (WEA), Cala Galdana, Menorca, Spain, May 24\u201327, pp. 134\u2013145. Springer.","DOI":"10.1007\/11764298_12"},{"key":"2016122917101284000_bxw103v1.7","doi-asserted-by":"crossref","unstructured":"Golynski, A. , Grossi, R. , Gupta, A. , Raman, R. and Satti, S.R. (2007) On the Size of Succinct Indices. In Proc. 15th Ann. European Symposium on Algorithms (ESA), Eilat, Israel, October 8\u201310, pp. 371\u2013382. Springer.","DOI":"10.1007\/978-3-540-75520-3_34"},{"key":"2016122917101284000_bxw103v1.8","unstructured":"Gonz\u00e1lez, R. , Grabowski, S. , M\u00e4kinen, V. and Navarro., G. (2005) Practical Implementation of Rank and Select Queries. In Poster Proc. 7th Int. Workshop on Experimental Algorithms, (WEA) 2005, Santorini Island, Greece, May 10\u201313, pp. 27\u201338. CTI Press and Ellinika Grammata."},{"key":"2016122917101284000_bxw103v1.9","doi-asserted-by":"crossref","unstructured":"Kim, D.K. , Na, J.C. , Kim, J.E. and Park, K. (2005) Efficient Implementation of Rank and Select Functions for Succinct Representation. In Proc. 4th International Workshop on Experimental Algorithms (WEA), Santorini Island, Greece, May 10\u201313, pp. 315\u2013327. Springer.","DOI":"10.1007\/11427186_28"},{"key":"2016122917101284000_bxw103v1.10","doi-asserted-by":"crossref","unstructured":"Vigna, S. (2008) Broadword Implementation of Rank\/Select Queries. In Proc. 7th International Workshop on Experimental Algorithms (WEA), Provincetown, MA, USA, May 30\u2013June 1, pp. 154\u2013168. Springer.","DOI":"10.1007\/978-3-540-68552-4_12"},{"key":"2016122917101284000_bxw103v1.11","doi-asserted-by":"crossref","unstructured":"Patrascu, M. and Thorup, M. (2006) Time-Space Trade-Offs for Predecessor Search. In Proc. 38th Ann. ACM Symposium on Theory of Computing (STOC), Seattle, WA, USA, May 21\u201323, pp. 232\u2013240. SIAM.","DOI":"10.1145\/1132516.1132551"},{"key":"2016122917101284000_bxw103v1.12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.09.014"},{"key":"2016122917101284000_bxw103v1.13","doi-asserted-by":"crossref","unstructured":"Okanohara, D. and Sadakane, K. (2007) Practical Entropy-Compressed Rank\/Select Dictionary. In Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, USA, January 6. SIAM.","DOI":"10.1137\/1.9781611972870.6"},{"key":"2016122917101284000_bxw103v1.14","first-page":"19","article-title":"General document retrieval in compact space","volume":"14","author":"Navarro","year":"2014","journal-title":"ACM J. Exp. Algorithmics"},{"key":"2016122917101284000_bxw103v1.15","doi-asserted-by":"crossref","unstructured":"Navarro, G. and Providel, E. (2012) Fast, Small, Simple Rank\/Select on Bitmaps. In Proc.11th Int. Symp. Experimental Algorithms (SEA), Bordeaux, France, June 7\u20139, pp. 295\u2013306. Springer.","DOI":"10.1007\/978-3-642-30850-5_26"},{"key":"2016122917101284000_bxw103v1.16","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J. , Kempa, D. and Puglisi, S. J. (2014) Hybrid Compression of Bitvectors for the FM-Index. In Proc. Data Compression Conf., (DCC), Snowbird, UT, USA, March 26\u201328, pp. 302-311. IEEE.","DOI":"10.1109\/DCC.2014.87"},{"key":"2016122917101284000_bxw103v1.17","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1002\/asi.4630330105","article-title":"Text compression using variable-to fixed-length encodings","volume":"33","author":"Cooper","year":"1982","journal-title":"JASIS"},{"key":"2016122917101284000_bxw103v1.18","unstructured":"Tunstall, B.P. (1967) Synthesis of noiseless compression codes. PhD Thesis, Georgia Tech."},{"key":"2016122917101284000_bxw103v1.19","unstructured":"Khodak, G.L. (1969) Connection Between Redundancy and Average Delay of Fixed-Length Coding. In All-Union Conf. Problems of Theoretical Cybernetics. (in Russian)."},{"key":"2016122917101284000_bxw103v1.20","doi-asserted-by":"crossref","first-page":"2928","DOI":"10.1109\/TIT.2010.2046248","article-title":"Tunstall code, Khodak variations, and random walks","volume":"56","author":"Drmota","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2016122917101284000_bxw103v1.21","doi-asserted-by":"crossref","unstructured":"Patrascu, M. (2008) Succincter. In Proc. 49th Ann. IEEE Symp. Foundations Comput. Science (FOCS), Philadelphia, PA, USA, October 25\u201328, pp. 305\u2013313. IEEE Computer Society.","DOI":"10.1109\/FOCS.2008.83"},{"key":"2016122917101284000_bxw103v1.22","doi-asserted-by":"crossref","unstructured":"Patrascu, M. and Viola, E. (2010) Cell-Probe Lower Bounds for Succinct Partial Sums. In Proc. 21st Ann. Symp. Discrete Algorithms (SODA), Austin, TX, USA, January 17\u201319, pp. 117\u2013122. SIAM.","DOI":"10.1137\/1.9781611973075.11"},{"key":"2016122917101284000_bxw103v1.23","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1007\/s00453-013-9767-2","article-title":"Optimal indexes for sparse bit vectors","volume":"69","author":"Golynski","year":"2014","journal-title":"Algorithmica"},{"key":"2016122917101284000_bxw103v1.24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"2016122917101284000_bxw103v1.25","unstructured":"Goethals, B. and Zaki, M. (2004). Fimi: frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/."},{"key":"2016122917101284000_bxw103v1.26","unstructured":"Ferragina, P. and Manzini, G. (2001) An experimental study of an opportunistic index. In Proc. 12th Annual Symposium on Discrete Algorithms (SODA), Washington, DC, USA, January 7\u20139, pp. 269\u2013278. SIAM."},{"key":"2016122917101284000_bxw103v1.27","unstructured":"Ferragina, P. and Navarro, G. Pizza&chili corpus. http:\/\/pizzachili.dcc.uchile.cl\/texts.html."},{"key":"2016122917101284000_bxw103v1.28","unstructured":"Tabei, Y. fmindex-plus-plus. https:\/\/code.google.com\/p\/fmindex-plus-plus\/."},{"key":"2016122917101284000_bxw103v1.29","doi-asserted-by":"crossref","unstructured":"Gog, S. , Beller, T. , Moffat, A. and Petri, M. (2014) From Theory to Practice: Plug and Play With Succinct Data Structures. In Proc. 13th Int. Symposium Experimental Algorithms, (SEA) 2014, Copenhagen, Denmark, June 29\u2013July 1, pp. 326\u2013337. Springer.","DOI":"10.1007\/978-3-319-07959-2_28"},{"key":"2016122917101284000_bxw103v1.30","doi-asserted-by":"crossref","unstructured":"Jurkiewicz, T. and Mehlhorn, K. (2013) The Cost of Address Translation. In Proc. 15th Meeting on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, USA, January 7, pp. 148\u2013162. SIAM.","DOI":"10.1137\/1.9781611972931.13"},{"key":"2016122917101284000_bxw103v1.31","unstructured":"Okanohara, D. (2010). Succinct data structure for sparse arrays and integers. https:\/\/code.google.com\/p\/sdarray\/."},{"key":"2016122917101284000_bxw103v1.32","unstructured":"Okanohara, D. (2012). Compressed rank select dictionary. https:\/\/code.google.com\/p\/rsdic\/."},{"key":"2016122917101284000_bxw103v1.33","doi-asserted-by":"crossref","first-page":"608","DOI":"10.3390\/a7040608","article-title":"High-order entropy compressed bit vectors with rank\/select","volume":"7","author":"Beskers","year":"2014","journal-title":"Algorithms"},{"key":"2016122917101284000_bxw103v1.34","doi-asserted-by":"crossref","unstructured":"Jo, S. , Joannou, S. , Okanohara, D. , Raman, R. and Satti, S. R. (2014) Compressed Bit Vectors Based on Variable-to-Fixed Encodings. In Proc. Data Comp. Conf., (DCC), Snowbird, UT, USA, March 26\u201328, p. 409. IEEE.","DOI":"10.1109\/DCC.2014.85"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T01:25:05Z","timestamp":1568597105000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,28]]},"references-count":34,"alternative-id":["10.1093\/comjnl\/bxw103"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw103","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,28]]}}}