Consider relational schema and construct algebra query, Database Management System

Assignment Help:

Consider the following relational schema:
PERSON (SS#, NAME, ADDRESS)
CAR (REGISTRATION_NUMBER, YEAR, MODEL)
ACCIDENT (DATE, DRIVER, CAR_REG_NO)
OWNS (SS#, LICENSE)

Construct the subsequent relational algebra queries:
(i) Find out the names of persons who are included in an accident.
(ii) Find out the registration number of cars that were not involved in any accident.
Ans: (i) πNAME(PERSON) ∩ πDRIVER(ACCIDENT)
(ii) πREGISTRATION_NUMBER(CAR) - πCAR_REG_NO(ACCIDENT)

Related Discussions:- Consider relational schema and construct algebra query

Explain the deferred update, Explain the Deferred Update The deferred ...

Explain the Deferred Update The deferred update methods do not physically update the database on disk till after a transaction reaches its commit point; after that the updates

Describe the association - design, Describe the Association: Design ...

Describe the Association: Design Before we describe association design let us define association "Association is set of links between two objects in the object model". It is

Describe the nested-loop join and block-nested loop join, Describe the nest...

Describe the nested-loop join and block-nested loop join. Ans: The block nested- loop join algorithm is as described below: for every block B r of relation R do beg

What is omr, What is OMR? OMR (Optical Mark Recognition) is the transla...

What is OMR? OMR (Optical Mark Recognition) is the translation of marks - or the absence of marks - but not the shape of the mark on forms that have small circles ("also called

Differentiate between static hashing and dynamic hashing, Differentiate bet...

Differentiate between static hashing and dynamic hashing. Ans: Static Hashing comprises the number of primary pages in the directory fixed. So, while a bucket is full, we requ

Define boyce codd normal form, Define Boyce codd normal form A relation...

Define Boyce codd normal form A relation schema R is in BCNF with respect to a set F of functional dependencies if, for all functional dependencies in F + of the form.α ->β.

Unrepeatable reads-problems of concurrent transactions, Unrepeatable reads ...

Unrepeatable reads : Assume T7 reads X twice during its implementation. If it did not update X itself it could be very disturbing to see a dissimilar value of X in its next read. B

#Attribute inheritence, what is attribute is attribute inheritance in dbms?...

what is attribute is attribute inheritance in dbms?

Describe models which define the operations on classes, Describe briefly mo...

Describe briefly models which define the operations on classes. The three models which are used to define operations on classes are as: Object Model = data dictionary + Obje

What are the overlapping elements, What are the Overlapping elements O...

What are the Overlapping elements Overlapping elements can be found by scanning all the elements in front of deleted element in priority list for the sheet and comparing them

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages