Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Discovery of Influence Sets in Frequently Updated Databases
Proceedings of the 27th 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
On computing top-t most influential spatial sites
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Reverse Nearest Neighbors Search in Ad Hoc Subspaces
IEEE Transactions on Knowledge and Data Engineering
Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
The VLDB Journal — The International Journal on Very Large Data Bases
Lazy updates: an efficient technique to continuously monitoring reverse kNN
Proceedings of the VLDB Endowment
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing network voronoi diagrams
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
| Hi-index | 0.00 |
A reverse nearest neighbor query returns the data objects that have a query point as their nearest neighbor. Although such queries have been studied quite extensively in Euclidean spaces, there is no previous work in the context of large graphs. In this paper, we propose algorithms and optimization techniques for RNN queries by utilizing some characteristics of networks.