A small project on data base management system

Introduction A transaction, in the context of a database, is a logical unit that is in dependently executed for data retrieval or updates. In relational databases, database transactions must be atomic, consistent, isolated and durable—summarized as the ACID acronym. Two schedules are conflict-equivalent if one can be reached from the other through a series of swaps of adjacent operations, where no swap falls into one of the following patterns: the operations are by the same transaction the operations use the same database element, and at least one is a write A schedule is conflict-serializable if it is conflict-equivalent to some serial schedule. View Serializability of a schedule is defined by equivalence to a serial schedule with the same transactions, such that respective transactions in the two schedules read and write the same data values. The goal in this project is to implement a View Serializable Checker with the basic operation to test for View Serializability. Your program should be linked with a main program in-order to test its functionality. Note: you should choose the appropriate data structure for the program. 2 Requirements In this project you are required to implement a View Serializable Checker to fulfill the following requirements: 1. Read the size of the schedule from the user. 2. The program takes a given schedule from the user in this form: : "r1x", "r2z", "r1z", "r3y", "r3y",... 3. Deduce its serial schedule 4. Test if the given schedule is equivalent to its serial schedule (3 properties) 5. Give the final result : The given schedule is View Serializable or not?