Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Database Management > Chapter 2 - Data Models > Flashcards

Chapter 2 - Data Models Flashcards

1
Q

Data Modeling

A

The first step in designing a database. The process of creating a specific data model for a determined problem domain. Iterative, progressive process.

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

Problem Domain

A

Clearly defined area within the real-world environment, with well-defined scope and boundaries that will be systematically addressed.

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

Data Model

A

Relative simple representation of more complex real-world data structures. An abstraction.

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

What should an implementation-ready data model contain?

A

1) A description of the data structure that will store end-user data.
2) A set of enforceable rules to guarantee data integrity.
3) A data manipulation methodology to support the real-world data transformations.

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

Entity

A

A person, place, thing or event about which data will be collected and stored. Each entity occurrence is unique and distinct.

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

Attribute

A

A characteristic of an entity. Equivalent of fields in file systems.

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

Relationship

A

Describes an association among entities. Three types of relationships. One-to-many, many-to-many, and one-to-one. Relationships are bidirectional.

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

One-to-many (1:M or 1..*) relationship

A

Example: A painter creates many different paintings, but each painting has only one painter.

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

Many-to-Many (M:N or ..) relationship

A

Example: An employee may learn many job skills, and each job skill may be learned by many employees.

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

One-to-One (1:1 or 1..1) relationship

A

Example: Each store managed by single employee, and each employee manages only a single store.

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

Constraint

A

A restriction placed on the data. Ensure data integrity.

Example: Student’s GPA must be between 0.00 and 4.00.

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

Business rule

A

A brief, precise, and unambiguous description of a policy, procedure, or principle within a specific organization. Used to define entities, attributes, relationships and constraints.

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

Hierarchical model

A

Developed in 1960s to manage large amounts of data for complex manufacturing projects. Basic logical structure represented by an upside down tree. Contains segments.

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

Segment

A

The equivalent of a file system’s record type. A higher layer is perceived as parent of segment directly beneath it, which is called the child.

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

Network model

A

Created to represent complex data relationships more effectively than Hierarchical, improve database performance, and impose database standard. Unlike Hierarchical, allows a record to have more than one parent.

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

Schema

A

Conceptual organization of the entire database as viewed by the database administrator.

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

Subschema

A

The portion of the database “seen” by the application programs that actually produce desired information from the data within the database.

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

Data Manipulation Language (DML)

A

Defines the environment in which data can be managed. Used to work with the data in the database.

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

Data Definition Language (DDL)

A

Enables the database administrator to define the schema components.

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

Relational Model

A

Introduced in 1970 by E.F. Codd of IBM. Based on mathematical set theory and represents data as independent relations.

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

Relation (AKA Table)

A

Matrix composed of intersecting rows and columns.

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

Tuple

A

Each row in a relation in a database.

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

Relational Database Management System (RDBMS)

A

Collection of programs that manages a relational database. Translates user’s logical requests (queries) into commands that physically locate and retrieve requested data.

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

Relational Diagram

A

A representation of the relational database’s entities, the attributes within those entities, and the relationships between those entities.

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

Entity Relationship (ER) Model

A

A data model that describes relationships among entities at the conceptual level with help of ER diagrams. Developed by P. Chen in 1975.

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

3 Vs

A

Three basic characteristics of Big Data databases: Volume, Velocity, and Variety

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

American National Standards Institute (ANSI)

A

The group that accepted the DBTG (Database Task Group) recommendations and augmented database standards in 1975 through its SPARC committee.

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

Big Data

A

A movement to find new and better ways to manage large amounts of web-generated data and derive business insight from it, while simultaneously providing high performance and scalability at a reasonable cost.

29
Q

Chen notation

A

ER model notation by Peter Chen. Connectivites written next to each entity box. Relationships represented by a diamond connected to related entities, with relationship name in the diamond.

30
Q

class

A

A collection of similar objects with shared structure (attributes) and behavior (methods). A class encapsulates an object’s data representation and a method’s implementation. Classes organized in a class hierarchy.

31
Q

class diagram

A

Diagram used to represent data and their relationships in UML object notation.

32
Q

class diagram notation

A

Set of symbols used in the creation of class diagrams.

33
Q

class hierarchy

A

The organization of classes in a hierarchical tree in which each parent class is a Superclass and each child class is a Subclass.

34
Q

client node

A

One of three types of nodes used in the HDFS. Client node acts as the interface between the user application and the HDFS.

35
Q

conceptual model

A

The output of the conceptual design process. Provides a global view of an entire database and describes the main data objects, avoiding details.

36
Q

conceptual schema

A

Representation of the conceptual model, usually expressed graphically.

37
Q

connectivity

A

The classification of the relationship between entities, such as 1:1, 1:M and M:N

38
Q

Crow’s Foot notation

A

Representation of the entity relationship diagram that uses a three-pronged symbol to represent the “many” sides of the relationship.

39
Q

Data Node

A

One of three types of HDFS nodes. The data node stores fixed-size data blocks, that could be replicated to other data nodes.

40
Q

entity instance

A

in ER modeling, a specific table row. Also known as entity occurrence.

41
Q

entity relationship diagram (ERD)

A

A diagram that depicts an entity relationship model’s entities, attributes, and relations.

42
Q

entity set

A

In a relational model, a grouping of related entities.

43
Q

eventual consistency

A

A model for database consistency in which updates to the database will propagate through the system so that all data copies will be consistent eventually. A feature in some NoSQL databases.

44
Q

extended relational data model (ERDM)

A

A model that includes the object-oriented model’s best features in an inherently simpler relational database structural environment.

45
Q

Extensible Markup Language (XML)

A

A metalanguage used to represent and manipulate data elements. Permits manipulation of a document’s data elements. Facilitates exchange of structured documents such as orders and invoices over the internet.

46
Q

external model

A

Application programmer’s view of the data environment. An external model works with a data subset of the global database schema.

47
Q

external schema

A

Specific representation of an external view. The end user’s view of the data environment.

48
Q

Hadoop

A

A java based, open source, high speed, fault-tolerant distributed storage and computational framework. Uses low-cost hardware to create clusters of thousands of computer nodes to store and process data.

49
Q

Hadoop Distributed File System (HDFS)

A

A highly distributed, fault-tolerant file storage system designed to manage large amounts of data at high speeds.

50
Q

Hardware Independence

A

A condition in which a model does not depend on the hardware used in the model’s implementation. Therefore, changes in the hardware will have no effect on the database design at the conceptual level.

51
Q

Inheritance

A

In object-oriented data model, the ability of an object to inherit the data structure and methods of the classes above it in the class hierarchy.

52
Q

Internal model

A

In database modeling, a level of data abstractions that adapts the conceptual model to a specific DBMS model for implementation. It is the representation of a database as “seen” by the DBMS. It requires a designer to match the conceptual model’s characteristics and constraints to those of the selected implementation model.

53
Q

Internal Schema

A

A representation of an internal model using the database constructs supported by the chosen database.

54
Q

key-value

A

A data model based on a structure composed of two data elements: a key and a value, in which every key has a corresponding value or set of values. AKA the associate or attribute-value data model.

55
Q

logical design

A

Stage in design phase that matches conceptual design to requirements of the selected DBMS. Software-dependent. Used to translate conceptual design into internal model for a selected DBMS, such as DB2, SQL Server, Oracle, IMS, Informix, Access or Ingress.

56
Q

logical independence

A

A condition in which the internal model can be changed without affecting the conceptual model. The internal model is hardware-independent because unaffected by computer on which software is installed. A change in storage devices or OS will not affect internal model.

57
Q

MapReduce

A

An open-source application programming interface (API) that provides fast data analytics services. One of the main Big Data technologies that allows organizations to process massive data stores.

58
Q

method

A

In the object-oriented data model, a named set of instructions to perform an action. Represent real-world actions, and invoked through messages.

59
Q

name node

A

One of three types of nodes used in HDFS. Stores all the metadata about the file system.

60
Q

NoSQL

A

A new generation of database management systems that is not based on the traditional relational database model.

61
Q

object

A

An abstract representation of a real-world entity that has a unique identity, embedded properties, and the ability to interact with other objects and itself.

62
Q

object/relational database management system (O/R DBMS)

A

A DBMS based on the extended relational model (ERDM) .The ERDM is relational model’s response to the OODM. This model includes many of the object-oriented model’s best features within an inherently simpler relational database structure.

63
Q

object-oriented data model (OODM)

A

A data model whose basic modeling structure is an object. Both data and their relationships are contained in an object.

64
Q

physical independence

A

A condition in which the physical model can be changed without affecting the internal model.

65
Q

physical model

A

A model in which physical characteristics such as location, path, and format are described for the data. Is both hardware- and software-dependent.

66
Q

semantic data model

A

Data model that more closely represented the real world, modeling both data and their relationships in a single structure known as an object. Semantic indicates meaning. The SDM was published in 1981 by M. Hammer and D. McLeod.

67
Q

software independence

A

A property of any model or application that does not depend on the software used to implement it.

68
Q

sparse data

A

A case in which the number of table attributes is very large but the number of actual data instances is low.

69
Q

Unified Modeling Language (UML)

A

A language based on object-oriented concepts that provides tools such as diagrams and symbols to graphically model a system.

Database Management (4 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions