Cs437 lecture 14_15

©Silberschatz, Korth and Sudarshan12.1Database System Concepts
Chapter 12: Indexing and Hashing
Basic Concepts
Ordered Indices
B+-Tree Index Files
B-Tree Index Files
Static Hashing
Dynamic Hashing
Comparison of Ordered Indexing and Hashing
Index Definition in SQL
Multiple-Key Access

Basic Concepts
Indexing mechanisms used to speed up access to desired data.
E.g., author catalog in library
Search Key - attribute to set of attributes used to look up
records in a file.
An index file consists of records (called index entries) of the
form
Index files are typically much smaller than the original file
Two basic kinds of indices:
Ordered indices: search keys are stored in sorted order
Hash indices: search keys are distributed uniformly across
“buckets” using a “hash function”.
search-key pointer

Ordered Indices
In an ordered index, index entries are stored sorted on the
search key value. E.g., author catalog in library.
Primary index: in a sequentially ordered file, the index whose
search key specifies the sequential order of the file.
Also called clustering index
The search key of a primary index is usually but not necessarily the
primary key.
Secondary index: an index whose search key specifies an
order different from the sequential order of the file. Also called
non-clustering index.
Index-sequential file: ordered sequential file with a primary
index.
Indexing techniques evaluated on basis of:

Dense Index Files
Dense index — Index record appears for every search-key value
in the file.

Sparse Index Files
Index records for some search-key values.
To locate a record with search-key value K we:
Find index record with largest search-key value < K
Search file sequentially starting at the record to which the index
record points
Less space and less maintenance overhead for insertions and
deletions.
Generally slower than dense index for locating records.
Good tradeoff: sparse index with an index entry for every block in
file, corresponding to least search-key value in the block.

Example of Sparse Index Files

Multilevel Index
If primary index does not fit in memory, access becomes
expensive.
To reduce number of disk accesses to index records, treat
primary index kept on disk as a sequential file and construct a
sparse index on it.
outer index – a sparse index of primary index
inner index – the primary index file
If even outer index is too large to fit in main memory, yet another
level of index can be created, and so on.
Indices at all levels must be updated on insertion or deletion from
the file.

Multilevel Index (Cont.)

Index Update: Deletion
If deleted record was the only record in the file with its particular
search-key value, the search-key is deleted from the index also.
Single-level index deletion:
Dense indices – deletion of search-key is similar to file record
deletion.
Sparse indices – if an entry for the search key exists in the index, it
is deleted by replacing the entry in the index with the next search-
key value in the file (in search-key order). If the next search-key
value already has an index entry, the entry is deleted instead of
being replaced.

Index Update: Insertion
Single-level index insertion:
Perform a lookup using the search-key value appearing in the
record to be inserted.
Dense indices – if the search-key value does not appear in the
index, insert it.
Sparse indices – if index stores an entry for each block of the file, no
change needs to be made to the index unless a new block is
created. In this case, the first search-key value appearing in the
new block is inserted into the index.
Multilevel insertion (as well as deletion) algorithms are simple
extensions of the single-level algorithms

Secondary Indices
Frequently, one wants to find all the records whose
values in a certain field (which is not the search-key of
the primary index satisfy some condition.
Example 1: In the account database stored sequentially
by account number, we may want to find all accounts in a
particular branch
Example 2: as above, but where we want to find all
accounts with a specified balance or range of balances
We can have a secondary index with an index record
for each search-key value; index record points to a
bucket that contains pointers to all the actual records
with that particular search-key value.

Secondary Index on balance field of
account

Primary and Secondary Indices
Secondary indices have to be dense.
Indices offer substantial benefits when searching for records.
When a file is modified, every index on the file must be updated,
Updating indices imposes overhead on database modification.
Sequential scan using primary index is efficient, but a sequential
scan using a secondary index is expensive (each record access
may fetch a new block from disk.)

Primary Index
Maintenance.
Overhead
Secondary Index
Maintenance.
Overhead
Sparse Index vs Dense Index
What we studied

Secondary indices have to be dense.
Indices offer substantial benefits when searching for records.
When a file is modified, every index on the file must be updated,
Updating indices imposes overhead on database modification.
Sequential scan using primary index is efficient, but a sequential
scan using a secondary index is expensive (each record access
may fetch a new block from disk.)
So which one to choose?
Primary vs Secondary Index

B-Tree Index Files

B-Tree Index Files
Similar to B+-tree, but B-tree allows search-key values to
appear only once; eliminates redundant storage of search
keys.
Search keys in nonleaf nodes appear nowhere else in the B-
tree; an additional pointer field for each search key in a
nonleaf node must be included.
Generalized B-tree leaf node
Nonleaf node – pointers Bi are the bucket or file record
pointers.

B-Tree Index Files (Cont.)
Advantages of B-Tree indices:
May use less tree nodes than a corresponding B+-Tree.
Sometimes possible to find search-key value before reaching leaf
node.
Disadvantages of B-Tree indices:
Only small fraction of all search-key values are found early
Non-leaf nodes are larger, so fan-out is reduced. Thus B-Trees
typically have greater depth than corresponding
B+-Tree
Insertion and deletion more complicated than in B+-Trees
Implementation is harder than B+-Trees.
Typically, advantages of B-Trees do not out weigh disadvantages.

Static Hashing
A bucket is a unit of storage containing one or more records (a
bucket is typically a disk block). In a hash file organization
we obtain the bucket of a record directly from its search-key
value using a hash function.
Hash function h is a function from the set of all search-key
values K to the set of all bucket addresses B.
Hash function is used to locate records for access, insertion as
well as deletion.
Records with different search-key values may be mapped to
the same bucket; thus entire bucket has to be searched
sequentially to locate a record.

Hash Functions
Worst has function maps all search-key values to the same
bucket; this makes access time proportional to the number of
search-key values in the file.
An ideal hash function is uniform, i.e., each bucket is assigned
the same number of search-key values from the set of all
possible values.
Ideal hash function is random, so each bucket will have the
same number of records assigned to it irrespective of the
actual distribution of search-key values in the file.
Typical hash functions perform computation on the internal
binary representation of the search-key. For example, for a
string search-key, the binary representations of all the
characters in the string could be added and the sum modulo
number of buckets could be returned. .

Deficiencies of Static Hashing
In static hashing, function h maps search-key values to a fixed
set of B of bucket addresses.
Databases grow with time. If initial number of buckets is too small,
performance will degrade due to too much overflows.
If file size at some point in the future is anticipated and number of
buckets allocated accordingly, significant amount of space will be
wasted initially.
If database shrinks, again space will be wasted.
One option is periodic re-organization of the file with a new hash
function, but it is very expensive.
These problems can be avoided by using techniques that allow
the number of buckets to be modified dynamically.

Example of Hash File Organization

Bucket overflow can occur because of
Insufficient buckets
Skew in distribution of records. This can occur due to two reasons:
multiple records have same search-key value
chosen hash function produces non-uniform distribution of key
values
Although the probability of bucket overflow can be reduced it
cannot be eliminated; it is handled by using overflow buckets.
Overflow chaining – the overflow buckets of a given bucket are
chained together in a linked list.This scheme is called closed
hashing.
Handling of Bucket Overflow

Hashing can be used not only for file organization, but also for index-
structure creation. A hash index organizes the search keys, with their
associated record pointers, into a hash file structure.
Hash indices are always secondary indices — if the file itself is organized
using hashing, a separate primary hash index on it using the same search-
key is unnecessary. However, we use the term hash index to refer to
both secondary index structures and hash organized files.
Is there a potential Problem?
Hash Indices

In static hashing, function h maps search-key values to a fixed set of
B of bucket addresses.
Databases grow with time. If initial number of buckets is too small, performance will
degrade due to too much overflows.
If file size at some point in the future is anticipated and number of buckets allocated
accordingly, significant amount of space will be wasted initially.
If database shrinks, again space will be wasted.
One option is periodic re-organization of the file with a new hash function, but it is very
expensive.
These problems can be avoided by using techniques that allow the
number of buckets to be modified dynamically.
Problems with Static Hashing

Good for database that grows and shrinks in size
Allows the hash function to be modified dynamically
Extendable hashing – one form of dynamic hashing
Hash function generates values over a large range — typically b-bit integers, with b
= 32.
At any time use only a prefix of the hash function to index into a table of bucket
addresses. Let the length of the prefix be i bits,
0 ≤ i ≤ 32
Initially i = 0
Value of i grows and shrinks as the size of the database grows and shrinks.
Actual number of buckets is < 2i, and this also changes dynamically due to
coalescing and splitting of buckets.
Dynamic Hashing

General Extendable Hash Structure

Multiple entries in the bucket address table may point to a bucket. Each
bucket j stores a value ij;all the entries that point to the same bucket
have the same values on the first ij bits.
To locate the bucket containing search-key Kj:
1. Compute h(Kj) = X
2. Use the first i high order bits of X as a displacement into bucket
address table, and follow the pointer to appropriate bucket
To insert a record with search-key value Kj follow same procedure as
look-up and locate the bucket, say j.
If there is room in the bucket j insert record in the bucket. Else the
bucket must be split and insertion re-attempted. (See next slide.)
Use of Extendable Hash Stucture

Cost of periodic re-organization
Relative frequency of insertions and deletions
Is it desirable to optimize average access time at the expense of
worst-case access time?
Expected type of queries:
Hashing is generally better at retrieving records having a specified value of the key.
If range queries are common, ordered indices are to be preferred
Comparison of Ordered Indexing and
Hashing

Create an index
create index <index-name> or <relation-name>
<attribute-list>)
E.g.: create index b-index on branch(branch-name)
Use create unique index to indirectly specify and enforce the
condition that the search key is a candidate key.is a candidate key.
To drop an index
drop index <index-name>
Index Definition in SQL

Cs437 lecture 14_15

More Related Content

What's hot (20)

Viewers also liked (20)

Similar to Cs437 lecture 14_15 (20)

More from Aneeb_Khawar (6)

Recently uploaded (20)

Cs437 lecture 14_15