Database Management Systems · topic
Blocking factor, spanned and unspanned records, heap, sorted and hashed files with their access costs; primary, clustering and secondary indexes, dense and sparse; multilevel indexes; B-tree and B+ tree node layouts, order and fan-out, height bounds, insertion with splits and block-access counts.
Blocking factor, spanned and unspanned records and the number of blocks; heap, sorted and hashed files with the block accesses for equality search, range search and insertion; primary, clustering and secondary indexes, dense and sparse, and how many of each a file can have; the access count through a single-level index; a single file worked through every access path by script, with all sizes stated.
A partial preview of the top of the sheet. The full sheet is in the Database Management Systems cheat sheet pack.
Multilevel indexes with fan-out and the number of levels; node layouts of the B-tree and the B+ tree; the inequalities that give the order of internal nodes and the capacity of leaves from block, key and pointer sizes; the conventions for "order" and minimum occupancy; the minimum and maximum height for a given number of keys; and block-access counts for search, all computed by script with every size stated.
A partial preview of the top of the sheet. The full sheet is in the Database Management Systems cheat sheet pack.
The B+ tree insertion routine with leaf splits that copy a key up and internal splits that move a key up, the root split that adds a level, and the split-point conventions; a before-and-after diagram generated from a tested insert routine; B-tree insertion for contrast; ascending insertion and its half-full leaves; node counts after splits; deletion with borrowing and merging in brief; and two checked past GATE questions.
A partial preview of the top of the sheet. The full sheet is in the Database Management Systems cheat sheet pack.
