Scribd
Upload
14 views9 pages

Sequential Storage

Data base storage method

Uploaded by

Suja Mary
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
14 views9 pages

Sequential Storage

Data base storage method

Uploaded by

Suja Mary
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/ 9

Unit – IV

Sequential Storage
It is one of the simple methods of file
organization.
Here each file/records are stored one after the
other in a sequential manner.
This can be achieved in two ways:
1. Records are stored one after the other as
they are inserted into the tables. This
method is called pile file method. When a
new record is inserted, it is placed at the end
of the file. In the case of any modification or
deletion of record, the record will be
searched in the memory blocks. Once it is
found, it will be marked for deleting and new
block of record is entered.
2. In the second method, records are sorted
(either ascending or descending) each time
they are inserted into the system. This
method is called sorted file method.
Sorting of records may be based on the
primary key or on any other columns.
Whenever a new record is inserted, it will be
inserted at the end of the file and then it will
sort – ascending or descending based on key
value and placed at the correct position.
Advantages of Sequential Storage

The design is very simple compared other file


organization. There is no much effort involved to
store the data.
When there are large volumes of data, this method
is very fast and efficient. This method is helpful
when most of the records have to be accessed like
calculating the grade of a student, generating the
salary slips etc where we use all the records for
our calculations
This method is good in case of report generation
or statistical calculations.
These files can be stored in magnetic tapes which
are comparatively cheap.
Disadvantage of Sequential Storage
Sorted file method always involves the
effort for sorting the record. Each time any
insert/update/ delete transaction is
performed, file is sorted. Hence identifying
the record, inserting/ updating/ deleting the
record, and then sorting them always takes
some time and may make system slow.
Pointers
The concept of database pointers is an
extension to the widely used tuple
identifiers.
 Database pointers have the efficiency of a
shared variable combined with the
advantages of using a real-time database
system. They allow a fast and predictable
way of accessing data in a database
without the need of consulting the indexing
system of a database.
The stored data location is identified by
the address. A variable that point to this
address is called Pointer.
Byte
Offset
 A disk drive is physically divided into several pieces.
 An individual drive is called a volume each drive
consist of several plotters.
 Each side of platter is accessed by a drive head. Each
side is divided into track of data.
 The tracks are further divided into sector or cylinder.
 Data is stored a certain number of bytes from the
start of the sector is known as an offset.
 When it find the appropriate key, it follow the pointer to
retrieve the associated data stored on the disk.
Index
 An index is the most common method used to
provide faster access to data
 An index sort and stores the key values from the
original table along be the pointer to the rest of the
data in each row
Index

You might also like