Mis 398-Test 1

Front 1

Database

Back 1

Anorganized collection of logically related data

Front 2

Data

Back 2

Stored representations of objects and events that havemeaning and importance in the users environment

Front 3

Information

Back 3

- Data that has been processed in such a way to increase theknowledge of a person who uses the data

Front 4

Metadata

Back 4

Data that describes the properties or characteristics of enduser data and the context of that data

Front 5

Databaseapplication

Back 5

An application program (or set of related programs) that isused to perform a series of data base activities (create, read, update anddelete)

Front 6

DataModel

Back 6

Graphicalsystems used to capture the relationships of data

Front 7

Entity

Back 7

A person, place, object, event or a concept in the userenvironment about which the organization wishes to maintain data

Front 8

Relationaldatabase

Back 8

A database that represents data as a collection of tables inwhich all data relationships are represented by common values in related tables

Front 9

DBMS

Back 9

Is a software system that is used to create, maintain, andprovide controlled access to its user data base. (ex. Access, MySQL, oracle)

Front 10

Dataindependence

Back 10

Theseparation of data descriptions from application programs that use the data

Front 11

Userview

Back 11

a logical description of some portion of the database thatis required by a user to perform some task

Front 12

Constraint

Back 12

arule that cannot be violated by database users

Front 13

Databasemodeling and design tools

Back 13

software tools that provide automated support for creatingdata models

Front 14

Repository

Back 14

acentralized knowledge base of all data definitions, data relationships, screenand report formats and other system components

Front 15

Enterprisedata modeling

Back 15

the first step in data base development in which the scopeand general contents of organizational databases are specified

Front 16

SDLC-

Back 16

the traditional methodology used to develop, maintain andreplace information systems

Front 17

Conceptualschema

Back 17

a detailed, technology-independent specification of theoverall structure of organizational data (look up more about- pg. 20)

Front 18

Logicalschema

Back 18

the representation of a database for a particular datamanagement technology

Front 19

Physicalschema

Back 19

specifications for how data from alogical schema are stored in a computer’s secondary memory by a DBMS

Front 20

***(LOOK UP MORE DEF A QUESTION ON THE TEST)***

Front 21

Prototyping

Back 21

aniterative process of systems development in which requirements are converted toa working system that is continually revised through close work betweenanalysts and users

Front 22

Agilesoftware development

Back 22

an approach to database and software development thatemphasizes “individuals and interactions over processes and tools, workingsoftware over comprehensive documentation, customer collaboration over contractnegotiation, and response to change over a following plan”

Front 23

Project

Back 23

a planned undertaking of related activities to reach anobjective that has a beginning and an end

Front 24

Enterpriseresource planning

Back 24

A business managements system that integrates all functionsof the enterprise, such as manufacturing, sales, finance, marketing, inventory,accounting, and human resources. ERP systems that provides the data necessaryfor the enterprise to examine and manage its activities

Front 25

DataWarehouse

Back 25

an integrated decision support database whose content isderived from various operational databases (LOOK UP MORE- pg. 30)

Front 26

EntityRelationship model

Back 26

alogical representation of the data for an organization or for a business area,using entities for categories of data relationships for associations betweenentities

Front 27

ERdiagram

Back 27

a graphical relationship of a entity-relationship model

Front 28

BusinessRule

Back 28

– Astatement that defines or constrains some aspect of the business. It isintended to assert business structure or to control or influence the behaviorof a business

Front 29

Term

Back 29

a word or phrase that has a specific business meeting

Front 30

Fact

Back 30

An association between two or more terms

Front 31

Entity

Back 31

aperson, place, an object, an event or a concept in the user environment aboutwhich the organization wishes to maintain data.

Front 32

Entitytype

Back 32

- acollection of entities that share common properties or characteristics

Front 33

Entityinstance

Back 33

asingle occurrence of an entity type

Front 34

Strongentity type

Back 34

anentity that exists independently of other entity types

Front 35

Weakentity type

Back 35

-an entity whose existence depends on some other entity type

Front 36

Identifyingowner

Back 36

theentity type on which the weak entity type depends

Front 37

Identifyingrelationship

Back 37

therelationship between a weak entity type and its owner

Front 38

Attribute

Back 38

a property or characteristic of an entity or relationshiptype that is of interest to the organization

Front 39

Requiredattribute

Back 39

an attribute that must have a value for every entity (orrelationship) instance with which it is associated

Front 40

Optionalattribute

Back 40

anattribute that many not have a value for every entity (or relationship)instance with which it is associated

Front 41

(LOOK UP MORE ABOUT PG- 69)

Front 42

Compositeattribute

Back 42

- an attribute that has meaningful component parts(attributes)

Front 43

Single(or atomic) attributes

Back 43

an attribute that cannot be broken down into smallercomponents that are meaningful to the organization

Front 44

Multivaluedattribute

Back 44

an attribute that may take on more than one value for agiven entity (or relationship) instance

Front 45

Deriverattribute

Back 45

anattribute whose values can be calculated from related attribute values

Front 46

Identifier

Back 46

an attribute (or combination of attributes) whose valuedistinguishes instances of an entity type

Front 47

CompositeIdentifier

Back 47

anidentifier that consists of a composite attribute

Front 48

Relationshiptype

Back 48

- a meaningful association between (or among) entity types

Front 49

Relationshipinstance

Back 49

an association between (or among) entity instances whereeach relationship instance associates exactly one entity instance from eachparticipating entity type

Front 50

Associativeentity

Back 50

anentity type that associates the instances of one or more entity types andcontains attributes that are particular to the relationships between thoseentity instances

Front 51

Degree

Back 51

-the number of entity types that participate in a relationship

Front 52

Urinaryrelationship

Back 52

a relationship between instances of a single entity type

Front 53

Binaryrelationship

Back 53

a relationship between the instances of two entity types

Front 54

Ternaryrelationship

Back 54

asimultaneous relationship among the instances of three entity types

Front 55

Cardinalityconstraint

Back 55

a rule that specifies the number of instances of one entitythat can (or must) be associated with each instance of another entity

Front 56

MinimumCardinality

Back 56

the minimum number of instances of one entity that may beassociated with each instance of another entity

Front 57

MaximumCardinality

Back 57

themaximum number of instances of one entity that may be associated with eachinstance of another entity

Front 58

TimeStamp

Back 58

atime value that is associated with a data value, often indicating when someevent occurred that affected the data value

Front 59

EERmodel

Back 59

a model that has reunited from extending the original E-Rmodel with new modeling conducts

Front 60

Subtype

Back 60

a subgrouping of the entities in an entity type that ismeaningful to the organization and that shares common attributes orrelationships distinct from other subgroupings

Front 61

Suptertype

Back 61

- ageneric entity type that has a relationship with one or more subtypes

Front 62

Attributeinheritance

Back 62

aproperty by which subtype entities inherit values of all attributes andinstances of all relationships of their super types

Front 63

Generalization

Back 63

- the process of defining a more general entity type from aset of more specialized entity types

Front 64

Specialization

Back 64

theprocess of defining one or more subtypes of the supertypes and forming a supertype/subtype relationships

Front 65

Completenessconstraint

Back 65

atype of constraint that address whether an instance of a supertype must also bea member of at least one subtype

Front 66

Totalspecialization rule

Back 66

- arule that specifies that an entity instance of a supertype must be a member ofsome subtype in the relationship

Front 67

Partialspecialization rule

Back 67

arule that specifies that an entity instance of a supertype is allowed not tobelong to any supertype

Front 68

Disjointconstraint

Back 68

a constrains that addresses whether an instance of asupertype may simultaneously be a member of two or more subtypes

Front 69

Disjointrule

Back 69

arule that specifies that an instance of a supertype may not simultaneously be amember of two or more subtypes

Front 70

Overlaprule

Back 70

arule that specifies that an instance of a supertype may simultaneously be amember of two or more subtypes

Front 71

Subtypediscriminatior

Back 71

anattribute of a supertype whose values determines the target supertypes or subtypes

Front 72

Supertype/subtypehierarchy

Back 72

ahierarchical arrangement of supertypes and subtypes In which each subtype hasonly one supertype

Front 73

EntityCluster

Back 73

aset of one or more entity types and associated relationships grouped into a single abstract entity type

Front 74

Universaldata model

Back 74

ageneric or template data model that can be reused as a starting point for adata modeling project

Front 75

Relation

Back 75

anamed two dimensional table of data

Front 76

PrimaryKey

Back 76

anattribute or a combination of attributes that uniquely identifies each row in arelation

Front 77

Compositekey

Back 77

aprimary key that consists of more than one attribute

Front 78

Foreignkey

Back 78

anattribute in a relation that serves as the primary key of another relation inthe same database

Front 79

Entityintegrity rule

Back 79

arule that states that no primary key attribute (or component of primary keyattribute) may be null

Front 80

Referentialintegrity constraint

Back 80

Arule that states that either each foreign key value must match a primary keyvalue in another relation or the foreign key value must be a null

Front 81

Well-structuredrelation

Back 81

a relation that contains minimal redundancy an allows usersto insert, modify, and delete the rows in a table without errors orinconsistencies

Front 82

Anomaly

Back 82

- an error or inconsistency that may result when a userattempts to update a table that contains redundant data. Insertion, deletion,and modification anomalies are the three types of errors

Front 83

Surrogateprimary key

Back 83

a serial number or other system assigned primary key for arelation

Front 84

Recursiveforeign key

Back 84

aforeign key in a relation that references the primary key values of the samerelation (LOOK UP MORE pg. 173)

Front 85

Normalization

Back 85

theprocess of decomposing relations with anomalies to produce smaller,well-structured relations

Front 86

NormalForm

Back 86

a state of a relation that requires that certain rulesregarding relationships between attributes (or functional dependencies) aresatisfied

Front 87

Functionaldependency

Back 87

aconstraint between two attributes in which the value of one attribute isdetermined by the value of another attribute

Front 88

Determinant

Back 88

the attribute on the left side of the arrow in a functionaldependency

Front 89

Candidatekey

Back 89

- an attribute or combination of attributes that uniquelyidentifies a row in a relation

Front 90

(LOOK UP MORE ABOUT pg. 181)

Front 91

Firstnormal form

Back 91

– arelation that has a primary key and in which there are no repeating groups

Front 92

Secondnormal form

Back 92

- arelation in first normal form in which every nonkey attribute is fullyfunctionally dependent on the primary key

Front 93

Partialfunctional dependency

Back 93

afunctional dependency in which one or more nonkey attributes are functionallydependant on part (but not all) of the primary key

Front 94

Thirdnormal form

Back 94

arelation that is in second normal form and has no transitive dependencies

Front 95

Transitivedependency

Back 95

a functional dependency between the primary key and one ormore nonkey attributes that are dependent on the primary key via another nonkeyattribute

Front 96

Synonyms

Back 96

twoor more attibutes that have different names but the same meaning

Front 97

Homonym

Back 97

- an attribute that may have more than one meaning

Front 98

EnterpriseKey

Back 98

aprimary key whose value is unique across all relations

Front 99

Field

Back 99

the smallest unit of application data recognized by systemsoftware

Front 100

DataType

Back 100

adetailed coding scheme recognized by system software such as a DBMS, forrepresenting organizational data

Front 101

Denormalization

Back 101

- The process of transforming normalized relations intononnormalized physical specifications (LOOK UP MORE ABOUT pg. 214)

Front 102

Horizontalpartitioning

Back 102

distributionof row of a logical relation into several separate tables

Front 103

Verticalpartitioning

Back 103

distribution of columns of a logical relation into severalseparate tables

Front 104

Physicalfile

Back 104

- anamed portion of secondary memory such as a (hard disk) allocated for the purpose of storing physical record

Front 105

Tablespace

Back 105

anamed logical storage unit in which data from one or more database tables,views, or other database objects may be stored

Front 106

Extent

Back 106

- acontiguous section of disk storage space

Front 107

Fileorganization

Back 107

a technique for physically arranging the records of a fileon secondary storage devices

Front 108

Sequentialfile organization

Back 108

thestorage of records in a file in sequence according to a primary key value

Front 109

Indexfile organization

Back 109

thestorage of records either sequentially or nonsequentially with an index thatallows software to locate individual records

Front 110

Index

Back 110

atable or other data structure used to determine in a file the location ofrecords that satisfy some condition

Front 111

Secondarykey-

Back 111

onefield or combination of fields for which more than one record may have the samecombination of values. Also called a nonunique key

Front 112

Joinindex

Back 112

An index on columns from two or more tables that come fromthe same domain of values

Front 113

Hashedfile organization

Back 113

astorage system in which the address for each record is determined using ahashing algorithm

Front 114

Hashingalgorithm

Back 114

a routine that converts a primary key value into a relativerecord number or relative file address

Front 115

Hashindex table

Back 115

afile organization that uses hashing to map a key into a location in an index,where there is a pointer to the actual data record matching the hash key

Front 116

Pointer

Back 116

afield of data indicating a target address that can be used to locate a relatedfield or record of data