Scribd
Upload
17 views13 pages

FS Mod1

file structure module 1 ppt

Uploaded by

chayashreeg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
17 views13 pages

FS Mod1

file structure module 1 ppt

Uploaded by

chayashreeg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

FILE STRUCTURES

(18IS61)
OBJECTIVES

• Explain the fundamentals of file structures and their


management.
• Measure the performance of different file structures
• Organize different file structures in the memory.
• Demonstrate hashing and indexing techniques.
COURSE OUTCOMES
• Choose appropriate file structure for storage representation.
• Identify a suitable sorting technique to arrange the data.
• Select suitable indexing and hashing techniques for better
performance to a given problem.

MODULES CO’S
1 1
2 2
3 2, 1
4 3
5 3
TEXTBOOK:
File Structures-An Object Oriented Approach with C++
By
Michael J. Folk, Bill Zoellick, Greg Riccardi
3rd Edition
Module 1
Chapter 1: Introduction to the Design and Specification of File
Structure
Chapter 2: Fundamental File Operations
Chapter 3: Secondary Storage and System Software
Chapter 4: Fundamental File Structure Concepts
Chapter 5: Managing Files of Records
INTRODUCTION
• File
• File structure: It is a combination of representations for data
in files and of operation for accessing the data.
• It allows applications to read, write modify and search data.
HEART OF FILE STRUCTURE
Why to study file structure?
• Data Storage
• Memory V/S Secondary storage
• How can secondary storage access time be improved?
HISTORY OF FILE STRUCTURE
General Goal
• Get the information we need with one access to the disk.
• If that’s not possible, then get the information with as few accesses as
possible.
• Group information so that we are likely to get everything we need
with only one trip to the disk.

Fixed and Dynamic files


Early History:
Sequential file structure: Tapes , access is direct proportion to the file
Indexed Sequential structure: key and pointer = direct access
Disks
Tree – leads to uneven grow of tree due to addition and deletion
AVL Tree – Balanced tree structure, top down
B Tree
B+ Tree : Btree +sequential linked list
Hashing: accessing data with a single request.
Extendable dynamic hashing
Conceptual tool : method of framing and addressing a design problem.
• Buffer, blocks or buckets
Chapter 2- Fundamental File
processing Operations
• Physical files and logical files
• Opening and closing files
• Reading, writing and seeking
• Special Characters in files
• UNIX Directory Structure
• Physical Devices and Logical files
• File Related Header files
• Unix File System Commands
Physical Files and Logical Files
• The files residing in secondary storage device and managed by
operating system is called as physical file.
• It is a collection of bytes.
• It occupies memory
• Logical file is a channel the connects the program to a physical files.
• It doesn’t occupy memory.
• It cannot exist without physical file.
• It can be deleted without deleting the physical file.

You might also like