GATEverse
← GATE CSE 2011

Q39

MCQ2 marks, −0.67

Consider a relational table rr with sufficient number of records, having attributes A1,A2,…,AnA_1, A_2, \dots ,A_n and let 1≤p≤n1 \leq p \leq n. Two queries Q1Q1 and Q2Q2 are given below. Q1:πA1,…,Ap(σAp=c(r))Q1: \pi_{A_1, \dots ,A_p} \left(\sigma_{A_p=c}\left(r\right)\right) where cc is a constant Q2:πA1,…,Ap(σc1≤Ap≤c2(r))Q2: \pi_{A_1, \dots ,A_p} \left(\sigma_{c_1 \leq A_p \leq c_2}\left(r\right)\right) where c1c_1 and c2c_2 are constants. The database can be configured to do ordered indexing on ApA_p or hashing on ApA_p. Which of the following statements is TRUE?

Sign in to save attempts.

Loading…