Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Ans:
Indexed Sequential Files: A file which has its records sequentially ordered,
and if there exists an index known as clustering index whose search key also
defines the sequential order of the file then that file is an indexed sequentially
file.
Access types: the types of access that are supported efficiently. It can
include finding records with a specified attributed value and finding
records whose values fall in a specified range.
Access time: The time taken by a technique to find a particular data
item.
Insertion Time: The time it takes to insert a new data item.
Deletion time: time taken to delete an existing item.
Space Overhead: The additional space occupied an index
structure.
While dealing with an Indexed sequential file, Insertion and Deletion are
always a major problem.
If we need to insert a new entry then we have to not only move records some
records but also change some index entries. One of the techniques that is
employed to resolve this is to have an unordered overflow file which will
contain newly added items.
These items are put to correct positions while file reorganisation is done
sometime later. But this technique can be employed only in those fields where
up-to-date data is not of utmost importance or else to increase the algorithm
complexity by adding a linear search algorithm for the overflow block.
But if the database is really huge and so is the chance for index to become if
we use dense indices and so does space occupied by it. Then we use a
technique where an index-record appears for only some of search key values.
This will considerably reduce the space taken by index .
Still if we have larger sparse indices we can go for multilevel indices where we
can keep an index for a set of inner indices and this concept can be extended
to any number of levels.
Dense Index:
An Index record appears for every search-key value in the file. The index
record contains the search-key value. The rest of the records with the same
search-key value would be stored sequentially after the first record, since
because the index is a clustering one.
A-132 FISAT 900
FISAT A-217 FISAT 850
A-218 FISAT 875
Rajagiri
A-456 Rajagiri 923
SCMS A-111 SCMS 567
A-567 SCMS 765
ToCH
A-432 ToCH 876
A-223 ToCH 765
Access time is pretty fast in these kind of indices, and so provides high
performance even in machines with slower secondary storage devices
Space intensive: Requires large amount of size for indices as well.
Situations may arise where index itself can’t be contained in the
memory at once.
This can affect the performance of system due to time taken for
interaction between and primary and secondary memory
Sparse Indices:
Multilevel Indices:
If a sparse matrix grows too large, we make an index of the existing
index as it itself is an ordered list. This enables the outer index to be kept at
main memory and perform binary search to find corresponding inner index,
which in turn can be searched to get the block.
References: