The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2013 vol.25)
pp: 850-862
George Trimponias , Hong Kong University of Science and Technology, Hong Kong
Ilaria Bartolini , University of Bologna , Bologna
Dimitris Papadias , Hong Kong University of Science and Technology, Hong Kong
Yin Yang , Advanced Digital Sciences Center, Singapore
We assume a data set that is vertically decomposed among several servers, and a client that wishes to compute the skyline by obtaining the minimum number of points. Existing solutions for this problem are restricted to the case where each server maintains exactly one dimension. This paper proposes a general solution for vertical decompositions of arbitrary dimensionality. We first investigate some interesting problem characteristics regarding the pruning power of points. Then, we introduce vertical partition skyline (VPS), an algorithmic framework that includes two steps. Phase 1 searches for an anchor point $(P_{anc})$ that dominates, and hence eliminates, a large number of records. Starting with $(P_{anc})$, Phase 2 constructs incrementally a pruning area using an interesting union-intersection property of dominance regions. Servers do not transmit points that fall within the pruning area in their local subspace. Our experiments confirm the effectiveness of the proposed methods under various settings.
Servers, Lattices, Partitioning algorithms, Query processing, query processing, Distributed skyline, vertical partitioning
George Trimponias, Ilaria Bartolini, Dimitris Papadias, Yin Yang, "Skyline Processing on Distributed Vertical Decompositions", IEEE Transactions on Knowledge & Data Engineering, vol.25, no. 4, pp. 850-862, April 2013, doi:10.1109/TKDE.2011.266
[1] R. Akbarinia, E. Pacitti, and P. Valduriez, "Best Position Algorithms for Top-k Queries," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB), 2007.
[2] W.-T. Balke, U. Güntzer, and J.X. Zheng, "Efficient Distributed Skylining for Web Information Systems," Proc. Int'l Conf. Extending Database Technology (EDBT), 2004.
[3] I. Bartolini, P. Ciaccia, and M. Patella, "Efficient Sort-Based Skyline Evaluation," ACM Trans. Database Systems, vol. 33, no. 4, pp. 1-45, 2008.
[4] S. Börzsönyi, D. Kossmann, and K. Stocker, "The Skyline Operator," Proc. 17th Int'l Conf. Data Eng. (ICDE), 2001.
[5] J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline with Pre-Sorting," Proc. 19th Int'l Conf. Data Eng. (ICDE), 2003.
[6] B. Cui, H. Lu, Q. Xu, L. Chen, Y. Dai, and Y. Zhou, "Parallel Distributed Processing of Constrained Skyline Queries by Filtering," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE), 2008.
[7] A. Datta, D. Vandermeer, A. Celik, and V. Kumar, "Broadcast Protocols to Support Efficient Retrieval from Databases by Mobile Users," ACM Trans. Database Systems, vol. 24, no. 1, 1-79, 1999.
[8] E. Dellis, A. Vlachou, I. Vladimirskiy, B. Seeger, and Y. Theodoridis, "Constrained Subspace Skyline Computation," Proc. 15th ACM Int'l Conf. Information and Knowledge Management, 2006.
[9] P. Godfrey, R. Shipley, and J. Gryz, "Algorithms and Analyses for Maximal Vector Computation," Int'l J. Very Large Data Bases, vol. 16, no. 1, 5-28 2007.
[10] K. Lee, B. Zhang, H. Li, and W.-C. Lee, "Approaching the Skyline in Z Order," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB), 2007.
[11] D. Papadias, Y. Tao, G. Fu, and B. Seeger, "Progressive Skyline Computation in Database Systems," ACM Trans. Database Systems, vol. 30, no. 1, pp. 41-82, 2005.
[12] Y. Tao, X. Xiao, and J. Pei, "SUBSKY: Efficient Computation of Skylines in Subspaces," Proc. 22nd Int'l Conf. Data Eng. (ICDE), 2006.
[13] A. Vlachou, C. Doulkeridis, and Y. Kotidis, "Angle-Based Space Partitioning for Efficient Parallel Skyline Computation," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2008.
[14] A. Vlachou, C. Doulkeridis, Y. Kotidis, and M. Vazirgiannis, "SKYPEER: Efficient Subspace Skyline Computation over Distributed Data," Proc. Int'l Conf. Data Eng. (ICDE), 2007.
[15] S. Wang, Q.H. Vu, B.C. Ooi, A.K.H. Tung, and L. Xu, "Skyframe: A Framework for Skyline Query Processing in Peer-to-Peer Systems," Int'l J. Conf. Very Large Data Bases, vol. 18, no. 1, pp. 345-362, 2009.
[16] M.L. Yiu and N. Mamoulis, "Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB), 2007.
[17] Z. Zhang, R. Cheng, D. Papadias, and A. Tung, "Minimizing the Communication Cost for Continuous Skyline Maintenance," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2009.
76 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool