Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for static datasets, the traditional methods do not extend to highly dynamic environments where multiple continuous queries requ...
Saved in:
Main Authors: | MOURATIDIS, Kyriakos, Hadjieleftheriou, Marios, Papadias, Dimitris |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/875 https://ink.library.smu.edu.sg/context/sis_research/article/1874/viewcontent/CPM_SIGMOD05.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Continuous Nearest Neighbor Queries over Sliding Windows
by: MOURATIDIS, Kyriakos, et al.
Published: (2007) -
Group Nearest Neighbor Queries
by: PAPADIAS, Dimitris, et al.
Published: (2004) -
A Threshold-Based Algorithm for Continuous Monitoring of K Nearest Neighbors
by: MOURATIDIS, Kyriakos, et al.
Published: (2005) -
Continuous Nearest Neighbor Monitoring in Road Networks
by: MOURATIDIS, Kyriakos, et al.
Published: (2006) -
Aggregate Nearest Neighbor Queries in Spatial Databases
by: PAPADIAS, Dimitris, et al.
Published: (2005)