Introduction to Algorithms
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
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
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
Fast nearest neighbor search on road networks
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Distributed spatial clustering in sensor networks
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Proximity queries in large traffic networks
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Efficient AKNN spatial network queries using the M-Tree
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Fast object search on road networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Path prediction of moving objects on road networks through analyzing past trajectories
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
Processing proximity relations in road networks
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
On-line preferential nearest neighbor browsing in large attributed graphs
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Voronoi-based range query for trajectory data in spatial networks
Proceedings of the 2011 ACM Symposium on Applied Computing
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
Querying shortest path distance with bounded errors in large graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Direction-based surrounder queries for mobile recommendations
The VLDB Journal — The International Journal on Very Large Data Bases
Context-aware nearest neighbor query on social networks
SocInfo'11 Proceedings of the Third international conference on Social informatics
Coupling or decoupling for KNN search on road networks?: a hybrid framework on user query patterns
Proceedings of the 20th ACM international conference on Information and knowledge management
Proximity queries in time-dependent traffic networks using graph embeddings
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
A safe-exit approach for efficient network-based moving range queries
Data & Knowledge Engineering
Moving Query Monitoring in Spatial Network Environments
Mobile Networks and Applications
Effective caching of shortest paths for location-based services
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Single-Source multi-target a* algorithm for POI queries on road network
WAIM'11 Proceedings of the 2011 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
Predictive line queries for traffic prediction
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
Aggregate nearest neighbor search methods using SSMTA* algorithm on road-network
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Spatial-temporal query homogeneity for KNN object search on road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Merged aggregate nearest neighbor query processing in road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
G-tree: an efficient index for KNN search on road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Saturn: a fast keyword kNN search system in road networks
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
A connectivity index for moving objects in an indoor cellular space
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
The processing of kNN and continuous kNN queries on spatial network databases (SNDB) has been intensively studied recently. However, there is a lack of systematic study on the computation of network distances, which is the most fundamental difference between a road network and a Euclidean space. Since the online Dijkstra's algorithm has been shown to be efficient only for short distances, we propose an efficient index, called distance signature, for distance computation and query processing over long distances. Distance signature discretizes the distances between objects and network nodes into categories and then encodes these categories. To minimize the storage and search costs, we present the optimal category partition, and the encoding and compression algorithms for the signatures, based on a simplified network topology. By mathematical analysis and experimental study, we showed that the signature index is efficient and robust for various data distributions, query workloads, parameter settings and network updates.