Journal article

Processing Moving kNN Queries Using Influential Neighbor Sets

Chuanwen Li, Yu Gu, Jianzhong Qi, Ge Yu, Rui Zhang, Wang Yi

Proc. VLDB Endow. | VLDB Endowment | Published : 2014

Abstract

The moving k nearest neighbor query, which computes one's k nearest neighbor set and maintains it while at move, is gaining importance due to the prevalent use of smart mobile devices such as smart phones. Safe region is a popular technique in processing the moving k nearest neighbor query. It is a region where the movement of the query object does not cause the current k nearest neighbor set to change. Processing a moving k nearest neighbor query is a continuing process of checking the validity of the safe region and recomputing it if invalidated. The size of the safe region largely decides the frequency of safe region recomputation and hence query processing efficiency. Existing moving k n..

View full abstract

University of Melbourne Researchers

Grants

Awarded by National Basic Research Program of China


Awarded by National Natural Science Foundation of China


Awarded by Australian Research Council (ARC) Discovery Project


Awarded by Australian Research Council (ARC) Future Fellowships Project


Awarded by Fundamental Research Funds for the Central Universities of China


Awarded by National Key Technology RAMP;D Program of China


Funding Acknowledgements

This work is supported by the National Basic Research Program of China under Grant No. 2012CB316201, the National Natural Science Foundation of China under Grant No. 61300021 and 61033007, Australian Research Council (ARC) Discovery Project DP130104587, Australian Research Council (ARC) Future Fellowships Project FT120100832, the Fundamental Research Funds for the Central Universities of China No. N120304003, National Key Technology R&D Program of China 2012BAK24B01 and China Scholarship Council.