Exam 1.1 Flashcards

(29 cards)

1
Q

Flat File

A

-Data stored in two dimensional database with no relational info to other files or database info
-often stored as CSV

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

Declarative language

A

focusses on defining the result rather than steps to get there

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

imperative langauge

A

Explicitly states the steps needed to achieve a goal

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

What language do DBMS use

A

Declarative (SQL)

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

Relational Data Model

A

The way of storing data in tables which are just realtions

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

schema

A

structure that describes how data is stored in tables

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

External Schema

A

Describes how users see data

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

Conceptual/Logical Schema

A

describes the logiccal structure of DBMS

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

Physical Schema

A

The files and indices used

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

what langauge is data defined in

A

DDL

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

what language is data modified

A

DML

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

Physical Data Independence

A

Protection from physical changes in data

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

Logical Data independence

A

Protection from changes in logic structre of data

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

ER diagram

A

Entity relation diagram describes data as set of entities and relationships

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

what does an entity, relationship and attribute look like in er diagram

A

entity: rectangle
relationship: diamond
attrivute: oval

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

Key constraints

A

define how many relations an entity can have with another

17
Q

Participation Constraint

A

There is at least 1

18
Q

How to interpret key constraint

A

Where arrow is on denotes which can have one

19
Q

How to interpret participation constraint

A

where bold line denotes which must be involved in relation

20
Q

Key

A

a minimal set of attributes unique for each record

20
Q

Candidate key

A

potential key and shares the same properties with it

21
Q

Primary Key

A

-Main candidate key
-Underlined in ER diagram

22
Q

Relationship set

A

set of relatonships other entities have with eachother

23
Q

True of False only entities can have attributes

A

False relationships can have it too

24
Weak entities
Have thick line around them
25
How do weak entities work
Only connected to 1 entity and have partial keys and you combine their key with owners key to get them
26
ISA hierarchy
going down speacializes going up generalizes
27
Aggregation
treating one relationship as an entity for another relationship
28
T or F keys must be minimal
False only candidate keys must be minimal