Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

CS 405/605 Programming Project: Simulation of Extendible Hashing - Prof. Soon Chung, Study Guides, Projects, Research of Computer Science

A programming project for a cs 405/605 course, focusing on the simulation of extendible hashing. Students are required to generate hash values for 104 records, display directory utilization and data bucket utilization, and use any programming language for implementation. References include section 13.8.3 of the textbook and an acm transactions on database systems article.

Typology: Study Guides, Projects, Research

Pre 2010

Uploaded on 08/19/2009

koofers-user-u5o-1
koofers-user-u5o-1 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 405/605 Programming Project
Simulation of Extendible Hashing.
1. The hash value of the hash-key attribute of each record is givenasarandomly gen-
erated integer value.
2. Each data bucket (block) can store 40 records and is dynamically allocated. Each
directory entry stores a pointer to a data bucket.
3. Generate up to 104hash values (to simulate up to 104records), and for every 102
hash values, display followings:
utilization of the directory =number of data buckets
number of entries in the directory
utilization of the data buckets =number of total records
number of records that can be stored in all the data buckets
Note:You can use anyprogramming language, and you can plot the outputs if you
want.
Reference:
1. Section 13.8.3 of the text book.
2. R. Fagin, J. Nievergelt, N. Pippenger,and H. R. Strong, Extendible Hashing: A fast
access method for dynamic files, ACMTrans. on Database Systems,4(3), 1979, pp.
315-344.

Partial preview of the text

Download CS 405/605 Programming Project: Simulation of Extendible Hashing - Prof. Soon Chung and more Study Guides, Projects, Research Computer Science in PDF only on Docsity!

CS 405/605 Programming Project

Simulation of Extendible Hashing.

  1. The hash value of the hash-key attribute of each record is given as a randomly gen- erated integer value.
  2. Each data bucket (block) can store 40 records and is dynamically allocated. Each directory entry stores a pointer to a data bucket.
  3. Generate up to 10^4 hash values (to simulate up to 10^4 records), and for every 10^2 hash values, display followings:

utilization of the directory =

number of data buckets number of entries in the directory

utilization of the data buckets =

number of total records number of records that can be stored in all the data buckets

Note : You can use any programming language, and you can plot the outputs if you want.

Reference :

  1. Section 13.8.3 of the text book.
  2. R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong, Extendible Hashing: A fast access method for dynamic files, ACM Trans. on Database Systems , 4(3), 1979, pp. 315-344.