Name
Abstract | ||
|---|---|---|
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the views/indexes selected to be materialized. We propose a novel end-to-end approach that focuses on systematic exploration of plans for evaluating the queries. Specifically, we propose a framework (architecture) and algorithms that enable selection of views/indexes that contribute to the most efficient plans for the input queries, subject to the space bound. We present strong optimality guarantees on our architecture. Our algorithms search for sets of competitive plans for queries expressed in the language of conjunctive queries with arithmetic comparisons. This language captures the full expressive power of SQL select-project-join queries, which are common in practical database systems. Our experimental results demonstrate the competitiveness and scalability of our approach. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-03973-7_11 | ADBIS |
Keywords | Field | DocType |
evaluation cost,arithmetic comparison,systematic exploration,automated database restructuring,disk space,conjunctive query,efficient plan,sql select-project-join query,competitive plan,efficient query plans,novel end-to-end approach,algorithms search,conjunctive queries,indexation,database system,expressive power,upper bound | SQL,Data mining,Conjunctive query,Architecture,Information retrieval,Upper and lower bounds,Computer science,Technical report,Database,Query plan,Restructuring,Scalability | Conference |
Volume | ISSN | Citations |
5739 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 24 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maxim Kormilitsin | 1 | 25 | 1.90 |
| Rada Chirkova | 2 | 450 | 36.53 |
| Y. Fathi | 3 | 137 | 19.10 |
| Matthias F. M. Stallmann | 4 | 166 | 19.38 |