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
Explain Thomas' Write rule. Show how it is different from timestamp ordering protol Ans: In timestamp-based concurrency control the thomas Write rule is a rule. Given a Timest
describe objectivde of file organisation
What are called index-sequential files? The files that are ordered sequentially with a primary index on the search key are known as index-sequential files
Heap files (unordered file) Mostly these files are unordered files. It is the easiest and most basic type. These files having of randomly ordered records. The records will have
By using the delete operation some consisting records can be deleted from a relation. To delete some definite records from the database a condition is also specified based on which
Give a sample of the Dynamic Model. The sample of dynamic model is given below: Dynamic model for the car: Brake and Accelerator Brake or Applies Accelerator
Explain trivial dependency? Functional dependency of the form α ->β. is trivial if α C β. Trivial functional dependencies are satisfied by all the relations.
Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen
The data of a view is not physically stored, but derived from one or more tables. True the data of a view is not physically stored
Aggregation : One limitation of the E-R diagram is that they do not permit representation of relationships between relationships. In such a case the relationship along with its ent
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