R-trees: a dynamic index structure for spatial searching
Readings in database systems
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A Framework for Generating Network-Based Moving Objects
Geoinformatica
Data on Air: Organization and Access
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
Query Processing in Broadcasted Spatial Index Trees
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
The D-Tree: An Index Structure for Planar Point Queries in Location-Based Wireless Services
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
Adaptive data dissemination schemes for location-aware mobile services
Journal of Systems and Software - Special issue: Quality software
On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems
IEEE Transactions on Mobile Computing
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Effective protocols for kNN search on broadcast multi-dimensional index trees
Information Systems
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
Continuous K-Nearest Neighbor Query over Moving Objects in Road Networks
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
A distributed spatial index for error-prone wireless data broadcast
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient mutual nearest neighbor query processing for moving object trajectories
Information Sciences: an International Journal
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
The islands approach to nearest neighbor querying in spatial networks
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
Recently, people have begun to deal with location-based queries (LBQs) under broadcast environments. To the best of our knowledge, most of the existing broadcast-based LBQ methods are aimed at Euclidean spaces and cannot be readily extended to road networks. This paper takes the first step toward processing Continuous Nearest Neighbor queries in road Networks under wireless Broadcast environments (CN^3B). Our method leverages the key properties of Network Voronoi Diagram (NVD). We first present an efficient method to partition the NVD structure of the underlying road networks into a set of grid cells and number the grid cells obtained, based on which we further propose an NVD-based Distributed air Index (NVD-DI) to support CN^3B query processing. Finally, we propose an efficient algorithm on the client side to process CN^3B queries. Extensive simulation experiments have been conducted to demonstrate the efficiency of our approach. The results show that our proposed method is about 4 and 7.6 times more efficient than a less-sophisticated D-tree air index based method, in access latency and tuning time, respectively.