Scribd
Upload
55 views5 pages

Ds Unit-5

The document discusses various concepts related to files and file systems. It defines a file as a collection of related information stored on secondary storage, and a file system as the process of managing files and directories on a storage disk. It then summarizes several common file systems like FAT, GFS, HFS, NTFS, and UDF. It also discusses concepts like disk space allocation, file allocation tables, tree-structured directories, fields, records, files, indexed and sequential files, hashing, and linear hashing.

Uploaded by

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

Ds Unit-5

The document discusses various concepts related to files and file systems. It defines a file as a collection of related information stored on secondary storage, and a file system as the process of managing files and directories on a storage disk. It then summarizes several common file systems like FAT, GFS, HFS, NTFS, and UDF. It also discusses concepts like disk space allocation, file allocation tables, tree-structured directories, fields, records, files, indexed and sequential files, hashing, and linear hashing.

Uploaded by

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

Basic Concepts Of File And File Systems :-

A file is a named collection of related


information that is recorded on secondary
storage such as magnetic disks, magnetic
tapes and optical disks. In general, a file is a
sequence of bits, bytes, lines or records
whose meaning is defined by the files creator
and user.
A file system is a process of managing how
and where data on a storage disk, which is
also referred to as file management or FS. It is
a logical disk component that compresses
files separated into groups, which is known as
directories. 
file systems services , MS_DOC FAT file system :-
FAT: FAT is a type of file system, which is developed for hard drives. It stands for file
allocation table and was first introduced in 1977, which is used for 12 or 16 bits for each
and every cluster access into the file allocation table (FAT). On hard drives and other
computer systems, it helps to manage files on Microsoft operating systems. In devices like
digital cameras, flash memory, and other portable devices, it is also often found that is
used to store file information.
GFS: A GFS is a file system, which stands for Global File System. It has the ability to make
enable multiple computers to act as an integrated machine, which is first developed at the
University of Minnesota. But now it is maintained by Red Hat. When the physical distance
of two or more computers is high, and they are unable to send files directly with each
other, a GFS file system makes them capable of sharing a group of files directly. A
computer can organize its I/O to preserve file systems with the help of a global file
system.
HFS: HFS (Hierarchical file system) is the file system that is used on a Macintosh computer
for creating a directory at the time a hard disk is formatted. Generally, its basic function is
to organize or hold the files on a Macintosh hard disk. Apple is not capable of supporting
to write to or format HFS disks since when OS X came on the market. Also, HFS-formatted
drives are not recognized by Windows computers as HFS is a Macintosh format. With the
help of WIN32 or NTFS file systems, Windows hard drives are formatted.

NTFS: NTFS is the file system, which stands for NT file system and stores and retrieves
files on Windows NT operating system and other versions of Windows like Windows 2000,
Windows XP, Windows 7, and Windows 10. Sometimes, it is known as the New
Technology File System. As compared to the FAT and HPFS file system, it provides better
methods of file recovery and data protection and offers a number of improvements in
terms of extendibility, security, and performance.

UDF: A UDF is a file system, stands for Universal Disk Format and used first developed by
OSTA (Optical Storage Technology Association) in 1995 for ensuring consistency among
data written to several optical media. It is used with CD-ROMs and DVD-ROMs and is
supported on all operating systems. Now, it is used in the process of CD-R's and CD-RW's,
called packet writing.

Disk Space allocation :- The allocation of disk space for compressed file systems is the
same as that of fragments in fragmented file systems. A logical block is allocated 4096
bytes when it is modified. This allocation guarantees that there will be a place to store the
logical block if the data does not compress.

File Allocation Table (FAT):- is a file system developed for personal computers and was
the default filesystem for MS-DOS and Windows 9x operating systems.[3] Originally
developed in 1977 for use on floppy disks, it was adapted for use on hard disks and other
devices. The increase in disk drives capacity required three major
variants: FAT12, FAT16 and FAT32. FAT was replaced with NTFS as the default file system
on Microsoft operating systems starting with Windows XP.[4] 

Tree-Structured Directories :- A directory refers to a container that stores and


organizes files and folders in a system. There are several ways to structure a directory.
However, tree-structured directories are the most common. The directory is structured in
the form of a tree. It also has a root directory, and every file in the system has a unique
path.A directory within a tree-structured directory may contain files or subdirectories.
Special system calls are used to create or remove directories.

CONCEPTS FIELDS, RECORDS AND FILES :-

You can think of a traditional database as an


electronic filing system, organized
by fields, records, and files. A field is a single
piece of information; a record is one
complete set of fields; and a file is a collection
of records. For example, a telephone book is
analogous to a file. It contains a list of
records, each of which consists of three fields:
name, address, and telephone number.

Indexed

 An indexed file contains records ordered by a record key. A record key uniquely
identifies a record and determines the sequence in which it is accessed with respect
to other records.

 Each record contains a field that contains the record key. A record key for a record
might be, for example, an employee number or an invoice number.

 An indexed file can also use alternate indexes, that is, record keys that let you
access the file using a different logical arrangement of the records. For example,
you could access a file through employee department rather than through
employee number.

 The possible record transmission (access) modes for indexed files are sequential,
random, or dynamic. When indexed files are read or written sequentially, the
sequence is that of the key values.

 Sequential file
 Storing and sorting in contiguous block within files on tape or disk is called
as sequential access file organization.
 In sequential access file organization, all records are stored in a sequential order. The
records are arranged in the ascending or descending order of a key field.
 Sequential file search starts from the beginning of the file and the records can be added
at the end of the file.
 In sequential file, it is not possible to add a record in the middle of the file without
rewriting the file.

Indexed sequential file


 Indexed sequential access file combines both sequential file and direct access file
organization.
 In indexed sequential access file, records are stored randomly on a direct access device
such as magnetic disk by a primary key.
 This file have multiple keys. These keys can be alphanumeric in which the records are
ordered is called primary key.
 The data can be access either sequentially or randomly using the index. The index is
stored in a file and read into memory when the file is opened.

Hashing 
Concepts :-
Hashing in the data structure is a technique of mapping a large chunk of data into
small tables using a hashing function. It is also known as the message digest function. It
is a technique that uniquely identifies a specific item from a collection of similar items.
It uses hash tables to store the data in an array format. Each value in the array has been
assigned a unique index number. Hash tables use a technique to generate these unique
index numbers for each value stored in an array format. This technique is called the hash
technique.

Linear Hashing :-

Linear Hashing is a dynamically updateable disk-based index structure which


implements a hashing scheme and which grows or shrinks one bucket at a time. The
index is used to support exact match queries, i.e., find the record with a given key.

You might also like