Expert MySQL pp 465-494 | Cite as

Internal Query Representation

  • Charles Bell


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, which is used for storing a query in memory. Next, I’ll present the query tree structure used for the project along with 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.


Case Statement Relational Algebra Execution Path Query Execution Node Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Charles Bell 2012

Authors and Affiliations

  • Charles Bell

There are no affiliations available

Personalised recommendations