Computer Science · Database Management Systems
When does a correlated subquery generally become slow and inefficient in execution?
- 1When the outer query has a large number of rows and is evaluated for each row✓
- 2When the subquery is executed only once for the entire outer query
- 3When the outer query contains only a single row
- 4When the inner subquery returns a very few rows
Correct answer
When the outer query has a large number of rows and is evaluated for each row
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems