Data Structure

♠ Posted by Unknown in Data Structure at 04:01

Abstract Data Type:

ADT's two popular implementations for large disk-based database applications are "Hashing" and "B+ tree". Both Support efficient insertion and deletion of records, and both support exact-match queries. 

Hashing is more efficient that the B+ tree for exact-match queries.

B+ tree can perform range queries efficiently, while hashing is hopelessly inefficient for range queries.