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
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 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
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Performance of Nearest Neighbor Queries in R-Trees
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Spatial Clustering in the Presence of Obstacles
Proceedings of the 17th International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Walking Through a Very Large Virtual Environment in Real-time
Proceedings of the 27th International Conference on Very Large Data Bases
K-Nearest Neighbor Search for Moving Query Point
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
Clustering Spatial Data in the Presence of Obstacles: a Density-Based Approach
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
All-Nearest-Neighbors Queries in Spatial Databases
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Continuous nearest neighbor search
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
visible nearest neighbor queries
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Continuous obstructed nearest neighbor queries in spatial databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Direction-based spatial skylines
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
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)
wNeighbors: a method for finding k nearest neighbors in weighted regions
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
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
On socio-spatial group query for location-based social networks
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
See-to-retrieve: efficient processing of spatio-visual keyword queries
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Density-based spatial keyword querying
Future Generation Computer Systems
Scalable visibility color map construction in spatial databases
Information Systems
| Hi-index | 0.00 |
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query line segment q, a CVNN query returns a set of (p, R) tuples such that p ε P is the nearest neighbor (NN) to every point r along the interval R ε q as well as p is visible to r. Note that p may be NULL, meaning that all points in P are invisible to all points in R, due to the obstruction of some obstacles in O. In this paper, we formulate the problem and propose efficient algorithms for CVNN query processing, assuming that both P and O are indexed by R-trees. In addition, we extend our techniques to several variations of the CVNN query. Extensive experiments verify the efficiency and effectiveness of our proposed algorithms using both real and synthetic datasets.