The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2009 vol.21)
pp: 1059-1072
Lijiang Chen , Peking University, Beijing
Linhao Xu , IBM China Research Lab, Beijing
Hua Lu , Aalborg University, Denmark
Guojie Song , Peking University, Beijing
Quanqing Xu , Peking University, Beijing
ABSTRACT
An increasing number of large-scale applications exploit peer-to-peer network architecture to provide highly scalable and flexible services. Among these applications, data management in peer-to-peer systems is one of the interesting domains. In this paper, we investigate the multidimensional skyline computation problem on a structured peer-to-peer network. In order to achieve low communication cost and quick response time, we utilize the iMinMax(\theta ) method to transform high-dimensional data to one-dimensional value and distribute the data in a structured peer-to-peer network called BATON. Thereafter, we propose a progressive algorithm with adaptive filter technique for efficient skyline computation in this environment. We further discuss some optimization techniques for the algorithm, and summarize the key principles of our algorithm into a query routing protocol with detailed analysis. Finally, we conduct an extensive experimental evaluation to demonstrate the efficiency of our approach.
INDEX TERMS
Distributed networks, database management, query processing.
CITATION
Lijiang Chen, Linhao Xu, Hua Lu, Guojie Song, Quanqing Xu, "Efficient Skyline Computation in Structured Peer-to-Peer Systems", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 7, pp. 1059-1072, July 2009, doi:10.1109/TKDE.2008.235
REFERENCES
[1] J. Aspnes and G. Shah, “Skip Graphs,” Proc. ACM-SIAM Symp. Discrete Algorithms (SODA), 2003.
[2] W.-T. Balke, U. Güntzer, and J.X. Zheng, “Efficient Distributed Skylining for Web Information Systems,” Proc. Int'l Conf. Extending Data Eng. (EDBT), pp.256-273, 2004.
[3] I. Bartolini, P. Ciaccia, and M. Patella, “Efficient Sort-Based Skyline Evaluation,” ACM Trans. Databases Systems, vol. 33, no. 4, pp.1-45, 2008.
[4] S. Borzsonyi, D. Kossmann, and K. Stocker, “The Skyline Operator,” Proc. Int'l Conf. Data Eng. (ICDE), pp.421-430, 2001.
[5] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella Like P2P Systems Scalable,” Proc. Special Interest Group on Data Comm. (SIGCOMM), 2003.
[6] J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, “Skyline with Presorting,” Proc. Int'l Conf. Data Eng. (ICDE), pp.717-719, 2003.
[7] L. Chen, B. Cui, H. Lu, L. Xu, and Q. Xu, “iSky: Efficient and Progressive Skyline Computing in a Structured P2P Network,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS), 2008.
[8] A. Crainiceanu, P. Linga, J. Gehrke, and J. Shanmugasundaram, “P-Tree: A P2P Index for Resource Discovery Applications,” Proc. World Wide Web Conf. (WWW), 2004.
[9] 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), 2008.
[10] S. Datta and H. Kargupta, “Uniform Data Sampling from a Peer-to-Peer Network,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS), p.50, 2007.
[11] 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.
[12] N.J.A. Harvey, M.B. Jones, S. Saroiu, M. Theimer, and A. Wolman, “SkipNet: A Scalable Overlay Network with Practical Locality Properties,” Proc. Symp. Internet Technologies and Systems (USITS), 2003.
[13] K. Hose, “Processing Skyline Queries in P2P Systems,” Proc. Int'l Conf. Very Large Data Bases (VLDB), PhD Workshop, 2005.
[14] Z. Huang, C.S. Jensen, H. Lu, and B.C. Ooi, “Skyline Queries Against Mobile Lightweight Devices in MANETs,” Proc. Int'l Conf. Data Eng. (ICDE), p.66, 2006.
[15] Y.-J. Joung, C.-T. Fang, and L.-W. Yang, “Keyword Search in DHT-Based Peer-to-Peer Networks,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS), pp.339-348, 2005.
[16] H.V. Jagadish, B.C. Ooi, and Q.H. Vu, “Baton: A Balanced Tree Structure for Peer-to-Peer Networks,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp.661-672, 2005.
[17] H.V. Jagadish, B.C. Ooi, Q.H. Vu, R. Zhang, and A.Y. Zhou, “VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes,” Proc. Int'l Conf. Data Eng. (ICDE), 2006.
[18] 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.
[19] D. Li, X. Lu, B. Wang, J. Su, J. Cao, K.C.C. Chan, and H.V. Leong, “Delay-Bounded Range Queries in DHT-Based Peer-to-Peer Systems,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS), p.64, 2006.
[20] H. Li, Q. Tan, and W. Lee, “Efficient Progressive Processing of Skyline Queries in Peer-to-Peer Systems,” Proc. Int'l Conf. Scalable Information Systems (INFOSCALE), 2006.
[21] M. Li, W. Lee, and A. Sivasubra, “Semantic Small World: An Overlay Network for Peer-to-Peer Search,” Proc. Int'l Conf. Network Protocols (ICNP), 2004.
[22] B. Liu, W.-C. Lee, and D.L. Lee, “Supporting Complex Multi-Dimensional Queries in P2P Systems,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS), pp.155-164, 2005.
[23] B.C. Ooi, K.-L. Tan, C. Yu, and S. Bressan, “Indexing the Edge: A Simple and Yet Efficient Approach to High-Dimensional Indexing,” Proc. ACM Symp. Principle Database Systems (PODS), pp.166-174, 2000.
[24] J. Pang, P.B. Gibbons, M. Kaminsky, S. Seshan, and H. Yu, “Defragmenting DHT-Based Distributed File Systems,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS), p.14, 2007.
[25] D. Papadias, Y. Tao, G. Fu, and B. Seeger, “An Optimal and Progressive Algorithm for Skyline Queries,” Proc. ACM Special Interest Group on Management of Data (SIGMOD), pp.467-478, 2003.
[26] D. Papadias, Y. Tao, G. Fu, and B. Seeger, “Progressive Skyline Computation in Database Systems,” ACM Trans. Databases Systems, vol. 30, no. 1, pp.41-82, 2005.
[27] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM Special Interest Group on Data Comm. (SIGCOMM), 2001.
[28] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM Middleware, 2001.
[29] I. Stoica, R. Moris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM Special Interest Group on Data Comm. (SIGCOMM), 2001.
[30] K.-L. Tan, P.-K. Eng, and B.C. Ooi, “Efficient Progressive Skyline Computation,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp.301-310, 2001.
[31] 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.
[32] 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.
[33] R. Weber, H.-J. Schek, and S. Blott, “A Quantitative Analysis and Performance Study for Similarity-Search Methods in High Dimensional Spaces,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp.194-205, 1998.
[34] K. Wei, A.J. Smith, Y.-F.R. Chen, and B. Vo, “Whopay: A Scalable and Anonymous Payment System for Peer-to-Peer Environments,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS), p.13, 2006.
[35] P. Wu, C. Zhang, Y. Feng, B.Y. Zhao, D. Agrawal, and A.E. Abbadi, “Parallelizing Skyline Queries for Scalable Distribution,” Proc. Conf. Extending Database Technology (EDBT), pp.112-130, 2006.
[36] Y. Yuan, X. Lin, Q. Liu, W. Wang, J.X. Yu, and Q. Zhang, “Efficient Computation of the Skyline Cube,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2005.
[37] D. Zinn, “Skyline Queries in P2P Systems,” Diploma thesis, Technische Universitat Ilmenau, 2005.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool