Workload-Driven Compressed Skycube Queries in Wireless Applications

  • Authors:

  • Zheng Fang;Jie Wang;Donghui Zhang

  • Affiliations:

  • Department of Computer Science, University of Massachusetts, Lowell 01854;Department of Computer Science, University of Massachusetts, Lowell 01854;College of Computer and Information Science, Northeastern University, Boston 02115

  • Venue:
  • WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Compressed skycubes provide an efficient mechanism for skyline queries that are useful for wireless applications, where the size of a compressed skycube is often much smaller than that of the original skycube. However, even with compression, the entire compressed skycube may still be too large to be placed in the main memory of a wireless device. To overcome this obstacle we introduce the concept of workload-driven subspace compressed skycubes to meet the needs of an expected query profile. While it is NP-hard to find the best set of subspace compressed skycubes within the given memory constraint to serve the largest possible number of queries, we devise a polynomial-time approximation algorithms with a proven approximation guarantee. Our simulation results show that the approximation algorithm produces feasible solutions in reasonable amount of time with approximation ratios close to 1.