Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Before we talk about the relational model in more detail, let us first define some very basic terms used in this model.
Tuple
Every row in a table shows a record and is called a tuple. A table containing 'n' attributes in a record is called n-tuple.
Attribute
The name of every column in a table is used to interpret its meaning and is known as an attribute. Every table is called a relation.
For instance, Figure shows a relation PERSON. The columns NAME, PERSON_ID, AGE and ADDRESS are the attributes of PERSON and every row in the table represents a separate tuple (record).
Relation Name: PERSON
PERSON_ID
NAME
AGE
ADDRESS
TELEPHONE
1
Sanjay Prasad
35
b-4,Modi Nagar
011-25347527
2
Sharad Gupta
30
Pocket 2, Mayur Vihar.
023-12245678
3
Vibhu Datt
36
c-2, New Delhi
033-1601138
Figure: An extended PERSON relation
Attributes attached to an entity can be of various types. Simple The attribute that cannot be further separated into smaller parts and shows the basic meaning is known as a
State your technical objectives for mining the data. Data Understanding. Describe the data For each attribute, give its description and data type. For numeric attributes
What are domain constraints? A domain is a set of values that might be assigned to an attribute .all values that appear in a column of a relation must be taken from the similar
WOUND-WAIT
explain exhaustively the problems associated with ER diagrams. include illustrations in your answer
properties of derirable decomposition
Decompose the table with the following description and functional dependencies into a set of equivalent tables normalized to 3NF or BCNF. This database stores records from a (ve
Define data conversion? Helpful to load data into temporary staging tables. Then can write SQL code to do much of data processing. SQL code is simpler and faster to write than
What is a candidate key? Minimal super keys are known as candidate keys.
Create 1 experiment to demonstrate an aspect of query optimisation by using access-path structures (indexes), decomposition, or denormalisation. Once satisfied with your experiment
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd