hakdog Flashcards

1
Q

A column or group of columns in a table that uniquely identify every row in that table.

A

Primary key

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

Defines the number of entities in one entity set, which can be associated with the number of entities of other set via relationship set.

A

Cardinality

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

One entity from entity set A can be associated with at most one entity of entity set B and vice versa.

A

One-to-one

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

One entity from entity set A can be associated with more than one entities of entity set B however an entity from entity set B, can be associated with at most one entity.

A

One-to-many

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

More than one entities from entity set A can be associated with at most one entity of entity set B, however an entity from entity set B can be associated with more than one entity from entity set A.

A

Many-to-one

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

One entity from A can be associated with more than one entity from B and vice versa.

A

Many-to-many

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

One entity from A can be associated with more than one entity from B and vice versa.

A

Many-to-many

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

Each entity is involved in the relationship. It is represented by double lines.

A

Total participation

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

Not all entities are involved in the relationship. It is represented by single lines.

A

Partial participations

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

It has the power of expressing database entities in a conceptual hierarchical manner.

A

ER Model

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

The process of generalizing entities, where the generalized entities contain in the properties of all the generalized entities. A number of entities are brought together into one generalized entity based on their similiar characteristics.

A

Generalization

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

A group of entities is divided into sub-groups based on their characteristics. Take a group ‘person’ for example

A

Specialization

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

It is an important feature of generalization and specialization. It allows lover level of entities to inherit the attributes of higher level entities.

A

Inheritance

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

The data stored in database, may it be user data or metadata, must be a value of some table cell.

A

Rule 1: Information Rule

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

Every single data element (value) is a guaranteed to be accessible logically with a combination of table-name, primary key (row value), and attribute name (column name)

A

Rule 2: Guaranteed Access Rule

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

The NULL values in a database must be given a systematic and uniform treatment. This is a very important rule because a NULL can be interpreted as one the following − data
is missing, data is not known, or data is not applicable.

A

Rule 3: Systematic Treatment of Null Values

17
Q

The structure description of the entire database must be stored in an online catalog, known as data dictionary, which can be accessed by authorized users.

A

Rule 4: Active online catalog

18
Q

A database can only be accessed using a language having linear syntax that support data definition, data manipulation, and transaction management operations.

A

Rule 5: Comprehensive Data sub-language rule

19
Q

All the views of a database, which can theoretically be updated, must also be updatable by the system.

A

Rule 6: View Updating Rule

20
Q

A database must support high-level insertion,
updation, and deletion.

A

Rule 7: High-Level Insert, Update, and Delete Rule

21
Q

The data stored in a database must be independent of the
applications that access the database. Any change in the physical structure of a database must not have
any impact on how the data is being accessed by external applications.

A

Rule 8: Physical Data Independence

22
Q

The logical data in a database must be independent of its user’s
view (application). Any change in logical data must not affect the applications using it.

A

Rule 9: Logical Data Independence

23
Q

The end-user must not be able to see that the data is distributed
over various locations. Users should always get the impression that the data is located at one site only.

A

Rule 11: Distribution Independence

24
Q

A database must be independent of the application that uses it. All its
integrity constraints can be independently modified without the need of any change in the application.

A

Rule 10: Integrity Independence

25
Q

If a system has an interface that provides access to low-level records,
then the interface must not be able to subvert the system and bypass security and integrity constraints.

A

Rule 12: Non-Subversion Rule

26
Q

The main highlights of this model are Data is stored in tables called relations, Relations can be normalized, In normalized relations, values saved are atomic values, Each row in relation contains unique value, Each column in relation contains values from a same domain.

A

Relational Model

27
Q

In relationaldata model, relations are saved in the format of Tables. This format stores the relation among entities. A table has rows and columns, where rows represents records and columns represent the
attributes.

A

Table

28
Q

A single row of a table, which contains a single record for that relation.

A

Tuple

29
Q

A finite set of tuples in the relational database
system represents ______

A

Relation Instance

30
Q

It describes the relation name (table name),
attributes, and their names

A

Relation Schema

31
Q

Each row has one or more attributes, known as
_______ , which can identify the row in the relation (table) uniquely.

A

Relation Key

32
Q

Every attribute has some pre-defined value scope

A

Attribute Domain

33
Q

Every relation has some conditions that must hold for it to be a valid relation. These conditions are called _______ .

A

Relational Integrity Constraints

34
Q

There must be at least one minimal subset of attributes in the relation, which can identify a tuple
uniquely. This minimal subset of attributes is called ___ for that relation.

A

Key

35
Q

If there are more than one such minimal subsets, these are called _________

A

Candidate Keys

36
Q

It is a key used to link two tables together.

A

Foreign Key

37
Q

It is a field (or collection of fields) in one table that
refers to the PRIMARY KEY in another table.

A

Foreign Key

38
Q

The table containing the foreign key is called the

A

Child Table

39
Q

The table containing the candidate key is called the

A

Referenced or parent
table