Please enable JavaScript.
Coggle requires JavaScript to display documents.
FILE ORGANIZATION 1 - Coggle Diagram
FILE ORGANIZATION 1
Defines how file records are mapped onto disk blocks.
OBJECTIVE
Contains an optimal selection of records
Duplicate records cannot be induced
Minimal cost of storage
TYPES
Sequential file organization
Heap file organization
Hash file organization
B+ file organization
Indexed sequential access method
Cluster file organization
Sequential file organization
Files stored in a sequential manner
Pile File Method
Store records in a sequence
Sorted File Method
Store records in a sorted order
Pros
Fast and efficient method
Simple design
Cheaper storage mechanism
Heap file organization
Records are inserted at the end of the file, into the data blocks
No Sorting required
Pros
Fetching and retrieving records is faster
Suited for database with huge data
Hash File Organization
Efficient technique to search data on the disk without using indexing
Hash Organization
Bucket
Stores one complete disk block
Hash Function
Mapping function
STATIC HASHING
same number of buckets
Operations
Insertion
Searching
Deletion
BUCKET OVERFLOW
Overflow chaining
Closed Hashing
Linear probing
Open Hashing
DYNAMIC HASHING
Operations
Querying
Update
Delete
Insert
Data buckets are added and removed dynamically and on-demand
external hashing
IMAGE ANALOGY
Pile File method
Hashing
Dynamic Hashing
VIDEO ANALOGY
https://drive.google.com/file/d/1xOGtkoBInlVU9FHMAD7-MBjfmLPX9NXD/view?usp=sharing
File organization
https://drive.google.com/file/d/18U43GRFMJ0qxen4gcBbWvIVx2emoYqAu/view?usp=sharing
Sorted sequential organization
