785 search results - page 2 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
WWW
2006
ACM
14 years 7 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
2008
IEEE
14 years 7 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...
ICDE
2005
IEEE
13 years 12 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...
JCIT
2010
13 years 1 months ago
2010
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
VLDB
2007
ACM
14 years 11 days 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...