467 search results - page 3 / 94 » Processing top k queries from samples |
153
click to vote
ICDE
2005
IEEE
15 years 9 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...
139
Voted
SSDBM
2005
IEEE
15 years 9 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...
258
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
172
Voted
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
154
Voted
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...