627 search results - page 9 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
VLDB
2004
ACM
15 years 2 months ago
2004
ACM
ADBIS
2004
Springer
15 years 2 months ago
2004
Springer
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
136
Voted
BTW
2007
Springer
15 years 1 months ago
2007
Springer
Abstract: Content based multimedia retrieval is an important topic in database systems. An emerging and challenging topic in this area is the content based search in video data. A ...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...