22 search results - page 2 / 5 » Partition-based lazy updates for continuous queries over mov... |
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
This paper proposes a generic framework for monitoring continuous spatial queries over moving objects. The framework distinguishes itself from existing work by being the first to ...
SSD
2007
Springer
13 years 11 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
TKDE
2008
13 years 5 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
SSDBM
2008
IEEE
13 years 12 months ago
2008
IEEE
Abstract. Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of an...