Continuous K-Nearest Neighbor Queries for Moving Objects

Xiao, Hui; Li, Qingquan; Sheng, Qinghong

doi:10.1007/978-3-540-74581-5_49

Cited by 1 publication

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Continuous k-nearest-neighbour queries (CKNN) are addressed have been addressed in several studies [4]- [7]. Two main approaches in this context are sampling and trajectory.…”

Section: A Nn Querymentioning

confidence: 99%

“…In the sampling approach, queries are evaluated multiple times. In each time interval or with each query movement, the query should be re-evaluated [4], [5], [7]. In the trajectory approach [2], [6] a trajectory is assumed for a moving query.…”

Section: A Nn Querymentioning

confidence: 99%

“…All of the above used a grid for indexing objects and queries. Other studies [6], [7] have used an R-tree-like structure for indexing objects and queries, or have applied it as a secondary index.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Continuous Mutual Nearest Neighbour Processing on Moving Objects in Spatiotemporal Datasets

Ghorbani¹,

Mobini²,

Minaei‐Bidgoli³

2017

IJIET

View full text Add to dashboard Cite

Abstract-This paper proposed a new algorithm for answering a novel kind of nearest neighbour search, that is, continuous mutual nearest neighbour (CMNN) search. In this kind of query, by providing a set of objects O and a query object q, CMNN continuously returns the set of objects from O, which is among the k 1 nearest neighbours of q; meanwhile, q is one of their k 2 nearest neighbours. CMNN queries are important in many applications such as decision making, pattern recognition and although it is useful in service providing systems, such as police patrol, taxi drivers, mobile car repairs and so forth. In this paper, we have proposed the first work for handling CMNN queries efficiently, without any assumption on object movements. The most important feature of this work is incremental evaluation and scalability. Utilizing an incremental evaluation technique led to a significant decrease in processing time.Index Terms-Moving objects, nearest neighbor, query processing, spatio-temporal.

show abstract

“…Continuous k-nearest-neighbour queries (CKNN) are addressed have been addressed in several studies [4]- [7]. Two main approaches in this context are sampling and trajectory.…”

Section: A Nn Querymentioning

confidence: 99%