296 search results - page 2 / 60 » Top-k queries on temporal data |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
ICDE
2005
IEEE
14 years 1 months ago
2005
IEEE
Processing of top-k queries has been attracting considerable attention. Much of the work assumes distributed data, with each site holding a different set of attributes for the sam...
SSDBM
2005
IEEE
14 years 1 months ago
2005
IEEE
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...