This is a description of the data for the non-relational database examples used for homework at the beginning of the course. The data is purposely chosen to allow a tree-structure organization of the data, which fits XML and JSON a bit better.
The data represents schools, teachers, and students in a school district. To enforce the tree structure we are going to assume the following.
We are also going to assume that every teacher and student has a unique ID number. (Just like every faculty memeber and student at UNC Asheville had a unique ID number.)
You should assume that schools has a single name, such as, “Penrose Elementary School,” but that teachers and students have three name components: first, last, and preferred.