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

Recovery management component, Ask question #Minim 100 words accepted#what ...

Ask question #Minim 100 words accepted#what is recovery management component in database management system and how it is useful

Example-revoke all on emp from mca12, Example: //REVOKE ALL ON EMP FROM MC...

Example: //REVOKE ALL ON EMP FROM MCA12; (All permissions will be cancelled) You can also cancel only some of the permissions. Drop: A user-

Define first normal form and second normal form, First Normal Form and seco...

First Normal Form and second normal form First Normal Form (1NF) A relation is said to be in 1NF if it having no non-atomic values and each row can give a unique combinat

What is candidate key, What is candidate key? Candidate Key - A candi...

What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.

State the data flow diagram of functional model, State the data flow diagra...

State the data flow diagram of functional model Any action initiated by transition in the state diagram can be extended into an entire data flow diagram in functional model. Th

Principles of good e-governance, Question: (a) e-Government implementa...

Question: (a) e-Government implementations normally evolve through a multi-stage process. Describe, using appropriate examples, the stages involved in an e-Government implemen

Heap files (unordered file), Heap files (unordered file) Mostly these f...

Heap files (unordered file) Mostly these files are unordered files. It is the easiest and most basic type. These files having of randomly ordered records. The records will have

Relational database, write on the various type of relationalkey

write on the various type of relationalkey

What is known as sequential file organization, What is known as sequential ...

What is known as sequential file organization? In the sequential file organization, the records are kept in sequential order, according to the value of a "search key" of every

What are the constituents of file, What are the Constituents of File? Also ...

What are the Constituents of File? Also elaborates all the possible file operations? A file is organised logically as sequence of record. These records are mapped onto disk blo

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages