Abstract
To me, the true beauty of the relational database engine comes from its declarative nature. As a programmer, I simply ask the engine a question, and it answers it. The questions I ask are usually pretty simple; just give me some data from a few tables, correlate it based on a column or two, do a little math perhaps, and give me back information (and naturally do it incredibly fast, if you don’t mind, regardless of the fact that there are 10 billion rows involved). While simple may not actually be the right single-word description for what I have asked, the engine usually obliges with an answer pretty quickly. Usually, but not always. This is where the DBA and data programmers must figure out what the optimizer is doing and help it along.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2021 Louis Davidson
About this chapter
Cite this chapter
Davidson, L. (2021). Data Structures, Indexes, and Their Application. In: Pro SQL Server Relational Database Design and Implementation. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-6497-3_11
Download citation
DOI: https://doi.org/10.1007/978-1-4842-6497-3_11
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-6496-6
Online ISBN: 978-1-4842-6497-3
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)