109 search results - page 2 / 22 » Optimization Using Tuple Subsumption |
ICDE
2009
IEEE
13 years 11 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
TKDE
2010
12 years 11 months ago
2010
Adaptive join algorithms have recently attracted a lot of attention in emerging applications where data is provided by autonomous data sources through heterogeneous network environ...
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
Adaptive join algorithms have recently attracted a lot of attention in emerging applications where data is provided by autonomous data sources through heterogeneous network enviro...
CP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...