288 search results - page 26 / 58 » Continuous Query Processing in Spatio-Temporal Databases |
SSD
2007
Springer
14 years 2 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 ...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
ICDE
2011
IEEE
13 years 12 days ago
2011
IEEE
Given a set of objects and a query q, a point p is
called the reverse k nearest neighbor (RkNN) of q if q is one of
the k closest objects of p. In this paper, we introduce the c...
ICDE
2010
IEEE
13 years 8 months ago
2010
IEEE
— In this paper, we aim to realize a context and preference-aware database system, CareDB, that provides scalable personalized location-based services to users based on their pre...
PVLDB
2010
13 years 7 months ago
2010
Applications from several domains are now being written to process live data originating from hardware and softwarebased streaming sources. Many of these applications have been wr...