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
Towards an analysis of range query performance in spatial data structures
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Power efficient filtering of data on air
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
Energy efficient indexing on air
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A general framework for vertex orderings with applications to circuit clustering
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
Location dependent query processing
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
Spatial databases with application to GIS
Spatial databases with application to GIS
Indexing techniques for power management in multi-attribute data broadcast
Mobile Networks and Applications
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Prioritized sequencing for efficient query on broadcast geographical information in mobile-computing
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Object Organization on a Single Broadcast Channel in the Mobile Computing Environment
Multimedia Tools and Applications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Effective Data Placement for Wireless Broadcast
Distributed and Parallel Databases
A Hybrid Index Technique for Power Efficient Data Broadcast
Distributed and Parallel Databases
Data Allocation on Wireless Broadcast Channels for Efficient Query Processing
IEEE Transactions on Computers
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and 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
Query Processing in Broadcasted Spatial Index Trees
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
A Multi-scale Algorithm for the Linear Arrangement Problem
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
A distributed spatial index for error-prone wireless data broadcast
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Data broadcasting is well known for its excellent scalability. Most geographical data, such as weather and traffic, is public information that has a large amount of potential users which makes it very suitable for broadcast. The query response time is greatly affected by the order in which data items are being broadcast. This paper proposes an efficient method to place geographical data items over broadcast channel that reduces access time for spatial range queries on them. This paper then performs evaluation studies comparing different ordering methods: 1000 random orderings, R-Tree traversal ordering, Hilbert ordering and the optimized ordering based on the proposed method. The results show that the optimized ordering is significantly better than the others.