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!
Define the basic operations of the relational algebra?
Ans: Basic operators of relational algebra are:
1. Union (∪) - Selects tuples which are in either P or Q or in both of them. The duplicate tuples are removed.
R = P ∪ Q
2. Difference or Minus (-) - eliminates common tuples from the first relation.
R = P - Q
3. Cartesian Product or Cross Product (×) - The cartesian product of two relations is the concatenation of tuples that are belonging to the two relations and containing all possible combination of the tuples.
R = P× Q
4. Projection (π) - The projection of a relation is illustrated as a projection of all its tuples over some set of attributes that is it yields a vertical subset of the relation. The relation's projection T on the attribute A is presented by T [A] or πA(T),.
5. Selection (σ) - Selects just some of the tuples, those satisfy specified criteria, from the relation. It yields a horizontal subset of a following relation.
R = σB(P)
MOSS VALE is a town with 15000 inhabitants. The fire department wishes to develop a system that automates the despatch of fire engines to attend fires. The ERD below describes the
Natural Join : It is the similar like Equi join except one of the duplicate columns is removed in the result table. The natural join is the most usually used form of join operation
Company Database: a-)Here is the ER Model b-)Here is the Relational Model: IMPORTANT NOTICE FOR SOLUTION TYPE: ***THIS ASSIGNMENT WILL BE SOLVED BY THE
Explain Clustering file organization (i) Determine if a record of file is physically ordered on a nonkey field - that does not comprise a different value for each record - that
What is meant by heuristic optimisation? Discuss the main heuristics that are applied during query optimisation. Ans: In heuristic optimization, heuristics are employed to r
Explain the Difference between DROP and DELETE DELETE deletes one or more than one tuples of a particular relation from the database. DROP is employed to remove a table from th
Example: RELATIONAL SCHEMA for PERSON: PERSON (PERSON_ID: integer, NAME: string, AGE: integer, ADDRESS: String) RELATION INSTANCE In this instance, m = 3 and n = 4
What are the two statements regarding transaction? The two statements regarding transaction of the form are:- A) Begin transaction B) End transaction
Explain current page table and shadow page table. The key idea behind the shadow paging method is to maintain two page tables during the life of the transaction: the current pa
Create Student DB and execute Insert query? STUDENT (name, student#, class, major) COURSE (course name, course#, credit hours, department) SECTION (section identifier, course
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