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

Physical dbms architecture, PHYSICAL DBMS ARCHITECTURE The physical ...

PHYSICAL DBMS ARCHITECTURE The physical architecture defines the software components used to process and enter data, and how these software components are related and interc

Describe five main functions of a database administrator, Describe five mai...

Describe five main functions of a database administrator. Ans: A database administrator (DBA) is a person who is accountable for the environmental aspects of a database. Genera

Define deadlock prevention, Define Deadlock prevention These protocols...

Define Deadlock prevention These protocols make sure that the system will never enter a deadlock state. There are two methods to deadlock prevention. One approach makes sure t

Sequential file organisation, Sequential File Organisation The most nec...

Sequential File Organisation The most necessary way to organise the collection of records in a file is to use sequential Organisation. Records of the file are stored in series

Compute the closure set, Compute the closure (F+) for the following set of ...

Compute the closure (F+) for the following set of the functional dependencies defined on R(a,b,c,d), where F - {c→ a, ab → d, a → b, d → c}, i.e. what are all of the FDs implied b

Discuss the types of integrity constraints with example, Discuss the types ...

Discuss the types of integrity constraints in which must be checked for the update operations - Insert and Delete. Give examples. Insert operation can violet any of the subse

Differentiate between horizontal and mixed partitioning, Question: In r...

Question: In relation to distributed database answer the following questions: (i) Give a brief definition of distributed database. Support your answer with an appropriate di

Adding redundant associations for efficient access, Adding Redundant Associ...

Adding Redundant Associations for Efficient Access Redundant associations do not add any type of information, therefore during design we should actually examine structure of o

Clinic database design, Implementation and SQL Applications

Implementation and SQL Applications

Security and integrity, Security And Integrity After Reading the concep...

Security And Integrity After Reading the concepts of database recovery in the last section, let us now deal with a vital concept that helps in minimizing consistency errors in

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages