Abstract
To avoid complex P2P architectures, some previous research studies on skyline queries have converted multi-dimensional data into a single index. Their indexing, however, does not solve constrained subspace queries efficiently. In this paper, we have devised algorithms and techniques to solve constrained subspace skyline queries efficiently in a structured peer-to-peer architecture using a single index. Dataspace is horizontally partitioned; and peers are given Z-order addresses. Each subspace query traverses peers using the subspace Z-order filling curve. Such partitioning and traversal approaches allow parallelism for incomparable data as well as the use of some techniques to reduce the data traveled in the network. The order of traversal also preserves progressiveness. Our experiments, applied on Chord [1], have shown a reduction in the number of traversed peers and an efficient usage of bandwidth.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM, pp. 149–160 (2001)
Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: 17th International Conference on Data Engineering, ICDE 2001, pp. 421–432. IEEE, Washington (2001)
Dellis, E., Vlachou, A., Vladimirskiy, I., Seeger, B., Theodoridis, Y.: Constrained subspace skyline computation. In: CIKM, pp. 415–424 (2006)
Wu, P., Zhang, C., Feng, Y., Zhao, B.Y., Agrawal, D., El Abbadi, A.: Parallelizing Skyline Queries for Scalable Distribution. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 112–130. Springer, Heidelberg (2006)
Rocha-Junior, J., Vlachou, A., Doulkeridis, C., Nørvåg, K.: Efficient execution plans for distributed skyline query processing. In: Proceedings of the 14th International Conference on Extending Database Technology, pp. 271–282. ACM (2011)
Chen, L., Cui, B., Lu, H.: Constrained skyline query processing against distributed data sites. IEEE Trans. Knowl. Data Eng. 23(2), 204–217 (2011)
Tao, Y., Xiao, X., Pei, J.: Subsky: Efficient computation of skylines in subspaces. In: ICDE, vol. 65 (2006)
Vlachou, A., Doulkeridis, C., Kotidis, Y., Vazirgiannis, M.: SKYPEER: Efficient subspace skyline computation over distributed data. In: ICDE, pp. 416–425. IEEE (2007)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive skyline computation in database systems. ACM Transactions on Database Systems 30(1), 41–82
Lee, K.C., Lee, W.C., Zheng, B., Li, H., Tian, Y.: Z-SKY: an efficient skyline query processing framework based on Z-order. VLDB Journal: Very Large Data Bases 19(3), 333–362 (2010)
Balke, W.-T., Güntzer, U., Zheng, J.X.: Efficient Distributed Skylining for Web Information Systems. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 256–273. Springer, Heidelberg (2004)
Wang, S., Vu, Q.H., Ooi, B.C., Tung, A.K.H., Xu, L.: Skyframe: a framework for skyline query processing in peer-to-peer systems. VLDB J. 18(1), 345–362 (2009)
Zhu, L., Tao, Y., Zhou, S.: Distributed skyline retrieval with low bandwidth consumption. IEEE Trans. Knowl. Data Eng. 21(3), 384–400 (2009)
Cui, B., Chen, L., Xu, L., Lu, H., Song, G., Xu, Q.: Efficient skyline computation in structured peer-to-peer systems. IEEE Trans. Knowl. Data Eng. 21(7), 1059–1072 (2009)
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, pp. 253–264. VLDB Endowment (2005)
Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J., Zhang, Q.: Efficient computation of the skyline cube. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 241–252. VLDB Endowment (2005)
Jin, W., Tung, A., Ester, M., Han, J.: On efficient processing of subspace skyline queries on high dimensional data. In: 19th International Conference on Scientific and Statistical Database Management, SSBDM 2007, pp. 12–12. IEEE (2007)
Chen, L., Cui, B., Xu, L., Shen, H.T.: Distributed Cache Indexing for Efficient Subspace Skyline Computation in P2P Networks. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 5981, pp. 3–18. Springer, Heidelberg (2010)
Zhu, L., Zhou, S., Guan, J.: Efficient skyline retrieval on peer-to-peer networks. In: FGCN, pp. 309–314. IEEE (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Banafaa, K.M., Li, R. (2012). Efficient Algorithms for Constrained Subspace Skyline Query in Structured Peer-to-Peer Systems. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds) Web-Age Information Management. WAIM 2012. Lecture Notes in Computer Science, vol 7418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32281-5_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-32281-5_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32280-8
Online ISBN: 978-3-642-32281-5
eBook Packages: Computer ScienceComputer Science (R0)