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
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
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
High dimensional reverse nearest neighbor queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Reverse Nearest Neighbors in Large Graphs
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Reverse nearest neighbor aggregates over data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Reverse kNN search in arbitrary dimensionality
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Distributed spatio-temporal similarity search
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
VLDB '07 Proceedings of the 33rd 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
Identifying the most influential data objects with reverse top-k queries
Proceedings of the VLDB Endowment
Efficient processing of top-k spatial preference queries
Proceedings of the VLDB Endowment
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
Subject-oriented top-k hot region queries in spatial dataset
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
Finding the most accessible locations: reverse path nearest neighbor query in road networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Topological operators: a relaxed query processing approach
Geoinformatica
Reverse nearest neighbor search in peer-to-peer systems
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
A scalable algorithm for maximizing range sum in spatial databases
Proceedings of the VLDB Endowment
Finding top k most influential spatial facilities over uncertain objects
Proceedings of the 21st ACM international conference on Information and knowledge management
Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces
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
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
Hi-index | 0.00 |
Given a set O of weighted objects, a set S of sites, and a query site s, the bichromatic RNN query computes the influence set of s, or the set of objects in O that consider s as the nearest site among all sites in S. The influence of a site s can be defined as the total weight of its RNNs. This paper addresses the new and interesting problem of finding the top-t most influential sites from S, inside a given spatial region Q. A straightforward approach is to find the sites in Q, and compute the RNNs of every such site. This approach is not efficient for two reasons. First, all sites in Q need to be identified whatsoever, and the number may be large. Second, both the site R-tree and the object R-tree need to be browsed a large number of times. For each site in Q, the R-tree of sites is browsed to identify the influence region -- a polygonal region that may contain RNNs, and then the R-tree of objects is browsed to find the RNN set. This paper proposes an algorithm called TopInfluential-Sites, which finds the top-t most influential sites by browsing both trees once systematically. Novel pruning techniques are provided, based on a new metric called minExistDNN. There is no need to compute the influence for all sites in Q, or even to visit all sites in Q. Experimental results verify that our proposed method outperforms the straightforward approach.