The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2010 vol.22)
pp: 1694-1708
Akrivi Vlachou , Norwegian University of Science and Technology, Trondheim
Christos Doulkeridis , Norwegian University of Science and Technology, Trondheim
Yannis Kotidis , Athens University of Economics and Business, Athens
Michalis Vazirgiannis , Athens University of Economics and Business, Athens
ABSTRACT
Data generation increases at highly dynamic rates, making its storage, processing, and update costs at one central location excessive. The P2P paradigm emerges as a powerful model for organizing and searching large data repositories distributed over independent sources. Advanced query operators, such as skyline queries, are necessary in order to help users handle the huge amount of available data. A skyline query retrieves the set of nondominated data points in a multidimensional data set. Skyline query processing in P2P networks poses inherent challenges and demands nontraditional techniques, due to the distribution of content and the lack of global knowledge. Relying on a superpeer architecture, we propose a threshold-based algorithm, called SKYPEER and its variants, for efficient computation of skyline points in arbitrary subspaces, while reducing both computational time and volume of transmitted data. Furthermore, we address the problem of routing skyline queries over the superpeer network and we propose an efficient routing mechanism, namely SKYPEER^+, which further improves the performance by reducing the number of contacted superpeers. Finally, we provide an extensive experimental evaluation showing that our approach performs efficiently and provides a viable solution when a large degree of distribution is required.
INDEX TERMS
Skyline queries, peer-to-peer systems, routing indexes.
CITATION
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis, Michalis Vazirgiannis, "Efficient Routing of Subspace Skyline Queries over Highly Distributed Data", IEEE Transactions on Knowledge & Data Engineering, vol.22, no. 12, pp. 1694-1708, December 2010, doi:10.1109/TKDE.2009.204
REFERENCES
[1] S. Börzsönyi, D. Kossmann, and K. Stocker, "The Skyline Operator," Proc. Int'l Conf. Data Eng. (ICDE), pp. 421-430, 2001.
[2] W.-T. Balke, U. Gunzer, and J. Zheng, "Efficient Distributed Skylining for Web Information Systems," Proc. Int'l Conf. Extending Database Technology (EDBT), pp. 256-273, 2004.
[3] B. Cui, H. Lu, Q. Xu, L. Chen, Y. Dai, and Y. Zhou, "Parallel Distributed Processing of Constrained Skyline Queries by Filtering," Proc. Int'l Conf. Data Eng. (ICDE), pp. 546-555, 2008.
[4] A. Vlachou, C. Doulkeridis, Y. Kotidis, and M. Vazirgiannis, "SKYPEER: Efficient Subspace Skyline Computation over Distributed Data," Proc. Int'l Conf. Data Eng. (ICDE), pp. 416-425, 2007.
[5] S. Wang, B.C. Ooi, A.K.H. Tung, and L. Xu, "Efficient Skyline Query Processing on Peer-to-Peer Networks," Proc. Int'l Conf. Data Eng. (ICDE), pp. 1126-1135, 2007.
[6] P. Wu, C. Zhang, Y. Feng, B.Y. Zhao, D. Agrawal, and A.E. Abbadi, "Parallelizing Skyline Queries for Scalable Distribution," Proc. Int'l Conf. Extending Database Technology (EDBT), pp. 112-130, 2006.
[7] L. Zhu, S. Zhou, and J. Guan, "Efficient Skyline Retrieval on Peer-to-Peer Networks," Future Generation Comm. and Networking, vol. 1, pp. 309-314, 2007.
[8] L. Zhu, Y. Tao, and S. Zhou, "Distributed Skyline Retrieval with Low Bandwidth Consumption," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 3, pp. 384-400, Mar. 2009.
[9] C. Doulkeridis, A. Vlachou, Y. Kotidis, and M. Vazirgiannis, "Peer-to-Peer Similarity Search in Metric Spaces," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 986-997, 2007.
[10] C. Doulkeridis, K. Nørvåg, and M. Vazirgiannis, "DESENT: Decentralized and Distributed Semantic Overlay Generation in P2P Networks," IEEE J. Selected Areas in Comm., vol. 25, no. 1, pp. 25-34, Jan. 2007.
[11] H.T. Kung, F. Luccio, and F.P. Preparata, "On Finding the Maxima of a Set of Vectors," J. ACM, vol. 22, no. 4, pp. 469-476, 1975.
[12] D. Kossmann, F. Ramsak, and S. Rost, "Shooting Stars in the Sky: An Online Algorithm for Skyline Queries," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 275-286, 2002.
[13] J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline with Pre-Sorting," Proc. Int'l Conf. Data Eng. (ICDE), pp. 717-719, 2003.
[14] 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.
[15] P. Godfrey, R. Shipley, and J. Gryz, "Maximal Vector Computation in Large Data Sets," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 229-240, 2005.
[16] I. Bartolini, P. Ciaccia, and M. Patella, "SaLSa: Computing the Skyline without Scanning the Whole Sky," Proc. ACM Int'l Conf. Information and Knowledge Management (CIKM), pp. 405-414, 2006.
[17] J. Pei, W. Jin, M. Ester, and Y. Tao, "Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 253-264, 2005.
[18] Y. Yuan, X. Lin, Q. Liu, W. Wang, J. Yu, and Q. Zhang, "Efficient Computation of the Skyline Cube," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 241-252, 2005.
[19] Y. Tao, X. Xiao, and J. Pei, "SUBSKY: Efficient Computation of Skylines in Subspaces," Proc. Int'l Conf. Data Eng. (ICDE), 2006.
[20] Y. Tao, X. Xiao, and J. Pei, "Efficient Skyline and Top-K Retrieval in Subspaces," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 8, pp. 1072-1088, Aug. 2007.
[21] K. Hose, C. Lemke, and K.-U. Sattler, "Processing Relaxed Skylines in PDMS Using Distributed Data Summaries," Proc. ACM Int'l Conf. Information and Knowledge Management (CIKM), pp. 425-434, 2006.
[22] Z. Huang, C. Jensen, H. Lu, and B.-C. Ooi, "Skyline Queries against Mobile Lightweight Devices in MANETs," Proc. Int'l Conf. Data Eng. (ICDE), 2006.
[23] 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," Very Large Data Bases J., vol. 18, no. 1, pp. 345-362, 2009.
[24] K. Fotiadou and E. Pitoura, "Bitpeer: Continuous Subspace Skyline Computation with Distributed Bitmap Indexes," Proc. Int'l Workshop Data Management in Peer-to-Peer Systems (DAMAP), 2008.
[25] A. Crespo and H. Garcia-Molina, "Routing Indices for Peer-to-Peer Systems," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), pp. 23-34, 2002.
[26] B. Yang and H. Garcia-Molina, "Improving Search in Peer-to-Peer Networks," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), pp. 5-14, 2002.
[27] H.V. Jagadish, B.C. Ooi, K.-L. Tan, C. Yu, and R. Zhang, "iDistance: An Adaptive B$^+$ -Tree Based Indexing Method for Nearest Neighbor Search," ACM Trans. Database Systems, vol. 30, no. 2, pp. 364-397, 2005.
4 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool