Sciweavers

624 search results - page 27 / 125
» Mutant Query Plans
Sort
View
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
15 years 12 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
PVLDB
2008
126views more  PVLDB 2008»
14 years 11 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
CIKM
2008
Springer
15 years 1 months ago
Modeling and exploiting query interactions in database systems
The typical workload in a database system consists of a mixture of multiple queries of different types, running concurrently and interacting with each other. Hence, optimizing per...
Mumtaz Ahmad, Ashraf Aboulnaga, Shivnath Babu, Kam...
PDIS
1996
IEEE
15 years 4 months ago
Capabilities-Based Query Rewriting in Mediator Systems
Users today are struggling to integrate a broad range of information sources providing di erent levels of query capabilities. Currently, data sources with di erent and limitedcapa...
Yannis Papakonstantinou, Ashish Gupta, Laura M. Ha...
ICDE
2010
IEEE
195views Database» more  ICDE 2010»
15 years 4 months ago
Interaction-Aware Prediction of Business-Intelligence Workload Completion Times
— While planning the execution of report-generation workloads, database administrators often need to know how long different query workloads will take to run. Database systems ru...
Mumtaz Ahmad, Songyun Duan, Ashraf Aboulnaga, Shiv...