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)
Closest pair queries in spatial databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
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
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
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
In-Route Nearest Neighbor Queries
Geoinformatica
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th 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
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
MOIR/MT: monitoring large-scale road network traffic in real-time
Proceedings of the VLDB Endowment
Path oracles for spatial networks
Proceedings of the VLDB Endowment
Direction-based spatial skylines
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Efficient best path monitoring in road networks for instant local traffic information
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Best point detour query in road networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Incremental graph pattern matching
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
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
STS: complex spatio-temporal sequence mining in flickr
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
MOVIES: indexing moving objects by shooting index images
Geoinformatica
Direction-based surrounder queries for mobile recommendations
The VLDB Journal — The International Journal on Very Large Data Bases
Finding the most accessible locations: reverse path nearest neighbor query in road networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
PNN query processing on compressed trajectories
Geoinformatica
Continuous distance-based skyline queries in road networks
Information Systems
HLDB: location-based services in databases
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Moving spatial keyword queries: Formulation, methods, and analysis
ACM Transactions on Database Systems (TODS)
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
Frontiers of Computer Science: Selected Publications from Chinese Universities
Quickest path queries on transportation network
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Customizable point-of-interest queries in road networks
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Secured obfuscated queries in spatial networks
International Journal of Wireless and Mobile Computing
Aggregate nearest neighbor queries in uncertain graphs
World Wide Web
Mobile Information Systems
A safe exit algorithm for continuous nearest neighbor monitoring in road networks
Mobile Information Systems
Hi-index | 0.00 |
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 provides a list of nearest candidates for reference by considering the whole coming journey. We name this query the k-Path Nearest Neighbor query (k-PNN). As the user is moving and may not always follow the shortest path, the query path keeps changing. The challenge of monitoring the k-PNN for an arbitrarily moving user is to dynamically determine the update locations and then refresh the k-PNN efficiently. We propose a three-phase Best-first Network Expansion (BNE) algorithm for monitoring the k-PNN and the corresponding shortest path. In the searching phase, the BNE finds the shortest path to the destination, during which a candidate set that guarantees to include the k-PNN is generated at the same time. Then in the verification phase, a heuristic algorithm runs for examining candidates' exact distances to the query path, and it achieves significant reduction in the number of visited nodes. The monitoring phase deals with computing update locations as well as refreshing the k-PNN in different user movements. Since determining the network distance is a costly process, an expansion tree and the candidate set are carefully maintained by the BNE algorithm, which can provide efficient update on the shortest path and the k-PNN results. Finally, we conduct extensive experiments on real road networks and show that our methods achieve satisfactory performance.