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

Describe logical data independence, Describe logical data independence ? ...

Describe logical data independence ? Logical Data Independence - It is the capacity to modify the conceptual schema without having to change external schemas or application p

Why we use delegation to share implementation, Use Delegation to Share Impl...

Use Delegation to Share Implementation The delegation " Delegation comprises of catching an operation on one object and sending it to other object which is part, or related to

Define the unique constraints for the table client, Define the following co...

Define the following constraints for the table client. (i) BAL_DUE must be at least 1000. (ii) NAME is a unique key. (i)ALTER TABLE CLIENT ADD CONSTRAINT CLIENT_BAL_DUE_C1

Entity integrity constraint - relational constraints, It defines that no pr...

It defines that no primary key value can be null. This is as the primary key is used to recognize individual tuple in the relation. So we will not be able to recognize the records

Write a query to find name from the relational algebra, Consider the relati...

Consider the relations City (city_name, state) Hotel (name, address) City_hotel (hotel_name, city_name, owner) Answer the following queries in relational algebra (i) Find

Fragmentation, let us consider a table having 2200 records and the fixed si...

let us consider a table having 2200 records and the fixed size of the table to be considered as 25.then how many numbers of table is requredto perform horizontal fragmentation

I need label printing program, Project Description: Hi I'm seeking someo...

Project Description: Hi I'm seeking someone to make my dBase application work. I know it's not a 'modern' language but it's what I know. I have written an order program and I ne

Which operator is cartesian product in relational algebra, Which operator i...

Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)

What is called a query evaluation plan, What is called a query evaluation p...

What is called a query evaluation plan? A sequence of primitive operations that can be used to assess a query is a query evaluation plan or a query implementation plan.

Relational algebra, Relational Algebra is a set of basic operations used to...

Relational Algebra is a set of basic operations used to influence the data in relational model. These operations allow the user to specify basic retrieval request. The result of re

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages