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!
Describes the several relationship constraints through giving suitable example?
Constraints on relationships: There are two kinds of constraints on relationships.
1) Mapping cardinalities or cardinality ratios express the number of entities to that another entity can be associated through a relationship set. For a binary relationship set among entities A and B. The mapping cardinality may be any one of the subsequent:
a) One to One: An entity in A is related along with at most one entity in B and an entity in B is related with at most one entity in A.b) One to Many: An entity in A can be related with any number in B but an entity in B is associated with at most one in A.c) Many to one: An entity in A is related with at most one in B but an entity in B is associated with any number in A.d) Many to Many: An entity in A and B can be associated along with any number of entities in the other entity set.
2) Participation constraints: The participation of an entity set E in a relationship set R is said to be total if every entity in E participates within at least one relationship in R. If only a few entities in E participation of entity set E in relationship R is said to be partial.
List the Armstrong's axioms for functional dependencies. What do you understand by soundness and completeness of these axioms? Ans: The Armstrong's axioms are: F1:
What are the advantages of creating a table from existing table?
The First Normal Form (1NF) Let us first describe 1NF: Definition: A relation (table) is in 1NF if 1. There are no duplicate tuples or rows in the relation. 2.
examples of fields in a database
Write short notes on transaction state? A transaction may not always complete its implementation successfully such a transaction is termed aborted A transaction must be in o
pine vally company
Describe the algorithm for updating indices for a single level index when a record is (i) Inserted (ii) deleted What will be the modification if there are multilevel in
Describe Data Manipulation language ? Data Manipulation Language (DML) - A data manipulation language is a language which enables users to access or manipulate data as organize
Association as a cache This association must be updated when any new element is added to it, but testing for overlap using association is more efficient. Figure:
Consider the relations described below: PHYSICIAN (regno, name, telno, city) PATIENT (pname, street, city) VISIT (pname, regno, date_of_visit, fee) Where the regno and pname ide
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