A Framework for Generating Network-Based Moving Objects
Geoinformatica
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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
MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries
IEEE Transactions on Mobile Computing
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd 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
Continuous range monitoring of mobile objects in road networks
Data & Knowledge Engineering
Continuous Range Search Query Processing in Mobile Navigation
ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Anonymous Query Processing in Road Networks
IEEE Transactions on Knowledge and Data Engineering
PAM: An Efficient and Privacy-Aware Monitoring Framework for Continuously Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Constrained k-nearest neighbor query processing over moving object trajectories
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
MDM '10 Proceedings of the 2010 Eleventh International Conference on Mobile Data Management
Recovery of flash memories for reliable mobile storages
Mobile Information Systems
Voronoi-based range and continuous range query processing in mobile databases
Journal of Computer and System Sciences
Constrained range search query processing on road networks
Concurrency and Computation: Practice & Experience
Mobile Information Systems
Event sharing in vehicular networks using geographic vectors and maps
Mobile Information Systems
Voronoi-based multi-level range search in mobile navigation
Multimedia Tools and Applications
Continuous Monitoring of Distance-Based Range Queries
IEEE Transactions on Knowledge and Data Engineering
Optimizing the performance and robustness of type-2 fuzzy group nearest-neighbor queries
Mobile Information Systems
Efficient algorithms to monitor continuous constrained k nearest neighbor queries
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Hi-index | 0.00 |
Given two positive parameters k and r, a constrained k-nearest neighbor CkNN query returns the k closest objects within a network distance r of the query location in road networks. In terms of the scalability of monitoring these CkNN queries, existing solutions based on central processing at a server suffer from a sudden and sharp rise in server load as well as messaging cost as the number of queries increases. In this paper, we propose a distributed and scalable scheme called DAEMON for the continuous monitoring of CkNN queries in road networks. Our query processing is distributed among clients query objects and server. Specifically, the server evaluates CkNN queries issued at intersections of road segments, retrieves the objects on the road segments between neighboring intersections, and sends responses to the query objects. Finally, each client makes its own query result using this server response. As a result, our distributed scheme achieves close-to-optimal communication costs and scales well to large numbers of monitoring queries. Exhaustive experimental results demonstrate that our scheme substantially outperforms its competitor in terms of query processing time and messaging cost.