InformationManagement Flashcards
1
Q
- refers to the trustworthiness of system resources over their entire life cycle
A
DATA INTEGRITY
2
Q
same data may be stored in multiple files leading to duplication
A
Data Redundancy
3
Q
- is an integrity rule which states that every table must have a primary key and that the column or columns chosen to be the primary key should be unique and not null
A
Entity Integrity Constraint
4
Q
introduced the three types of relationships:
A
One-to-many (1:) relationship
Many-to-many (:*) relationship
One-to-one (1:1) relationship
5
Q
each entity consists of a set of — that describes particular characteristics of the entity.
A
- Attribute
6
Q
- are sometimes called atomic attributes
A
- Simple Attribute
7
Q
– a type of database that supports only user at the time
A
- Single-user database
8
Q
provides description of data to enable program-data independence.
A
- System catalog (metadata)
9
Q
- All values in a column must conform to the same data format. Each column has a specific range of values known as the attribute domain.
A
RELATIONAL DATABASE
10
Q
Retrieves rows from one table that are not found in another union compatible table
A
DIFFERENCE
11
Q
- states that any foreign key value can only be in one of two states the database must not contain any unmatched foreign key
A
Referential Integrity Constraint
12
Q
When there are n entities set participating in a relation, the relationship is called an —– .
A
n-ary Relationship
13
Q
Specifies a condition that must be true for each row in a table. It restricts the values that can be inserted or updated in a column based on the defined condition.
A
Check Constraint
14
Q
describes an association among entities.
A
- Relationship
15
Q
types of cardinality notation (2)
A
- Chen notation
- Crowfoot notation
16
Q
tailored to specific industries or application domains such as healthcare, finance or manufacturing. They capture the unique terminology, entities and relationship relevant to that domain.
A
Domain-Specific Models
17
Q
stores both data and their relationships in a single structure known as an object.
A
OBJECT-ORIENTED MODEL
18
Q
describes how data is stored in the database, including details such as data types, indexing and storage optimization
A
Physical data model
19
Q
is also called a major key
A
- Primary key
20
Q
- Shared collection of logically related data and a description of this data, designed to meet the information needs of an organization.
A
DATABASE
21
Q
a British scientist who worked for IBM, invented the relational model for database management
A
- Dr. E.F. Codd
22
Q
This software is also referred to as the “database engine” or the “back end.”
A
DATABASE APPROACH
23
Q
specifies that it is not necessary for every entity occurrence to participate in the relationship
A
- Optional relationship
24
Q
Establishes a relationship between two tables by linking a column in one table to a primary key or unique key column in another table. This enforces referential integrity.
A
Foreign Key Constraint:
25
analyzing data stored in separate files can be complex and time-consuming
difficulties in data analysis
26
Retrieves possible pairs of rows from two tables
PRODUCT
27
refers to the activities that focus on the design of the database structure that will be used to store and manage end-user data.
Database Design
28
file based systems often do not support simultaneous access by multiple users effectively
Limited Data Access
29
was introduced in 1970 by E.F. Codd of IBM. It is collection of relations or two-dimensional tables having distinct names
RELATIONAL MODEL
30
* is a diagram that depicts an entity relationship model’s entities, attributes, and relations.
ENTITY RELATIONSHIP DIAGRAM (ERD)
31
are based on a network data model that allows each record to have multiple parents and multiple child records.
network database
32
are unordered and meaningless fact.It does not convey any message.
Data
33
– Retrieves rows that are common to two union-compatible tables
INTERSECT
34
Information Models (Types)
1. Domain-specific Models
2. Enterprise Information Models
35
* an attribute that represents a value that is derivable from the value of a related attribute or set of attributes, not necessarily in the same entity type
* Derived Attribute
36
SPARC
Standard Planning and Requirements Committee
37
) represents data about an entity.
* Each table row (tuple)
38
It is the representation of the entire database as “seen” by the DBMS.
1. Physical or Internal Level
39
retrieves a subset of columns
PROJECT
40
TYPES OF DBMS (10)
1. Single-user database
2. Desktop database
3. Multiuser database
4. Workgroup database
5. Enterprise database
6. Centralized database
7. Distributed database
8. Cloud database
9. General-purpose database
41
* A unique identifier for every entity type
* Key Attribute
42
* an attribute that holds multiple values for each occurrence of an entity type
* Multi-valued Attribute
43
a data analyst from Gartner Corp. who first describe the basic characteristics of Big Data databases.
Douglas Laney
44
further refines the conceptual model by defining the attributes, keys and relationships between entities in a more detailed and implementation
Logical Data Model
45
DBTG
Database Task Group
46
- raw facts, or facts that have not yet processed to reveal their meaning to the enduser.
Data
47
Merges two union-compatible tables into a new table, dropping the duplicate rows
UNION
48
– It is a large scale distributed system that stores structured and unstructured data.
Emerging Data Model: NoSQL
49
is the field which occupies the first column within a certain relation
* Primary key
50
an entity can be classified as strong entity or weak entity
1. Entity
51
is the key field that serves as the unique identifier of a specific tuple in a relation
* Primary key
52
as the volume of data increases, managing it accross numerous files becomes cumbersome
Scalability Problems
53
a single user that runs on a personal computer.
2. Desktop database
54
a database that is created and maintained using cloud services, such as Microsoft Azure or Amazon AWS.
Cloud database
55
* First step in designing a database, refers to the process of creating a specific data model for a determined problem domain.
DATA MODELING
56
Types of Data Integrity Rules
Specific Integrity Rules
General Integrity Rules
57
is as a two-dimensional structure composed of rows and columns.
* A table (relation)
58
Components of ERM (3)
Entity
Attributes
Relationship
59
types of degree of a relationhsip (3)
1. Unary
2. Binary
3. n-ary
60
Collection of application programs that perform services for the end users
FILE-BASED SYSTEM
61
Relationship Dependencies (2)
* Mandatory relationship
* Optional relationship
62
represents high-level concepts and relationships between data entities. it's independent of any specific technology or implementation
Conceptual data model
63
– it was created to represent complex data relationship, improve database performance, and impose a database standard.
NETWORK MODEL
64
file based systems typically lack robust security features
Security Concerns
65
Compenents of ER Model (4)
entity
entity set
strong entity
weak entity
66
* It is defined as the information that describes and explains data.
METADATA
67
are rules that apply to a particular database
Specific Integrity Rules
68
ensuring data remains accurate and consistent accross different files is challenging
Data integrity issues
69
* is a computerized system whose overall purpose is to maintain information and make that information available on demand.
DATABASE SYSTEMS
70
* The eight (8) fundamental relational operators are:
Select
Project
Union
Intersect
Difference
Product
Divide
Join
71
representes how data is stored in. collection of tables, each of which is assigned a unique name.
Relational Model
72
* is a data model that describes relationships among entities at the conceptual level with the help of ER diagrams.
ENTITY RELATIONSHIP MODEL (ERM)
73
a type of database that supports multiple users at the same time.
3. Multiuser database
74
* concerns the concept of a primary key
Entity Integrity Constraint
75
is a set of mathematical principles that form the basis for manipulating relational table contents.
* Relational algebra
76
rectangle, also known as an entity box.
Entity
77
- refer to the hiding of unnecessary data from the end-user.
Data Abstraction
78
a model for identifying entities to be represented in the database and representation of how the entities are related.
entity relational model
79
– a database that contains a wide variety of data used in multiple discipline.
9. General-purpose database
80
a movement to find a new and better ways to manage large amounts of web and sensor-generated data and derive business insight from it.
Emerging Data Model: BIG DATA
81
a person, place, thing, or event about which data will be collected and stored.
* Entity
82
can be manipulated to generate useful information.
* Data
83
different files may be formatted or structured differently
Lack of Standardization
84
key attribute that uniquely identifies each entity in the entity set.
weak entity.
85
* The use of relational algebra operators on existing relations (tables) produces new relations is called
closure
86
a type of database that supports data located at a single site.
Centralized Database
87
context of databases refers to a rule or condition applied to the data in a database table. are used to enforce data integrity, ensuring that the data stored in the database meets certain requirements or follows specific rules.
Constraints
88
The result of processing data to reveal its meaning. consist of transformed data and facilities decision making
Information
89
* concerns the concept of a foreign key
Referential Integrity Constraint
90
is a part of mathematical science that deals with sets, or groups of things, and is used as the basis for data manipulation in the relational model.
Set theory
91
a characteristic of an entity.
* Attribute
92
: When there is only ONE entity set participating in a relation. For example, one person is married to only one person.
Unary Relationship
93
- written in singular form
Entity
94
a type of database that supports a relatively small number of users or a specific department within the organization.
4. Workgroup database
95
are ordered and meaningful facts.
Information
96
* Focuses on how the database structure will be used to store and manage end-user data.
DATABASE DESIGN
97
CODASYL
Conference on Data Systems Language
98
Attributes can be classified as (6)
simple or
composite,
single-valued
multi-valued,
key
derived.
99
a metalanguage used to represent and manipulate data elements. Unlike other markup language, XML permits the manipulation of document’s data elements.
EXTENSIBLE MARKUP LANGUAGE
100
Entities are connected by lines, and symbols at either end describe the cardinality of the relationship between the entities.
* Crowfoot notation
101
* The condition to be evaluated is also known as
predicate
102
Ensures that each row in a table is uniquely identifiable by a specific attribute or combination of attributes.
Primary Key Constraint
103
is a field in one table whose values are constrained to be values of the primary key in another table
* Foreign key
104
number of different entity sets participating in a relationship sets
Degree of a Relationship
105
* an attribute composed of a single component with an independent existence
* Simple Attribute
106
– It is the end-users view of the data environment. It refers to the people who use the application programs to manipulate the data and generate information.
3. View or External Level
107
Ensures that a column does not accept null values, requiring every row in the table to have a value for the specified column.
Not Null Constraint
108
represents data in a tree-liked form. q
hierarchical database
109
are rules that apply to all relational database
General Integrity
110
The Three Level of Abstraction:
1. Physical or Internal Model
2. Logical or Conceptual Model
3. View or External Model
111
comprehensive views of information assets and processes across an entire org.
Enterprise Information Models
112
Retrieves unique column values that are associated with all the unique values of another table’s column
DIVIDE
113
number of times an entity of an entity set participates in a relationship
cardinality
114
* an attribute composed of multiple components, each with an independent existence
* Composite Attribute
115
was developed in the 1960’s. It is used to manage large amounts of data for complex manufacturing projects. It has a basic logical structure represented by an upside-down tree.
HIERARCHICAL MODEL
116
- the type of relationship between entities is called ----- and is represented in an ERD by a line.
connectivity
117
is an object of entity type and a set of all students.
entity set
118
When there are TWO entities set participating in a relationship. For example, a Student is enrolled in a Course.
Binary Relationship
119
specifies how many instances of an entity relate to one instance of another entity
Cardinality Notation
120
ANSI
American Nation Standards
121
* an attribute that holds a single value for each occurrence of an entity type
* Single-valued Attribute
122
retrieves subset of rows
SELECT
123
specifies that for every occurrence of entity A there must exist an entity B, and vice versa
* Mandatory relationship
124
a type of database that supports data distributed across several different sites.
7. Distributed database
125
is used extensively in mathematics to provide a framework in which an assertion (statement of fact) can be verified as either true or false.
Predicate logic
126
* represents the database as a collection of relations, with relations pertaining to tables with rows and columns.
RELATIONAL MODEL
127
that has a key attribute. does not depend on other entity in schema.
strong entity
128
Types of Integrity Constraints (2)
Entity Integrity Constraint
Referential Integrity Constraint
129
: Ensures that the values in a column or a group of columns are unique across all rows in a table.
Unique Constraint:
130
broader than data models. represent concepts, entities, relationships and constraints within a specific problem domain or application area. encompass not only the structure of data but also the semantics and rules governing that data.
Information Models
131
* Each table column represents an ---- and each column has a distinct name.
attribute
132
describe associations among data.
Relationship
133
Types of Relational Database (3)
* Primary key
* Domain
* Foreign key
134
components of objected oriented model
Object
Attribute
Class
Class hierarchy
Inheritance
135
* A relatively simple representation, usually graphical, of more complex real-world data structures.
DATA MODEL
136
* A software system that enables users to define, create, maintain and control access to the database.
DATABASE MANAGEMENT SYSTEM (DBMS)
137
a type of database that is used by the entire organization and support many users across many departments.
5. Enterprise database
138
was introduced by Peter Chen in 1976. A graphical representation of entities and their relationships in database structure. It is usually represented by an entity relationship diagram.
ENTITY RELATIONSHIP MODEL
139
Retrieves rows from two tables based on criteria
JOIN
140
abstract representations of the structure and relationships of data within a database.
Data Model
141
- relationships are represented by a diamond connected to the related entities through a relationship line. The relationship name is written inside the diamond.
* Chen notation
142
Types of Data Model
- conceptual
- logical
- physical
143
is a pool of legal values for a given attribute
* Domain
144
Types of Constraints (5):
Primary Key Constraint:
Foreign Key Constraint:
Unique Constraint:
Check Constraint:
Not Null Constraint:
145
The set of allowable values for one or more attributes.
- It defines the potential values that an attribute may hold.
Attribute Domain
146
DATA MODEL BASIC BUILDING BLOCKS (3)
* Entity
* Attribute
* Relationship
147
It represents a global view of the entire database by the entire organization, it is the basis of the and high-level description of the main data objects.
2. Logical or Conceptual Level
