Exam 21: Data Structures for Database Processing

An index is a table that cross-references record addresses with some attribute value.

In a B-Tree whose top entry contains the values 47 and 88,the middle arrow allows access to all records whose key field values are ________.

In a linked list,the sequence field holds the address of the next record in the logical sequence.

The term set refers to all records that have the same ________.

To represent a tree structure using indexes,store each 1:N relationship as an index.

Linked lists can be used to keep records in a logical order even if they are not necessarily in physical order.

Each physical record is addressed by its ________.

An intersection record is a record that is created when a complex network is decomposed into a simple network.

A two-way linked list has links in both directions.

Complex networks can be represented by reducing them to simple networks,which requires the introduction of a(n)________.

A multilevel index that allows both sequential and direct processing of data records is called a C-tree.

DBMS products represent trees using all of the following except ________.

A complex network is a collection of records and the 1:N relationships between them.

Linked lists can be used to keep records in ________.

The DBMS creates physical records,also called blocks,on its direct access fields.

The term set refers to all records having the same nonunique secondary key.

A flat file is a file that has repeating groups.

What are tree,simple networks and complex networks?

What is a linked list?

Data structures are typically used to ________.