Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    Extendible Hashing - Class Example: Record K H (K) H (K)

    Uploaded by

    Igal Gofman
    The document describes the process of extending a hashing table using Extendible Hashing. It shows how records are inserted into the table and buckets are split as the table fills up. Each level of the tree increases the global depth by 1. As new records are added, some are overflow records that cause buckets to split, increasing the local depth of nodes in the tree.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Extendible Hashing - Class Example: Record K H (K) H (K)

    Uploaded by

    Igal Gofman
    11 views7 pages
    The document describes the process of extending a hashing table using Extendible Hashing. It shows how records are inserted into the table and buckets are split as the table fills up. Each level of the tree increases the global depth by 1. As new records are added, some are overflow records that cause buckets to split, increasing the local depth of nodes in the tree.

    Original Description:

    Hashing

    Original Title

    Extendible Hashing

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the process of extending a hashing table using Extendible Hashing. It shows how records are inserted into the table and buckets are split as the table fills up. Each level of the tree increases the global depth by 1. As new records are added, some are overflow records that cause buckets to split, increasing the local depth of nodes in the tree.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    11 views7 pages

    Extendible Hashing - Class Example: Record K H (K) H (K)

    Uploaded by

    Igal Gofman
    The document describes the process of extending a hashing table using Extendible Hashing. It shows how records are inserted into the table and buckets are split as the table fills up. Each level of the tree increases the global depth by 1. As new records are added, some are overflow records that cause buckets to split, increasing the local depth of nodes in the tree.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    of 7

    Extendible Hashing - Class Example

    Record
    rec1
    rec2
    rec3
    rec4
    rec5
    rec6
    rec7
    rec8
    rec9
    rec10
    rec11
    rec12
    rec13
    rec14
    rec15

    K
    2639
    3760
    4692
    4871
    5659
    1821
    1074
    2115
    1620
    2428
    3943
    4750
    6975
    4981
    9208

    h(K)
    1
    16
    20
    7
    27
    29
    18
    11
    20
    28
    7
    14
    31
    21
    24

    h(K)2
    00001
    10000
    10100
    00111
    11011
    11101
    10010
    01011
    10100
    11100
    00111
    01110
    11111
    10101
    11000

    d1 = local depth
    d = global depth

    rec 1

    d1 = 1

    rec 4

    rec 1

    d1=0

    splitting bucket

    rec 2

    splitting bucket

    d=0

    d=1
    record 3 = overflow!!

    rec 2

    d1 = 1

    rec 3

    record 5 = overflow!!

    NEXT

    rec 1

    d1 = 1

    rec 4

    00
    01

    rec 2

    10

    d1 = 2

    rec 3

    11
    d=2

    rec 5

    record 7 = overflow!!

    splitting bucket

    d1 = 2

    rec 6

    NEXT

    rec 1

    d1 = 1

    rec 4

    record 8 = overflow!!

    000
    001

    rec 2

    010

    rec 7

    011

    rec 3

    splitting bucket

    d1 = 3

    d1 = 3

    100

    101
    110
    rec 5

    111
    d=3

    d1 = 2

    rec 6

    NEXT

    000

    rec 1

    d1 = 3

    rec 4

    d1 = 3

    rec 8

    d1 = 2

    NEXT

    001
    010
    011
    100

    rec 2

    101

    rec 7

    110

    rec 3

    111

    rec 9
    d=3

    rec 5
    rec 6

    d1 = 3

    d1 = 3

    d1 = 2

    splitting bucket
    record 10 = overflow!!

    rec 1

    d1 = 3

    rec 4

    d1 = 3

    NEXT

    rec 11
    rec 8

    000

    d1 = 2

    rec 12

    001
    010
    011
    100

    rec 2

    101

    rec 7

    110

    rec 3

    111

    rec 9
    d=3

    d1 = 3

    d1 = 3

    rec 5

    d1 = 3

    rec 6

    d1 = 3

    rec 10

    splitting bucket
    record 13 = overflow!!

    rec 1

    d1 = 3

    0001

    rec 4

    d1 = 3

    0010

    rec 11

    0011

    rec 8

    0100

    rec 12

    0000

    d1 = 2

    0101
    0110

    rec 2

    0111

    rec 7

    1000

    rec 3

    1001

    rec 14

    1010

    rec 5

    1011

    d1 = 3

    d1 = 3

    d1 = 3

    rec 15

    1100
    1101

    rec 6

    1110

    rec 10

    1111

    rec 13
    d=4

    d1 = 4

    d1 = 4

    You might also like