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
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
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
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
What Is the Nearest Neighbor in High Dimensional Spaces?
VLDB '00 Proceedings of the 26th 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
General packet radio service in GSM
IEEE Communications Magazine
On the metric properties of discrete space-filling curves
IEEE Transactions on Image Processing
Spatial queries in wireless broadcast systems
Wireless Networks - Special issue: Pervasive computing and communications
MiddleWhere: a middleware for location awareness in ubiquitous computing applications
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
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
On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems
IEEE Transactions on Mobile Computing
Valid scope computation for location-dependent spatial query in mobile broadcast environments
Proceedings of the 17th ACM conference on Information and knowledge management
A distributed spatial index for error-prone wireless data broadcast
The VLDB Journal — The International Journal on Very Large Data Bases
Energy Efficient and Progressive Strategy for Processing Skyline Queries on Air
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
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
Short communication: Location-based grid-index for spatial query processing
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
With the advent of wireless networking and personal digital devices, the population of mobile users will increase significantly. Broadcasting is particularly suitable for environments having a large number of clients. In this paper, we study the query processing of some typical location-dependent queries, such as window queries and kNN queries, in a broadcast system. To reduce clients' power consumption and provide efficient services, a transformation of the objects is applied based on Hilbert Curve. Furthermore, a linear index structure is constructed and several algorithms are devised to answer spatial queries. Experiments are conducted to evaluate the performance of the proposed transformation and related algorithms. Results show that the proposed schemes outperform existing algorithms significantly.