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
What is primary Key Explain? Primary Key - Primary key is one of the candidate keys. It should be selected such in which its attribute values are never, or very rarely, chang
what are the limitations of dbms?
Secondary Indexes Let consider the student database and its clustering index and primary (only one will be applicable at a time). Now consider the state when the database is to
Single Valued Normalisation Codd in the year 1972 formed three normal forms (1NF, 2NF, and 3NF). These were based on functional dependencies between the attributes of a relati
What do you understand by transitive dependencies? Define with an example any two problems that can take place in the database if transitive dependencies are available in the datab
as a customer service employee, explain five measures you would recommend a displeased student to patronise a school canteen
1. Staff (staffID --> availabilityID) 2. Services (servicesID --> itemBasedID --> timedBasedID) 3. TimedBased (timedbasedID--> priceid) 4. Clients (clientId, serviceId-->
In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→ P2 is equivalent to ¬P1 V P2. (The logical implication expression A B, meaning
What is deadlock? How can it be avoided? How can it be resolved once it occurs? Deadlock happens when two transactions are each waiting on a resource that the other transaction
Problem : (b) A deductive database system is essentially the outcome of applying mathematics logic to database management, where logic is used for both data representation and
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