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)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Processing in-route nearest neighbor queries: a comparison of alternative approaches
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Computational data modeling for network-constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient query routing in distributed spatial databases
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Roads, codes, and spatiotemporal queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
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
Adaptive nearest neighbor queries in travel time networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Distance indexing on road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
K nearest neighbor search in navigation systems
Mobile Information Systems
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient AKNN spatial network queries using the M-Tree
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
A multi-resolution surface distance model for k-NN query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Nearest neighbor queries with peer-to-peer data sharing in mobile environments
Pervasive and Mobile Computing
Monitoring Aggregate k-NN Objects in Road Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Indexing land surface for efficient kNN query
Proceedings of the VLDB Endowment
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Versioning of Network Models in a Multiuser Environment
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
An efficient pre-computation technique for approximation KNN search in road networks
Proceedings of the 2009 International Workshop on Location Based Social Networks
Virtual social networks online and mobile systems
Mobile Information Systems
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Continuous monitoring of nearest neighbors on land surface
Proceedings of the VLDB Endowment
Distributed, concurrent range monitoring of spatial-network constrained mobile objects
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Efficient successor retrieval operations for aggregate query processing on clustered road networks
Information Sciences: an International Journal
Best point detour query in road networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Scalable shortest paths browsing on land surface
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Querying shortest path distance with bounded errors in large graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Optimizing predictive queries on moving objects under road-network constraints
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Direction-based surrounder queries for mobile recommendations
The VLDB Journal — The International Journal on Very Large Data Bases
Proximity queries in time-dependent traffic networks using graph embeddings
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Fast GPU-based locality sensitive hashing for k-nearest neighbor computation
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Range query processing in multi-objective networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A safe-exit approach for efficient network-based moving range queries
Data & Knowledge Engineering
Fast nearest neighbor search on road networks
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Constrained shortest path computation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
A network-based indexing method for trajectories of moving objects
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
The weighted shortest path search based on multi-agents in mobile GIS management services
Wireless Communications & Mobile Computing
Predictive line queries for traffic prediction
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
Spatial query processing in road networks for wireless data broadcast
Wireless Networks
Saturn: a fast keyword kNN search system in road networks
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Hi-index | 0.00 |
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, the shortest distance between two points depends on the actual path connecting the points and cannot be computed accurately using one of the Minkowski metrics. Thus, the Euclidean distance may not properly approximate the real distance. In this paper, we apply an embedding technique to transform a road network to a high dimensional space in order to utilize computationally simple Minkowski metrics for distance measurement. Subsequently, we extend our approach to dynamically transform new points into the embedding space. Finally, we propose an efficient technique that can find the actual shortest path between two points in the original road network using only the embedding space. Our empirical experiments indicate that the Chessboard distance metric (∞) in the embedding space preserves the ordering of the distances between a point and its neighbors more precisely as compared to the Euclidean distance in the original road network.