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

Dbms, statical data

statical data

Define object-relational systems, Define object-relational systems? Sy...

Define object-relational systems? Systems that give object-oriented extensions to relational systems are known as object-relational systems.

Concept of foreign key, Fundamentals of Database Management 1. Explai...

Fundamentals of Database Management 1. Explain the concept of Foreign Key. How a foreign key differs from a Primary Key? Can the Foreign Key accept nulls? 2. With a necess

Explain the aggregation implies concurrency, Explain the Aggregation implie...

Explain the Aggregation implies concurrency Concurrency actually is: This in objects can be identified by the way they change state. Present objects can change state independen

Generalization and specialization, design a generalization specialization h...

design a generalization specialization hierarchy for a motor vehicle sales company. the company sells motorcycles, passenger cars, vens and buses.

What is a virtual table that draws its data from the result, What is a virt...

What is a virtual table that draws its data from the result of an SQL SELECT statement? View is a virtual table that draws its data from the result of an SQL SELECT statement.

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Explain domain-oriented relational calculus?, How does Tuple-oriented relat...

How does Tuple-oriented relational calculus vary from domain-oriented relational calculus? The tuple-oriented calculus uses a tuple variables i.e., variable whose only allowed

Software engineering, Critically evaluate the bulleted list of information-...

Critically evaluate the bulleted list of information-related items in this case study. How are each contradictory to the notion of being an information-literate knowledge worker?

Insert statement reverses storage space and transfers value, A field-groups...

A field-groups statement or an insert statement reverses storage space and transfers values. False.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd