Space-efficient data-analysis queries on grids

23Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

We consider various data-analysis queries on two-dimensional points. We give new space/time tradeoffs over previous work on geometric queries such as dominance and rectangle visibility, and on semigroup and group queries such as sum, average, variance, minimum and maximum. We also introduce new solutions to queries less frequently considered in the literature such as two-dimensional quantiles, majorities, successor/predecessor, mode, and various top-k queries, considering static and dynamic scenarios. © 2013 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Navarro, G., Nekrich, Y., & Russo, L. M. S. (2013). Space-efficient data-analysis queries on grids. Theoretical Computer Science, 482, 60–72. https://doi.org/10.1016/j.tcs.2012.11.031

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free