G.C.E. (Advanced) Level Information & Communication Technology

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 12

G.C.E.

(Advanced) Level
Information & Communication
Technology
UNIT 9.4
Analyzing main components of a Data
Base System
Raw data(some time called source data or atomic data)
Raw data is data that has not been processed for use.
Indexed file organization
The records are stored either sequentially or non sequentially
and an indexes is created that allows software to locate
individual records
Index
A table or other data structure used to determine the location
of rows in a file that satisfy some condition.
Meta data
Meta data is a description of a data
Introduction to indices
• Many queries reference only a small
proportion of records
• An index for a file works like a catalogue in a
library
• Indices might be too large to be efficient
• There are two kinds of indices
– Ordered indices
• Based on a sorted ordering of the values
– Hash indices
• Litwin’s linear hashing implementation
• We may have more than one index or hash
function for a file

• The search key :


• The attribute or set of attributes used to look up
records in a file
Dense Index
Sparse Index
• Dense indices are faster
• Sparse indices require less space and impose
less maintenance for insertions and deletions
• Good to have a sparse index with one entry
per block
Index Update on Deletion

• Find the record


• If the last record with a particular search key
value, delete that search key value from index
• For dense indices, this is like deleting a record in a
file
• For sparse indices, delete a key value by replacing
key value's entry in index by next search key value
• If that value already has an index entry, delete
the entry
Index Update on Insertion

• Find place to insert


• Dense index: insert search key value if not
present
• Sparse index: no change unless new block is
created

You might also like