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...
محفوظ في:
المؤلفون الرئيسيون: | MOURATIDIS, Kyriakos, Hadjieleftheriou, Marios, Papadias, Dimitris |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2005
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/875 https://ink.library.smu.edu.sg/context/sis_research/article/1874/viewcontent/CPM_SIGMOD05.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
مواد مشابهة
-
Continuous Nearest Neighbor Queries over Sliding Windows
بواسطة: MOURATIDIS, Kyriakos, وآخرون
منشور في: (2007) -
Group Nearest Neighbor Queries
بواسطة: PAPADIAS, Dimitris, وآخرون
منشور في: (2004) -
A Threshold-Based Algorithm for Continuous Monitoring of K Nearest Neighbors
بواسطة: MOURATIDIS, Kyriakos, وآخرون
منشور في: (2005) -
Continuous Nearest Neighbor Monitoring in Road Networks
بواسطة: MOURATIDIS, Kyriakos, وآخرون
منشور في: (2006) -
Aggregate Nearest Neighbor Queries in Spatial Databases
بواسطة: PAPADIAS, Dimitris, وآخرون
منشور في: (2005)