Scribd
Upload
4 views

Week 7- Indexing Structures (1)

The document discusses various types of indexing structures for files, including primary, clustering, and secondary indexes, as well as multi-level indexes and dynamic multi-level indexes using B-trees and B+-trees. It explains how these indexes serve as access paths to improve search efficiency in data files, detailing their characteristics, advantages, and the differences between B-trees and B+-trees. The document also provides examples and calculations to illustrate the efficiency of using indexes compared to linear search methods.

Uploaded by

hayaiman719
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
4 views

Week 7- Indexing Structures (1)

The document discusses various types of indexing structures for files, including primary, clustering, and secondary indexes, as well as multi-level indexes and dynamic multi-level indexes using B-trees and B+-trees. It explains how these indexes serve as access paths to improve search efficiency in data files, detailing their characteristics, advantages, and the differences between B-trees and B+-trees. The document also provides examples and calculations to illustrate the efficiency of using indexes compared to linear search methods.

Uploaded by

hayaiman719
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 25

1

INDEXING STRUCTURES FOR


FILES

Fiaz Majeed (University of Gujrat)


Chapter 14-2

Outline
• Types of Single-level Ordered Indexes

• Primary Indexes
• Clustering Indexes
• Secondary Indexes
• Multilevel Indexes
• Dynamic Multilevel Indexes Using B-Trees and B+-Trees
Chapter 14-3

Indexes as Access Paths

• A single-level index is an auxiliary file that makes it more efficient to


search for a record in the data file.
• The index is usually specified on one field of the file (although it
could be specified on several fields)
• One form of an index is a file of entries <field value, pointer to
record>, which is ordered by field value
• The index is called an access path on the field.
Chapter 14-4

Indexes as Access Paths (contd.)


• The index file usually occupies considerably less disk blocks than
the data file because its entries are much smaller
• A binary search on the index yields a pointer to the file record

• Indexes can also be characterized as dense or sparse.

• A dense index has an index entry for every search key value (and
hence every record) in the data file.
• A sparse (or nondense) index, on the other hand, has index entries for
only some of the search values
Chapter 14-5

Indexes as Access Paths (contd.)


Example: Given the following data file:
EMPLOYEE(NAME, SSN, ADDRESS, JOB, SAL, ... )
Suppose that:
record size R=150 bytes
block size B=512 bytes
r=30000 records

Then, we get:
blocking factor Bfr= B div R= 512 div 150= 3 records/block
number of file blocks b= (r/Bfr)= (30000/3)= 10000 blocks

For an index on the SSN field, assume the field size V SSN=9 bytes,
assume the record pointer size PR=7 bytes. Then:
index entry size RI=(VSSN+ PR)=(9+7)=16 bytes
index blocking factor BfrI= B div RI= 512 div 16= 32 entries/block
number of index blocks b= (r/ BfrI)= (30000/32)= 938 blocks
binary search needs log2bI= log2938= 10 block accesses

This is compared to an average linear search cost of:


(r/2)= 30000/2= 15000 accesses
Chapter 14-6

Types of Single-Level Indexes

• Primary Index

• Defined on an ordered data file

• The data file is ordered on a key field

• Includes one index entry for each block in the data file;
the index entry has the key field value for the first record
in the block, which is called the block anchor
• A similar scheme can use the last record in a block.

• A primary index is a nondense (sparse) index, since it


includes an entry for each disk block of the data file and
the keys of its anchor record rather than for every search
value.
Chapter 14-7

FIGURE 14.1
Primary index
on the
ordering key
field of the file
shown in
Figure 13.7.
Chapter 14-8

Types of Single-Level Indexes

• Clustering Index

• Defined on an ordered data file

• The data file is ordered on a non-key field unlike primary


index, which requires that the ordering field of the data file
have a distinct value for each record.
• Includes one index entry for each distinct value of the field;
the index entry points to the first data block that contains
records with that field value.
• It is another example of nondense index where Insertion
and Deletion is relatively straightforward with a clustering
index.
Chapter 14-9
FIGURE 14.2
A clustering index on the
DEPTNUMBER ordering nonkey field
of an EMPLOYEE file.
Chapter 14-10

FIGURE 14.3
Clustering index with a
separate block cluster
for each group of
records that share the
same value for the
clustering field.
Chapter 14-11

Types of Single-Level Indexes


• Secondary Index
• A secondary index provides a secondary means of
accessing a file for which some primary access already
exists.
• The secondary index may be on a field which is a candidate
key and has a unique value in every record, or a nonkey
with duplicate values.
• The index is an ordered file with two fields.
• The first field is of the same data type as some nonordering field of the data
file that is an indexing field.
• The second field is either a block pointer or a record pointer. There can be
many secondary indexes (and hence, indexing fields) for the same file.
• Includes one entry for each record in the data file; hence, it
is a dense index
Chapter 14-12

FIGURE 14.4
A dense
secondary index
(with block
pointers) on a
nonordering key
field of a file.
Chapter 14-13

FIGURE 14.5
A secondary index (with recored pointers) on a nonkey field implemented using
one level of indirection so that index entries are of fixed length and have unique
field values.
Chapter 14-14
Chapter 14-15

Multi-Level Indexes
• Because a single-level index is an ordered file, we can
create a primary index to the index itself ; in this case,
the original index file is called the first-level index and
the index to the index is called the second-level index.
• We can repeat the process, creating a third, fourth, ...,
top level until all entries of the top level fit in one disk
block
• A multi-level index can be created for any type of first-
level index (primary, secondary, clustering) as long as
the first-level index consists of more than one disk
block
Chapter 14-16

FIGURE 14.6
A two-level
primary index
resembling
ISAM (Indexed
Sequential
Access Method)
organization.
Chapter 14-17

Multi-Level Indexes

• Such a multi-level index is a form of search tree ; however,


insertion and deletion of new index entries is a severe problem
because every level of the index is an ordered file.
Chapter 14-18

FIGURE 14.9
A search tree of order p = 3.
Chapter 14-19

Dynamic Multilevel Indexes Using B-Trees


and B+-Trees
• Because of the insertion and deletion problem, most
multi-level indexes use B-tree or B+-tree data structures,
which leave space in each tree node (disk block) to allow
for new index entries
• These data structures are variations of search trees that
allow efficient insertion and deletion of new search
values.
• In B-Tree and B+-Tree data structures, each node
corresponds to a disk block
• Each node is kept between half-full and completely full
Chapter 14-20

Dynamic Multilevel Indexes Using B-Trees


and B+-Trees (contd.)

• An insertion into a node that is not full is quite


efficient; if a node is full the insertion causes a split
into two nodes
• Splitting may propagate to other tree levels

• A deletion is quite efficient if a node does not become


less than half full
• If a deletion causes a node to become less than half full,
it must be merged with neighboring nodes
Chapter 14-21

Difference between B-tree and B+-tree

• In a B-tree, pointers to data records exist at all levels of


the tree

• In a B+-tree, all pointers to data records exists at the


leaf-level nodes

• A B+-tree can have less levels (or higher capacity of


search values) than the corresponding B-tree
Chapter 14-22

FIGURE 14.10
B-tree structures. (a) A node in a B-tree with q – 1 search values.
(b) A B-tree of order p = 3. The values were inserted in the order
8, 5, 1, 7, 3, 12, 9, 6.
Chapter 14-23

FIGURE 14.11
The nodes of a B+-tree. (a) Internal node of a B+-tree with q –1 search values.
(b) Leaf node of a B+-tree with q – 1 search values and q – 1 data pointers.
Chapter 14-24

FIGURE 14.12
An example of insertion
in a B+-tree with q = 3
and pleaf = 2.
Chapter 14-25

FIGURE 14.13
An example of
deletion from a
B+-tree.

You might also like