Database Systems Lecture Review

Vocabulary based flashcards covering database indexing, physical design, and storage concepts based on lecture notes.

B+ trees (Non-identifying Indexing)

The preferred structure over B-trees for non-identifying indexing keys.

Direct Addressing Key

A key that is always an identifier in direct addressing.

Distributed Free Space

A feature that reduces update cost, provided the ordering key does not change.

Bidirectional B+ Trees

B+ tree structures that cannot rotate both left and right.

Direct Addressing Pointers

Identification pointers (consisting of high/low parts) required for direct addressing.

Direct Addressing Collisions

A characteristic of direct addressing where there are no collisions or overflow.

Address Space $N$

A value that must be less than or equal to the domain cardinality of the hash key ($N \le \text{domain cardinality of hash key}$).

Overflow Handling (Hashing)

A process in hashing that increases data density.

Primary Index

An index that is created on a primary key.

Ideal Density

A measure used to evaluate the quality of physical-logical design.

Serial Organization

Oganizational structure that favors cases where there is no search key.

Oracle Datafiles

Storage components in Oracle that cannot contain multiple tablespaces.

Simple Hash (Privileged Keys)

A hash method that does not have as many privileged keys as attributes.

Multi-key Hash Search

A search operation that does not require all key values to be provided.

RS Lock

A lock type that does not prevent RX locks on other rows or deletions.

ACID Acronym

A database concept incorrectly defined as availability, clarity, integrity, and durability.

B-tree Density

A measure that can drop to as low as $50\%$.

Oracle Hints

Directives that do not recommend physical structures to the user.

SQL Injection

A type of attack that does not protect database confidentiality.

Symbolic Identifier Pointer

A pointer type that does not identify physical records.

Directory

A file made of entries.

Index

A file of entries, each linked to one record, which requires extra storage.

Simple Dense Index

An index type that does not have a lower cost.

Dense Index Cost

An index cost that depends specifically on the structure.