edited by
6,778 views
5 votes
5 votes

Consider the following schemas:

Branch=(Branch-name, Assets, Branch-city)

Customer = (Customer-name, Bank name, Customer-city)

Borrow = (Branch-name, Loan number, Customer account-number)

Deposit = (Branch-name, Account-number, Customer-name, Balance)

Using relational Algebra, the Query that finds customers who have balance more than 10,000 is _____

  1. $\pi_{customer-name} (\sigma_{balance > 10000^{(Deposit)}}$)
  2. $\sigma_{customer-name} (\sigma_{balance > 10000^{(Deposit)}}$)
  3. $\pi_{customer-name} (\sigma_{balance > 10000^{(Borrow)}}$)
  4. $\sigma_{customer-name} (\pi_{balance > 10000^{(Borrow)}}$)
edited by

2 Answers

Best answer
3 votes
3 votes

πcustomer-namebalance >10000(Deposit)) 

we have to apply projection and use table Deposite.

A is ans

selected by
0 votes
0 votes

σbalance >10000(Deposit) - select all tuple with balance>10000 

πcustomer−name- give only customer−name attribute from select query

ans-A

Answer:

Related questions

3 votes
3 votes
1 answer
1
go_editor asked Jul 29, 2016
2,233 views
Match the following $:$$\begin{array} {clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Secondary Index} & \text{i.} & \text{Functional Depende...
3 votes
3 votes
1 answer
2
go_editor asked Jul 29, 2016
1,731 views
Armstrong $(1974)$ proposed systematic approach to derive functional dependencies. Match the following w.r.t functional dependencies:$\begin{array}{} & \textbf{List-I} ...
4 votes
4 votes
1 answer
4
go_editor asked Jul 29, 2016
2,413 views
Consider the following ER diagram:The minimum number of tables required to represent $M, N, P, R_1, R_2$ is2345