We address the problem of maintaining the correct answer-sets to a novel query- Maximizing Range-Sum (C-MaxRS)-for spatial data. Given a set of 2D point objects, possibly with associated weights, the traditional MaxRS problem determines an optimal placement for an axes-parallel rectangle so that the number-or, the weighted sum-of the objects in its interior is maximized. The peculiarities of C-MaxRS is that in many practical settings, the objects from a particular set-e.
View Article and Find Full Text PDF