Name
Abstract | ||
|---|---|---|
Repetitive queries refer to those queries that are likely to be executed repeatedly in the future. Examples of repetitive queries include those that are used to generate periodic reports, perform routine maintenance, summarize data for analysis, etc. They can constitute a large part of daily activities of the database system and deserve more optimization efforts. In this paper, we propose to collect information about joins of a repetitive query, called the trace, during execution. We intend to use this information to re-estimate selectivities of joins in all possible execution orders. We discuss the information needed to be kept for the joins and design an operator, called the extended full outer join, to gather such information. We show the sufficiency of the traces in computing the exact selectivities of joins in all plans of the query. With the exact selectivities of joins available, the query optimizer can utilize them to find truly the best join order for the query in its search space, guaranteeing "optimal" execution of the query in the future. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-23091-2_35 | DEXA (2) |
Keywords | Field | DocType |
exact selectivities,large part,selectivity re-estimation,daily activity,possible execution order,periodic report,optimization effort,database system,routine maintenance,query optimizer,repetitive query | Query optimization,Range query (database),Data mining,Query language,Joins,Computer science,Sargable,Web query classification,Operator (computer programming),Database | Conference |
Citations | PageRank | References |
1 | 0.35 | 6 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Feng Yu | 1 | 20 | 4.40 |
| Wen-Chi Hou | 2 | 387 | 274.15 |
| Cheng Luo | 3 | 97 | 11.48 |
| Qiang Zhu | 4 | 398 | 60.85 |
| Dunren Che | 5 | 254 | 36.67 |