Reference no: EM133840273
Homework: Database Management Systems
Learning Outcome
1) Recognize database file organization and indexing.
2) Analyze algorithms for query processing.
3) Analyze algorithms for query processing.
4) Develop a standard database using DBMS.
Task
Question I
Discuss the structure and components of a hard disk drive. Provide an example of how data is stored on a hard disk. (Note: You must create your own figure to illustrate this, do not copy from books, the internet, or other sources.)
Question II
1) Explain the difference between a primary index, a clustering index, and a secondary index in a database. In what scenarios would you use each type of index, and how does having multiple secondary indexes affect data retrieval? Support your answer with examples.
2) List and discuss three algorithms you would use to search for data in a database. Provide an example of each algorithm and include a figure to illustrate their performance (e.g., time complexity).
Question III
Given the following parameters:
1) index size = 5 bytes
2) record pointer = 4 bytes
3) block size = 512 bytes
4) records = 35000
Calculate and discuss the following:
1) The size of the index entry
2) The index blocking factor
3) The number of index blocks
4) Binary search block accesses
5) The average linear search accesses
6) Discuess the average cost between linear search, binary search with indexing, and binary search on ordered records (without an index)
Question IV
Assume that you are working as a database administrator at Saudi Electronic University (SEU), and you need to retrieve data for the Dammam branch only, using relation algebra and SQL query. The data to be retrieved includes the course ID and name, the faculty member's name and department number, and the student's name.
1) Create an SQL query to retrieve the required data.
2) Translate the SQL query into relational algebra.
3) Discuss the benefits of translating the SQL query into relational algebra.