72 search results - page 2 / 15 » Approximate distributed top- k queries |
ICDE
2005
IEEE
13 years 10 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...
ICDE
2010
IEEE
13 years 9 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...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
CCR
2006
13 years 5 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...