Also in the modern day, it's valuable to learn common strategies behind column-oriented databases such as late tuple materialization, deferred execution, linear scans vs. binary search, instruction pipelining.
Once you're familiar with all this, you'd find sometimes in the field what you really need is a simple flat file or an embeddable database like RocksDB, not a DBMS.
I'm familiar with all of the concepts in the context of databases except "process model." Is this the same as data model? Could you elaborate if not?
Hellerstein, Stonebraker and Hamilton (2007) is a great introduction on this.
> but when you realize you're just adding one tree on top of another you're just masking the problem.
What is the problem and how do you propose to solve it without touching indexes? They are a hard requirement for any decent sized table.
But your point is still valid. :)
Also, of course you may have covering indexes.
I recommend people learn DBs by doing a class like this and understanding b-trees.
Nearly Everything about the strengths & weaknesses of RDBMS is understood through knowing btrees and how they affect key insertion, lookup & ordering.
Most people try to speed up a DB by adding indexes -- but when you realize you're just adding one tree on top of another you're just masking the problem.
Some problems are well suited toward b-trees, and many aren't.
SQL is just a query interface to a remote b-tree system.