Exam 19: Data Structures for Database Processing

Keys may include:

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

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

A tree structure cannot be represented using indexes.

How does a DBMS store data on its direct access files?

DBMS products represent trees using:

The term set refers to all records that have the same:

What are tress,simple networks and complex networks?

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

A flat file is a file that has repeating groups.

A collection of records and the N:M relationships between them is a:

Linked lists can be used to keep records in:

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

The word key indicates a field or fields whose value uniquely or nonuniquely identifies a record.

Complex networks can be represented by reducing them to simple networks,and then representing the simple networks using:

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

Each physical record is addressed by its sequential record number (SRN).

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

What is a set?

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