• Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off
Reading...
Front

Card Range To Study

through

image

Play button

image

Play button

image

Progress

1/36

Click to flip

Use LEFT and RIGHT arrow keys to navigate between flashcards;

Use UP and DOWN arrow keys to flip the card;

H to show hint;

A reads text to speech;

36 Cards in this Set

  • Front
  • Back
relation schema
logical design of a relation, contains relation name, list of attributes, and their domains
relation
the entire set of data that is possible for a relation where the values of each tuple are logically related and conform to the proper domains
relation instance
the set of tuples that actually exist in a relation at a given time
tuple
the unordered set of related attribute values for a particular relation
attribute
unordered attribute name and domain
domain
permitted set of values corresponding to data types and other constraints
value
a specific value conforming to the domain of an attribute, must be atomic
atomic
indivisible, not composite
super key
one or more attributes in a relation which can uniquely identify the tuple in which they appear for each and every tuple in the relation
candidate key
a minimal super key, no attributes are in the key that do not help identify the tuple
primary key
a candidate key which is chosen to be the primary means of identifying tuples in a relation
foreign key
the primary key of one relation included in another relation
referential integrity
the value of a foreign key in the referencing relation much appear as a primary key value in the references relation
constraint
values stored much satisfy certain limitations, such as domain, referential integrity, assertions, and authorization
relational algebra
a set of operations that take one or more relation as input and return a relation as output
join
the merging of two relations where pairs of tuples, one from each relation, are combined to form one tuple
Cartesian/cross product
every tuple in a relation is combined with every tuple of another relation
natural join
tuples in a relation are combined with tuples in another relation where the values match on all attributes having the same name
outer join
returns all tuples from the outer side of a join whether they match with a tuple on the other side or not
selection
returns tuples of the input relation that satisfy a predicate
projection
return specified attributes from all tuples, removing duplicates
union
all the tuples from a relation are appended with all tuples from another relation
except/minus/difference
all tuples in a relation not appearing in another relation
intersect
all tuples in a relation r1 that also appear in a relation r2
symmetric difference
all tuples in r1 and r2 except the ones that appear in both
database schema
logical design and structure of a database, table definitions
relational database
the collection of tables
database instance
snapshot of all data in the tables of a database at a specific point in time
table
a visual/physical representation of a relation, made of a heading (columns) and a body (rows), collection of rows
columns
correspond to attributes in a relation schema, are ordered, may be unnamed, and may have duplicates
rows
represents a set of related data values, are ordered, each row in a table has the same structure
entity
represents a thing or object in the real world that is distinguishable from all other objects, must be unique based on the value of its attributes, no duplicates allowed
entity set
set of entities of the same type that share the same properties
entity attributes
descriptive properties possessed by each member of an entity set, each entity has a value for each of its attributes
relationship
association among several entities, deals with particular instances/entities
relationship set
a set of relationships of the same type, each relationship in the set much be unique, attributes of a relationship set are the primary key attributes of each of the entity sets that are being related