Storage & Indexing Flashcards
(25 cards)
heap scan
BD
heap equality
.5BD
heap range
BD
heap insert
2D
heap delete
search + D
sorted scan
BD
sorted equality
D * log (2) B
sorted range
D * (log (2) B + # matching pages)
sorted insert
search + BD
sorted delete
search + BD
clustered scan
1.5BD
clustered equality
D * log (F) 1.5B
clustered range
D * log (F) 1.5B + # matching pages
clustered insert
search + D
clustered delete
search + D
unclustered tree index scan
BD(R + 0.15)
unclustered tree index equality
D * (1 + log (F) 0.15B)
unclustered tree index range
D * (log (F) 0.15B + #matches)
unclustered tree index insert
D(3 + log (F) 0.15B)
unclustered tree index delete
search + 2D
unclustered hash index scan
BD(R + 0.125)
unclustered hash index equality
2D
unclustered hash index range
D * (0.125B + #matches)
unclustered hash index insert
4D