Exam Prep Flashcards

(44 cards)

1
Q

analysis phase

A

specifies database requirements represented as entities
AKA conceptual design, entity-relationship modeling

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

logical design

A

implements database requirements by converting entities, relationships and attributes into tables, keys and columns

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

physical design

A

adds indexes and specifies how tables are organized on storage media

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

MySQL Command-line client

A

text interface in MySQL Server
- returns error code

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

DDL (data definition language)

A

defines structure of database

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

DQL (data query language)

A

retrieves data from database

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

DML (data manipulation)

A

manipulates data stored in database

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

DCL (data control)

A

controls database user access

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

DTL (data transaction)

A

manages database transactions

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

Drop table

A

deletes a table and its rows

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

Update statement

A

modifies existing rows by using SET clause and optional WHERE clause

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

Truncate

A

deletes all rows from a table
- like delete statement without WHERE clause

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

auto-increment column

A

numeric column that is assigned an automatically incrementing value when a new row is inserted

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

RESTRICT

A

rejects an insert, update, or delete that violates referential integrity

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

CASCADE

A

propagates primary key changes to foreign keys

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

TRIM

A

returns string s without leading and trailing spaces

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

INNER JOIN

A

selects only matching left and right table rows

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

FULL JOIN

A

selects all left and right table rows, regardless of match

19
Q

LEFT JOIN

A

selects all left table rows, but only matching right table rows

20
Q

RIGHT JOIN

A

selects all right table rows, but only matching left table rows

21
Q

OUTER JOIN

A

any join that selects unmatched rows

22
Q

UNION

A

combines two results into one table

23
Q

EQUIJOIN

A

compares columns of two tables with the = operator

24
Q

CROSS-JOIN

A

combines 2 tables without comparing columns

25
subquery
AKA nested query/inner query - query within a query
26
materialized view
view for which data is stored at all times, must be refreshed
27
WITH CHECK
database rejects inserts and updates that do not satisfy the view query WHERE clause
28
Analysis steps
1. discover entities, relationships, and attributes 2, determine cardinality 3. distinguish strong and weak entities 4, create supertype and subtype entities
29
logical design steps
1. implement entities 2. implement relationships 3. implement attributes 4. apply normal form
30
IsA relationship
identifying relationship
31
partition
is a group of mutually exclusive subtype entities
32
candidate key
simple or composite column that is unique and minimal
33
third normal form
whenever non-key column A depends on column B, then B is unique
34
Boyce-codd normal form
whenever column A depends on column B, then B is unique - GOLD STANDARD - ideal for tables with frequent inserts, updates, and deletes
35
trivial dependency
when columns of A are subset of columns of B, A always depends on B
36
normalization
eliminates redundancy by decomposing table into 2 or more tables
37
heap table
no order imposed on rows - fast for bulk
38
hash table
rows assigned to buckets
39
bucket
block or group of blocks containing rows
40
hit ratio
AKA filter factor/selectivity - percentage of table rows selected by query
41
dense index
contains an entry for every table rows
42
sparse index
contains entry for every table block
43
bitmap index
grid of bits, index contains ones and zeros
44
tablespace
database object that maps one or more tables to a single file