100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
WGU C170 Chapter 1|Latest Update Complete with A+ Graded Answers $10.19   Add to cart

Exam (elaborations)

WGU C170 Chapter 1|Latest Update Complete with A+ Graded Answers

 2 views  0 purchase
  • Course
  • Institution

WGU C170 Chapter 1|Latest Update Complete with A+ Graded Answers AREA In DB2, a named section of permanent storage space that is reserved to store the database. associative entity See composite entity. bridge entity See composite entity. candidate key A minimal superkey; that is...

[Show more]

Preview 2 out of 5  pages

  • May 22, 2024
  • 5
  • 2023/2024
  • Exam (elaborations)
  • Questions & answers
avatar-seller
WGU C170 Chapter 1|Latest Update Complete
with A+ Graded Answers
AREA
In DB2, a named section of permanent storage space that is reserved to store the database.


associative entity
See composite entity.


bridge entity
See composite entity.


candidate key
A minimal superkey; that is, a key that does not contain a subset of attributes that is itself a superkey.
See key.


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. See also linking table.


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 can be looked up.


DIFFERENCE
In relational 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 key 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. See key.


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. See also synonym.


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
See 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.


INTERSECT
In relational algebra, an operator used to yield only the rows that are common to two union-
compatible tables.

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller LectDan. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $10.19. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

75632 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$10.19
  • (0)
  Add to cart