A branch and bound method for min-dist location selection queries

Authors:
Jianzhong Qi;Zhenghua Xu;Yuan Xue;Zeyi Wen
Affiliations:
University of Melbourne, Carlton, Victoria, Australia;University of Melbourne, Carlton, Victoria, Australia;University of Melbourne, Carlton, Victoria, Australia;University of Melbourne, Carlton, Victoria, Australia
Venue:
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Year:
2012

Citing 20
Cited 0

Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
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
An Index Structure for Efficient Reverse Nearest Neighbor Queries

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
Aggregate nearest neighbor queries in spatial databases

ACM Transactions on Database Systems (TODS)
On computing top-t most influential spatial sites

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Progressive computation of the min-dist optimal-location query

VLDB '06 Proceedings of the 32nd 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
Continuous Intersection Joins Over Moving Objects

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Optimal-Location-Selection Query Processing in Spatial Databases

IEEE Transactions on Knowledge and Data Engineering
Efficient method for maximizing bichromatic reverse nearest neighbor

Proceedings of the VLDB Endowment
High-dimensional kNN joins with incremental updates

Geoinformatica
Optimal location queries in road network databases

ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Influence zone: Efficiently processing reverse k nearest neighbors queries

ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Top-k most influential locations selection

Proceedings of the 20th ACM international conference on Information and knowledge management
Medoid queries in large spatial databases

SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
The optimal-location query

SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
The Min-dist Location Selection Query

ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
A highly optimized algorithm for continuous intersection join queries over moving objects

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set of clients and a set of existing facilities, the min-dist location selection query returns a location from a given set of potential locations for establishing a new facility so that the average distance between a client and her nearest facility is minimized. This type of queries has a wide range of applications in marketing, decision support systems, urban development simulations and massively multiplayer online games. The computational cost of a naive algorithm, which sequentially scans all the potential locations, is too high to process this type of queries in real time. Motivated by this, we propose a branch and bound algorithm that exploits geometric properties of the data objects and early prunes unpromising potential locations from consideration to achieve a higher query processing efficiency. We conduct a detailed cost analysis and extensive experiments to validate the efficiency of the branch and bound algorithm. The results show that the proposed algorithm outperforms the naive algorithm constantly.