Rotating MaxRS queries

Given a set of weighted objects in a data space, the MaxRS problem in spatial databases studied in a VLDB 2012 paper is to find a location for a rectangular region of a given size such that the weighted sum of all the objects covered by the rectangular region centered at the optimal location is maximized. This problem is useful in lots of location-based service applications, such as finding the location for a new fast food restaurant with a limited delivery range attracting the greatest number of customers. The existing MaxRS problem assumes that the rectangular region is always placed horizontally and is non-rotatable. However, under this assumption, the weighted sum of all the covered objects may not be the greatest when the rectangular region is rotatable. In this paper, we propose a generalized MaxRS problem called rotating MaxRS without this assumption. In rotating MaxRS, the rectangular region is rotatable and can be associated with an inclination angle. The goal of our problem is to find a location and an inclination angle such that the weighted sum of all the objects covered by the rectangular region of a given size centered at this location with this inclination angle is the greatest. We also present an efficient algorithm for the problem. Extensive experiments were conducted to verify the efficiency of our algorithms based on the real and synthetic datasets. The experimental results show that the weighted sum of all the objects in the rotating MaxRS queries can be increased with up to 300% on the synthetic datasets compared with existing non-rotating MaxRS queries, which shows the significance of the new rotating MaxRS queries.

[1]  Philip S. Yu,et al.  Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional spaces , 2011, The VLDB Journal.

[2]  Sergio Greco,et al.  Chase termination , 2010, Proc. VLDB Endow..

[3]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[4]  Subhas C. Nandy,et al.  A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids , 1995 .

[5]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[6]  Yang Du,et al.  On Computing Top-t Most Influential Spatial Sites , 2005, VLDB.

[7]  Ge Yu,et al.  The min-dist location selection and facility replacement queries , 2013, World Wide Web.

[8]  Yang Du,et al.  The Optimal-Location Query , 2005, SSTD.

[9]  Dan Lin,et al.  The Min-dist Location Selection Query , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[10]  Yufei Tao,et al.  A Scalable Algorithm for Maximizing Range Sum in Spatial Databases , 2012, Proc. VLDB Endow..

[11]  R. L. Francis,et al.  State of the Art-Location on Networks: A Survey. Part II: Exploiting Tree Network Structure , 1983 .

[12]  K.Ankamma chowdary.  Efficient Processing of Top-k Spatial Preference Queries , 2012 .

[13]  Wei Wu,et al.  MaxFirst for MaxBRkNN , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[14]  Stefan Langerman,et al.  Reverse facility location problems , 2005, CCCG.

[15]  Raymond Chi-Wing Wong,et al.  A new approach for maximizing bichromatic reverse nearest neighbor search , 2013, Knowledge and Information Systems.

[16]  B. C. Brookes,et al.  Information Sciences , 2020, Cognitive Skills You Need for the 21st Century.

[17]  Yufei Tao,et al.  Approximate MaxRS in Spatial Databases , 2013, Proc. VLDB Endow..

[18]  Yuan-Ko Huang,et al.  Efficient processing of continuous min-max distance bounded query with updates in road networks , 2014, Inf. Sci..

[19]  Mark de Berg,et al.  The Priority R-tree: a practically efficient and worst-case optimal R-tree , 2004, SIGMOD '04.

[20]  Yunjun Gao,et al.  OptRegion: Finding Optimal Region for Bichromatic Reverse Nearest Neighbors , 2013, DASFAA.

[21]  Philip S. Yu,et al.  Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor , 2009, Proc. VLDB Endow..

[22]  Feifei Li,et al.  Optimal location queries in road network databases , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[23]  Takao Asano,et al.  Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane , 1983, J. Algorithms.

[24]  Raymond Chi-Wing Wong,et al.  Efficient methods for finding influential locations with adaptive grids , 2011, CIKM '11.

[25]  Man Lung Yiu,et al.  Top-k Spatial Preference Queries , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[26]  Yufei Tao,et al.  Progressive computation of the min-dist optimal-location query , 2006, VLDB.