627 search results - page 29 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
180
click to vote
ASUNAM
2011
IEEE
13 years 9 months ago
2011
IEEE
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
181
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
In this demo we present the cgmOLAP server, the first fully functional parallel OLAP system able to build data cubes at a rate of more than 1 Terabyte per hour. cgmOLAP incorporat...
73
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have...
71
Voted
IPL
2006
14 years 9 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
66
Voted
WAIM
2004
Springer
15 years 2 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...