Aggregated 2D range queries on clustered points
Use this link to citehttp://hdl.handle.net/2183/18152
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 España
MetadataShow full item record
TitleAggregated 2D range queries on clustered points
Nieves R. Brisaboa, Guillermo De Bernardo, Roberto Konow, Gonzalo Navarro, Diego Seco, Aggregated 2D range queries on clustered points, Information Systems, Volume 60, August–September 2016, Pages 34-49, ISSN 0306-4379, http://dx.doi.org/10.1016/j.is.2016.03.004.
[Abstract] Efficient processing of aggregated range queries on two-dimensional grids is a common requirement in information retrieval and data mining systems, for example in Geographic Information Systems and OLAP cubes. We introduce a technique to represent grids supporting aggregated range queries that requires little space when the data points in the grid are clustered, which is common in practice. We show how this general technique can be used to support two important types of aggregated queries, which are ranked range queries and counting range queries. Our experimental evaluation shows that this technique can speed up aggregated queries up to more than an order of magnitude, with a small space overhead.
Compact data structures
The final publication is available via http://dx.doi.org/10.1016/j.is.2016.03.004
Atribución-NoComercial-SinDerivadas 3.0 España