Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2011: Algorithms and Computation pp 323–332Cite as

Space-Efficient Data-Analysis Queries on Grids

  • Conference paper

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

Abstract

We consider various data-analysis queries on two-dimensional points. We give new space/time tradeoffs over previous work on semigroup and group queries such as sum, average, variance, minimum and maximum. We also introduce new solutions to queries rarely considered in the literature such as two-dimensional quantiles, majorities, successor/predecessor and mode queries. We face static and dynamic scenarios.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alstrup, S., Brodal, G., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS, pp. 198–207 (2000)

    Google Scholar 

  2. Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Orthogonal range searching: Querying a database. In: Computational Geometry, pp. 95–120. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Bose, P., He, M., Maheshwari, A., Morin, P.: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 98–109. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Brodal, G., Davoodi, P., Rao, S.: On space efficient two dimensional range minimum data structures. Algorithmica (2011), doi:10.1007/s00453-011-9499-0

    Google Scholar 

  5. Carlsson, S., Munro, J.I., Poblete, P.V.: An Implicit Binomial Queue with Constant Insertion Time. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 1–13. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  6. Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comp. 17(3), 427–462 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  7. Culpepper, J.S., Navarro, G., Puglisi, S.J., Turpin, A.: Top-k Ranked Document Search in General Text Databases. In: de Berg, M., Meyer, U. (eds.) ESA 2010, part II. LNCS, vol. 6347, pp. 194–205. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Durocher, S., Morrison, J.: Linear-space data structures for range mode query in arrays. CoRR, 1101.4068 (2011)

    Google Scholar 

  9. Fischer, J.: Optimal Succinctness for Range Minimum Queries. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158–169. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Gagie, T., Navarro, G., Puglisi, S.J.: Colored Range Queries and Document Retrieval. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 67–81. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: SODA, pp. 841–850 (2003)

    Google Scholar 

  12. He, M., Munro, J.I.: Succinct Representations of Dynamic Strings. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 334–346. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Mäkinen, V., Navarro, G.: Rank and select revisited and extended. Theo. Comp. Sci. 387(3), 332–347 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mäkinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. ACM Trans. Alg., 4(3), art. 32 (2008)

    Google Scholar 

  15. Navarro, G., Sadakane, K.: Fully-functional static and dynamic succinct trees. CoRR, 0905.0768v5 (2010)

    Google Scholar 

  16. Nekrich, Y.: Orthogonal range searching in linear and almost-linear space. Comp. Geom. Theo. and App. 42(4), 342–351 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: ALENEX (2007)

    Google Scholar 

  18. Pǎtraşcu, M.: Succincter. In: FOCS, pp. 305–313 (2008)

    Google Scholar 

  19. Pătraşcu, M.: Lower bounds for 2-dimensional range counting. In: STOC, pp. 40–46 (2007)

    Google Scholar 

  20. Rahul, S., Gupta, P., Janardan, R., Rajan, K.S.: Efficient Top-k Queries for Orthogonal Ranges. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 110–121. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  21. Willard, D.: New data structures for orthogonal range queries. SIAM J. Comp. 14(232-253) (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Gonzalo Navarro

  2. INESC-ID / IST, Tech. Univ. of Lisbon, Portugal

    Luís M. S. Russo

Authors
  1. Gonzalo Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís M. S. Russo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Chuo University, Kasuga, Bunkyo-ku, 112-8551, Tokyo, Japan

    Takao Asano

  2. Gunma University, 1-5-1 Tenjin-Cho, 376-8515, Kiryu-Shi, Japan

    Shin-ichi Nakano

  3. Japan Advanced Institute of Science and Technology, 1-1 Asahidai, 923-1292, Nomi, Ishikawa, Japan

    Yoshio Okamoto

  4. Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, 152-8552, Tokyo, Japan

    Osamu Watanabe

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Navarro, G., Russo, L.M.S. (2011). Space-Efficient Data-Analysis Queries on Grids. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25591-5_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25590-8

  • Online ISBN: 978-3-642-25591-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation