Skip to Main Content
Automated Physical Database Design and Tuning
book

Automated Physical Database Design and Tuning

by Nicolas Bruno
February 2011
Intermediate to advanced content levelIntermediate to advanced
253 pages
8h 4m
English
CRC Press
Content preview from Automated Physical Database Design and Tuning
74 Automated Physical Database Design and Tuning
set of candidate indexes for query Q, obtained by any of the techniques of
Section 4.1. Let C
i
(i 0) be a family of candidate indexes defined as follows:
C
0
=
QW
cand(Q)
C
i+1
= C
i
{I
1
I
2
for each I
1
, I
2
C
i
}∪
{I
1
I
2
for each I
1
, I
2
C
i
}∪
{ρ(I, K
) for each I = R(K, S) C
i
, K
K }∪
{(I) for each I C
i
}
That is, C
i+1
is obtained by considering all possible merges, splits, reductions,
and promotions of indexes in C
i
. We define closure(W)=C
k
, where k is the
smallest integer that satisfies C
k
=C
k+1
. In words, the closure of a workload W
is the set of all indexes that either are in the candidate set of a query
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

What Is Database Design, Anyway?

What Is Database Design, Anyway?

C.J. Date
Physical Database Design

Physical Database Design

Sam S. Lightstone, Toby J. Teorey, Tom Nadeau

Publisher Resources

ISBN: 9781439815670