K2-Treaps: Range Top-k Queries in Compact Space

  • Nieves R. Brisaboa
  • Guillermo de Bernardo
  • Roberto Konow
  • Gonzalo Navarro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8799)

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 K2-treap, that represents grids in compact form and supports efficient prioritized range queries. We compare the K2-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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Nieves R. Brisaboa
    • 1
  • Guillermo de Bernardo
    • 1
  • Roberto Konow
    • 2
    • 3
  • Gonzalo Navarro
    • 2
  1. 1.Databases Lab.Univ. of A. CoruñaSpain
  2. 2.Dept. of Computer ScienceUniv. of ChileChile
  3. 3.Escuela de Informática y TelecomunicacionesUniv. Diego PortalesChile

Personalised recommendations