Skip to main content
SpringerLink
Log in

Faster Practical Block Compression for Rank/Select Dictionaries

  • Conference paper
  • First Online:
String Processing and Information Retrieval (SPIRE 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10508))

Included in the following conference series:

  • 644 Accesses

Abstract

This paper presents faster practical encoding and decoding procedures for block compression that underlies both static and dynamic compressed rank/select bitmaps based on the RRR (Raman, Raman, and Rao) scheme. Our procedures use a novel combination of universal tables for chunkwise processing. Experimental results showed that our procedures were faster than existing ones on 64-bit blocks.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The base of the logarithm is 2 throughout this paper.

References

  1. Brodnik, A., Munro, J.I.: Membership in constant time and almost-minimum space. SIAM J. Comput. 28(5), 1627–1640 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Clark, D.R.: Compact PAT trees. Ph.D. thesis, University of Waterloo (1996)

    Google Scholar 

  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). doi:10.1007/978-3-540-89097-3_18

    Chapter  Google Scholar 

  4. Cordova, J., Navarro, G.: Practical dynamic entropy-compressed bitvectors with applications. In: Goldberg, A.V., Kulikov, A.S. (eds.) SEA 2016. LNCS, vol. 9685, pp. 105–117. Springer, Cham (2016). doi:10.1007/978-3-319-38851-9_8

    Google Scholar 

  5. Gog, S., Petri, M.: Optimized succinct data structures for massive data. Softw. Pract. Exper. 44(11), 1287–1314 (2014)

    Article  Google Scholar 

  6. González, R., Grabowski, S., Mäkinen, V., Navarro, G.: Practical implementation of rank and select queries. In: Poster Proceedings of WEA 2005, pp. 27–38. CTI Press and Ellinika Grammata (2005)

    Google Scholar 

  7. Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of FOCS 1989. pp. 549–554. IEEE Computer Society (1989)

    Google Scholar 

  8. Klitzke, P., Nicholson, P.K.: A general framework for dynamic succinct and compressed data structures. In: Proceedings of ALENEX 2016, pp. 160–173 (2016)

    Google Scholar 

  9. Mäkinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. ACM Trans. Algorithms 4(3), 32:1–32:38 (2008)

    Google Scholar 

  10. Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37–42. Springer, Heidelberg (1996). doi:10.1007/3-540-62034-6_35

    Chapter  Google Scholar 

  11. Navarro, G.: Compact Data Structures: A Practical Approach, 1st edn. Cambridge University Press, Cambridge (2016)

    Book  Google Scholar 

  12. Navarro, G., Providel, E.: Fast, small, simple rank/select on bitmaps. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 295–306. Springer, Heidelberg (2012). doi:10.1007/978-3-642-30850-5_26

    Chapter  Google Scholar 

  13. Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4) (2007)

    Google Scholar 

  14. Vigna, S.: Broadword implementation of rank/select queries. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 154–168. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68552-4_12

    Chapter  Google Scholar 

Download references

Acknowledgments

The author would like to thank anonymous reviewers and Shirou Maruyama for their valuable comments that greatly improved this paper.

Author information

Authors and Affiliations

  1. Rakuten Institute of Technology, Rakuten, Inc., Tokyo, Japan

    Yusaku Kaneta

Authors
  1. Yusaku Kaneta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yusaku Kaneta .

Editor information

Editors and Affiliations

  1. Università di Palermo, Palermo, Italy

    Gabriele Fici

  2. Università di Palermo, Palermo, Italy

    Marinella Sciortino

  3. Università di Pisa, Pisa, Italy

    Rossano Venturini

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kaneta, Y. (2017). Faster Practical Block Compression for Rank/Select Dictionaries. In: Fici, G., Sciortino, M., Venturini, R. (eds) String Processing and Information Retrieval. SPIRE 2017. Lecture Notes in Computer Science(), vol 10508. Springer, Cham. https://doi.org/10.1007/978-3-319-67428-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67428-5_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67427-8

  • Online ISBN: 978-3-319-67428-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation