Lesson 2 Flashcards

1
Q

organizational environment in which users own their data exclusively

A

Flat-file approach

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

most elemental piece of potentially useful data in the database.

A

Data attribute

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

state of data elements being represented in all user files.

A

Data redundancy

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

efficient information system that captures and stores data only once and makes this single source available to all users who need it.

-To meet the private data needs of users, organizations must incur the costs of both multiple collection and multiple storage procedures.

A

Data storage

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

the periodic updating of data stored in the files of an organization.

This adds significantly to the cost of data management

A

Data updating

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

the problem associated with the flat-file model because of its failure to update all the user files affected by a change in status; may result in decisions based on outdated information.

A

Currency of information

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

the user’s inability to obtain additional information as his or her needs change.

user’s information set is constrained by the data that he or she possesses and controls.

A

Task-data dependency

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

The most obvious change from the flat-file model is the pooling of data into a common database that is shared by all the users.

A

THE DATABASE APPROACH

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

software system that controls access to the data resource.

programmed to know which data elements each user is authorized to access

A

database management system (DBMS)

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

database model that represents data in a hierarchical structure and permits only a single parent record for each child record.

A

hierarchical model

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

individuals who employ systems, receive information, and act on the information received.

A

Users

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

a data model that is more flexible than traditional navigational models. It allows users to create new and unique paths through the database to solve a wide range of business problems.

A

relational model

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

models that possess explicit links or paths among data elements.

A

Navigational models

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

physical arrangement of records in the database.

A

internal view

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

Elements of the Database Environment

A

Users
The DBMS
The database administrator
The physical database

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

programming language used to define the database to the database management system.

A

Data definition language (DDL)

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

description of the entire database.

A

CONCEPTUAL VIEW (SCHEMA)

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

set of data that a particular user needs to achieve his or her assigned tasks.

A

USER VIEW (SUBSCHEMA

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

a technique used to locate records and navigate through the database.

A

DBMS OPERATION: Access method

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

language used to insert special database commands into application programs written in conventional languages.

A

Data manipulation language (DML)

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

sequential file structure accessed via an index.

A

indexed sequential file

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

The indexed sequential file is a sequential file structure accessed via an index.

A

Query Language

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

the individual responsible for managing the database resource.

A

database administrator (DBA)

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

description of every data element in the database.

A

data dictionary

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

lowest level of the database containing magnetic spots on magnetic disks.

A

physical database

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

sequential file structure accessed via an index.

A

indexed sequential file

24
Q

a cross-reference created from multiple indexes.

A

The inverted list

25
Q

proposed the principles of the relational model in the late 1960s.

A

E. F. Codd

26
Q

blueprint for what ultimately will become the physical database.

A

data model

27
Q

detailed analysis of the organization’s information needs.

A

A top-down approach

28
Q

a client organization’s database developers may modify the model to suit the company’s specific needs.

A

bottom-up approach

29
Q

resource, event, or agent

29
Q

documentation technique used to represent the relationship among data entities in a system.

A

entity relationship (ER) diagram

30
Q

high-level perspective of the overall schema, which presents only the key entities and their relationships; it does not show the data types and keys contained within the entities.

A

entity-level ER diagram

31
Q

describes how data in one entity are related to data in another entity.

32
Q

describe the number of instances or records that pertain to a specific entity.

A

Occurrence

32
Q

the equivalents to adjectives in the English language that serve to describe the objects.

A

Attributes

32
Q

relationship among record types.

A

Association

33
Q

numerical mapping between entity instances.

A

Cardinality

33
Q

the formal name for a row in the table.

34
Q

set of characteristics that uniquely identify each record in the tables.

A

Primary key

34
Q

keys that permit the physical connection of logically related tables to achieve the associations described in the data model.

A

Foreign keys

35
Q

negative operational symptoms caused by improperly normalized tables.

36
Q

low degree of normalization of relational database tables.

A

The first normal form (INF)

37
Q

table that is free of both repeating group and partial dependencies.

A

second normal form (2NF)

38
Q

normalization that occurs by dividing an unnormalized database into smaller tables until all attributes in the resulting tables are uniquely and wholly dependent on (explained by) the primary key.

A

third normal form (3NF)

39
Q

an unintentional updating of data in a table, resulting from data redundancy.

A

update anomaly

40
Q

an unintentional insertion of data into a table.

A

insertion anomaly

41
Q

multiple values for a particular attribute exist in a specific tuple.

A

Repeating groups

41
Q

combining the data needs of all users into a single schema or enterprise-wide view

A

View integration

42
Q

unintentional deletion of data from a table.

A

deletion anomaly

43
Q

one or more nonkey attributes are dependent on (defined by) only part of the primary key rather than the whole key.

A

Partial dependencies

44
Q

comprised of two attributes: INVOICE NUM and PROD NUM.

A

composite key

44
Q

is reorganizing the IT function into small information processing units (IPUs) that are distributed to end users and placed under their control.

A

Distributed data processing (DDP)

44
Q

table where nonkey attributes are dependent on another nonkey attribute and are independent of the table’s primary key.

A

Transitive dependencies

45
Q

database retained in a central location.

A

Centralized database

46
Q

a firm’s data files accurately reflect the effects of its transactions.

A

Data currency

47
Q

occurs during accounting transactions, account balances pass through a state where the values are incorrectly stated.

A

Temporary inconsistency

48
Q

software control (usually a function of the DBMS) that prevents multiple simultaneous accesses to data.

A

database lockout is software control (usually a function of the DBMS) that prevents

49
Q

database approach that splits the central database into segments or partitions that are distributed to their primary users.

A

Partitioned database

50
Q

is a “wait” state that occurs between sites when data are locked by multiple sites that are waiting for the removal of the locks from the other sites.

51
Q

database approach in which the central database is replicated at each site.

A

Replicated databases

52
Q

method in which the root segment (customer file) of the database is organized as an indexed file.

A

Hierarchical indexed direct access method

53
Q

system that ensures that transactions processed at each site are accurately reflected in the databases at all other sites.

A

Concurrency control