For the issue of continuous skyline query in mobile environment where the query point is moving fast toward unpredictable directions
a novel algorithm named LDCS(location dependent continuous skyline query)is proposed. Along with data stream introduction
R-tree is used to quickly update the data set in search area. Then a “passive” data stream is constructed by overlap of two adjacent search areas and the “new” and “fail” data sets are dealt with separately. Compared with traditional algorithms
LDCS is set lighter calculation tasks due to its usage of historical results. The experimental results show that LDCS is particularly suitable for the high frequency calculation
and with the increasing size of data set
it gets significant improvement in efficiency over grid-based algorithms.
关键词
Keywords
references
BORZSONYI S, KOSSMANN D, STOCKER K. The skyline operator[C]∥Proceedings of the 17th International Conference on Data Engineering. New York, USA: IEEE, 2001: 421-430.
CHOMICKI J, GODFREY P, GRYZ J, et al. Skyline with presorting[C]∥Proceedings of ICDE. New York, USA: IEEE, 2003: 717-816.
KOSSMANN D, RAMSAK F, ROST S. Shooting stars in the sky: an online algorithm for skyline queries[C]∥Proceedings of VLDB. San Francisco, USA: Morgan Kaufmann, 2002: 275-286.
PAPADIAS D, TAO Y, FU G, et al. An optimal and progressive algorithm for skyline queries[C]∥Proceedings of the ACM SIGMOD International Conference on Management of Data. New York, USA: ACM, 2003: 467-478.
PAPADIAS D, TAO Y, FU G, et al. Progressive skyline computation in database systems[J]. ACM Transactions on Database Systems, 2005, 30(1): 41-82.
JENSEN C S, FRIIS-CHRRISTENSEN A, PEDERSEN T B, et al. Location-based services: a database perspective[C]∥Proceeding of 8th Scandinavian Research Conference on Geographical Information Science. Aas, Norway: Agricultural University of Norway, 2001: 59-68.
BABCOCK B, BABU S, DATAR M, et al. Models and issues in data streams[C]∥Proceeding of the 21st ACM Symposium on Principles of Database Systems. New York, USA: ACM, 2002: 1-16.
GABER M M, ZASLAVSKY A, KRISHNASWAMY S. Mining data streams: a review[J]. ACM SIGMOD Record, 2005, 34(2): 18-26.
LIN X, YUAN Y, WANG W, et a1. Stabbing the sky: efficient skyline computation over sliding Windows[C]∥Proceeding of ICDE. New York, USA: IEEE, 2005: 502-513.
TAO Y, PAPADIAS D. Maintaining sliding window skylines on data streams[J]. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(3): 377-391.
LU Hua, ZHOU Yongluan, HAUSTAD J. Continuous skyline monitoring over distributed data streams[C]∥Proceedings of the 22nd International Conference on Scientific and Statistical Database Management. Heidelberg, Germany: Springer, 2010: 565-583.
ZHANG Li, ZOU Peng, JIA Yan, et al. Continuous dynamic skyline queries over data stream[J]. Journal of Computer Research and Development,2011, 48(1): 77-85.
SU Hui Zhu, WANG En Tzu, CHEN A L P. Continuous probabilistic skyline queries over uncertain data streams[C]∥Proceedings of the 21st International Conference on Database and Expert Systems Applications. Heidebery, Germany: Springer, 2010: 105-121.
HUANG Z, LU H, OOI B, et a1. Continuous skyline queries for moving objects[J]. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(12): 1645-1658.
LEE M W, HWANG S W. Continuous skylining on volatile moving data[C]∥Proceedings of the IEEE International Conference on Data Engineering. New York, USA: IEEE, 2009: 1568-1575.
ZHENG B, LEE K C K, LEE W C. Location-dependent skyline query[C]∥Proceedings of the 9th International Conference on Mobile Data Management. New York, USA: IEEE, 2008: 148-155.
LIN Xin, XU Jianliang, HU Haibo. Range-based skyline queries in mobile environments[J]. IEEE Transactions on Knowledge and Data Engineering, 2011, 23(11): 1059-1072.
KUNG H T, LUCCIO F, PREPARATA F P. On finding the maxima of a set of vectors[J]. Journal of the ACM, 1975, 22(4): 469-476.
WEI Xiaojuan, YANG Jing, LI Cuiping, et al. Skyline query processing[J]. Journal of Software, 2008,19(6): 1386-1400.
GUTTMAN A. R-trees: a dynamic index structure for spatial searching[C]∥Proceedings of SIGMOD. New York, USA: ACM, 1984: 47-57.
LEUTENEGGER S, LOPEZ M, EDGINGTON J. STR: an efficient and simple algorithm for R-tree packing[C]∥Proceedings of the 13th IEEE International Conference on Data Engineering. New York, USA: IEEE, 1997: 497-506.
DONGSEOP K, SANG J L, WONIK C, et al. An adaptive hashing technique for indexing moving object[J]. Data Knowledge Engineering, 2006, 56(3): 287-303.