SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
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
Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Location-Dependent Cache Invalidation Schemes for Mobile Environments
IEEE Transactions on Knowledge and Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th 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
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
Distance indexing on road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Monitoring Aggregate k-NN Objects in Road 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
Continually answering constraint k-NN queries in unstructured P2P systems
Journal of Computer Science and Technology
An efficient pre-computation technique for approximation KNN search in road networks
Proceedings of the 2009 International Workshop on Location Based Social Networks
S-GRID: a versatile approach to efficient query processing in spatial networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Efficient k-nearest neighbor search in time-dependent spatial networks
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Query-aware location anonymization for road networks
Geoinformatica
Direction-based surrounder queries for mobile recommendations
The VLDB Journal — The International Journal on Very Large Data Bases
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
Multiple k nearest neighbor query processing in spatial network databases
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Moving Query Monitoring in Spatial Network Environments
Mobile Networks and Applications
Continuous min-max distance bounded query in road networks
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Indexing network voronoi diagrams
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database 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
Accurate and scalable nearest neighbors in large networks based on effective importance
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Spatial-temporal query homogeneity for KNN object search on 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
| Hi-index | 0.00 |
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 closer than the NN to the query must be visited. The latter, e.g., the Voronoi Network Nearest Neighbor (VN3) approach, can handle sparse datasets but is inappropriate for medium and dense datasets due to its high precomputation and storage overhead. In this paper, we propose a new approach that indexes the network topology based on a novel network reduction technique. It simplifies the network by replacing the graph topology with a set of interconnected tree-based structures called SPIE’s. An nd index is developed for each SPIE and our new (k)NN search algorithms on an SPIE follow a predetermined tree path to avoid costly network expansion. By mathematical analysis and experimental results, our new approach is shown to be efficient and robust for various network topologies and data distributions.