Implementation of a Simple Storage Manager  With Sparse Index for a DataBase Management System

Deadline: 10.05.2004, Monday, 17:00. (-20% for each day late)

• In this project you will implement the storage manager you have designed in Project 1.
• However, implementation of the design when indexing is not used will not be done. You will just implemen the design when sparce indexing is used.
• In order to be able to test your sparse index implememntation, specify the page size as 200-500 bytes, such that each page can contain at most 3-4 records with 3-4 fields.
• The program should be submitted in both electronic and paper form.
• It should be nicely indented and commented.
• You should create a readme file in the root directory of the diskette. In this file explain the compiler you used and how you compiled and ran the program. A printed version of this document should also be submitted with the diskette.
• An executable should be included.
• A progress report will be given with the program. This file should briefly tell the changes you have made after the design document and the data structures you have used. The layout of the document will be announced in the PS hour and also in the mailing list.
• You will also submit a document containing your source code. Each page of this document should be numbered. And if your project has more then 1 files then in the header part of each page the name of the file that contains the source code should be printed.
• I would like your source to be in C/C++ or Java. You are not supposed to implement any visual interface. Plain dos/linux is enough.
• You should submit the documents (paper) + diskette either directly to me or put it in a box outside Eta203 (This box will have appropriate labeling on it).
• Follow the P.S. , mailing list and this page for more information.