Skip to main content
Log in

Processing skyline queries in incomplete distributed databases

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

Due to its great benefits over many database applications, skyline queries have received formidable concern in the last decades. Skyline queries attempt to assist users by identifying the set of data items which represents the best results that meet the conditions of a given query. Most of the existing skyline techniques concentrate on identifying skylines over a single relation. However, in distributed databases, the process of skyline queries required accessing multiple relations which might be located at different sites. Consequently, data items from these multiple relations need to be joined and thus transferring these data items from one site to another is unavoidable. Moreover, the previous techniques also assume that the values of dimensions for every data item are presented (complete) which is not always true as some values may be missing. In this paper, we proposed an approach for processing skyline queries in incomplete distributed databases. The approach derives skylines from multiple relations where dominated data items are removed before joining the relations to reduce the processing time and the network cost. The experimental results illustrate that our proposed approach outperforms the previous approaches in terms of processing time and network cost.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  • Alwan, A.A., Hamidah, I., Yip, Tan C., Sidi, F., & Udzir, N.I. (2011). Preference evaluation of preference queries techniques over a high multidimensional database. In Proc. the 3 rd int. conf. on networked digital technologies (pp. 212–223).

  • Bartolini, I., Ciaccia, P., & SaLSa, M.P. (2006). Computing the Skyline without Scanning the Whole Sky. In Proc. the 15 th int. conf. on information and knowledge management (pp. 405–414).

  • Börzsönyi, S., Kossmann, D., & Stocker, K. The Skyline Operator. In 2001 (pp. 421–430).

  • Chan, C.-Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., & Zhang, Z. (2006a). On high dimensional skylines. In In Proc. the 10 th int. conf. on extending database technology (pp. 478–495).

  • Chan, C.-Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., & Zhang, Z. (2006b). Finding k-dominant Skylines in High Dimensional Space. In Proc. the, 2006, ACM SIGMOD int. conf. on management of data (pp. 503–514).

  • Chomicki, J., Godfrey, P., Gryz, J., & Liang, D. (2003). Skyline with Presorting. In Proc. the 19 th int. conf. on data engineering (pp. 717–816).

  • Fotiadou, K., & Pitoura, E. (2008). BITPEER: Continuous Subspace Skyline Computation with Distributed Bitmap Indexes. In Proc. the int. work. on data management in peer-to-peer systems (pp. 35–42).

  • Godfrey, P., Shipley, R., & Gryz, J. (2005). Maximal vector computation in large data sets. In Proc. the 31 st int. conf. on very large data bases (pp. 229–240).

  • Huang, Z., & Wang, W. (2006). A Novel Incremental Maintenance Algorithm of SkyCube. In Proc. the 17th int. conf. of database and expert systems applications (pp. 781–790).

  • Huang, Z., Sun, S., & Wang, W. (2010). Efficient mining of skyline objects in subspaces over data streams. Know. Info. Sys., 22(2), 159–183.

    Article  Google Scholar 

  • Jin, W., Ester, M., Hu, Z., & Han, J. (2007). The Multi-Relational Skyline Operator. In Proc. the 23 rd int. conf. on data engineering (pp. 1276–1280).

  • Justin, J.L., Mohamed, F.M., & Mohamed, E.K. (2010). FlexPref: A Framework for Extensible Preference Evaluation in Database Systems. In Proc. the 26th Int. Conf. on Data Engineering. 1- 6 March (pp. 828–839).

  • Kossmann, D., Ramsak, F., & Rost, S. (2002). Shooting Stars in the Sky: An Online Algorithm for Skyline Queries. In Proc. the 28 th int. conf. on very large data bases (pp. 275–286).

  • Lee, J., You, G.-W., & Hwang, S.-W. (2009). Personalized top-k skyline queries in high-dimensional space. Info. Syst., 34(1), 45–61.

    Article  Google Scholar 

  • Lee, K.C.K., Lee, W.-C., Zheng, B., Li, H., & Tian, Y. (2010). Z-Sky: an efficient skyline query processing framework based on Z-order, The Very Large Data Bases J., (Vol. 19.

  • Lin, X., Yuan, Y., Zhang, Q., & Zhang, Y. (2007). Selecting Stars: The k Most Representative Skyline Operator. In Proc. the 23 rd int. conf. on data engineering (pp. 86–95).

  • Mohamed, E.K., Mokbel, M.F., & Livandoski, J.J. (2008). Skyline query processing for incomplete data. In Proc. the 24 th int. conf. on data engineering (pp. 556–565).

  • Morse, M.D., Patel, J.M., & Grosky, W.I. (2007). Efficient continuous skyline computation. Info. Sci. Int. J., 177(17), 3411–3437.

    MathSciNet  Google Scholar 

  • Mouratidis, K., Bakiras, S., & Papadias, D. (2006). Continuous Monitoring of Top-k Queries over Sliding Windows. In Procs. the int. conf. on management of data (pp. 635–646).

  • Papadias, D., Tao, Y., Fu, G., & Seeger, B. (2003). An Optimal and Progressive Algorithm for Skyline Queries. In Proc. of the Int. Conf. on Management of Data (pp. 467–478).

  • Pei, J., Jin, W., Ester, M., & Tao, Y. (2005). Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces. In Proc. the 31 st int. conf. on very large data bases (pp. 253–264).

  • Sun, D., Sai, W., Li, J., & Tung, A.K.H. (2008). Skyline-join in distributed databases. In In Proc. the 24 th int. conf. of data engineering work (pp. 176–181).

  • Tan, K.-L., Eng, P.-K., & Chin Ooi, B. (2001). Efficient Progressive Skyline Computation. In Proc. the 27 th Int. Conf. on Very Large Data Bases (pp. 301–310).

  • Tao, Y., Xiao, X., & Pei, J. (2006). SUBSKY: Efficient Computation of Skylines in Subspaces. In Proc. the 22 nd int. conf. on data engineering (pp. 65–74).

  • Wang, S., Ooi, B.C., Tung, A.K.H., & Xu, L. (2008). Efficient skyline query processing on peer-to-peer networks. In Proc. the int. conf. on data engineering (pp. 1126–1135).

  • Wong, R.C.-W., Fu, A.W.-C., Pei, J., Ho, Y.S., Wong, T., & Liu, Y. (2008). Efficient skyline querying with variable user preferences on nominal attributes. In Proc. the 34 th int. conf. on very large data bases (pp. 1032–1043).

  • Yiu, M.L., & Mamoulis, N. (2007). Efficient Processing of top-k Dominating Queries on Multi-Dimensional Data. In Proc. the 33 rd int. conf. on very large data bases (pp. 483–494).

  • Yiu, M.L., & Mamoulis, N. (2009). Multi-dimensional top-k dominating queries, The Very Large Data Bases J., 18(3), 695–718.

  • Vlachou, A., Doulkeridis, C., Kotidis, Y., & Vazirgiannis, M. (2007). SKYPEER: Efficient subspace skyline computation over distributed data. In In Proc. of the 23 rd int. conf. on data and engineering (pp. 416–425).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ali A. Alwan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alwan, A.A., Ibrahim, H., Udzir, N.I. et al. Processing skyline queries in incomplete distributed databases. J Intell Inf Syst 48, 399–420 (2017). https://doi.org/10.1007/s10844-016-0419-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10844-016-0419-2

Keywords

Navigation