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
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Exponential index: a parameterized distributed indexing scheme for data on air
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Energy efficient exact kNN search in wireless broadcast environments
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Spatial queries in wireless broadcast systems
Wireless Networks - Special issue: Pervasive computing and communications
DSI: A Fully Distributed Spatial Index for Location-Based Wireless Broadcast Services
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Reverse Nearest Neighbors in Large Graphs
IEEE Transactions on Knowledge and Data Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
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
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
Processing transitive nearest-neighbor queries in multi-channel access environments
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Efficient heuristics for data broadcasting on multiple channels
Wireless Networks
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
An efficient nonuniform index in the wireless broadcast environments
Journal of Systems and Software
Continuous Monitoring of Spatial Queries in Wireless Broadcast Environments
IEEE Transactions on Mobile Computing
A distributed spatial index for error-prone wireless data broadcast
The VLDB Journal — The International Journal on Very Large Data Bases
Benefit-oriented data retrieval in data broadcast environments
Wireless Networks
Shortest path computation on air indexes
Proceedings of the VLDB Endowment
Energy-efficient tree-based indexing schemes for information retrieval in wireless data broadcast
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Optimal location queries in road network databases
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Short communication: Location-based grid-index for spatial query processing
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Recently, wireless broadcast environments have attracted significant attention due to its high scalability to broadcast information to a large number of mobile subscribers. It is especially a promising and desirable dissemination method for the heavily loaded environment where a great number of the same type of requests are sent from the users. There have been many studies on processing spatial queries via broadcast model recently. However, not much attention is paid to the spatial queries in road networks on wireless broadcast environments. In this paper, we focus on three common types of spatial queries, namely, k nearest neighbor (kNN) queries, range queries and reverse nearest neighbor (RNN) queries in spatial networks for wireless data broadcast. Specially, we propose a novel index for spatial queries in wireless broadcast environments (ISW). With the reasonable organization and the effectively pre-computed bounds, ISW provides a powerful framework for spatial queries. Furthermore, efficient algorithms are designed to cope with kNN, range and RNN queries separately based on ISW. The search space can be obviously reduced and subsequently the client can download as less as possible data for query processing, which can conserve the energy while not significantly influence the efficiency. The detailed theory analysis of cost model and the experimental results are presented for verifying the efficiency and effectiveness of ISW and our methods.