Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Multikey retrieval from K-d trees and QUAD-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Taxonomy of Indexing Schemes for Parallel Database Systems
Distributed and Parallel Databases
The Universal B-Tree for Multidimensional Indexing: general Concepts
WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
A Taxonomy of Broadcast Indexing Schemes for Multi Channel Data Dissemination in Mobile Databases
AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Global parallel index for multi-processors database systems
Information Sciences: an International Journal
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
K nearest neighbor search in navigation systems
Mobile Information Systems
Data retrieval for location-dependent queries in a multi-cell wireless environment
Mobile Information Systems
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
A context-aware Tour Guide: User implications
Mobile Information Systems
Architecture for the development of context-sensitive mobile applications
Mobile Information Systems - Mobile Systems and Applications
On Mining Movement Pattern from Mobile Users
International Journal of Distributed Sensor Networks - Heterogenous Wireless Ad Hoc and Sensor Networks
Mobile service oriented architectures for NN-queries
Journal of Network and Computer Applications
Range assignment problem on the Steiner tree based topology in ad hoc wireless networks
Mobile Information Systems - Advances in Wireless Networks
Network Voronoi Diagram Based Range Search
AINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications
Continuous range search based on network Voronoi diagram
International Journal of Grid and Utility Computing
Reverse k Nearest Neighbor and Reverse Farthest Neighbor Search on Spatial Networks
Transactions on Large-Scale Data- and Knowledge-Centered Systems I
Approximate static and continuous range search in mobile navigation
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Optimized skyline queries on road networks using nearest neighbors
Personal and Ubiquitous Computing
Designing an integrated driver assistance system using image sensors
Journal of Intelligent Manufacturing
Integrated context-aware driver assistance system architecture
Mobile Information Systems
Mobile Information Systems
Genetic algorithms for satellite scheduling problems
Mobile Information Systems
A safe exit algorithm for continuous nearest neighbor monitoring in road networks
Mobile Information Systems
Hi-index | 0.00 |
Due to the universality and importance of range search queries processing in mobile and spatial databases as well as in geographic information system (GIS), numerous approaches on range search algorithms have been proposed in recent years. But ordinary range search queries focus only on a specific type of point objects. For queries which require to retrieve objects of interest locating in a particular region, ordinary range search could not get the expected results. In addition, most existing range search methods need to perform a searching on each road segments within the pre-defined range, which decreases the performance of range search. In this paper, we design a weighted network Voronoi diagram and propose a high-performance multilevel range search query processing that retrieves a set of objects locating in some specified region within the searching range. The experimental results show that our proposed algorithm runs very efficiently and outperforms its main competitor.