Computer Sciences > GATE 2024 Set-2 > DBMS

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?

A

Heap file

B

Clustered B+ tree index

C

Unclustered tree index

D

Unclustered hash index

Check Answer

Explanation

Correct : a,b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science