Sciweavers

119 search results - page 3 / 24
» Benchmarking Query Execution Robustness
Sort
View
PVLDB
2010
97views more  PVLDB 2010»
13 years 9 months ago
Generating Databases for Query Workloads
To evaluate the performance of database applications and DBMSs, we usually execute workloads of queries on generated databases of different sizes and measure the response time. Th...
Eric Lo, Nick Cheng, Wing-Kai Hon
SIGMOD
2005
ACM
91views Database» more  SIGMOD 2005»
14 years 11 months ago
Towards a Robust Query Optimizer: A Principled and Practical Approach
Research on query optimization has focused almost exclusively on reducing query execution time, while important qualities such as consistency and predictability have largely been ...
Brian Babcock, Surajit Chaudhuri
ICDE
1998
IEEE
153views Database» more  ICDE 1998»
15 years 6 days ago
Flattening an Object Algebra to Provide Performance
Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in OODBMS is difficult due to the complexity o...
Peter A. Boncz, Annita N. Wilschut, Martin L. Kers...
NIS
1998
131views more  NIS 1998»
13 years 10 months ago
Dynamic Memory Allocation for Large Query Execution
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
Luc Bouganim, Olga Kapitskaia, Patrick Valduriez
FPCA
1993
14 years 3 months ago
Benchmarking Implementations of Lazy Functional Languages
Five implementations of di erent lazy functional languages are compared using a common benchmark of a dozen medium size programs. The benchmarking procedure has been designed such...
Pieter H. Hartel, Koen Langendoen