714 search results - page 107 / 143 » Continuous Processing of Preference Queries in Data Streams |
PDP
2008
IEEE
14 years 1 months ago
2008
IEEE
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
EDBT
2009
ACM
13 years 10 months ago
2009
ACM
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
SSD
2007
Springer
14 years 1 months ago
2007
Springer
The ability to continuously monitor the positions of mobile objects is important in many applications. While most past work has been set in Euclidean spaces, the mobile objects rel...
SSDBM
2006
IEEE
14 years 1 months ago
2006
IEEE
Many applicationsstore data items for a pre-determined, finite length of time. Examples include slidingwindows over on-line data streams, where old data are dropped as the window...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...