subject: database

the question

the slide that explian how to solve :

Question 1: A database contains a table Students, which is sorted by student name. You know you will be inserting many new students in random order. Your database is using fixed length records (lecture 5 , slide 13). To improve the efficiency of the system, you decide to change the source code of the buffer manager, as follows: When a new tuple is inserted in page p, sort all tuples in p by student name. Since p is aiready in memory, sorting can be done without any 1/0 cost. Is this a good idea? Explain. Page Formats: Fixed Length Records Record id = page id, slot \# In first alternative, moving records for free space management changes rid; may not be acceptable