Question
a.
scanner tree
b.
parser tree
c.
query graph
d.
query tree
Posted under DBMS
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The representation of the queries in the form of data structure graph is classified as
Similar Questions
Discover Related MCQs
Q. In sort merge strategy, the small sub files sorted are called
View solution
Q. Which of the following are steps in query processing?
View solution
Q. A relational algebra operation annotated with instructions on how to evaluate it is called _______
View solution
Q. A sequence of primitive operations that can be used to evaluate a query are called as __________
View solution
Q. The lowest level operator to access data in query processing is _______
View solution
Q. Search algorithms that use an index are referred to as _________
View solution
Q. Sorting of relations that do not fit in memory is called as _______
View solution
Q. A selection of the form satisfying the intersection of all records satisfying individual simple conditions is
View solution
Q. A selection of the form satisfying the union of all records satisfying individual simple conditions is
View solution
Q. A selection of the form giving all the records not satisfying simple individual conditions is ______
View solution
Q. Which of the following can be implemented?
View solution
Q. If the results of one operation are passed on to the other, it is called as ________
View solution
Q. The result of each intermediate operation are created and then are used for valuation of the next level operations, this evaluation is called as ________
View solution
Q. If the system makes repeated requests for tuples from the operation at the top of the table, it is called as _________
View solution
Q. If the operations do not wait to produce tuples, then it is called as _________
View solution
Q. State true or false: Sorting is an inherently blocking operation
View solution
Q. State true or false: Join is an inherently blocking operation
View solution
Q. Which of the following techniques does not exist?
View solution
Q. State true or false: Hybrid hash join is partially pipelined on the probe relation
View solution
Q. The usage of two buffers, with one continuing execution of the algorithm while the other is written is called as __________
View solution
Suggested Topics
Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
