Presentation is loading. Please wait.

Presentation is loading. Please wait.

Extendible Hashing - Class Example

Published byAbel Henney Modified over 9 years ago

Similar presentations

Presentation on theme: "Extendible Hashing - Class Example"— Presentation transcript:

1 Extendible Hashing - Class Example

2 d1 = local depth d = global depth rec 1 rec 4 splitting bucket rec 1
1 splitting bucket d = 0 record 3 = overflow!! d = 1 rec 2 rec 3 record 5 = overflow!! NEXT

3 rec 1 rec 4 00 01 rec 2 10 splitting bucket rec 3
d = 2 d1 = 2 d1 = 1 11 01 rec 1 rec 4 rec 2 splitting bucket rec 3 record 7 = overflow!! rec 5 rec 6 NEXT

4 000 110 d = 3 111 001 010 011 100 101 rec 1 rec 4 splitting bucket
record 8 = overflow!! d1 = 3 rec 2 rec 7 d1 = 3 rec 3 rec 5 rec 6 NEXT

5 NEXT d1 = 3 d1 = 2 rec 1 rec 4 rec 8 000 110 d = 3 111 001 010 011 100 101 d1 = 3 d1 = 2 rec 2 rec 3 rec 5 rec 6 rec 7 rec 9 splitting bucket record 10 = overflow!!

6 NEXT rec 7 rec 9 d1 = 3 rec 1 rec 4 000 110 d = 3 111 001 010 011 100 101 rec 2 rec 3 d1 = 2 rec 8 rec 11 rec 12 d1 = 3 rec 5 rec 6 splitting bucket rec 10 record 13 = overflow!!

7 d1 = 4 d1 = 3 d1 = 2 0000 1110 d = 4 1111 0001 0010 0011 1100 1101 0100 0101 0110 0111 1010 1011 1000 1001 rec 1 rec 4 rec 2 rec 3 rec 5 rec 7 rec 8 rec 11 rec 12 rec 14 rec 15 rec 6 rec 10 rec 13

Download ppt "Extendible Hashing - Class Example"

Similar presentations

Dana Shapira Hash Tables

Dana Shapira Hash Tables
Name: ___________________________________ I filled _______________________’s bucket today. I filled a bucket by _________________________ _________________________________________.

Name: ___________________________________ I filled _______________________’s bucket today. I filled a bucket by _________________________ _________________________________________.
HASH TABLE. HASH TABLE a group of people could be arranged in a database like this: Hashing is the transformation of a string of characters into a.

HASH TABLE. HASH TABLE a group of people could be arranged in a database like this: Hashing is the transformation of a string of characters into a.
External Memory Hashing. Model of Computation Data stored on disk(s) Minimum transfer unit: a page = b bytes or B records (or block) N records -> N/B.

External Memory Hashing. Model of Computation Data stored on disk(s) Minimum transfer unit: a page = b bytes or B records (or block) N records -> N/B.
CS4432: Database Systems II Hash Indexing 1. Hash-Based Indexes Adaptation of main memory hash tables Support equality searches No range searches 2.

CS4432: Database Systems II Hash Indexing 1. Hash-Based Indexes Adaptation of main memory hash tables Support equality searches No range searches 2.
Hash-Based Indexes Jianlin Feng School of Software SUN YAT-SEN UNIVERSITY.

Hash-Based Indexes Jianlin Feng School of Software SUN YAT-SEN UNIVERSITY.
Hash-based Indexes CS 186, Spring 2006 Lecture 7 R &G Chapter 11 HASH, x. There is no definition for this word -- nobody knows what hash is. Ambrose Bierce,

Hash-based Indexes CS 186, Spring 2006 Lecture 7 R &G Chapter 11 HASH, x. There is no definition for this word -- nobody knows what hash is. Ambrose Bierce,
1 Hash-Based Indexes Module 4, Lecture 3. 2 Introduction As for any index, 3 alternatives for data entries k* : – Data record with key value k – –Choice.

1 Hash-Based Indexes Module 4, Lecture 3. 2 Introduction As for any index, 3 alternatives for data entries k* : – Data record with key value k – –Choice.
Hash-Based Indexes The slides for this text are organized into chapters. This lecture covers Chapter 10. Chapter 1: Introduction to Database Systems Chapter.

Hash-Based Indexes The slides for this text are organized into chapters. This lecture covers Chapter 10. Chapter 1: Introduction to Database Systems Chapter.
1 Linear Hashing Appendix for Chapter 1. 2 Linear Hashing Allow a hash file to expand and shrink dynamically without needing a directory. Suppose the.

1 Linear Hashing Appendix for Chapter 1. 2 Linear Hashing Allow a hash file to expand and shrink dynamically without needing a directory. Suppose the.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Hash-Based Indexes Chapter 11.

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Hash-Based Indexes Chapter 11.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Hash-Based Indexes Chapter 11.

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Hash-Based Indexes Chapter 11.
Lecture 6 : Dynamic Hashing Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University.

Lecture 6 : Dynamic Hashing Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University.
Additional notes on Hashing And notes on HW4. Selected Answers to the Last Assignment The records will hash to the following buckets: K h(K) (bucket number)

Additional notes on Hashing And notes on HW4. Selected Answers to the Last Assignment The records will hash to the following buckets: K h(K) (bucket number)
Chapter 11 (3 rd Edition) Hash-Based Indexes Xuemin COMP9315: Database Systems Implementation.

Chapter 11 (3 rd Edition) Hash-Based Indexes Xuemin COMP9315: Database Systems Implementation.
Tutorial 8 CSI 2132 Database I. Exercise 1 Both disks and main memory support direct access to any desired location (page). On average, main memory accesses.

Tutorial 8 CSI 2132 Database I. Exercise 1 Both disks and main memory support direct access to any desired location (page). On average, main memory accesses.
Index tuning Hash Index. overview Introduction Hash-based indexes are best for equality selections. –Can efficiently support index nested joins –Cannot.

Index tuning Hash Index. overview Introduction Hash-based indexes are best for equality selections. –Can efficiently support index nested joins –Cannot.
23/05/20151 Data Structures Random Access Files. 223/05/2015 Learning Objectives Explain Random Access Searches. Explain the purpose and operation of.

23/05/20151 Data Structures Random Access Files. 223/05/2015 Learning Objectives Explain Random Access Searches. Explain the purpose and operation of.
ICS 421 Spring 2010 Indexing (2) Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa 2/23/20101Lipyeow Lim.

ICS 421 Spring 2010 Indexing (2) Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa 2/23/20101Lipyeow Lim.
Indexing Techniques. Advanced DatabasesIndexing Techniques2 The Problem What can we introduce to make search more efficient? –Indices! What is an index?

Indexing Techniques. Advanced DatabasesIndexing Techniques2 The Problem What can we introduce to make search more efficient? –Indices! What is an index?

Similar presentations

Ads by Google