Abstract
In multi-criterion decision making applications, a skyline query narrows the search range, as it returns only the points that are not dominated by others. Unfortunately, in high-dimensional/large-cardinal datasets there exist too many skyline points to offer interesting insights. In this paper, we propose a novel structure, called the dominance tree (Do-Tree), to effectively index and retrieve the skyline. Do-Tree is a straightforward and flexible tree structure, in which skyline points are resident on leaf nodes, while the internal nodes contain the entries that dominate their children. As Do-Tree is built on a dominance relationship, it is suitable for the retrieval of specified skyline via dominance-based predicates customized by users. We discuss the topology of Do-Tree and propose the construction methods. We also present the scan scheme of Do-Tree and some useful queries based on it. Extensive experiments confirm that Do-Tree is an efficient and scalable index structure for the skyline.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bartolini, I., Ciaccia, P., Patella, M., 2008. Efficient sort-based skyline evaluation. ACM Trans. Database Syst., 33(4). [doi:10.1145/1412331.1412343]
Börzsönyi, S., Kossmann, D., Stocker, K., 2001. The Skyline Operator. ICDE, p.421–430. [doi:10.1109/ICDE.2001.914855]
Brando, C., Goncalves, M., González, V., 2007. Evaluating Top-k Skyline Queries over Relational Databases. DEXA, p.254–263. [doi:10.1007/978-3-540-74469-6-26]
Chan, C.Y., Jagadish, H.V., Tan, K.L., Tung, A.K.H., Zhang, Z.J., 2006a. On High Dimensional Skylines. EDBT, p.478–495. [doi:10.1007/11687238_30]
Chan, C.Y., Jagadish, H.V., Tan, K.L., Tung, A.K.H., Zhang, Z.J., 2006b. Finding k-Dominant Skylines in High Dimensional Space. SIGMOD, p.503–514. [doi:10.1145/1142473.1142530]
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.M., 2003. Skyline with Presorting. ICDE, p.717–816.
Goncalves, M., Vidal, M.E., 2005. Top-k Skyline: a Unified Approach. OTM Workshops, p.790–799. [doi:10.1007/11575863-99]
Goncalves, M., Vidal, M.E., 2009. Reaching the Top of the Skyline: an Efficient Indexed Algorithm for Top-k Skyline Queries. DEXA, p.471–485. [doi:10.1007/978-3-642-03573-9-41]
Guttman, A., 1984. R-trees: a dynamic index structure for spatial searching. ACM SIGMOD Rec., 14(2):47–57. [doi:10.1145/971697.602266]
Hjaltason, G.R., Samet, H., 1999. Distance browsing in spatial databases. ACM Trans. Database Syst., 24(2):265–318. [doi:10.1145/320248.320255]
Kamel, I., Faloutsos, C., 1993. On Packing R-Trees. CIKM, p.490–499. [doi:10.1145/170088.170403]
Kossmann, D., Ramsak, F., Rost, S., 2002. Shooting Stars in the Sky: an Online Algorithm for Skyline Queries. VLDB, p.275–286.
Lee, J.W., You, G.W., Sohn, I.C., Hwang, S.W., Ko, K., Lee, Z., 2007a. Supporting Personalized Top-k Skyline Queries Using Partial Compressed Skycube. WIDM, p.65–72. [doi:10.1145/1316902.1316914]
Lee, K.C.K., Zheng, B.H., Li, H.J., Lee, W.C., 2007b. Approaching the Skyline in Z Order. VLDB, p.279–290.
Leutenegger, S.T., Edgington, J.M., Lopez, M.A., 1997. STR: a Simple and Efficient Algorithm for R-Tree Packing. ICDE, p.497–506. [doi:10.1109/ICDE.1997.582015]
Lin, X.M., Yuan, Y.D., Zhang, Q., Zhang, Y., 2007. Selecting Stars: the k Most Representative Skyline Operator. ICDE, p.86–95. [doi:10.1109/ICDE.2007.367854]
Papadias, D., Tao, Y.F., Fu, G., Seeger, B., 2003. An Optimal and Progressive Algorithm for Skyline Queries. SIGMOD, p.467–478. [doi:10.1145/872757.872814]
Pei, J., Jin, W., Ester, M., Tao, Y.F., 2005. Catching the Best Views of Skyline: a Semantic Approach Based on Decisive Subspaces. VLDB, p.253–264.
Pei, J., Fu, A.W.C., Lin, X.M., Wang, H.X., 2007. Computing Compressed Multidimensional Skyline Cubes Efficiently. ICDE, p.96–105. [doi:10.1109/ICDE.2007.367855]
Tan, K.L., Eng, P.K., Ooi, B.C., 2001. Efficient Progressive Skyline Computation. VLDB, p.301–310.
Tao, Y.F., Xiao, X.K., Pei, J., 2006. Subsky: Efficient Computation of Skylines in Subspaces. ICDE, p.65. [doi:10.1109/ICDE.2006.149]
Tao, Y.F., Xiao, X.K., Pei, J., 2007. Efficient skyline and top-k retrieval in subspaces. IEEE Trans. Knowl. Data Eng., 19(8):1072–1088. [doi:10.1109/TKDE.2007.1051]
Yiu, M.L., Mamoulis, N., 2007. Efficient Processing of Top-k Dominating Queries on Multi-dimensional Data. VLDB, p.483–494.
Yuan, Y.D., Lin, X.M., Liu, Q., Wang, W., Yu, J.X., Zhang, Q., 2005. Efficient Computation of the Skyline Cube. VLDB, p.241–252.
Zhang, Z.J., Guo, X.Y., Lu, H., Tung, A.K.H., Wang, N., 2005. Discovering Strong Skyline Points in High Dimensional Spaces. CIKM, p.247–248. [doi:10.1145/1099554.1099610]
Author information
Authors and Affiliations
Corresponding author
Additional information
Project supported by the National Natural Science Foundation of China (Nos. 60803003 and 60970124), the Changjiang Scholars and Innovative Research Grant (No. IRT0652) at Zhejiang University, and the Fundamental Research Funds for the Central Universities (No. 2010QNA5051), China
Rights and permissions
About this article
Cite this article
Xu, C., Shou, Ld., Chen, G. et al. Index and retrieve the skyline based on dominance relationship. J. Zhejiang Univ. - Sci. C 12, 62–75 (2011). https://doi.org/10.1631/jzus.C0900003
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/jzus.C0900003