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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jin, W., Han, J., Ester, M.: Mining Thick Skylines over Large Databases. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS, vol. 3202, pp. 255–266. Springer, Heidelberg (2004)
Hristidis, V., Koudas, N., Papakonstantinou, Y.: PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries. In: SIGMOD, pp. 259–270 (2001)
Huang, Z., Jensen, C., Lu, H., Ooi, B.: Skyline Queries Against Mobile Lightweight Devices in MANETs. In: ICDE, pp. 66–76 (2006)
Liang, W., Chen, B., Yu, J.: Energy-efficient skyline query processing and maintenance in sensor networks. In: Proceeding of the 17th ACM conference on Information and knowledge management (CIKM), pp. 1471–1472 (2008)
Barndorff-Nielsen, O., Sobel, M.: On the Distribution of the Number of Admissable Points in a Vector Random Sample. Theory of Probability and its Application 11(2), 249–269 (1966)
Bentley, J.L., Kung, H.T., Schkolnick, M., Thompson, C.D.: On the Average Number of Maxima in a Set of Vectors and Applications. Journal of ACM 25(4), 536–543 (1978)
Kung, H.T., Luccio, F., Preparata, F.P.: On Finding the Maxima of a Set of Vectors. Journal of ACM 22(4), 469–476 (1975)
Preparata, F., Shamos, M.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)
Börzsönyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: ICDE, pp. 421–430 (2001)
Balke, W.-T., Güntzer, U.: Multi-objective Query Processing for Database Systems. In: VLDB, pp. 936–947 (2004)
Balke, W.-T., Güntzer, U., Zheng, J.X.: Efficient Distributed Skylining for Web Information Systems. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 256–273. Springer, Heidelberg (2004)
Chan, C.Y., Eng, P.-K., Tan, K.-L.: Stratified Computation of Skylines with Partially-Ordered Domains. In: SIGMOD, pp. 203–214 (2005)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with Presorting. In: ICDE, pp. 717–816 (2003)
Godfrey, P., Shipley, R., Gryz, J.: Maximal Vector Computation in Large Data Sets. In: VLDB, pp. 229–240 (2005)
Kossmann, D., Ramsak, F., Rost, S.: Shooting Stars in the Sky: An Online Algorithm for Skyline Queries. In: VLDB, pp. 275–286 (2002)
Lin, X., Yuan, Y., Wang, W., Lu, H.: Stabbing the Sky: Efficient Skyline Computation over Sliding Windows. In: ICDE, pp. 502–513 (2005)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: An Optimal and Progressive Algorithm for Skyline Queries. In: SIGMOD, pp. 467–478 (2003)
Tan, K.-L., Eng, P.K., Ooi, B.C.: Efficient Progressive Skyline Computation. In: VLDB, pp. 301–310 (2001)
Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces. In: VLDB, pp. 253–264 (2005)
Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient Computation of the Skyline Cube. In: VLDB, pp. 241–252 (2005)
Tao, Y., Xiao, X., Pei, J.: SUBSKY: Efficient Computation of Skylines in Subspaces. In: ICDE (2006)
Xia, T., Zhang, D.: Refreshing the sky: the compressed skycube with efficient support for frequent updates. In: SIGMOD, pp. 491–502 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fang, Z., Wang, J., Zhang, D. (2009). Workload-Driven Compressed Skycube Queries in Wireless Applications. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)