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
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Efficient indexing for broadcast based wireless systems
Mobile Networks and Applications - Special issue on mobile computing and system services
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
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Performance comparison of index structures for multi-key retrieval
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Hybrid Index Technique for Power Efficient Data Broadcast
Distributed and Parallel Databases
Data on Air: Organization and Access
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 Semantic Broadcast Scheme for a Mobile Environment Based on Dynamic Chunking
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Location-dependent queries evaluation in mobile networks
UbiMob '04 Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing
An efficient data dissemination scheme for spatial query processing
Journal of Computer Science and Technology
Hi-index | 0.00 |
Broadcasting is an effective and efficient way to disseminate public geographical information to massive users. In this paper, we use R-tree to index broadcast geographical data. Based on our observation that geographical data and their accesses are often concentrated (clustered) in real applications, we propose a novel prioritized sequencing method by considering access frequencies based on application semantics to reduce average access time (latency). The key idea is to put "hot" data items ahead of "cold" ones in the broadcast sequence while still maintain R-Tree indexing structure.We evaluate our method using MapInfo Census 2000 data sample with 576 service locations and 111 of them are hot data items. The average reduction percentages of access time are reduced by 60% for both point queries and range queries based on 10 rounds experiments, each consists 10 hot data items and 5 cold items that are randomly selected. We conclude that our simple method is very effective in improving query efficiency in geographical information broadcast systems.We also proved the linear relationship between wait time and the Aggregate Data Affinity (ADA) (Lee, 2000), a parameter measuring the "eagerness" for data experienced by a client during a query process in broadcast wireless mobile computing environment. Thus our conclusion also holds when using ADA for evaluating broadcast system performance.