An Efficient Algorithm for Maximizing Range Sum Queries in a Road Network

الملخص EN

Given a set of positive-weighted points and a query rectangle r (specified by a client) of given extents, the goal of a maximizing range sum (MaxRS) query is to find the optimal location of r such that the total weights of all the points covered by r are maximized.

All existing methods for processing MaxRS queries assume the Euclidean distance metric.

In many location-based applications, however, the motion of a client may be constrained by an underlying (spatial) road network; that is, the client cannot move freely in space.

This paper addresses the problem of processing MaxRS queries in a road network.

We propose the external-memory algorithm that is suited for a large road network database.

In addition, in contrast to the existing methods, which retrieve only one optimal location, our proposed algorithm retrieves all the possible optimal locations.

Through simulations, we evaluate the performance of the proposed algorithm.