Optimizing data placement over wireless broadcast channel for multi-dimensional range query processing

Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent services, are very popular queries in mobile computing. Query response time is greatly affected by the order in which data items are being broadcast. This paper proposes a non-greedy, low polynomial time cost optimization method to place data over a wireless broadcast channel for multi-dimensional range query processing. Experimental results show that the method, together with proper global constraints based on application semantics, can greatly reduce total access time to the data channel. Compared with the heuristic data placement methods purely based on the access frequencies, the reduction of access time can be as much as 54%.