The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
Broadcast protocols to support efficient retrieval from databases by mobile users
ACM Transactions on Database Systems (TODS)
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Catalyst for Mobile and Ubiquitous Computing
IEEE Pervasive Computing
Guest Editors' Introduction: Context-Aware Computing
IEEE Pervasive Computing
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Adaptive Broadcast Protocols to Support Power Conservant Retrieval by Mobile Users
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Approximate Nearest Neighbor Searching in Multimedia Databases
Proceedings of the 17th International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
What Is the Nearest Neighbor in High Dimensional Spaces?
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
A Hashing Strategy for Efficient k -Nearest Neighbors Computation
CGI '99 Proceedings of the International Conference on Computer Graphics
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Power Conservative Multi-Attribute Queries on Data Broadcast
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Optimal Channel Allocation for Data Dissemination in Mobile Computing Environments
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Perceptrons: An Introduction to Computational Geometry
Perceptrons: An Introduction to Computational Geometry
General packet radio service in GSM
IEEE Communications Magazine
On the metric properties of discrete space-filling curves
IEEE Transactions on Image Processing
An error-resilient cell-based distributed index for location-based wireless broadcast services
MobiDE '06 Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access
Continuous spatial queries via wireless data broadcast
Proceedings of the 2006 ACM symposium on Applied computing
Broadcast-based spatial queries
Journal of Computer Science and Technology
Adaptive data dissemination schemes for location-aware mobile services
Journal of Systems and Software - Special issue: Quality software
Efficient query execution on broadcasted index tree structures
Data & Knowledge Engineering
A skewed distributed indexing for skewed access patterns on the wireless broadcast
Journal of Systems and Software
Energy-Efficient Data Dissemination Schemes for Nearest Neighbor Query Processing
IEEE Transactions on Computers
On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems
IEEE Transactions on Mobile Computing
Effective protocols for kNN search on broadcast multi-dimensional index trees
Information Systems
Proceedings of the 6th international conference on Mobile systems, applications, and services
An efficient nonuniform index in the wireless broadcast environments
Journal of Systems and Software
Mobile continuous nearest neighbor queries on air
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
An efficient data dissemination scheme for spatial query processing
Journal of Computer Science and Technology
On processing location based top-k queries in the wireless broadcasting system
Proceedings of the 2010 ACM Symposium on Applied Computing
Shortest path computation on air indexes
Proceedings of the VLDB Endowment
A hybrid communication solution to distributed moving query monitoring systems
Electronic Commerce Research and Applications
Fast and memory-efficient NN search in wireless data broadcast
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Cell-Based distributed index for range query processing in wireless data broadcast systems
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Energy-efficient shortest path query processing on air
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Effective low-latency k-nearest neighbor search via wireless data broadcast
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Range and nearest neighbor query processing for mobile clients
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
Processing generalized k-nearest neighbor queries on a wireless broadcast stream
Information Sciences: an International Journal
Similarity search in sensor networks using semantic-based caching
Journal of Network and Computer Applications
Spatial queries in wireless broadcast environments
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Computers & Mathematics with Applications
Mobile query services in a participatory embedded sensing environment
ACM Transactions on Embedded Computing Systems (TECS) - Special issue on embedded systems for interactive multimedia services (ES-IMS)
Energy-efficient air-indices for distance queries on road networks
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Spatial query processing in road networks for wireless data broadcast
Wireless Networks
Hi-index | 0.00 |
Owing to the advent of wireless networking and personal digital devices, information systems in the era of mobile computing are expected to be able to handle a tremendous amount of traffic and service requests from the users. Wireless data broadcast, thanks to its high scalability, is particularly suitable for meeting such a challenge. Indexing techniques have been developed for wireless data broadcast systems in order to conserve the scarce power resources in mobile clients. However, most of the previous studies do not take into account the impact of location information of users. In this paper, we address the issues of supporting spatial queries (including window queries and kNN queries) of location-dependent information via wireless data broadcast. A linear index structure based on the Hilbert curve and corresponding search algorithms are proposed to answer spatial queries on air. Experiments are conducted to evaluate the performance of the proposed indexing technique. Results show that the proposed index and its enhancement outperform existing algorithms significantly.