File Structures: An Analytic Approach |
Other editions - View all
Common terms and phrases
added algorithm already amount answer assume average B+-tree begin binary bucket buffer bytes calculations called chapter contain correct cost create CUSTOMER CUSTOMER records cylinder database deletion digits disk accesses disk drive efficient entry estimate example fetches field figure formula give given half hash table illustrated insertion join key values larger leaf leaves less linked load factor look match megabytes memory merge method milliseconds minutes modify move node number of blocks number of records obtain once operations optimal ORDER records organization overflow overlap parent partition pass performance pieces pile file primary problem query range reason reorganization seconds seek selection sequential reading smaller sorted file sorted segments space split stored structure Suppose takes track transfer tree usually write