Results 1 - 10 of 23

k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation

by Tenindra Abeywickrama , Muhammad Aamir Cheema , David Taniar
"... ABSTRACT A k nearest neighbor (kNN) query on road networks retrieves the k closest points of interest (POIs) by their network distances from a given location. Today, in the era of ubiquitous mobile computing, this is a highly pertinent query. While Euclidean distance has been used as a heuristic to ..."
Abstract - Add to MetaCart
ABSTRACT A k nearest neighbor (kNN) query on road networks retrieves the k closest points of interest (POIs) by their network distances from a given location. Today, in the era of ubiquitous mobile computing, this is a highly pertinent query. While Euclidean distance has been used as a heuristic

A Road Network Embedding Technique for k-Nearest Neighbor Search in Moving Object Databases

by Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Sharifzadeh - GeoInformatica , 2002
"... A very important class of queries in GIS applications is the class of K-nearest neighbor queries. Most of the current studies on the K-nearest neighbor queries utilize spatial index structures and hence are based on the Euclidean distances between the points. In real-world road networks, however, th ..."
Abstract - Cited by 90 (5 self) - Add to MetaCart
A very important class of queries in GIS applications is the class of K-nearest neighbor queries. Most of the current studies on the K-nearest neighbor queries utilize spatial index structures and hence are based on the Euclidean distances between the points. In real-world road networks, however

Using Dijkstra’s algorithm to incrementally find the k-nearest neighbors in spatial network databases

by Victor Teixeira De Almeida , Ralf Hartmut Güting - IN: PROC. ACM SAC , 2006
"... One of the most important kinds of queries in Spatial Network Databases (SNDB) to support Location-Based Services (LBS) is the k-Nearest Neighbors (k-NN) query. Given a point in a network, e.g. a location of a car on a road network, and a set of points of interests, e.g. hotels, gas stations, etc., ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
One of the most important kinds of queries in Spatial Network Databases (SNDB) to support Location-Based Services (LBS) is the k-Nearest Neighbors (k-NN) query. Given a point in a network, e.g. a location of a car on a road network, and a set of points of interests, e.g. hotels, gas stations, etc

Enforcing k Nearest Neighbor Query Integrity on Road Networks

by unknown authors
"... Outsourcing spatial databases, including both road networks and points of interest, to a third party Cloud service provider has attracted much attention from individual and business data owners. With popularity of mobile devices, providing instant and reliable location-based services to smartphones ..."
Abstract - Add to MetaCart
diagrams and neighbors to prove the integrity of the query result. Unlike previous work that verifies k-nearest-neighbor results in the Euclidean space, our approach verifies both the distances and the shortest paths from the query point to its kNN result on the road network.

K Nearest Neighbor Path Queries based on Road Networks

by unknown authors , 2013
"... The Island is a k nearest neighbor query algorithm of moving objects based on road networks and can effectively balance the performance of query and update. But the algorithm doesn’t consider the direction of moving object which is required in many scenarios. It traverses vertexes from all direction ..."
Abstract - Add to MetaCart
The Island is a k nearest neighbor query algorithm of moving objects based on road networks and can effectively balance the performance of query and update. But the algorithm doesn’t consider the direction of moving object which is required in many scenarios. It traverses vertexes from all

Continuous Nearest Neighbor Monitoring in Road Networks

by Kyriakos Mouratidis, Man Lung Yiu , Dimitris Papadias , Nikos Mamoulis - PROCEEDINGS 32 ND VLDB CONFERENCE , 2006
"... Recent research has focused on continuous monitoring of nearest neighbors (NN) in highly dynamic scenarios, where the queries and the data objects move frequently and arbitrarily. All existing methods, however, assume the Euclidean distance metric. In this paper we study k-NN monitoring in road netw ..."
Abstract - Cited by 54 (2 self) - Add to MetaCart
Recent research has focused on continuous monitoring of nearest neighbors (NN) in highly dynamic scenarios, where the queries and the data objects move frequently and arbitrarily. All existing methods, however, assume the Euclidean distance metric. In this paper we study k-NN monitoring in road

Monitoring path nearest neighbor in road networks

by Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey Xu Yu - In SIGMOD , 2009
"... This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new query returns the k-NN with respect to the shortest path connecting the destination and the user’s current location, and thus ..."
Abstract - Cited by 25 (3 self) - Add to MetaCart
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new query returns the k-NN with respect to the shortest path connecting the destination and the user’s current location

Fast Nearest Neighbor Search on Road Networks

by Haibo Hu, Dik Lun Lee, Jianliang Xu - In Proc. EDBT , 2006
"... Abstract. Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance precomputation. The former may cause an explosive number of node accesses for sparse datasets because all nodes cl ..."
Abstract - Cited by 20 (2 self) - Add to MetaCart
Abstract. Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance precomputation. The former may cause an explosive number of node accesses for sparse datasets because all nodes

A P2P Technique for Continuous k-Nearest-Neighbor Query in Road Networks

by Fuyu Liu, Kien A. Hua, Tai T. Do
"... Abstract. Due to the high frequency in location updates and the expensive cost of continuous query processing, server computation capacity and wireless communication bandwidth are the two limiting factors for large-scale deployment of moving object database systems. Many techniques have been propose ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
, and wireless communications associated with location updates. Most of these techniques, however, assume an open-space environment. In this paper, we investigate a P2P computing technique for continuous kNN queries in a network environment. Since network distance is different from Euclidean distance, techniques

Memory-Efficient Algorithms for Spatial Network Queries

by Sarana Nutanong, Hanan Samet
"... Abstract — Incrementally finding thek nearest neighbors (kNN) in a spatial network is an important problem in location-based services. One method (INE) simply applies Dijkstra’s algorithm. Another method (IER) computes the k nearest neighbors using Euclidean distance followed by computing their corr ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
that cannot possibly lead to the k nearest neighbors by using a Euclidean heuristic estimator, and on IER by avoiding the repeated visits to nodes in the spatial network that appear on the shortest paths to different members of the k nearest neighbors by performing multiple instances of heuristic search using
Results 1 - 10 of 23