161 search results - page 24 / 33 » Efficiently Executing Information-Gathering Plans |
176
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
214
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
AAAI
2010
15 years 1 months ago
2010
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
108
click to vote
DKE
2006
14 years 11 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
186
Voted
ICDT
2009
ACM
16 years 14 days ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...