Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    05 Indexes

    Uploaded by

    Joao Carvalho
    The document discusses different types of database indices, including B+ tree and hash indices. It provides details on the structure and functionality of B+ tree indices, including how they are used to efficiently process queries. It also compares B+ tree and hash indices, noting that B+ trees are generally preferred as they allow for efficient processing of range queries in addition to exact-value lookups. The document additionally addresses indexing on multiple keys to optimize queries involving conditions on more than one attribute.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    05 Indexes

    Uploaded by

    Joao Carvalho
    27 views28 pages
    The document discusses different types of database indices, including B+ tree and hash indices. It provides details on the structure and functionality of B+ tree indices, including how they are used to efficiently process queries. It also compares B+ tree and hash indices, noting that B+ trees are generally preferred as they allow for efficient processing of range queries in addition to exact-value lookups. The document additionally addresses indexing on multiple keys to optimize queries involving conditions on more than one attribute.

    Original Description:

    Data base

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses different types of database indices, including B+ tree and hash indices. It provides details on the structure and functionality of B+ tree indices, including how they are used to efficiently process queries. It also compares B+ tree and hash indices, noting that B+ trees are generally preferred as they allow for efficient processing of range queries in addition to exact-value lookups. The document additionally addresses indexing on multiple keys to optimize queries involving conditions on more than one attribute.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    27 views28 pages

    05 Indexes

    Uploaded by

    Joao Carvalho
    The document discusses different types of database indices, including B+ tree and hash indices. It provides details on the structure and functionality of B+ tree indices, including how they are used to efficiently process queries. It also compares B+ tree and hash indices, noting that B+ trees are generally preferred as they allow for efficient processing of range queries in addition to exact-value lookups. The document additionally addresses indexing on multiple keys to optimize queries involving conditions on more than one attribute.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 28

    Bases de

    Dados

    Basic
    Concepts
    B+ -Tree
    Indices

    Bases de Dados
    Indices

    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Departamento de Engenharia Inform


    atica
    Instituto Superior T
    ecnico

    SISE 2015

    Slides baseados nos slides oficiais dos livros Database


    Management Systems, de Ramakrishnan e Gehrke e
    Database System Concepts, de Silberschatz, Korth e
    Sudarshan

    Outline
    Bases de
    Dados

    Basic Concepts
    Indexing
    Types of Indices

    B+ -Tree Indices
    B+ -Tree Indices
    Queries on B+ -Trees

    Hash Indices
    Hashing
    Hashing vs. Ordered Indices

    Indices on Multiple Keys

    Indices and SQL

    Basic
    Concepts
    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Outline
    Bases de
    Dados

    Basic
    Concepts

    Basic Concepts
    Indexing
    Types of Indices

    B+ -Tree Indices

    Hash Indices

    Indices on Multiple Keys

    Indices and SQL

    Indexing
    Types of Indices

    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Indexing
    Bases de
    Dados

    Basic
    Concepts
    Indexing
    Types of Indices

    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Indexing mechanisms are used to speed up access to


    desired data.
    For instance, an author catalog in a library

    In a database, they serve the same purpose


    An index file consists of records (called index entries) of
    the form
    search-key

    pointer

    A search key is an attribute or set of attributes used to


    look up records in a file
    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

    Index Evaluation Metrics


    Bases de
    Dados

    Basic
    Concepts
    Indexing
    Types of Indices

    B+ -Tree
    Indices
    Hash Indices

    Indices are chosen according to:


    Access types supported efficiently
    records with a specified value in the attribute
    or records with an attribute value falling in a specified
    range of values

    Indices on
    Multiple Keys

    Access time

    Indices and
    SQL

    Insertion time
    Deletion time
    Space overhead

    Types of Indices
    Bases de
    Dados

    Basic
    Concepts
    Indexing
    Types of Indices

    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    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

    Primary Index
    Bases de
    Dados

    Basic
    Concepts
    Indexing
    Types of Indices

    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Primary index on branch name field of account

    Secondary Index
    Bases de
    Dados

    Basic
    Concepts
    Indexing
    Types of Indices

    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Secondary index on balance field of account

    Dense Index Files


    Bases de
    Dados

    Basic
    Concepts
    Indexing
    Types of Indices

    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Dense index: index record appears for every search-key


    value in the file

    Sparse Index Files


    Bases de
    Dados

    Basic
    Concepts

    Sparse Index: contains index records for only some


    search-key values

    Indexing
    Types of Indices

    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Can secondary indices be sparse?

    Outline
    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices

    Basic Concepts

    B+ -Tree Indices
    B+ -Tree Indices
    Queries on B+ -Trees

    Hash Indices

    Indices on Multiple Keys

    Indices and SQL

    B+ -Tree Indices
    Queries on
    B+ -Trees

    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    B+ -Tree Index Files


    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    B+ -Tree Indices
    Queries on
    B+ -Trees

    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Advantage of B+ -tree index files:


    Automatically reorganizes itself with small, local, changes,
    in the face of insertions and deletions
    Reorganization of entire file is not required to maintain
    performance

    Disadvantage of B+ -trees: extra insertion and deletion


    overhead, space overhead
    Advantages of B+ -trees outweigh disadvantages, and they
    are used extensively

    Structure of a B+ -Tree
    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    B+ -Tree Indices
    Queries on
    B+ -Trees

    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    B+ -tree for account file

    Observations about B+ -trees


    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    B+ -Tree Indices
    Queries on
    B+ -Trees

    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Since the inter-node connections are done by pointers,


    logically close blocks need not be physically close
    The non-leaf levels of the B+ -tree form a hierarchy of
    sparse indices
    The B+ -tree contains a relatively small number of levels
    (logarithmic in the size of the main file), thus searches can
    be conducted efficiently
    Insertions and deletions to the main file can be handled
    efficiently, as the index can be restructured in logarithmic
    time

    Queries on B+ -Trees
    Bases de
    Dados

    Basic
    Concepts

    To find all records with a search-key value of k:


    1 Start with the root node
    1
    2

    B+ -Tree
    Indices
    B+ -Tree Indices
    Queries on
    B+ -Trees

    Hash Indices
    Indices on
    Multiple Keys

    Indices and
    SQL

    Examine the node for the smallest search-key value > k.


    If such a value exists (assume it is Ki ), then follow Pi to
    the child node
    Otherwise follow Pm to the child node (k Km1 , where
    there are m pointers in the node)

    If the node reached by following the pointer above is not a


    leaf node, repeat step 1 on the node
    Else we have reached a leaf node
    1
    2

    If for some i, key Ki = k follow pointer Pi to the desired


    record or bucket
    Else no record with search-key value k exists

    Queries on B+ -Trees (cont.)


    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    B+ -Tree Indices
    Queries on
    B+ -Trees

    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    In processing a query, a path is traversed in the tree from


    the root to some leaf node
    If there are K search-key values in the file, the path is no
    longer than logn/2 (K )
    where n is the number of children

    A node is generally the same size as a disk block, typically


    4 kilobytes, and n is typically around 100 (40 bytes per
    index entry)
    With 1 million search key values and n = 100, at most
    log50 (1 000 000) = 4 nodes are accessed in a lookup

    Outline
    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices

    Basic Concepts

    B+ -Tree Indices

    Hash Indices
    Hashing
    Hashing vs. Ordered Indices

    Indices on Multiple Keys

    Indices and SQL

    Hash Indices
    Hashing
    Hashing vs.
    Ordered Indices

    Indices on
    Multiple Keys
    Indices and
    SQL

    Hashing Indices
    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    Hash Indices
    Hashing
    Hashing vs.
    Ordered Indices

    Indices on
    Multiple Keys
    Indices and
    SQL

    A bucket is a unit of storage containing one or more


    records (a bucket is typically a disk block)
    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, and 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

    Example of Hash Index


    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    Hash Indices
    Hashing
    Hashing vs.
    Ordered Indices

    Indices on
    Multiple Keys
    Indices and
    SQL

    h(A-215) = 1,
    h(A-217) = 3,
    h(A-218) = 4, . . .

    Hash Functions
    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    Hash Indices
    Hashing
    Hashing vs.
    Ordered Indices

    Indices on
    Multiple Keys
    Indices and
    SQL

    Worst hash function maps all search-key values to the


    same bucket
    An ideal hash function is uniform: each bucket is assigned
    the same number of search-key values from the set of all
    possible values
    An ideal hash function is random: 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 the number of buckets could
    be returned

    Hashing vs. Ordered Indices


    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    Hash Indices
    Hashing
    Hashing vs.
    Ordered Indices

    Indices on
    Multiple Keys
    Indices and
    SQL

    Several issues must be considered:


    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

    Outline
    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices

    Basic Concepts

    B+ -Tree Indices

    Hash Indices

    Indices on Multiple Keys

    Indices and SQL

    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Multiple-Key Access
    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Use multiple indices for certain types of queries


    Example
    select account number
    from account
    where branch name = Perryridge and balance = 1000

    Possible strategies for processing query using indices on


    single attributes:
    1
    2
    3

    Use index on branch name to find


    branch name = Perryridge; test for balance = $1000
    Use index on balance to find balance = $1000; test for
    branch name = Perryridge
    Use branch name index to find pointers to all records
    pertaining to the Perryridge branch; similarly, use index on
    balance; take intersection of both sets of pointers obtained

    Indices on Multiple Keys


    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Composite search keys are search keys containing more


    than one attribute
    E.g. (branch name, balance)

    Lexicographic ordering: (a1 , a2 ) < (b1 , b2 ) if either


    a1 < b1 , or
    a1 = b1 and a2 < b2

    Examples
    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    With the where clause


    where branch name = Perryridge and balance = 1000
    the index can be used to fetch only records that satisfy
    both conditions
    Using separate indices in less efficient we may fetch
    many records that satisfy only one of the conditions.
    Can also efficiently handle
    where branch name = Perryridge and balance < 1000
    But cannot efficiently handle
    where branch name < Perryridge and balance = 1000
    May fetch many records that satisfy the first but not the
    second condition

    Outline
    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices

    Basic Concepts

    B+ -Tree Indices

    Hash Indices

    Indices on Multiple Keys

    Indices and SQL

    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Index Definition in SQL


    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    Create an index
    create index <index-name> on <relation-name>(<attribute-list>)
    E.g.: create index branch index on branch(branch name)

    Use create unique index to indirectly specify and enforce


    the condition that the search key is a candidate key
    Not really required if SQL unique integrity constraint is
    supported

    To drop an index
    drop index <index-name>

    Bases de
    Dados

    Basic
    Concepts
    B+ -Tree
    Indices
    Hash Indices
    Indices on
    Multiple Keys
    Indices and
    SQL

    End of Lecture

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy