Skip to main content
SpringerLink
Log in

Skyframe: a framework for skyline query processing in peer-to-peer systems

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

This paper looks at the processing of skyline queries on peer-to-peer (P2P) networks. We propose Skyframe, a framework for efficient skyline query processing in P2P systems, which addresses the challenges of quick response time, low network communication cost and query load balancing among peers. Skyframe consists of two querying methods: one is optimized for network communication while the other focuses on query response time. These methods are different in the way in which the query search space is defined. In particular, the first method uses a high dominating point that has a large dominating region to prune the search space to achieve a low cost in network communication. On the other hand, the second method relaxes the search space in order to allow parallel query processing to speed up query response. Skyframe achieves query load balancing by both query load conscious data space splitting/merging during the join/departure of nodes and dynamic load migration. We further show how to apply Skyframe to both the P2P systems supporting multi-dimensional indexing and the P2P systems supporting single-dimensional indexing. Finally, we have conducted extensive experiments on both real and synthetic data sets over two existing P2P systems: CAN (Ratnasamy in A scalable content-addressable network. In: Proceedings of SIGCOMM Conference, pp. 161–172, 2001) and BATON (Jagadish et al. in A balanced tree structure for peer-to-peer networks. In: Proceedings of VLDB Conference, pp. 661–672, 2005) to evaluate the effectiveness and scalability of Skyframe.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aberer, K., Datta, A., Hauswirth, M.: Multifaceted simultaneous load balancing in dht-based p2p systems: a new game with old balls and bins. In: Self-star Properties in Complex Information Systems, pp. 373–391 (2005)

  2. Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: Peer-to-Peer Computing, pp. 33–40 (2002)

  3. Balke, W.T., Güntzer, U., Zheng, J.X.: Efficient distributed skylining for web information systems. In: Proceedings of EDBT Conference, pp. 256–273 (2004)

  4. Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: supporting scalable multi-attribute range queries. In: Proceedings of SIGCOMM Conference, pp. 353–366 (2004)

  5. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of ICDE Conference, pp. 421–430 (2001)

  6. Cai, M., Frank, M.R., Chen, J., Szekely, P.A.: Maan: A multi-attribute addressable network for grid information services. In: GRID, pp. 184–191 (2003)

  7. Chan, C.Y., Eng, P.-K., Tan, K.-L.: Stratified computation of skylines with partially-ordered domains. In: Proceedings of SIGMOD Conference, pp. 203–214 (2005)

  8. Chan, C.Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., Zhang, Z.: On high dimensional skylines. In: Proceedings of EDBT Conference, pp. 478–495 (2006)

  9. Chan, C.Y., Jagadish, H.V., Tan, K.-L., Tung, Anthony K.H., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: SIGMOD Conference, pp. 503–514 (2006)

  10. Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarca, A., Shenker, S., Hellerstein, J.M.: A case study in building layered dht applications. In: SIGCOMM, pp. 97–108 (2005)

  11. Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: Proceedings of ICDE Conference, pp. 717–816 (2003)

  12. Dellis, E., Vlachou, A., Vladimirskiy, I., Seeger, B., Theodoridis, Y.: Constrained subspace skyline computation. In: CIKM, pp. 415–424 (2006)

  13. Deng, K., Zhou, X., Shen, H.T.: Multi-source skyline query processing in road networks. In: Proceedings of ICDE Conference (2007)

  14. Ganesan, P., Bawa, M., Garcia-Molina, H.: Online balancing of range-partitioned data with applications to peer-to-peer systems. In: Proceedings of VLDB Conference, pp. 444–455 (2004)

  15. Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: Multidimensional queries in p2p systems. In: Proceedings of WebDB workshop, pp. 19–24 (2004)

  16. Godfrey, P., Shipley, R., Gryz, J.: Maximal vector computation in large data sets. In: Proceedings of VLDB Conference, pp. 229–240 (2005)

  17. Hose, K., Lemke, C., Sattler, K.-U.: Processing relaxed skylines in pdms using distributed data summaries. In: CIKM, pp. 425–434 (2006)

  18. http://basketballreference.com

  19. Huang, Z., Jensen, C.S., Lu, H., Ooi, B.C.: Skyline queries against mobile lightweight devices in manets. In: Proceedings of ICDE Conference (2006)

  20. Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: Proceedings of VLDB Conference, pp. 661–672 (2005)

  21. Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: Proceedings of VLDB Conference, pp. 275–286 (2002)

  22. Li, C., Tung, A.K.H., Jin, W., Ester, M.: On dominating your neighborhood profitably. In: VLDB, pp. 818–829 (2007)

  23. Lin, X., Yuan, Y., Wang, W., Lu, H.: Stabbing the sky: efficient skyline computation over sliding windows. In: Proceedings of ICDE Conference, pp. 502–513 (2005)

  24. Lin, X., Yuan, Y., Zhang, Q., Zhang, Y.: Selecting stars: The k most representative skyline operator. In: ICDE, pp. 86–95 (2007)

  25. Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of SIGMOD Conference, pp. 467–478 (2003)

  26. Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the best views of skyline: A semantic approach based on decisive subspaces. In: Proceedings of VLDB Conference, pp. 253–264 (2005)

  27. Pei, J., Fu, A.W.-C., Lin, X., Wang, H.: Computing compressed multidimensional skyline cubes efficiently. In: ICDE, pp. 96–105 (2007)

  28. Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. In: VLDB, pp. 15–26 (2007)

  29. Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: Proceedings of SIGCOMM Conference, pp. 161–172 (2001)

  30. Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: VLDB, pp. 751–762 (2006)

  31. Shu, Y., Tan, K.L., Zhou, A.: Adapting the content native space for load balanced indexing. In: Proceedings of DBISP2P Workshop, pp. 122–135 (2004)

  32. Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of SIGCOMM Conference, pp. 149–160 (2001)

  33. Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient progressive skyline computation. In: Proceedings of VLDB Conference, pp. 301–310 (2001)

  34. Tao, Y., Xiao, X., Pei, J.: Subsky: efficient computation of skylines in subspaces. In: ICDE, 65 pp. (2006)

  35. Vlachou, A., Doulkeridis, C., Kotidis, Y., Vazirgiannis, M.: Skypeer: efficient subspace skyline computation over distributed data. In: Proceedings of ICDE Conference (2007)

  36. Wang, S., Ooi, B.C., Tung, A.K.H., Xu, L.: Efficient skyline query processing on peer-to-peer networks. In: Proceedings of ICDE Conference, pp. 1126–1135 (2007)

  37. Wu, P., Zhang, C., Feng, Y., Zhao, B.Y., Agrawal, D., Abbadi, A.E.: Parallelizing skyline queries for scalable distribution. In: Proceedings of EDBT Conference, pp. 112–130 (2006)

  38. Wu, P., Agrawal, D., Egecioglu, ö., El Abbadi, A.: Deltasky: optimal maintenance of skyline deletions without exclusive dominance region generation. In: ICDE, pp. 486–495 (2007)

  39. Xia, T., Zhang, D.: Refreshing the sky: the compressed skycube with efficient support for frequent updates. In: SIGMOD Conference, pp. 491–502 (2006)

  40. Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient computation of the skyline cube. In: Proceedings of VLDB Conference, pp. 241–252 (2005)

  41. Zhang, C., Krishnamurthy, A., Wang, R.Y.: Skipindex: towards a scalable peer-to-peer index service for high dimensional data. Technical report, Princeton University (2004)

Download references

Author information

Authors and Affiliations

  1. University of California, Santa Barbara, USA

    Shiyuan Wang

  2. National University of Singapore, Singapore, Singapore

    Quang Hieu Vu, Beng Chin Ooi & Anthony K. H. Tung

  3. Southeast University, Nanjing, China

    Lizhen Xu

Authors
  1. Shiyuan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Quang Hieu Vu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Beng Chin Ooi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Anthony K. H. Tung
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lizhen Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shiyuan Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, S., Vu, Q.H., Ooi, B.C. et al. Skyframe: a framework for skyline query processing in peer-to-peer systems. The VLDB Journal 18, 345–362 (2009). https://doi.org/10.1007/s00778-008-0104-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-008-0104-3

Keywords

Search

Navigation