Homework: Hash Indexing (w6)

Homework: Hash Indexing (w6)
Points 9 Submitting a file upload
Introduction
The objective of this assignment is to learn how to implement index structures on data stored in the external memories.
What you must do
Assume that we have a relation Employee(id, name, bio, manager-id). The values of id and manager-id are integers each with
the fixed size of 8 bytes. The values of name and bio are character strings and take at most 200 and 500 bytes, respectively.
Note that as opposed to the values of id and manager-id, the sizes of the values of name (bio) are not fixed and are between 1
to 200 (500) bytes. The size of each block is 4096 bytes (4KB). The size of each record is less than the size of a block. Using
the provided skeleton code with this assignment, write a C++ program that creates a hash index file for relation Employee
using attribute id. Your program must also enable users to search the created index by providing the id of a record.
• Your program must first read an input Employee relation and build a linear hash index for the relation using attribute id. The input relation
is stored in a CSV file, i.e., each tuple is in a separate line and fields of each record are separated by commas. Your program must
assume that the input CSV file is in the current working directory, i.e., the one from which your program is running, and its name is
Employee.csv. We have included an input CSV file with this assignment as a sample test case for your program. Your program must
create and search hash indexes correctly for other CSV files with the same fields as the sample file.
6/1/23, 1:04 AM Homework: Hash Indexing (w6)
https://canvas.oregonstate.edu/courses/1939345/assignments/9237569?module_item_id=23191658 2/4
Your program must store the hash index in a file with the name EmployeeIndex on the current working directory. You may use one of
the methods explained for storing variable-length records and the method described on storing blocks (pages) of variable-length
records in our lectures on storage management to store records and blocks in the index file. They are also explained in Sections 9.7.2
and 9.6.2 of Cow Book, respectively.
During the index creation, your program may keep up to three blocks plus the directory of the hash index in main memory at any time.
The submitted solutions that use more main memory will not get any points.
You may use hash function h = id mod 2 . Your program must increment the value of n if the average number of records per each
block exceeds 70% of the block capacity.
After finishing the index creation, your program should accept an Employee id in its command line and search the index file for all
records of the given id. Like index creation, your program may use up to three blocks plus the directory of the hash index in main
memory at any time. The submitted solutions that use more main memory will not get any points for implementing lookup operation.
The user of your program may search for records of multiple ids, one id at a time.
Your index file must be a binary data file rather than text / csv.
Each student has an account on hadoop-master.engr.oregonstate.edu server, which is a Linux machine. Your should ensure that your
program can be compiled and run on this machine. You can use the following bash command to connect to it:
 > ssh your_onid_username@hadoop-master.engr.oregonstate.edu
Then it asks for your ONID password and probably one another question. To access this server, you must be on campus or connect to
the Oregon State VPN.
You can use following commands to compile and run C++ code:
 > g++ -std=c++11 main.cpp -o main.out
  > main.out
Necessary files
16
6/1/23, 1:04 AM Homework: Hash Indexing (w6)
https://canvas.oregonstate.edu/courses/1939345/assignments/9237569?module_item_id=23191658 3/4
Hash Indexing
Input file: Employee.csv (https://canvas.oregonstate.edu/courses/1939345/files/99023017?wrap=1)
(https://canvas.oregonstate.edu/courses/1939345/files/99023017/download?download_frd=1)
Following files contain the skeleton code to generate the required EmployeeIndex file. You may make changes to these files adhering to the
assignment requirements.
main.cpp (https://canvas.oregonstate.edu/courses/1939345/files/99023080?wrap=1)
(https://canvas.oregonstate.edu/courses/1939345/files/99023080/download?download_frd=1)
classes.h (https://canvas.oregonstate.edu/courses/1939345/files/99023084?wrap=1)
(https://canvas.oregonstate.edu/courses/1939345/files/99023084/download?download_frd=1)
What to turn in
The assignment is to be turned in before Midnight (by 11:59pm) on May 17. You may turn in the source code of your program through
Canvas. The assignment may be done in groups of two students. Each group may submit only one file that contains the full name, OSU
email, and ONID of every member of the group.
Grading criteria
The programs that implement the correct algorithm, return correct answers, and do not use more than allowed buffers will get the perfect
score. The ones that use more buffer than allowed will not get any points. The ones that implement the right algorithm but return partially
correct answers will get partial scores.
6/1/23, 1:04 AM Homework: Hash Indexing (w6)
https://canvas.oregonstate.edu/courses/1939345/assignments/9237569?module_item_id=23191658 4/4
Total Points: 9
Criteria Ratings Pts
9 pts
Description
of criterion
9 pts
Full
Marks
7 pts
Minor Error
Lookup did not
return all the IDs
we were
searching for.
4.5 pts
Partial Credit
EmployeeIndex created
properly but Lookup
implementation did not match
assignment requirement.
3 pts
Major Error
Your program do not return any queries correctly.
Your EmployeeIndex file structure shows that you
are reading the EmployeeIndex file sequentially for
Lookup. It defeats the purpose Indexing the CSV
file.
0 pts
No Marks
You did not meet
the assignment
requirements