Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Encodings for Range Majority Queries

  • Conference paper
Combinatorial Pattern Matching (CPM 2014)

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

Included in the following conference series:

Abstract

We face the problem of designing a data structure that can report the majority within any range of an array A[1,n], without storing A. We show that Ω(n) bits are necessary for such a data structure, and design a structure using O(nlog* n) bits that answers majority queries in O(logn) time. We extend our results to τ-majorities.

Funded in part by Millennium Nucleus Information and Coordination in Networks ICM/FIC P10-024F, Chile.

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. Belazzougui, D., Gagie, T., Navarro, G.: Better space bounds for parameterized range majority and minority. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 121–132. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  2. Bose, P., An, H.-C., Morin, P., Tang, Y.: Approximate range mode and range median queries. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 377–388. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Brodal, G.S., Fagerberg, R., Greve, M., López-Ortiz, A.: Online sorted range reporting. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 173–182. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Chan, T., Durocher, S., Larsen, K., Morrison, J., Wilkinson, B.: Linear-space data structures for range mode query in arrays. In: STACS, pp. 290–301 (2012)

    Google Scholar 

  5. Chan, T.M., Durocher, S., Skala, M., Wilkinson, B.T.: Linear-space data structures for range minority query in arrays. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 295–306. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Durocher, S., He, M., Munro, I., Nicholson, P., Skala, M.: Range majority in constant time and linear space. Inf. Comput. 222, 169–179 (2013)

    Article  MATH  MathSciNet  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)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gagie, T., He, M., Munro, J.I., Nicholson, P.: Finding frequent elements in compressed 2d arrays and strings. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol. 7024, pp. 295–300. Springer, Heidelberg (2011)

    Google Scholar 

  9. Greve, M., Jørgensen, A.G., Larsen, K.D., Truelsen, J.: Cell probe lower bounds and approximations for range mode. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. Part I, LNCS, vol. 6198, pp. 605–616. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Grossi, R., Iacono, J., Navarro, G., Raman, R., Rao Satti, 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)

    Google Scholar 

  11. Karpinski, M., Nekrich, Y.: Searching for frequent colors in rectangles. In: CCCG (2008)

    Google Scholar 

  12. Ian Munro, J.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37–42. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  13. Petersen, H.: Improved bounds for range mode and range median queries. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 418–423. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Petersen, H., Grabowski, S.: Range mode and range median queries in constant time and sub-quadratic space. Inf. Process. Lett. 109(4), 225–228 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  15. Raman, R., Raman, V., Srinivasa Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Alg. 3(4), 43 (2007)

    Article  Google Scholar 

  16. Skala, M.: Array range queries. In: Brodnik, A., López-Ortiz, A., Raman, V., Viola, A. (eds.) Munro Festschrift. LNCS, vol. 8066, pp. 333–350. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Univ. of Chile, Chile

    Gonzalo Navarro

  2. Cheriton School of Computer Science, Univ. of Waterloo, Canada

    Sharma V. Thankachan

Authors
  1. Gonzalo Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sharma V. Thankachan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. St. Petersburg Department of Steklov Institute of Mathematics, 27 Fontanka, 191023, St. Petersburg, Russia

    Alexander S. Kulikov

  2. National Research University Higher School of Economics, Bldg 3, Bolshoy Trekhsvyatitelskiy pereulok, 109028, Moscow, Russia

    Sergei O. Kuznetsov

  3. University of California at San Diego, 9500 Gilman Drive, EBU3b 4236, 92093-0404, La Jolla, CA, USA

    Pavel Pevzner

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Navarro, G., Thankachan, S.V. (2014). Encodings for Range Majority Queries. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds) Combinatorial Pattern Matching. CPM 2014. Lecture Notes in Computer Science, vol 8486. Springer, Cham. https://doi.org/10.1007/978-3-319-07566-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07566-2_27

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07565-5

  • Online ISBN: 978-3-319-07566-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation