Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

Data Architecture > Data Storage > Flashcards

Data Storage Flashcards

1
Q

Access ZTime

A

Time required to access the first byte in a read or write operation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Transfer Rate

A

speed at which data is read or written. following initial access.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Volatile memory

A

Memory that is lost when disconnected from power.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Non-volatile memory

A

Memory is retained when power is lost

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Main Memory/RAM

A

Primary memory used when computer programs execute

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Flash Memory/SSD

A

less expensive and higher capacity than main memory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Magnetic Disk/HDD

A

used to store large amounts of data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Sectors

A

Magnetic disk groups data in sectors, traditionally 512 bytes per sector but 4 kilobytes with newer disk formats

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Pages

A

Flash memory groups data in pages, usually between 2 kilobytes and 16 kilobytes per page

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Block

A

Databases and file systems use a uniform size, called a block, when transferring data between main memory and storage media

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Row-oriented storage

A

Relational databases usually store an entire row within one block, which is called row-oriented storage

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Column-oriented/Columnar Storage

A

Each block stores values for a single column only.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Table Structure

A

Scheme for organizing rows in blocks on storage media

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

heap table

A

no order is imposed on rows

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Sorted Table/Sort Column

A

Database designer identifies a sort column that determines physical row order

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Hash Table

A

Rows are assigned to buckets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Bucket

A

Block or group of blocks containing rows

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Hash Key

A

Column or group of columns, usually the primary key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

hash Function

A

Computes the bucket containing the row from the hash key

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Modulo Function

A

Simple has function with four steps

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Dynamic hash function

A

Automatically allocates more blocks to the table, creates additional buckets, and distributes rows across al buckets. With more buckers, fewer rows are assigned to each bucket and, on average, buckets contain fewer linked blocks.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Table clusts/Multi-Tables

A

Interleave rows of two or mote tables in the same storage area.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Cluster key

A

Column that is available in all interleaved tables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Single-level index

A

File containing column values, along with pointers to rows containing the column value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

Multi-level index

A

Each index entry is a composite of values from all indexed columns.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

Table scan

A

Database operation that reads table blocks directly, without access an index

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

Index Scan

A

Database operation that reads index blocks sequentially, in order to locate the needed table blocks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

Hit Ratio/Filter facotr/Selectivity

A

Percentage of table rows selected by a query

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

Binary Search

A

Database repeatedly splits the indexed in two until it finds the entry containing the search value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

Primary Index/Clustering index

A

Index on a sort column

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

Dense index

A

Contains an entry for every table rows

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

Sparse index

A

Contains an entry for every table block

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

multi-level indexd

A

Stores column values and rows pointer s in a hierarchy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
Q

Fan-out

A

Number of index entries per block is called the fan-out of a multi-level index

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
35
Q

Branch

A

Top-level block to a bottom-level block is called a branch.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
36
Q

balanced/imbalanced

A

when all branches are the same length and imbalanced when branches are different lengths

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
37
Q

B+tree

A

All indexed values appear in the bottom level. Pointers to table blocks appear only in the bottom level. Values are occasionally repeated in the index

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
38
Q

B-Tree

A

Indexed values appear in a higher level, the value is not repeated at lower levels. Instead, a pointer to the corresponding table block appears in the higher level along with the value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
39
Q

Hash index

A

INdex entries are assigned to buckets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
40
Q

BUcket

A

Block or group of blocks containing index entries

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
41
Q

hash Function

A

Index entry is determined by a hash function, which computes a bucket number from the value of the indexed column

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
42
Q

Bitmap Index

A

Grid of Bits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
43
Q

Physical INdexd

A

Single or multi-level index normally contains pointers to table blocks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
44
Q

Logical index

A

Single or multi-level index in which pointers to table blocks are replaced with primary key values.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
45
Q

Function index

A

Database designer specifies a function on the column value. Index entries contain the result of the function applied to column values, rather than the column values

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
46
Q

Tablespace

A

Database object that maps one or more tables to a single file

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
47
Q

fragmented

A

Files are updated, blocks become scattered, or fragmented, across many tracks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
48
Q

partition

A

subset of table data. One table has many partitions that do not overlap, and together, contain all table data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
49
Q

Horizontal Partition

A

Subset of table rows

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
50
Q

Vertical partition

A

Subset of table columns

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
51
Q

Shard

A

Subset of table data, usually a subset of rows rather than columns. Stored on different computers in a distributed database

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
52
Q

Partition Expression/Partition Columns

A

Specifies a partition expression based on one or more partition columns. Partition expression may be simple, such as the value of a single partition column, or a complex based on several partition columns. Rows are assigned to partitions in different ways.

53
Q

Range partition

A

Associates each partition with a range of parittion expression values. VALUES LESS THAN keywords specify the upper bound of each range. MAXVALUE keyword represents the highest column value, and VALUES LESS THAN MAXVALUE specifies the highest range.

54
Q

List Partition

A

Associates each partition with an explicit list of partition expression values using the VALUES IN keywords.

55
Q

Hash Parititon

A

A partition expression with positive integer values. Database administrator specifies the number of partitions, N, and partitions are automatically named p0 through p(n-1). Partition number for each row is computed as: (Partition expression value) modulo N

56
Q

Key Parition

A

Partition expression is determined automatically by the database

57
Q

Logical Design

A

Specifies tables, columns, and keys.

58
Q

Physical Design

A

Specifies indexes, table structures, and partitions. Physical design affects query performance but never affects query results

59
Q

Storage Engine/Storage Manager

A

Translates instructions generated by a query processor into low-level commands that access data on storage media. Storage engines support different index and table structures, so physical design is dependent on a specific storage engine.

60
Q

CREATE INDEX

A

statement creates an index by specifying the index name and table columns that compose the index

61
Q

DROP INDEX

A

Statement deletes a table’s index

62
Q

SHOW INDEX

A

Statement displays a table’s index

63
Q

EXPLAIN

A

Statement generates a result table that describes how a statement is executed by the storage engine

64
Q

slow query low

A

File that records all long-running queries submitted to the database

65
Q

Time required to access the first byte in a read or write operation

A

Access ZTime

66
Q

speed at which data is read or written. following initial access.

A

Transfer Rate

67
Q

Memory that is lost when disconnected from power.

A

Volatile memory

68
Q

Memory is retained when power is lost

A

Non-volatile memory

69
Q

Primary memory used when computer programs execute

A

Main Memory/RAM

70
Q

less expensive and higher capacity than main memory

A

Flash Memory/SSD

71
Q

used to store large amounts of data

A

Magnetic Disk/HDD

72
Q

Magnetic disk groups data in sectors, traditionally 512 bytes per sector but 4 kilobytes with newer disk formats

73
Q

Flash memory groups data in pages, usually between 2 kilobytes and 16 kilobytes per page

74
Q

Databases and file systems use a uniform size, called a block, when transferring data between main memory and storage media

75
Q

Relational databases usually store an entire row within one block, which is called row-oriented storage

A

Row-oriented storage

76
Q

Each block stores values for a single column only.

A

Column-oriented/Columnar Storage

77
Q

Scheme for organizing rows in blocks on storage media

A

Table Structure

78
Q

no order is imposed on rows

A

heap table

79
Q

Database designer identifies a sort column that determines physical row order

A

Sorted Table/Sort Column

80
Q

Rows are assigned to buckets

A

Hash Table

81
Q

Block or group of blocks containing rows

82
Q

Column or group of columns, usually the primary key

83
Q

Computes the bucket containing the row from the hash key

A

hash Function

84
Q

Simple has function with four steps

A

Modulo Function

85
Q

Automatically allocates more blocks to the table, creates additional buckets, and distributes rows across al buckets. With more buckers, fewer rows are assigned to each bucket and, on average, buckets contain fewer linked blocks.

A

Dynamic hash function

86
Q

Interleave rows of two or mote tables in the same storage area.

A

Table clusts/Multi-Tables

87
Q

Column that is available in all interleaved tables

A

Cluster key

88
Q

File containing column values, along with pointers to rows containing the column value

A

Single-level index

89
Q

Each index entry is a composite of values from all indexed columns.

A

Multi-level index

90
Q

Database operation that reads table blocks directly, without access an index

A

Table scan

91
Q

Database operation that reads index blocks sequentially, in order to locate the needed table blocks

A

Index Scan

92
Q

Percentage of table rows selected by a query

A

Hit Ratio/Filter facotr/Selectivity

93
Q

Database repeatedly splits the indexed in two until it finds the entry containing the search value

A

Binary Search

94
Q

Index on a sort column

A

Primary Index/Clustering index

95
Q

Contains an entry for every table rows

A

Dense index

96
Q

Contains an entry for every table block

A

Sparse index

97
Q

Stores column values and rows pointer s in a hierarchy

A

multi-level indexd

98
Q

Number of index entries per block is called the fan-out of a multi-level index

99
Q

Top-level block to a bottom-level block is called a branch.

100
Q

when all branches are the same length and imbalanced when branches are different lengths

A

balanced/imbalanced

101
Q

All indexed values appear in the bottom level. Pointers to table blocks appear only in the bottom level. Values are occasionally repeated in the index

102
Q

Indexed values appear in a higher level, the value is not repeated at lower levels. Instead, a pointer to the corresponding table block appears in the higher level along with the value

103
Q

INdex entries are assigned to buckets

A

Hash index

104
Q

Block or group of blocks containing index entries

105
Q

Index entry is determined by a hash function, which computes a bucket number from the value of the indexed column

A

hash Function

106
Q

Grid of Bits

A

Bitmap Index

107
Q

Single or multi-level index normally contains pointers to table blocks

A

Physical INdexd

108
Q

Single or multi-level index in which pointers to table blocks are replaced with primary key values.

A

Logical index

109
Q

Database designer specifies a function on the column value. Index entries contain the result of the function applied to column values, rather than the column values

A

Function index

110
Q

Database object that maps one or more tables to a single file

A

Tablespace

111
Q

Files are updated, blocks become scattered, or fragmented, across many tracks

A

fragmented

112
Q

subset of table data. One table has many partitions that do not overlap, and together, contain all table data

113
Q

Subset of table rows

A

Horizontal Partition

114
Q

Subset of table columns

A

Vertical partition

115
Q

Subset of table data, usually a subset of rows rather than columns. Stored on different computers in a distributed database

116
Q

Specifies a partition expression based on one or more partition columns. Partition expression may be simple, such as the value of a single partition column, or a complex based on several partition columns. Rows are assigned to partitions in different ways.

A

Partition Expression/Partition Columns

117
Q

Associates each partition with a range of parittion expression values. VALUES LESS THAN keywords specify the upper bound of each range. MAXVALUE keyword represents the highest column value, and VALUES LESS THAN MAXVALUE specifies the highest range.

A

Range partition

118
Q

Associates each partition with an explicit list of partition expression values using the VALUES IN keywords.

A

List Partition

119
Q

A partition expression with positive integer values. Database administrator specifies the number of partitions, N, and partitions are automatically named p0 through p(n-1). Partition number for each row is computed as: (Partition expression value) modulo N

A

Hash Parititon

120
Q

Partition expression is determined automatically by the database

A

Key Parition

121
Q

Specifies tables, columns, and keys.

A

Logical Design

122
Q

Specifies indexes, table structures, and partitions. Physical design affects query performance but never affects query results

A

Physical Design

123
Q

Translates instructions generated by a query processor into low-level commands that access data on storage media. Storage engines support different index and table structures, so physical design is dependent on a specific storage engine.

A

Storage Engine/Storage Manager

124
Q

statement creates an index by specifying the index name and table columns that compose the index

A

CREATE INDEX

125
Q

Statement deletes a table’s index

A

DROP INDEX

126
Q

Statement displays a table’s index

A

SHOW INDEX

127
Q

Statement generates a result table that describes how a statement is executed by the storage engine

128
Q

File that records all long-running queries submitted to the database

A

slow query low

Data Architecture (6 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions