Sciweavers

1024 search results - page 153 / 205
» High-Level Execution Time Analysis
Sort
View
VLDB
2001
ACM
190views Database» more  VLDB 2001»
15 years 5 months ago
LEO - DB2's LEarning Optimizer
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...
147
Voted
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
16 years 24 days ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
113
Voted
OOPSLA
2007
Springer
15 years 6 months ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...
97
Voted
ASPLOS
2004
ACM
15 years 6 months ago
Low-overhead memory leak detection using adaptive statistical profiling
Sampling has been successfully used to identify performance optimization opportunities. We would like to apply similar techniques to check program correctness. Unfortunately, samp...
Matthias Hauswirth, Trishul M. Chilimbi
97
Voted
WSC
1997
15 years 2 months ago
Multiplexed State Saving for Bounded Rollback
Optimistic parallel discrete event simulation (PDES) uses a state history trail to support rollback. State saving strategies range from making a complete copy of a model’s state...
Fabian Gomes, Brian Unger, John G. Cleary, Steve F...