On shortest paths in polyhedral spaces
SIAM Journal on Computing
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
Continuous queries over append-only databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
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)
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
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
Constraint-based clustering in large databases
ICDT '01 Proceedings of the 8th 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
AUTOCLUST+: Automatic Clustering of Point-Data Sets in the Presence of Obstacles
TSDM '00 Proceedings of the First International Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining-Revised Papers
K-Nearest Neighbor Search for Moving Query Point
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
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Continuous K-Nearest Neighbor Search for Moving Objects
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Density-based spatial clustering in the presence of obstacles and facilitators
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
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
An efficient and scalable approach to CNN queries in a road network
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors
IEEE Transactions on Knowledge and 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 Queries over Sliding Windows
IEEE Transactions on Knowledge and Data Engineering
Multidimensional reverse kNN search
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Continuous K-nearest neighbor queries for continuously moving points with updates
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
An output sensitive algorithm for computing visibility graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
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
Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
visible nearest neighbor queries
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Spatial clustering based on moving distance in the presence of obstacles
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries
The VLDB Journal — The International Journal on Very Large Data Bases
Moving K-Nearest Neighbor Query over Obstructed Regions
APWEB '10 Proceedings of the 2010 12th International Asia-Pacific Web Conference
Group visible nearest neighbor queries in spatial databases
WAIM'10 Proceedings of the 11th international conference on Web-age information management
A P2P technique for continuous k-nearest-neighbor query in road networks
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Searching continuous nearest neighbors in road networks on the air
Information Systems
Hi-index | 0.00 |
Despite the ubiquity of physical obstacles (e.g., buildings, hills, and blindages, etc.) in the real world, most of spatial queries ignore the obstacles. In this article, we study a novel form of continuous nearest-neighbor queries in the presence of obstacles, namely continuous obstructed nearest-neighbor (CONN) search, which considers the impact of obstacles on the distance between objects. Given a data set P, an obstacle set O, and a query line segment q, in a two-dimensional space, a CONN query retrieves the nearest neighbor p ∈ P of each point p′ on q according to the obstructed distance, the shortest path between p and p′ without crossing any obstacle in O. We formalize CONN search, analyze its unique properties, and develop algorithms for exact CONN query-processing assuming that both P and O are indexed by conventional data-partitioning indices (e.g., R-trees). Our methods tackle CONN retrieval by performing a single query for the entire query line segment, and only process the data points and obstacles relevant to the final query result via a novel concept of control points and an efficient quadratic-based split point computation approach. Then, we extend our techniques to handle variations of CONN queries, including (1) continuous obstructed k nearest neighbor (COkNN) search which, based on obstructed distances, finds the k (≥ 1) nearest neighbors (NNs) to every point along q; and (2) trajectory obstructed k nearest-neighbor (TOkNN) search, which, according to obstructed distances, returns the k NNs for each point on an arbitrary trajectory (consisting of several consecutive line segments). Finally, we explore approximate COkNN (ACOkNN) retrieval. Extensive experiments with both real and synthetic datasets demonstrate the efficiency and effectiveness of our proposed algorithms under various experimental settings.