Skip to main content
SpringerLink
Log in

Processing continuous K-nearest skyline query with uncertainty in spatio-temporal databases

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

Abstract

Continuous K-nearest skyline query (CKNSQ) is an important query in the spatio-temporal databases. Given a query time interval [t s ,t e ] and a moving query object q, a CKNSQ is to retrieve the K-nearest skyline points of q at each time instant within [t s ,t e ]. Different from the previous works, in this paper we devote to overcoming the specific assumptions that each object is static in road networks and has the certain dimensional values. We focus on processing the CKNSQ over moving objects with uncertain dimensional values in Euclidean space and the velocity of each object (including the query object) varies within a known range. As the uncertainty is involved, such a query is called the continuous possible K-nearest skyline query (CPKNSQ). We first discuss the difficulties raised by the uncertainty of moving objects and then propose the CPKNSQ algorithm operated with a data-partitioning index, the uncertain TPR-tree (UTPR-tree), to efficiently answer the CPKNSQ. Moreover, we design a probability-based model to quantify the possibility of each object being the query result. Finally, extensive experiments using the synthetic and real datasets demonstrate the effectiveness and the efficiency of the proposed approaches.

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

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

Similar content being viewed by others

References

  • Bartolini, I., Ciaccia, P., Patella. M. (2008). Efficient sort-based skyline evaluation. ACM TODS, 33(4), 1–45.

  • Borzsonyi, S., Kossmann, D., Stocker, K. (2001). The skyline operator. In, 17th International Conference on Data Engineering (pp. 421–430).

  • Chomicki, J., Godfrey, P., Gryz, J., Liang, D. (2003). Skyline with presorting. In, Nineteenth International Conference on Data Engineering (pp. 717–719).

  • Fan, P., Li, G., Yuan, L., Li, Y. (2012). Vague continuous k-nearest neighbor queries over moving objects with uncertain velocity in road networks. In, Information Systems, vol 37 (pp. 13–32).

  • Huang, Y.-K., Chang, C.-H., Lee, C. (2012). Continuous distance-based skyline queries in road networks. Information Systems, 37(7), 611–633.

  • Huang, Y.-K., Chen, C.-C., Lee, C. (2009). Continuous k-nearest neighbor query for moving objects with uncertain velocity. In, Geoinformatica (pp. 1–25).

  • Huang, Y.-K., & Lee, C. (2010). Efficient evaluation of continuous spatio-temporal queries on moving objects with uncertain velocity. In, Geoinformatica (pp. 163–200).

  • Jiang, B., & Pei, J. (2009). Online interval skyline queries on time series. In, International Conference on Data Engineering (pp. 1036–1047).

  • Jin, W., Tung, A.K.H., Ester, M., Han, J. (2007). On efficient processing of subspace skyline queries on high dimensional data. In, International Conference on Scientific and Statistical Database Management.

  • Khalefa, M.E., Mokbel, M.F., Levandoski, J.J. (2008). Skyline query processing for incomplete data. In, International Conference on Data Engineering (pp. 556–565).

  • Khalefa, M.E., Mokbel, M.F., Levandoski, J.J. (2010). Skyline query processing for uncertain data. In, 19th International Conference on Information and Knowledge Management and Co-located Workshops (pp. 1293–1296).

  • Kossmann, D., Ramsak, F., Rost, S. (2002). Shooting stars in the sky: an online algorithm for skyline queries. In, International Conference on VLDB.

  • Lee, J., You, G.W., Hwang, S.W. (2009). Personalized top-k skyline queries in high-dimensional space. Information System 34(1).

  • Lin, X., Yuan, Y., Zhang, Q., Zhang, Y. (2007). Selecting stars: the k most representative skyline operator. In, International Conference on Data Engineering (pp. 86–95).

  • Papadias, D., Tao, Y., Fu, G., Seeger, B. (2003). An optimal and progressive algorithm for skyline queries. In, ACM SIGMOD (pp. 467–478).

  • Pei, J., Jiang, B., Lin, X., Yuan, Y. (2007). Probabilistic skylines on uncertain data. In, Proceedings of the VLDB Conference.

  • Sarkas, N., Das, G., Koudas, N., Tung, A.K.H. (2008). Categorical skylines for streaming data. In, ACM SIGMOD (pp. 239–250).

  • Tan, K.-L., Eng, P.-K., Ooi, B.C. (2001). Efficient progressive skyline computation. In, International Conference on Very Large Data Bases (pp. 301–310).

  • Tao, Y., Xiao, X., Pei, J. (2006). Subsky: efficient computation of skylines in subspaces. In, International Conference on Data Engineering.

Download references

Acknowledgments

This work was supported by National Science Council of Taiwan (R.O.C.) under Grants NSC102-2119-M-244-001 and MOST103-2119-M-244-001.

Author information

Authors and Affiliations

  1. Department of Information Communication, Kao-Yuan University, Kaohsiung, Taiwan

    Yuan-Ko Huang

  2. Department of Computer Science, Information Engineering National Cheng-Kung University, Tainan, Taiwan

    Zong-Han He

Authors
  1. Yuan-Ko Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zong-Han He
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuan-Ko Huang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huang, YK., He, ZH. Processing continuous K-nearest skyline query with uncertainty in spatio-temporal databases. J Intell Inf Syst 45, 165–186 (2015). https://doi.org/10.1007/s10844-014-0344-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10844-014-0344-1

Keywords

Search

Navigation