visible nearest neighbor queries

Authors:
Sarana Nutanong;Egemen Tanin;Rui Zhang
Affiliations:
Department of Computer Science and Software Engineering, University of Melbourne, Victoria, Australia;Department of Computer Science and Software Engineering, University of Melbourne, Victoria, Australia and NICTA Victoria Laboratory, Australia;Department of Computer Science and Software Engineering, University of Melbourne, Victoria, Australia
Venue:
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Year:
2007

Citing 8
Cited 9

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching

Communications of the ACM
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Constrained Nearest Neighbor Queries

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Nearest Surrounder Queries

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering

Continuous visible nearest neighbor queries

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Continuous obstructed nearest neighbor queries in spatial databases

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Spatio-temporal database research at the University of Melbourne

ACM SIGMOD Record
Group visible nearest neighbor queries in spatial databases

WAIM'10 Proceedings of the 11th international conference on Web-age information management
Continuous nearest-neighbor search in the presence of obstacles

ACM Transactions on Database Systems (TODS)
Continuous visible nearest neighbor query processing in spatial databases

The VLDB Journal — The International Journal on Very Large Data Bases
Direction-based surrounder queries for mobile recommendations

The VLDB Journal — The International Journal on Very Large Data Bases
Efficient approximate visibility query in large dynamic environments

DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Approximate search algorithm for aggregate k-nearest neighbour queries on remote spatial databases

International Journal of Knowledge and Web Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the visible k nearest neighbor (VkNN) query, which finds the k nearest objects that are visible to a query point. We also propose an algorithm to efficiently process the VkNN query. We compute the visible neighbors incrementally as we enlarge the search space. Our algorithm dramatically reduces the search cost compared to existing methods that require the computation of the visibility of all objects in advance. With extensive experiments, we show that our algorithm to process the VkNN query outperform the existing algorithms significantly.