Q. The tree structure diagram in which the pointers of data are stored at the leaf nodes of diagram is classified as

View solution

Q. The type of multilevel index which leaves space for inserting new entries in its blocks is called

View solution

Q. In tree structure, the node which is free of child nodes is called

View solution

Q. In physical ordered record files, the non key field for which the records does not have distinct values is classified as

View solution

Q. The search value which is present on each node in search tree diagram of order 'p' is as

View solution

Q. The kind of index in which the records have fixed length with only two fields is classified as

View solution

Q. In tree structure diagrams, the non leaf node is called

View solution

Q. The types of access that are supported efficiently are called as ________

View solution

Q. The time it takes to find a particular data item is called as ___________

View solution

Q. The time it takes to insert a new data item is called ____________

View solution

Q. The time it takes to delete a data item is called as _________

View solution

Q. The additional space occupied by an index structure is called as _________

View solution

Q. If the file containing the records is sequentially ordered, a ___________ is an index whose search key also defines the sequential order of the file.

View solution

Q. State true or false: Clustering indices are also called as primary indices

View solution

Q. If an index entry appears for every search key value in the file, it is called as ________

View solution

Q. If an index entry appears for only some of the search key values in the file, it is called as ________

View solution

Q. Indices with two or more levels are called as?

View solution

Q. A search key containing more than one attribute is called a _________ search key

View solution

Q. State true or false: B+ trees are not always balanced trees.

View solution

Q. What are the leaf nodes in a B+ tree?

View solution