Computing
Progressive approximate aggregate queries with a multi-resolution tree structure
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
The R-tree: An Improved R*-tree with Materialized Data for Supporting Range Queries on OLAP-Data
DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On computing top-t most influential spatial sites
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Cache-oblivious dynamic programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Progressive computation of the min-dist optimal-location query
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Indexing range sum queries in spatio-temporal databases
Information and Software Technology
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Covering Many or Few Points with Unit Disks
Theory of Computing Systems
Efficient method for maximizing bichromatic reverse nearest neighbor
Proceedings of the VLDB Endowment
Efficient processing of top-k spatial preference queries
Proceedings of the VLDB Endowment
New results on two-dimensional orthogonal range aggregation in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal location queries in road network databases
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Approximate MaxRS in spatial databases
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
This paper investigates the MaxRS problem in spatial databases. Given a set O of weighted points and a rectangular region r of a given size, the goal of the MaxRS problem is to find a location of r such that the sum of the weights of all the points covered by r is maximized. This problem is useful in many location-based applications such as finding the best place for a new franchise store with a limited delivery range and finding the most attractive place for a tourist with a limited reachable range. However, the problem has been studied mainly in theory, particularly, in computational geometry. The existing algorithms from the computational geometry community are in-memory algorithms which do not guarantee the scalability. In this paper, we propose a scalable external-memory algorithm (ExactMaxRS) for the MaxRS problem, which is optimal in terms of the I/O complexity. Furthermore, we propose an approximation algorithm (ApproxMaxCRS) for the MaxCRS problem that is a circle version of the MaxRS problem. We prove the correctness and optimality of the ExactMaxRS algorithm along with the approximation bound of the ApproxMaxCRS algorithm. From extensive experimental results, we show that the ExactMaxRS algorithm is two orders of magnitude faster than methods adapted from existing algorithms, and the approximation bound in practice is much better than the theoretical bound of the ApproxMaxCRS algorithm.