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!
You want to implement following relationships when designing tables. How would you do it?
a.) One-to-one
b.) One-to-many
c.) Many-to-many
a.) One-to-One relationship - can be implemented as a single table and seldom as two tables with foreign and primary key relationships.
b.) One-to-Many relationships - by splitting data into 2 tables with foreign key and primary key relationships.
c.) Many-to-Many - by using a junction table with keys from both tables forming composite primary key of junction table.
The Structured Query Language INTRODUCTION Database is an organised set of information about an entity having controlled redundancy and serves numerous applications. DBMS
Define a view and a trigger. Construct a view for the above relations that have the information about suppliers and the elements they supply. The view holds the S#, SNAME, P# , PNA
Views in relational algebra: 1. Basic expression contains either a) A relation in the database. b) A constant relation. 2. General expressions are madde out of sma
Data Independence This brings us to our next topic: data independence. It is the property of the database which tries to make sure that if we make any change in any level of sc
Advantages And Drawbacks Of Ddbms There are various reasons for building distributed database systems, with sharing of data, reliability and availability, and speedup of query
Create a new user : CREATE USER IDENTIFIED BY Example: //CREATE USER MCA12 IDENTIFIED BY W123 Grant: It is used to give database access permission to users. It is of
what do you mean by consistency in rdbms?
What are the three data anomalies that are likely to occur as a result of data redundancy? Can data redundancy be completely eliminated in database approach? Why or why not? A
Explain the Recoverable Schedule A recoverable schedule is one in which for each pair of transactions Ti and Tj such that Tj reads a data item formerly written by Ti, the comm
#questiontypes of keys examples..
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