62360639

Question 1
a. This is an innovative and new type of data base design that does not follow the normal and
ubiquitous design properties of the relational databases. MongoDB isa good example of NoSql. It is
new and still needs work but is useful in some instances.
b. This is database design that takes its influence from object oriented programming. It uses objects to
describe a relation. The object contains all the information like the relations of that specific object.
We use things like uml diagrams to represent these objects best.
c. This is a set of rules, a sort of checklist, to make sure the data base one has designed is certainly a
relational one, hence the name. It has rules like, “ The database must support set-level inserts,
updates, and deletes. “ Which describe exactly what a relational database should be.
d. One way to improve the design of a database after normalization is to make sure that it cannot be
subdivided anymore. This makes querying objects a much more flexible task. Like when we have a
table that has things like the type of animal by family. This is atomic because then you have a super
specific value.
e. The idea of recursion is one that describes being able to refer cyclically in database design. This is
best shown with a column type that describes the interpersonal relationships within a company or
school. Imagine the marital status of 2 employees in a company are stored. The one employee
would be married to another employee in the company and then the database would recursively
refer to the other via the status of their relationship.
f. When designing a database you will almost always want to describe structures that describe
specialized values of the rows in those tables like the fact that students do a specific subject. This is
called the specialization hierarchy. Now in the specialization hierarchy there is a thing that
describes when the specialized table structures you created have no values in common in any
shape or form. That is what is described as disjointed subtypes. This is identified when two animals
exist in different habitats if their supertype or main describer is the relation of animals.

Question 2
a. It refers to the 3 properties of Big Data which are velocity, volume and variety.
b.
- A primary key not changing over time is super desirable. Having to update a primary key makes
things super complicated for database managers because it might bring update anomalies that
would take an abhorrent amount of time to fix.
- The primary keys that are security compliant is also very desirable. Primary keys that make use
of peoples secure data can be very bad. Saving things like credit card numbers as primary keys
would be unsafe and detrimental to a business.
- The fact that a primary key is not one that has some internal meaning to it. Like the Name and
family type of an animal would make an ohkay PK but it wouldn’t make a great one.
- Prefereably a numerical primary key is good so that makes the PK super easy to deal with like
making use of the automatic increment of the DBMS.
- Obviously it must be unique. We must make sure the PK has the ability to return specifi
information from the DB.
- The least number primary key is desirable because you are making use of less number of
updateable values.
-
c. Second normal form is a databas that has tables that are already in 1 Normal form and that have all
the partial dependancies removed. This means that that values that are dependant one value of a
 composite key are separated to tables that focus on the one key made into a primary key. Tables
not in 2NF can have problems like update, deletion or Insertion anomalies which is basically to say
that updating deleting and inserting values in the database might not occur in all the places you
want it to. Putting it in 2nf makes sure that you have possibly one place to put values of a database.

Question 3
a.

i. B & D - > Are composite Primary keys and they each identify the desirable attributes..
C F G - > These are the desirable attributes… these are identified by the primary keys.
B & C - > This shows a Partial Dependancy
F & G - > This describe a Transitive dependancy
ii. 

Table name: Student

Transitive
Dependency
Table Name: Class

Semester_Pro
name Stud_surname Subject ject
Class_ID Class_Name credits Semester

Table Name: Professors

of_Name Prof_lastname Department
 iii.

me: Students

Table Name: Classes

t_ID Stud_name Stud_surname Subject

Class_ID Class_Name credits Semester

Table Name: Professors

Table Name: Subjects

Prof_Name Prof_lastname Department

Semester_pro
subjet ject
 Question 4
Recording
Track
Question 5
a. :O
1. Not a Key
2. Is a Key
3. Not a key
4. Not a key
5. Is a key
6. Is a kye
b. :D
1. Functional dependence
2. Not a Functional dependence Artist
3. Not a Functional Dependance
4. Not a Functional Dependance
5. Functional Dependance
6. Not a Functional Dependance
c. SELECT TOP 3 * FROM ARTICLES;
d. COMMIT;
e. UPDATE ARTICLES
SET TITLE=Social competency
WHERE NUMBER=770;
f. 
1. Invalid
2. Invalid
3. Valid
4. Valid
5. Valid
6. INVALID
g. :\
1. 3 Tuples
2. 2 Tuples
3. 1 Tuple
4. No Tuple