CHAPTER 10Internal Query Representation
This chapter presents the first part of the advanced database technologies for the database experiment project (DBXP). I begin by introducing the concept of the query tree structure used for storing a query in memory. Next I'll present the query tree structure used for the project and the first in a series of short projects for implementing the DBXP code. The chapter concludes with a set of exercises you can use to learn more about MySQL and query trees.
The Query Tree
A query tree is a tree structure that corresponds to a query, where leaf nodes of the tree contain nodes that access a relation and internal nodes with zero, one, or more children. The internal nodes contain the relational operators. These ...