Sciweavers

2223 search results - page 286 / 445
» Query Optimization in an OODBMS
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 11 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
EDBT
2008
ACM
118views Database» more  EDBT 2008»
16 years 4 months ago
Robustness in automatic physical database design
Automatic physical database design tools rely on "what-if" interfaces to the query optimizer to estimate the execution time of the training query workload under differen...
Kareem El Gebaly, Ashraf Aboulnaga
ECCV
2004
Springer
16 years 6 months ago
An Information-Based Measure for Grouping Quality
We propose a method for measuring the quality of a grouping result, based on the following observation: a better grouping result provides more information about the true, unknown g...
Erik A. Engbers, Michael Lindenbaum, Arnold W. M. ...
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
16 years 5 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom
ICDE
2008
IEEE
232views Database» more  ICDE 2008»
16 years 5 months ago
Continuous Content-Based Copy Detection over Streaming Videos
Digital videos are increasingly adopted in various multimedia applications where they are usually broadcasted or transmitted as video streams. Continuously monitoring copies on the...
Ying Yan, Beng Chin Ooi, Aoying Zhou