Q. One of the module in the database management system which is responsible for choosing efficient execution plan considering queries is considered as

View solution

Q. The procedure of storing the data on a medium of storage which is controlled by database management system is considered as

View solution

Q. The planning program which consolidates the functions of organizations such as sales, marketing, human resources and finance is classified as

View solution

Q. In external sorting, the number of runs that can be merged in every pass are called

View solution

Q. The files that can fit in available buffer space in phase of external sorting must be read into

View solution

Q. The concept which checks the syntax of query whether is written according to the rules of grammar is classified as

View solution

Q. The processor used to run the code of the queries of interpreted mode or compiled mode is classified as

View solution

Q. The procedure of sorting the algorithms for larger records that does not fit in the main memory and are stored on disk is classified as

View solution

Q. The files from which algorithms are selected for records are called

View solution

Q. The procedure of choosing a suitable query out of all the queries is classified as

View solution

Q. The representation of the query in the form of data structure is classified as

View solution

Q. The representation of the queries in the form of data structure graph is classified as

View solution

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