Final Flashcards
(148 cards)
The time required to read or write the first byte of data is known as _____.
access time
transfer rate
random-access
volatility
access time
A magnetic disk groups data into _____.
blocks
sectors
kilobytes
pages
sectors
A relational database uses row-oriented storage to store an entire row
within one _____.
Table
block
page
sector
block
With column-oriented storage, a block stores values for _____.
a single column
non-key columns
key columns only
all table columns
a single column
Data was not saved before a system was accidentally powered off. This data was located in _____.
non-volatile memory
volatile memory
flash storage
magnetic storage media
volatile memory
The heap table structure is optimized for _____.
inserting new rows
deleting all rows with primary key between two fixed values
reading all rows with primary key between two fixed values
updating all occurrences of a specific value of a column, in all rows
inserting new rows
The sort column in a sorted table determines the _____ row order.
key
physical
dynamic
linked
physical
Which table structure might use the modulo function to locate rows?
Sorted
Hash
Heap
Cluster
Hash
In a multi-table, a _____ column is available in all interleaved tables.
sort
hash function
bucket
cluster key
cluster key
A _____ assigns each row to a group of linked blocks, called a bucket.
hash table
heap table
table cluster
sorted table
hash table
A single-level index is a file that contains column values and pointers to _____ containing the column _____.
tables, key
blocks, key
rows, value
tables, rows
rows, value
In order to locate rows selected by a query, an index scan reads index blocks _____.
in reverse order
randomly
sequentially
in order of key values
sequentially
When performing a search, which scan type is fastest?
Cluster
Row
Table
Index
Index
A _____ index is an index on a non-unique sort column.
clustering
primary
secondary
sorted
Clustering
When a table is updated and the index block has no free space for a new index entry, what happens?
An error results.
A new block is merged.
The block splits.
The entry is removed.
The block splits
The bottom level of a multi-level index is a _____index.
sorted single-level
unsorted single-level
bottom-level block
primary and clustering
sorted single-level
What is the fan-out for a multi-level index where index entries are 32 bytes and index blocks are 10 kilobytes?
Approximately 400
Approximately 300
Approximately 200
Approximately 500
Approximately 300
How are blocks read with a single-level index scan?
A scan is initiated to read all table blocks. Index blocks are then read.
The search reads one index block plus selected table blocks.
A scan reads all index blocks to find table blocks that contain selected rows. The table blocks are then read.
A scan is initiated to read all table blocks that contain index blocks with selected data.
A scan reads all index blocks to find table blocks that contain selected rows. The table blocks are then read.
Branches that are similar in length in an index hierarchy are _____.
sparse
primary
balanced
dense
balanced
Which of the following is a characteristic of a B-tree index, but not a B+tree index?
Pointers to table blocks appear only in the bottom level.
All column values appear in the bottom level.
Column values are occasionally repeated in the index.
Column values do not repeat at lower levels.
Column values do not repeat at lower levels.
Hash index entries are assigned to _____.
buckets
values
clusters
blocks
buckets
What are two characteristics of an efficient bitmap index?
The WHERE clause may specify any values in upper case. The column used in a WHERE clause may contain mixed upper and lower case characters.
The database can quickly determine the block containing a table row from the index row number. Any indexed column contains relatively few distinct values.
Each bucket initially has one block. Any additional blocks are allocated and linked to the initial block.
Indexes change only when primary key values are updated. Physical indexes change whenever a row moves to a new block.
The database can quickly determine the block containing a table row from the index row number. Any indexed column contains relatively few distinct values.
What is a characteristic of a logical index?
Each bucket initially has one block.
Any additional blocks are allocated and linked to the initial block.
The block containing a table row is determined from the index row number.
Index does not change when a row moves to a new block.
Index does not change when a row moves to a new block.
A column contains grades from 0 to 10, but a WHERE clause specifies values from 0 to 100. A _____ index can be used to modify the column values and process the queries.
logical
function
multi-level
single-level
function