Consider the following relation schemas : b-Schema = (b-name, b-city, assets)…

PYQ GATE 2007

Consider the following relation schemas :

    • b-Schema = (b-name, b-city, assets)

    • a-Schema = (a-num, b-name, bal)

    • d-Schema = (c-name, a-number)

Let branch, account and depositor be respectively instances of the above schemas. Assume that account and depositor relations are much bigger than the branch relation. Consider the following query: П

c-name

(σ

b-city = "Agra" ⋀ bal < 0

(branch ⋈ (account ⋈ depositor) Which one of the following queries is the most efficient version of the above query ?

  1. A.

    Пc-name (σbal < 0 (σb-city = "Agra" branch ⋈ account) ⋈ depositor)

  2. B.

    Пc-name (σb-city = "Agra"branch ⋈ (σbal < 0 account ⋈ depositor))

  3. C.

    Пc-name (σb-city = "Agra" branch ⋈ σb-city = "Agra" ⋀ bal < 0 account) ⋈ depositor)

  4. D.

    Π c-name (σ b-city="Agra"(branch) ⋈ (σ b-city="Agra" ∧ bal<0(account) ⋈ depositor))

Attempted by 97 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…