A non-correlated subquery can be defined as________(a) A set of sequential queries, all of which must always return a single value(b) A set of sequential queries, all of which must return values from the same table(c) A SELECT statement that can be embedded in a clause of another SELECT statement only(d) A set of one or more sequential queries in which generally the result of the inner query is used as the search value in the outer queryThis question was addressed to me during an interview.My query is from Insertion Deletion Predicate Reads topic in division Concurrency Control of Database Management

A non-correlated subquery can be defined as________(a) A set of sequen

1.	A non-correlated subquery can be defined as________(a) A set of sequential queries, all of which must always return a single value(b) A set of sequential queries, all of which must return values from the same table(c) A SELECT statement that can be embedded in a clause of another SELECT statement only(d) A set of one or more sequential queries in which generally the result of the inner query is used as the search value in the outer queryThis question was addressed to me during an interview.My query is from Insertion Deletion Predicate Reads topic in division Concurrency Control of Database Management
Answer» Correct ANSWER is (d) A SET of one or more SEQUENTIAL queries in which generally the result of the inner query is used as the search value in the outer query To explain: A noncorrelated subquery is subquery that is independent of the outer query and it can EXECUTED on its own without RELYING on main outer query.

Discussion

No Comment Found

Related InterviewSolutions

How many techniques are available to control concurrency on B+ trees?(a) One(b) Three(c) Four(d) None of the mentionedI got this question during an interview.The above asked question is from Concurrency in Index Structures in chapter Concurrency Control of Database Management
When a transaction Ti attempts to update a data item, it requests a _________ on that data item.(a) Read lock(b) Update lock(c) Write lock(d) Chain lockI had been asked this question during an online interview.The query is from Snapshot Isolation topic in chapter Concurrency Control of Database Management
The file organization which allows us to read records that would satisfy the join condition by using one block read is(a) Heap file organization(b) Sequential file organization(c) Clustering file organization(d) Hash files organizationThe question was posed to me during an interview.Origin of the question is Multiversion Schemes topic in portion Concurrency Control of Database Management
Which of the following are introduced to reduce the overheads caused by the log-based recovery?(a) Checkpoints(b) Indices(c) Deadlocks(d) LocksThe question was asked in homework.This is a very interesting question from Lock-Based Protocols topic in portion Concurrency Control of Database Management
Snapshot isolation is used to give(a) Transaction a snapshot of the database(b) Database a snapshot of the transaction(c) Database a snapshot of committed values in the transaction(d) Transaction a snapshot of the database and Database a snapshot of committed values in the transactionI got this question by my school teacher while I was bunking the class.I want to ask this question from Snapshot Isolation topic in section Concurrency Control of Database Management
Which of the following protocols ensures conflict serializability and safety from deadlocks?(a) Two-phase locking protocol(b) Time-stamp ordering protocol(c) Graph based protocol(d) None of the mentionedI got this question by my school principal while I was bunking the class.This intriguing question originated from Lock-Based Protocols topic in portion Concurrency Control of Database Management
Why do we need concurrency control on B+ trees ?(a) To remove the unwanted data(b) To easily add the index elements(c) To maintain accuracy of index(d) All of the mentionedThe question was posed to me by my school principal while I was bunking the class.My doubt is from Concurrency in Index Structures topic in division Concurrency Control of Database Management
In crabbing protocol, the lock obtained on the root node is in _________ mode.(a) Shared(b) Exclusive(c) Read only(d) None of the mentionedI got this question during an online interview.This interesting question is from Concurrency in Index Structures in portion Concurrency Control of Database Management
Under first updater wins the system uses a __________ mechanism that applies only to updates.(a) Close(b) Read(c) Locking(d) BeatThe question was asked during an internship interview.This is a very interesting question from Snapshot Isolation in chapter Concurrency Control of Database Management
A lock that prevents the use of any tables in the database from one transaction while another transaction is being processed is called a(a) Database-level lock(b) Table-level lock(c) Page-level lock(d) Row-level lockI got this question during an interview.This interesting question is from Multiversion Schemes in section Concurrency Control of Database Management

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment