Approximate MaxRS in Spatial Databases

Download Now
Provided by: VLD Digital
Topic: Data Management
Format: PDF
In the Maximizing Range Sum (MaxRS) problem, given a set P of 2D points each of which is associated with a positive weight, and a rectangle r of specific extents, the authors need to decide where to place r in order to maximize the covered weight of r - that is, the total weight of the data points covered by r. Algorithms solving the problem exactly entail expensive CPU or I/O cost. In practice, exact answers are often not compulsory in a MaxRS application, where slight imprecision can often be comfortably tolerated, provided that approximate answers can be computed considerably faster.
Download Now

Find By Topic