Skip to main content
SpringerLink
Log in

K 2-Treaps: Range Top-k Queries in Compact Space

  • Conference paper
String Processing and Information Retrieval (SPIRE 2014)

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

Included in the following conference series:

Abstract

Efficient processing of top-k queries on multidimensional grids is a common requirement in information retrieval and data mining, for example in OLAP cubes. We introduce a data structure, the K 2-treap, that represents grids in compact form and supports efficient prioritized range queries. We compare the K 2-treap with state-of-the-art solutions on synthetic and real-world datasets, showing that it uses 30% of the space of competing solutions while solving queries up to 10 times faster.

Funded by Millennium Nucleus Information and Coordination in Networks ICM/FIC P10-024F, by a Conicyt scholarship, by MICINN (PGE and FEDER) TIN2009-14560-C03-02 and TIN2010-21246-C02-01, by CDTI, MEC and AGI EXP 00064563/ITC-20133062, and by Xunta de Galicia (with FEDER) GRC2013/053.

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. Afshani, P., Arge, L., Larsen, K.G.: Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. In: Proc. SCG, pp. 323–332 (2012)

    Google Scholar 

  2. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Comm. ACM 18(9), 509–517 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  3. de Bernardo, G., Álvarez-García, S., Brisaboa, N.R., Navarro, G., Pedreira, O.: Compact querieable representations of raster data. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol. 8214, pp. 96–108. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Brisaboa, N., Ladra, S., Navarro, G.: DACs: Bringing direct access to variable-length codes. Inf. Proc. Manag. 49(1), 392–404 (2013)

    Article  Google Scholar 

  5. Brisaboa, N., Ladra, S., Navarro, G.: Compact representation of web graphs with extended functionality. Inf. Sys. 39(1), 152–174 (2014)

    Article  Google Scholar 

  6. Chazelle, B.: Lower bounds for orthogonal range searching I: The reporting case. J. ACM 37(2), 200–212 (1990)

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  8. Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comp. 40(2), 465–492 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Golin, M., Iacono, J., Krizanc, D., Raman, R., Rao, S.S.: Encoding 2D range maximum queries. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 180–189. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

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

    Google Scholar 

  11. Konow, R., Navarro, G., Clarke, C., López-Ortíz, A.: Faster and smaller inverted indices with treaps. In: Proc. 36th SIGIR, pp. 193–202 (2013)

    Google Scholar 

  12. Mäkinen, V., Navarro, G.: Position-restricted substring searching. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 703–714. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Martínez, C., Roura, S.: Randomized binary search trees. J. ACM 45(2), 288–323 (1997)

    Article  Google Scholar 

  14. McCreight, E.M.: Priority search trees. SIAM J. Comp. 14(2), 257–276 (1985)

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  16. Navarro, G., Nekrich, Y.: Top-k document retrieval in optimal time and linear space. In: Proc. 23rd SODA, pp. 1066–1078 (2012)

    Google Scholar 

  17. Navarro, G., Nekrich, Y., Russo, L.: Space-efficient data-analysis queries on grids. Theor. Comp. Sci. 482, 60–72 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  18. Seidel, R., Aragon, C.: Randomized search trees. Algorithmica 16(4/5), 464–497 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Databases Lab., Univ. of A. Coruña, Spain

    Nieves R. Brisaboa & Guillermo de Bernardo

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

    Roberto Konow & Gonzalo Navarro

  3. Escuela de Informática y Telecomunicaciones, Univ. Diego Portales, Chile

    Roberto Konow

Authors
  1. Nieves R. Brisaboa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guillermo de Bernardo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roberto Konow
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gonzalo Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto de Computação, Universidade Federal do Amazonas, 6200, Manaus, Brazil

    Edleno Moura

  2. King’s College London, UK

    Maxime Crochemore

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Brisaboa, N.R., de Bernardo, G., Konow, R., Navarro, G. (2014). K 2-Treaps: Range Top-k Queries in Compact Space. In: Moura, E., Crochemore, M. (eds) String Processing and Information Retrieval. SPIRE 2014. Lecture Notes in Computer Science, vol 8799. Springer, Cham. https://doi.org/10.1007/978-3-319-11918-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11918-2_21

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation