RSkycube: Efficient Skycube Computation by Reusing Principle
Over the past years, the skyline query has already attracted wide attention in database community. In order to meet different preferences for users, the skycube computation is proposed to compute skylines, or cuboids, on all possible non-empty dimension subsets. The key issue of computing skycube is how to share computation among multiple related cuboids, which classified into sharing strict space dominance and sharing space incomparability. However, state-of-the-art algorithm only leverages sharing strict space dominance to compute skycube. This paper aims to design a more efficient skycube algorithm that shares computation among multiple related cuboids. We first propose a set of rules named identical partitioning (IP) for constructing a novel structure VSkyTree. Moreover, we present the reusing principle, which utilizes both sharing strict space dominance and sharing space incomparability by reusing VSkyTree on parent cuboids to compute child cuboids. Then, in top-down fashion, we design an efficient skycube computation algorithm RSkycube based on the reusing principle. Our experimental results indicate that our algorithm RSkycube significantly outperforms state-of-the-art skycube computation algorithm on both synthetic and real datasets.
KeywordsSkyline Skycube Space partitioning
This work was supported in part by the Key Research and Development Plan of National Ministry of Science and Technology under grant No. 2016YFB1000703, the National Natural Science Foundation of China under grant Nos. 61402130, 61272046, U1509216, the Natural Science Foundation of Heilongjiang Province, China under grant No. F201317.
- 1.Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, 2–6 April 2001, pp. 421–430 (2001)Google Scholar
- 3.Khalefa, M.E., Mokbel, M.F., Levandoski, J.J.: Skyline query processing for incomplete data. In: Proceedings of the 24th International Conference on Data Engineering, ICDE, Cancún, México, 7–12 April 2008, pp. 556–565 (2008)Google Scholar
- 4.Lee, J., Hwang, S.: Bskytree: scalable skyline computation using a balanced pivot selection. In: EDBT Proceedings of the 2010 13th International Conference on Extending Database Technology, Lausanne, Switzerland, 22–26 March 2010, pp. 195–206 (2010)Google Scholar
- 5.Lee, J., Hwang, S.: Qskycube: efficient skycube computation using point-based space partitioning. PVLDB 4(3), 185–196 (2010)Google Scholar
- 6.Pei, J., Fu, A.W., Lin, X., Wang, H.: Computing compressed multidimensional skyline cubes efficiently. In: Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, 15–20 April 2007, pp. 96–105 (2007)Google Scholar
- 7.Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the best views of skyline: a semantic approach based on decisive subspaces. In: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, 30 August–2 September 2005, pp. 253–264 (2005)Google Scholar
- 8.Raïssi, C., Pei, J., Kister, T.: Computing closed skycubes. PVLDB 3(1), 838–847 (2010)Google Scholar
- 9.Xia, T., Zhang, D.: Refreshing the sky: the compressed skycube with efficient support for frequent updates. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, 27–29 June 2006, pp. 491–502 (2006)Google Scholar
- 10.Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient computation of the skyline cube. In: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, 30 August–2 September 2005, pp. 241–252 (2005)Google Scholar
- 11.Zhang, S., Mamoulis, N., Cheung, D.W.: Scalable skyline computation using object-based space partitioning. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2009, Providence, Rhode Island, USA, 29 June–2 July 2009, pp. 483–494 (2009)Google Scholar