K Nearest Neighbor query M kNN which requires to find the knearest neighbors of a moving query point continuously In most" />

Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: World Wide Web

Search In Journal Title:

Abbravation: World Wide Web

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/0003-4843(77)90015-8

Search In DOI:

ISSN

1573-1413

Search In ISSN:
Search In Title Of Papers:

Efficient moving Emphasis Type="Italic"k/Emphas

Authors: Yu Gu Hui Zhang Zhigang Wang Ge Yu
Publish Date: 2015/05/05
Volume: 19, Issue: 4, Pages: 653-677
PDF Link

Abstract

The growing need for location based services motivates the moving K Nearest Neighbor query MkNN which requires to find the K Nearest Neighbors of a moving query point continuously In most existing solutions data objects are abstracted as points However lots of realworld data objects such as roads rivers or pipelines should be reasonably modeled as line segments or polyline segments In this paper we present LVDiagram to handle MkNN queries over line segment data objects LVDiagram dynamically constructs a safe region The query results remain unchanged if the query point is in the safe region and hence the computation cost of the server is greatly reduced Experimental results show that our approach significantly outperforms the baseline method wrt CPU load I/O and communication costsThis work is supported by the National Basic Research Program of China under Grant No2012CB316201the National Natural Science Foundation of China under Grant No61472071 and 61003058and the Fundamental Research Funds for the Central Universities of China under Grant No N130404010


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


Search Result: