Project #04: Databases and AVL Trees (Solved)
computer science
Description
Background
Conceptually, a database is a set of tables, where each table stores data that is logically related. For
example, the database maintained by UIC would include the following tables:
students: data about each student
faculty: data about each faculty member
staff: data about each staff employee
courses: data about each course
Databases are created, searched and modified using the SQL programming language. For example, here’s an
SQL select query to retrieve all the info from the students table about the student with netid fzizza2:
select * from students where netid = fzizza2
How are databases implemented? Each table is stored in a file, and balanced trees are built to index the file
and find data quickly. For example, suppose student fzizza2 has their data stored at position 2048 in the
underlying file (which would be called “students.data” based on the tablename). This file would be indexed by
a tree consisting of (uin, offset) pairs, and this student’s node in the tree would contain the pair (fzizza2,
2048).Background
Conceptually, a database is a set of tables, where each table stores data that is logically related. For
example, the database maintained by UIC would include the following tables:
students: data about each student
faculty: data about each faculty member
staff: data about each staff employee
courses: data about each course
Databases are created, searched and modified using the SQL programming language. For example, here’s an
SQL select query to retrieve all the info from the students table about the student with netid fzizza2:
select * from students where netid = fzizza2
How are databases implemented? Each table is stored in a file, and balanced trees are built to index the file
and find data quickly. For example, suppose student fzizza2 has their data stored at position 2048 in the
underlying file (which would be called “students.data” based on the tablename). This file would be indexed by
a tree consisting of (uin, offset) pairs, and this student’s node in the tree would contain the pair (fzizza2,
2048).
