Fast, small, simple rank/select on bitmaps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7276 LNCS, Issue , 2012, Pages 295-306

  Navarro, Gonzalo ^a   Providel, Eliana ^a,b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSIDAD DE VALPARAÍSO   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

BIT MAPS; COMPACT DATA STRUCTURE; CONSTANT TIME; SPACE OVERHEAD; THEORY AND PRACTICE; TIME PERFORMANCE;

ALGORITHMS;

DATA STRUCTURES;

EID: 84864349248     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-30850-5_26     Document Type: Conference Paper

References (16)

1. Arroyuelo, D., Cánovas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Proc. 11th ALENEX, pp. 84-97 (2010)
2. Clark, D.: Compact Pat Trees. PhD thesis, University of Waterloo, Canada (1996)
3. Claude, F., Navarro, G.: Practical Rank/Select Queries over Arbitrary Sequences. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 176-187. Springer, Heidelberg (2008)
4. Ferragina, P., Manzini, G.: Indexing compressed texts. Journal of the ACM 52(4), 552-581 (2005)
5. Golynski, A.: Optimal Lower Bounds for Rank and Select Indexes. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 370-381. Springer, Heidelberg (2006)
6. Golynski, A., Munro, I., Rao, S.: Rank/select operations on large alphabets: a tool for text indexing. In: Proc. 17th SODA, pp. 368-373 (2006)
7. González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Proc. 4th WEA, pp. 27-38 (2005) (posters)
8. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th SODA, pp. 841-850 (2003)
9. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549-554 (1989)
10. Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996)
11. Munro, I., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. In: Proc. 38th FOCS, pp. 118-126 (1997)
12. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. 9th ALENEX (2007)
13. Pagh, R.: Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 595-604. Springer, Heidelberg (1999)
14. Patrascu, M.: Succincter. In: Proc. 49th FOCS, pp. 305-313 (2008)
15. Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th SODA, pp. 233-242 (2002)
16. Vigna, S.: Broadword Implementation of Rank/Select Queries. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 154-168. Springer, Heidelberg (2008)