63 pages matching disk accesses in this book
Results 1-3 of 63
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
algorithm assume B+-tree index BCBS file binary search Bkfr bucket factor calculations chain CUSTOMER file CUSTOMER records cylinder data bucket database DBMSs deletion digits disk accesses disk drive double buffering efficient estimate example extendible hashing file organization fit in memory formula hash function hash number hash table hB-tree heapsort hospital file illustrated in figure index join insertion internal nodes intersection file ISAM key values large files larger leaf node linear hashing linked list load factor Massachusetts file megabytes merge milliseconds minutes number of blocks number of buckets number of records operations ORDER records overflow area overflow bucket overlap parent-of-leaf level partition pile file polyphase merge primary area primary B+-tree priority queue query optimizer quicksort random reading range queries reorganization rotational latency secondary B+-tree secondary index seconds sibling smaller sort-merge join sorted file sorted segments space structure Suppose takes track tree whole file write