SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Path Computation Algorithms for Advanced Traveller Information System (ATIS)
Proceedings of the Ninth International Conference on Data Engineering
An Index Structure for Efficient Reverse Nearest Neighbor Queries
Proceedings of the 17th International Conference on Data Engineering
Incremental Computation and Maintenance of Temporal Aggregates
Proceedings of the 17th International Conference on Data Engineering
Discovery of Influence Sets in Frequently Updated Databases
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Reverse kNN search in arbitrary dimensionality
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Progressive computation of the min-dist optimal-location query
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Identifying the Most Endangered Objects from Spatial Datasets
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Efficient method for maximizing bichromatic reverse nearest neighbor
Proceedings of the VLDB Endowment
Optimal network location queries
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficient processing of top-k spatial preference queries
Proceedings of the VLDB Endowment
Finding the sites with best accessibilities to amenities
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Preference-based top-k spatial keyword queries
Proceedings of the 1st international workshop on Mobile location-based service
Efficient methods for finding influential locations with adaptive grids
Proceedings of the 20th ACM international conference on Information and knowledge management
Top-k most influential locations selection
Proceedings of the 20th ACM international conference on Information and knowledge management
Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional spaces
The VLDB Journal — The International Journal on Very Large Data Bases
A scalable algorithm for maximizing range sum in spatial databases
Proceedings of the VLDB Endowment
Continuous maximal reverse nearest neighbor query on spatial networks
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Optimal k-constraint coverage queries on spatial objects
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
A branch and bound method for min-dist location selection queries
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Trajectory based optimal segment computation in road network databases
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Approximate MaxRS in spatial databases
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
We propose and solve the optimal-location query in spatial databases. Given a set S of sites, a set O of weighted objects, and a spatial region Q, the optimal-location query returns a location in Q with maximum influence. Here the influence of a location l is the total weight of its RNNs, i.e. the total weight of objects in O that are closer to l than to any site in S. This new query has practical applications, but is very challenging to solve. Existing work on computing RNNs assumes a single query location, and thus cannot be used to compute optimal locations. The reason is that there are infinite candidate locations in Q. If we check a finite set of candidate locations, the result can be inaccurate, i.e. the revealed location may not have maximum influence. This paper proposes three methods that accurately compute optimal locations. The first method uses a standard R*-tree. To compute an optimal location, the method retrieves certain objects from the R*-tree and sends them as a stream to a plane-sweep algorithm, which uses a new data structure called the aSB-tree to ensure query efficiency. The second method is based on a new index structure called the OL-tree, which novelly extends the k-d-B-tree to store segmented rectangular records. The OL-tree is only of theoretical usage for it is not space efficient. The most practical approach is based on a new index structure called the Virtual OL-tree. These methods are theoretically and experimentally evaluated.