Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Cache Conscious Indexing for Decision-Support in Main Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
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
Effect of node size on the performance of cache-conscious B+-trees
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On computing top-t most influential spatial sites
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Continuous Reverse k-Nearest-Neighbor Monitoring
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
Reverse k-nearest neighbor search in dynamic and general metric databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Continuous Intersection Joins Over Moving Objects
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient method for maximizing bichromatic reverse nearest neighbor
Proceedings of the VLDB Endowment
The HV-tree: a memory hierarchy aware version index
Proceedings of the VLDB Endowment
Influence zone: Efficiently processing reverse k nearest neighbors queries
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
Finding top k most influential spatial facilities over uncertain objects
Proceedings of the 21st ACM international conference on Information and knowledge management
Location selection for utility maximization with capacity constraints
Proceedings of the 21st ACM international conference on Information and knowledge management
Efficient general spatial skyline computation
World Wide Web
A branch and bound method for min-dist location selection queries
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Hi-index | 0.01 |
We propose and study a new type of facility location selection query, the top-k most influential location selection query. Given a set M of customers and a set F of existing facilities, this query finds k locations from a set C of candidate locations with the largest influence values, where the influence of a candidate location c (c in C) is defined as the number of customers in M who are the reverse nearest neighbors of c. We first present a naive algorithm to process the query. However, the algorithm is computationally expensive and not scalable to large datasets. This motivates us to explore more efficient solutions. We propose two branch and bound algorithms, the Estimation Expanding Pruning (EEP) algorithm and the Bounding Influence Pruning (BIP) algorithm. These algorithms exploit various geometric properties to prune the search space, and thus achieve much better performance than that of the naive algorithm. Specifically, the EEP algorithm estimates the distances to the nearest existing facilities for the customers and the numbers of influenced customers for the candidate locations, and then gradually refines the estimation until the answer set is found, during which distance metric based pruning techniques are used to improve the refinement efficiency. BIP only estimates the numbers of influenced customers for the candidate locations. But it uses the existing facilities to limit the space for searching the influenced customers and achieve a better estimation, which results in an even more efficient algorithm. Extensive experiments conducted on both real and synthetic datasets validate the efficiency of the algorithms.