Skip to main content
Springer Nature Link
Log in

Rank and Select Operations on Sequences

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 183 Accesses

Years and Authors of Summarized Original Work

  • 2003; Grossi, Gupta, Vitter

  • 2006; Golynski, Munro, Rao

  • 2007; Ferragina, Manzini, Mäkinen, Navarro

  • 2011; Barbay, He, Munro, Rao

  • 2012; Belazzougui, Navarro

  • 2013; Navarro, Nekrich

  • 2014; Barbay, Claude, Gagie, Navarro, Nekrich

Problem Definition

The query \(S.\text{rank}_{a}(i)\) on a sequence S is defined to return the number of occurrences of the distinct character a among the first i characters of S, and the query \(S.\text{select}_{a}(j)\) is defined to return the position of the jth occurrence of a in S (if it exists). Since rank and select queries are fundamental to the field of succinct and compressed data structures, researchers have proposed several data structures that answer them quickly while using little space. Most of these data structures also support fast random access to S, and a few of them support fast insertions and deletions of characters in S. Some of them return \(S.\text{rank}_{a}(i)\) more quickly when the ith...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Barbay J, He M, Munro JI, Rao SS (2011) Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans Algorithms 7(4):1–27

    Article  MathSciNet  MATH  Google Scholar 

  2. Barbay J, Claude F, Gagie T, Navarro G, Nekrich Y (2014) Efficient fully-compressed sequence representations. Algorithmica 69(1):232–268 [20] was presented in Philadelphia, USA

    Google Scholar 

  3. Belazzougui D, Navarro G (2012) New lower and upper bounds for representing sequences. In: Proceedings of the 20th European symposium on algorithms, Ljubljana, Slovenia, pp 181–192

    Google Scholar 

  4. Belazzougui D, Navarro G (2013) New lower and upper bounds for representing sequences. CoRR abs/1111.2621v2. To appear in ACM Transactions on Algorithms

    Google Scholar 

  5. Belazzougui D, Navarro G (2014) Alphabet-independent compressed text indexing. ACM Trans Algorithms 10(4):1–19

    Article  MathSciNet  MATH  Google Scholar 

  6. Claude F, Navarro G, Ordóñez A (2015) The wavelet matrix: an efficient wavelet tree for large alphabets. Inf Syst 47:15–32

    Article  Google Scholar 

  7. Ferragina P, Manzini G, Mäkinen V, Navarro G (2007) Compressed representations of sequences and full-text indexes. ACM Trans Algorithms 3(2)

    Google Scholar 

  8. Fredman ML, Saks ME (1989) The cell probe complexity of dynamic data structures. In: Proceedings of the 21st symposium on theory of computing, Seattle, USA pp 345–354

    Google Scholar 

  9. Golynski A (2009) Cell probe lower bounds for succinct data structures. In: Proceedings of the 20th symposium on discrete algorithms, New York, USA, pp 625–634

    Chapter  Google Scholar 

  10. Golynski A, Munro JI, Rao SS (2006) Rank/select operations on large alphabets: a tool for text indexing. In: Proceedings of the 17th symposium on discrete algorithms, Miami, USA, pp 368–373

    Google Scholar 

  11. Golynski A, Raman R, Rao SS (2008) On the redundancy of succinct data structures. In: Proceedings of the 11th scandinavian workshop on algorithm theory, Gothenburg, Sweden, pp 148–159

    Google Scholar 

  12. Grossi R, Gupta A, Vitter JS (2003) High-order entropy-compressed text indexes. In: Proceedings of the 14th symposium on discrete algorithms, Baltimore, USA, pp 841–850

    Google Scholar 

  13. Grossi R, Orlandi A, Raman R (2010) Optimal trade-offs for succinct string indexes. In: Proceedings of the 37th international colloquium on automata, languages and programming, Bordeaux, France, pp 678–689

    Chapter  Google Scholar 

  14. Grossi R, Raman R, Satti SR, Venturini R (2013) Dynamic compressed strings with random access. In: Proceedings of the 40th international colloquium on languages, automata and programming, Riga, Latvia, pp 504–515

    Google Scholar 

  15. He M, Munro JI (2010) Succinct representations of dynamic strings. In: Proceedings of the 17th symposium on string processing and information retrieval, Los Cabos, Mexico, pp 334–346

    Chapter  Google Scholar 

  16. Jacobson G (1989) Space-efficient static trees and graphs. In: Proceedings of the 30th symposium on foundations of computer science, Research Triangle Park, North Carolina, USA, pp 549–554

    Chapter  Google Scholar 

  17. Navarro G, Nekrich Y (2013) Optimal dynamic sequence representations. In: Proceedings of the 24th symposium on discrete algorithms, New Orleans, USA, pp 865–876

    Google Scholar 

  18. Navarro G, Nekrich Y (2013) Optimal dynamic sequence representations. CoRR abs/1206.6982v2. To appear in SIAM Journal on Computing

    Google Scholar 

  19. Navarro G, Sadakane K (2014) Fully functional static and dynamic succinct trees. ACM Trans Algorithms 10(3):1–39

    Article  MathSciNet  MATH  Google Scholar 

  20. Pǎtraşcu M (2008) Succincter. In: Proceedings of the 49th symposium on foundations of computer science, Philadelphia, USA, pp 305–313

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Eastern Piedmont, Alessandria, Italy

    Travis Gagie

  2. Department of Computer Science, University of Helsinki, Gustaf Hällströmin katu 2b, 00014, Helsinki, Finland

    Travis Gagie

Authors
  1. Travis Gagie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Gagie, T. (2016). Rank and Select Operations on Sequences. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_638

Download citation

Publish with us

Policies and ethics