Dong-Wan Choi
Abstract
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.
- The R-tree portal. http://www.rtreeportal.org, 2003.Google Scholar
- L. Arge, M. Knudsen, and K. Larsen. A general lower bound on the I/O-complexity of comparison-based algorithms. In Proceedings of Algorithms and Data Structures (WADS), pages 83--94, 1993. Google ScholarDigital Library
- B. Aronov and S. Har-Peled. On approximating the depth and related problems. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 886--894, 2005. Google ScholarDigital Library
- B. M. Chazelle and D. Lee. On a circle placement problem. Computing, 36(1):1--16, 1986. Google ScholarDigital Library
- H.-J. Cho and C.-W. Chung. Indexing range sum queries in spatio-temporal databases. Information & Software Technology, 49(4):324--331, 2007. Google ScholarDigital Library
- R. A. Chowdhury and V. Ramachandran. Cache-oblivious dynamic programming. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 591--600, 2006. Google ScholarDigital Library
- M. de Berg, S. Cabello, and S. Har-Peled. Covering many or few points with unit disks. Theory Comput. Syst., 45(3):446--469, 2009. Google ScholarDigital Library
- Z. Drezner. Note---on a modified one-center model. Management Science, 27(7):848--851, 1981.Google ScholarDigital Library
- Y. Du, D. Zhang, and T. Xia. The optimal-location query. In International Symposium of Advances in Spatial and Temporal Databases (SSTD), pages 163--180, 2005. Google ScholarDigital Library
- M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry (preliminary version). In Proceedings of Annual Symposium on Foundations of Computer Science (FOCS), pages 714--723, 1993. Google ScholarDigital Library
- H. Imai and T. Asano. Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. Journal of Algorithms, 4(4):310--323, 1983.Google ScholarCross Ref
- M. Jürgens and H.-J. Lenz. The RA*-tree: An improved r-tree with materialized data for supporting range queries on olap-data. In DEXA Workshop, pages 186--191, 1998. Google ScholarDigital Library
- I. Lazaridis and S. Mehrotra. Progressive approximate aggregate queries with a multi-resolution tree structure. In SIGMOD Conference, pages 401--412, 2001. Google ScholarDigital Library
- S. C. Nandy and B. B. Bhattacharya. A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Computers and Mathematics with Applications, 29(8):45--61, 1995.Google ScholarCross Ref
- D. Papadias, P. Kalnis, J. Zhang, and Y. Tao. Efficient olap operations in spatial data warehouses. In International Symposium of Advances in Spatial and Temporal Databases (SSTD), pages 443--459, 2001. Google ScholarDigital Library
- J. B. Rocha-Junior, A. Vlachou, C. Doulkeridis, and K. Nørvåg. Efficient processing of top-k spatial preference queries. PVLDB, 4(2):93--104, 2010. Google ScholarDigital Library
- C. Sheng and Y. Tao. New results on two-dimensional orthogonal range aggregation in external memory. In Proceedings of ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pages 129--139, 2011. Google ScholarDigital Library
- R. C.-W. Wong, M. T. Özsu, P. S. Yu, A. W.-C. Fu, and L. Liu. Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB, 2(1):1126--1137, 2009. Google ScholarDigital Library
- T. Xia, D. Zhang, E. Kanoulas, and Y. Du. On computing top-t most influential spatial sites. In Proceedings of International Conference on Very Large Data Bases (VLDB), pages 946--957, 2005. Google ScholarDigital Library
- X. Xiao, B. Yao, and F. Li. Optimal location queries in road network databases. In Proceedings of International Conference on Data Engineering (ICDE), pages 804--815, 2011. Google ScholarDigital Library
- M. L. Yiu, X. Dai, N. Mamoulis, and M. Vaitis. Top-k spatial preference queries. In Proceedings of International Conference on Data Engineering (ICDE), pages 1076--1085, 2007.Google ScholarCross Ref
- D. Zhang, Y. Du, T. Xia, and Y. Tao. Progressive computation of the min-dist optimal-location query. In Proceedings of International Conference on Very Large Data Bases (VLDB), pages 643--654, 2006. Google ScholarDigital Library
- Z. Zhou, W. Wu, X. Li, M.-L. Lee, and W. Hsu. Maxfirst for MaxBRkNN. In Proceedings of International Conference on Data Engineering (ICDE), pages 828--839, 2011. Google ScholarDigital Library
Recommendations
Maximizing Range Sum in External Memory
This article studies the MaxRS problem in spatial databases. Given a set O of weighted points and a rectangle 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 ...
Approximate MaxRS in spatial databases
In the maximizing range sum (MaxRS) problem, given (i) a set P of 2D points each of which is associated with a positive weight, and (ii) a rectangle r of specific extents, we need to decide where to place r in order to maximize the covered weight of r - ...
Maximizing area-range sum for spatial shapes (MAxRS3)
SSDBM '18: Proceedings of the 30th International Conference on Scientific and Statistical Database ManagementWe investigate a novel variant of the well-known MaxRS (Maximizing Range Sum) problem - namely, the MAxRS3 (Maximizing Area-Range Sum for Spatial Shapes). The MaxRS problem amounts to detecting a location where a fixed-size rectangle R should be placed, ...
Comments