Sciweavers

624 search results - page 12 / 125
» Mutant Query Plans
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 4 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— 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...
Dan Olteanu, Jiewen Huang, Christoph Koch
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 1 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
90
Voted
VLDB
2005
ACM
112views Database» more  VLDB 2005»
15 years 3 months ago
Content-Based Routing: Different Plans for Different Data
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
Pedro Bizarro, Shivnath Babu, David J. DeWitt, Jen...
RECOMB
2008
Springer
15 years 9 months ago
Constructing Treatment Portfolios Using Affinity Propagation
A key problem of interest to biologists and medical researchers is the selection of a subset of queries or treatments that provide maximum utility for a population of targets. For ...
Delbert Dueck, Brendan J. Frey, Nebojsa Jojic, Vla...
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 9 months ago
Cost-based query optimization for complex pattern mining on multiple databases
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...
Ruoming Jin, David Fuhry, Abdulkareem Alali