Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2012 Charles Bell
About this chapter
Cite this chapter
Bell, C. (2012). Internal Query Representation. In: Expert MySQL. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4302-4660-2_12
Download citation
DOI: https://doi.org/10.1007/978-1-4302-4660-2_12
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4302-4659-6
Online ISBN: 978-1-4302-4660-2
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books