Design of a Simple Storage Manager for a DBMS (with Sparse Index)

• The deadline of the project will be determined in the PS hour (19.03.2004/Friday-16:00-17:00).
• Specifications
  • In this project you will design a simple storage manager. In the implementation of the storage manager the user will be able to perform the following operations.
    
    Table Operations:
    
    
    • Create a table of a certain type (fields of the table and the search key will be determined by the user)
    • Delete a table.
    • List all the tables in the database.

    Record Operations:
    

    • Insert a record to a specified table.
    • Delete a record according to the search key from a specified table.
    • List all records in a specified table.
    • Search for a record according to the search key in a specified table.

   

  • Search key will be determined by the user when the table is created. Note that search key is not necessarily the primary key, i.e. it may have duplicate values.
  • Records in a table will be stored sorted accoring to the user-specified search key.
  • If  user wants, sparse indexing of the records with respect to the search key field will be implemented.
  • You may assume that the type of each field is string
•        Submittion:

  You should submit a report in paper format, including the following sections:

  • Introduction-including your assumptions and a brief summary of your work
  • Data Structures-system catalog, table format, record format,page format, index record format...(draw figures for illustration)
  • Algorithms -write pseudocodes for table and record operations both when sparse indexing is used and when indexing is not used. Also give a discussion about the pros and cons of the two design alternatives.
  • Conclusion- evaluate your work