Question

In multilevel indexes, primary index created for its second level is classified as

a.

second level of multilevel index

b.

first level of multilevel index

c.

zero level of multilevel index

d.

third level of multilevel index

Posted under DBMS

Answer: (d).third level of multilevel index

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In multilevel indexes, primary index created for its second level is classified as

Add Comment

Similar Questions

Discover Related MCQs

Q. The method of access which uses key transformation is known as

View solution

Q. The physical location of a record is determined by a mathematical formula that transforms
a file key into a record location is :

View solution

Q. An indexing operation

View solution

Q. The index consists of

View solution

Q. If you want to organize a file in multiple ways, it is better to _____ the data rather than to sort it.

View solution

Q. The physical location of a record is determined by a mathematical formula that transforms a file key into a record location in

View solution

Q. The master list of an indexed file

View solution

Q. The files used for speedy disk search by providing the specialized structures of data are classified as

View solution

Q. In database management system, the types of data structures used in indexes are

View solution

Q. In linear hashing, the formula of file load factor is

View solution

Q. The kind of allocation in which the file blocks contain the pointer to the next blocks of file is classified as

View solution

Q. The hashing technique which allocates fixed number of buckets is classified as

View solution

Q. The hashing technique which allows increase or decrease in number of buckets without a need of directory is classified as

View solution

Q. In linear hashing, the formula used to calculate number of records if the blocking factor, loading factor and file buckets are known is as

View solution

Q. The type of data organization which does not allow cross block boundaries is called

View solution

Q. If the global depth is more than local depth then the operation must be performed in directory array is

View solution

Q. In extendible hashing array of bucket addresses 2d then d is considered as

View solution

Q. The open addressing, multiple hashing and chaining are all the methods used for

View solution

Q. The record searching technique which is based on the blocks rather than records is called

View solution

Q. The additional access path added into ordered file is called

View solution

View All MCQs on DBMS

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!

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Hadoop

Dive into the world of big data with our Hadoop MCQs. Cover key concepts including...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

Big Data Computing

Enhance your understanding of Big Data Computing with our comprehensive MCQs. Explore...