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!
What is inheritance? Define it in detail?
Inheritance
Inheritance can be at the levels of types, or at the level of tables we first consider inheritance of types, then inheritance at the level of labels.
Type inheritance
Assume that we have the following type definition for people
create type person
(name varchar(20)
address varchar(20))
Table inheritance
Create table people of person
The consistency requirements for sub tables are
1. Each tuple of the sub table can correspond to at most single tuple in each of its immediate sub tables.
2. SQL:1999 has an additional constraint that all the tuples corresponding to each other must be derived from single tuple .
What do you mean by an execution plan? Why is it used? How will you view it? a.) An execution plan can be known as a road map which textually or graphically illustrates the dat
What is banker's algorithm? Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource ty
Define Query by Example QBE is a query language relies upon domain calculus and has two dimensional syntax. The queries are written in the horizontal and vertical dimensions of
What is Relational calculus? Relational calculus is a Non- Procedural language.
Shared lock or Read Lock It is requested by a transaction that needs to just read the value of data item. A shared lock on a data item does not permit an exclusive lock
What are the drawbacks of shadow-paging technique? The drawbacks of shadow paging is:- a) Commit Overhead b) Data fragmentation c) Garbage collection
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.
Cardinality of Relationship One-to-One Only one entity of the first set is linked to only one entity of the second set. E.g. A teacher teaches a student. Only one teacher
What are metrics for choosing the best algorithm? Matrices for choosing the best algorithms are as below: Computational complexity Ease of understand ability and im
1. Which relational algebra operations do not need the participating tables to be union-compatible? Ans: Join is the relational algebra operations that do not need the particip
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