Skip to main content
SpringerLink
Log in

Encoding Data Structures

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2015)

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

Included in the following conference series:

Abstract

In recent years, there has been an explosion of interest in succinct data structures, which store the given data in compact or compressed formats and answer queries on the data rapidly while it is still in its compressed format. Our focus in this talk is to introduce encoding data structures. Encoding data structures consider the data together with the queries and aim to store only as much information about the data as is needed to store the queries. Once this is done, the original data can be deleted. In many cases, one can obtain space-efficient encoding data structures even when the original data is incompressible.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brodal, G.S., Davoodi, P., Rao, S.S.: On space efficient two dimensional range minimum data structures. Algorithmica 63(4), 815–830 (2012), http://dx.doi.org/10.1007/s00453-011-9499-0

    Article  MATH  MathSciNet  Google Scholar 

  2. Brodnik, A., López-Ortiz, A., Raman, V., Viola, A. (eds.): Ianfest-66. LNCS, vol. 8066. Springer, Heidelberg (2013), http://dx.doi.org/10.1007/978-3-642-40273-9

    MATH  Google Scholar 

  3. Davoodi, P., Navarro, G., Raman, R., Satti, S.R.: Encoding range minima and range top-2 queries. Philosphical Transactions of the Royal Society A 372, 20130131 (2014), http://hdl.handle.net/2381/28856

    Article  Google Scholar 

  4. Davoodi, P., Raman, R., Satti, S.R.: On succinct representations of binary trees. CoRR abs/1410.4963 (2014), http://arxiv.org/abs/1410.4963 , preliminary version in COCOON 2012, LNCS 7434

  5. Demaine, E.D., Landau, G.M., Weimann, O.: On cartesian trees and range minimum queries. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 341–353. Springer, Heidelberg (2009), http://dx.doi.org/10.1007/978-3-642-02927-1_29

    Chapter  Google Scholar 

  6. Fischer, J.: Combined data structure for previous- and next-smaller-values. Theor. Comput. Sci. 412(22), 2451–2456 (2011), http://dx.doi.org/10.1016/j.tcs.2011.01.036

    Article  MATH  Google Scholar 

  7. Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465–492 (2011), http://dx.doi.org/10.1137/090779759

    Article  MATH  MathSciNet  Google Scholar 

  8. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: DeMillo, R.A. (ed.) Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1984, Washington, DC, USA. pp. 135–143. ACM (1984), http://doi.acm.org/10.1145/800057.808675

  9. Gawrychowski, P., Nicholson, P.K.: Optimal encodings for range min-max and top-k. CoRR abs/1411.6581 (2014), http://arxiv.org/abs/1411.6581

  10. Golin, M.J., Iacono, J., Krizanc, D., Raman, R., Rao, S.S.: Encoding 2-d range maximum queries. CoRR abs/1109.2885 (2011), http://arxiv.org/abs/1109.2885 , preliminary version in Asano, T., Nakano, S.-I., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 180–189. Springer, Heidelberg (2011)

  11. Grossi, R., Iacono, J., Navarro, G., Raman, R., Rao, S.S.: Encodings for range selection and top-k queries. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 553–564. Springer, Heidelberg (2013), http://dx.doi.org/10.1007/978-3-642-40450-4_47

    Chapter  Google Scholar 

  12. Jacobson, G.: Space-efficient static trees and graphs. In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, October 30-November 1, pp. 549–554. IEEE Computer Society (1989), http://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63533

  13. Jayapaul, V., Jo, S., Raman, V., Satti, S.R.: Space efficient data structures for nearest larger neighbor. In: Proc. IWOCA 2014 (to appear, 2014)

    Google Scholar 

  14. Jo, S., Raman, R., Satti, S.R.: Optimal encodings and indexes for nearest larger value problems. In: Rahman, M.S., Tomita, E. (eds.) WALCOM 2015. LNCS, vol. 8973, Springer, Heidelberg (2015)

    Google Scholar 

  15. Kurtz, S.: Reducing the space requirement of suffix trees. Softw., Pract. Exper. 29(13), 1149–1171 (1999), http://dx.doi.org/10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O

    Google Scholar 

  16. Navarro, G., Raman, R., Satti, S.R.: Asymptotically optimal encodings for range selection. In: Proc. 34th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2014). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)

    Google Scholar 

  17. Vuillemin, J.: A unifying look at data structures. Commun. ACM 23(4), 229–239 (1980), http://doi.acm.org/10.1145/358841.358852

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Leicester, UK

    Rajeev Raman

Authors
  1. Rajeev Raman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of CSE, BUET, ECE Building, West Palasi, 1205, Dhaka, Bangladesh

    M. Sohel Rahman

  2. The Advanced Algorithms Research Laboratory, The University of Electro-Communications, Chofugaoka 1-5-1, 182-8585, Chofu, Tokyo, Japan

    Etsuji Tomita

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Raman, R. (2015). Encoding Data Structures. In: Rahman, M.S., Tomita, E. (eds) WALCOM: Algorithms and Computation. WALCOM 2015. Lecture Notes in Computer Science, vol 8973. Springer, Cham. https://doi.org/10.1007/978-3-319-15612-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15612-5_1

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation