Geschreven door studenten die geslaagd zijn Direct beschikbaar na je betaling Online lezen of als PDF Verkeerd document? Gratis ruilen 4,6 TrustPilot
logo-home
Tentamen (uitwerkingen)

WGU C170 Chp 1 ALREADY PASSED

Beoordeling
-
Verkocht
-
Pagina's
5
Cijfer
A+
Geüpload op
01-12-2023
Geschreven in
2023/2024

AREA - in DB2, a named section of permanent storage space that is reserved to store the database. associative entity - another name for composite entity, bridge entity or linking table bridge entity - another name for composite entity, associative entity or linking table candidate key - a minimal superkey; that is, a key that dows not contain a subset of attributes that is itself a superkey. closure - A property of relational operators that permits the use of relational algebra operators on existing tables (relations) to produce new relations. composite entity - An entity designed to transform an M:N relationship into two 1:M relationships. The composite entity's primary key comprises at least the primary keys of the entities that it connects. Also known as a bridge entity or associative entity. composite key - A multiple-attribute key. dependent - an attribute whose value is determined by another attribute. determination - The role of a key. In the context of a database table, the statement "A determines B" indicates that knowing the value of attribute A means that the value of attribute B an be looked up DIFFERENCE - In relation algebra, an operator used to yield all rows from one table that are not found in another union-compatible table. DIVIDE - In relational algebra, an operator that answers queries about one set of data being associated with all values of data in another set of data

Meer zien Lees minder
Instelling
Vak

Voorbeeld van de inhoud

WGU C170 Chp 1 ALREADY PASSED

AREA - ✔✔in DB2, a named section of permanent storage space that is reserved to store the
database.



associative entity - ✔✔another name for composite entity, bridge entity or linking table



bridge entity - ✔✔another name for composite entity, associative entity or linking table



candidate key - ✔✔a minimal superkey; that is, a key that dows not contain a subset of attributes
that is itself a superkey.



closure - ✔✔A property of relational operators that permits the use of relational algebra operators
on existing tables (relations) to produce new relations.



composite entity - ✔✔An entity designed to transform an M:N relationship into two 1:M
relationships. The composite entity's primary key comprises at least the primary keys of the entities
that it connects. Also known as a bridge entity or associative entity.



composite key - ✔✔A multiple-attribute key.



dependent - ✔✔an attribute whose value is determined by another attribute.



determination - ✔✔The role of a key. In the context of a database table, the statement "A
determines B" indicates that knowing the value of attribute A means that the value of attribute B an
be looked up



DIFFERENCE - ✔✔In relation algebra, an operator used to yield all rows from one table that are not
found in another union-compatible table.



DIVIDE - ✔✔In relational algebra, an operator that answers queries about one set of data being
associated with all values of data in another set of data

, domain - ✔✔In data modeling, the construct used to organize and describe an attribute's set of
possible values.



entity integrity - ✔✔The property of a relational table that guarantees each entity has a unique value
in a primary key and that the keys has no null values.



equijoin - ✔✔A join operator that links tables based on an equality condition that compares specified
columns of the tables



flags - ✔✔Special codes implemented by designers to trigger a required response, alert end users to
specified conditions, or encode values. Flags may be used to prevent nulls by bringing attention to
the absence of a value in a table.



foreign key (FK) - ✔✔An attribute or attributes in one table whose values must match the primary
key in another table or whose values must be null.



full functional dependence - ✔✔A condition in which an attribute is functionally dependent on a
composite key but not on any subset of the key



functional dependence - ✔✔Within a relation R, an attribute B is functionally dependent on an
attribute A if and only if a given value of attribute A determines exactly one value of attribute B. The
relationship "B is dependent on A" is equivalent to "A determines B" and is written as A B.



homonyms - ✔✔The use of the same name to label different attributes. Homonyms generally should
be avoided. Some relational software automatically checks for homonyms and either alerts the user
to their existence or automatically makes the appropriate adjustments.



index - ✔✔An ordered array of index key values and row ID values (pointers). Indexes are generally
used to speed up and facilitate data retrieval. Also known as an index key.



index key - ✔✔another term for index



inner join - ✔✔A join operation in which only rows that meet a given criterion are selected. The join
criterion can be an equality condition (natural join or equijoin) or an inequality condition (theta join).
The inner join is the most commonly used type of join. Contrast with outer join.

Geschreven voor

Vak

Documentinformatie

Geüpload op
1 december 2023
Aantal pagina's
5
Geschreven in
2023/2024
Type
Tentamen (uitwerkingen)
Bevat
Vragen en antwoorden

Onderwerpen

$10.99
Krijg toegang tot het volledige document:

Verkeerd document? Gratis ruilen Binnen 14 dagen na aankoop en voor het downloaden kun je een ander document kiezen. Je kunt het bedrag gewoon opnieuw besteden.
Geschreven door studenten die geslaagd zijn
Direct beschikbaar na je betaling
Online lezen of als PDF

Maak kennis met de verkoper
Seller avatar
eustacemaina122

Maak kennis met de verkoper

Seller avatar
eustacemaina122 USIU
Volgen Je moet ingelogd zijn om studenten of vakken te kunnen volgen
Verkocht
1
Lid sinds
3 jaar
Aantal volgers
1
Documenten
519
Laatst verkocht
1 jaar geleden

0.0

0 beoordelingen

5
0
4
0
3
0
2
0
1
0

Recent door jou bekeken

Waarom studenten kiezen voor Stuvia

Gemaakt door medestudenten, geverifieerd door reviews

Kwaliteit die je kunt vertrouwen: geschreven door studenten die slaagden en beoordeeld door anderen die dit document gebruikten.

Niet tevreden? Kies een ander document

Geen zorgen! Je kunt voor hetzelfde geld direct een ander document kiezen dat beter past bij wat je zoekt.

Betaal zoals je wilt, start meteen met leren

Geen abonnement, geen verplichtingen. Betaal zoals je gewend bent via iDeal of creditcard en download je PDF-document meteen.

Student with book image

“Gekocht, gedownload en geslaagd. Zo makkelijk kan het dus zijn.”

Alisha Student

Bezig met je bronvermelding?

Maak nauwkeurige citaten in APA, MLA en Harvard met onze gratis bronnengenerator.

Bezig met je bronvermelding?

Veelgestelde vragen