Q.1
Which of the following are steps in query processing?
  • a) Parsing and translation
  • b) Optimization
  • c) Evaluation
  • d) All of the mentioned
Q.2
A relational algebra operation annotated with instructions on how to evaluate it is called _______
  • a) Evaluation algebra
  • b) Evaluation plan
  • c) Evaluation primitive
  • d) Evaluation engine
Q.3
A sequence of primitive operations that can be used to evaluate a query are called as __________
  • a) Query evaluation algebra
  • b) Query evaluation plan
  • c) Query evaluation primitive
  • d) Query evaluation engine
Q.4
The lowest level operator to access data in query processing is _______
  • a) File scan
  • b) File manipulation
  • c) File handling
  • d) File organization
Q.5
Search algorithms that use an index are referred to as _________
  • a) Index scans
  • b) Search scans
  • c) Primary scans
  • d) Equality scans
Q.6
Sorting of relations that do not fit in memory is called as _______
  • a) Internal sorting
  • b) External sorting
  • c) Overflow sorting
  • d) Overload sorting
Q.7
A selection of the form satisfying the intersection of all records satisfying individual simple conditions is
  • a) Conjunctive selection
  • b) Disjunctive selection
  • c) Negation
  • d) None of the mentioned
Q.8
A selection of the form satisfying the union of all records satisfying individual simple conditions is
  • a) Conjunctive selection
  • b) Disjunctive selection
  • c) Negation
  • d) None of the mentioned
Q.9
A selection of the form giving all the records not satisfying simple individual conditions is ______
  • a) Conjunctive selection
  • b) Disjunctive selection
  • c) Negation
  • d) None of the mentioned
Q.10
Which of the following can be implemented?
  • a) Conjunctive selection using one index
  • b) Conjunctive selection using composite index
  • c) Conjunctive selection by intersection of identifiers
  • d) All of the mentioned
0 h : 0 m : 1 s