Exam 15: External Methods

In a B-tree,all leaves must be at the same level.

A file is typically partitioned into individual ______ which are the smallest unit of transfer between internal and external memory.

Suppose a B-tree of order 5 contains the key values 20,40,60 and 70.What happens when we insert the key value 80?

When we access external data,a location that temporarily stores data between one process and another is called a ______.

In a 2-3 tree,if a node has two key values,then the node has two children.

In the external mergesort algorithm,how many buffers are needed to merge runs?

Name two advantages to storing a data structure in external storage.

The technique of referencing an employee table with either a Social Security Number or a name as the key value is ______.

When we perform external hashing,we hash the data file instead of the index file.

The maximum number of records in a B-tree of degree 5 and height 2 is ______.