←back to thread

SQL Design Patterns (2010)

(vadimtropashko.wordpress.com)
149 points mci | 2 comments | 27 Aug 25 04:59 UTC | HN request time: 0.001s | source
Show context
alphazard ◴[30 Aug 25 20:17 UTC] No.45077668[source]▶
I always tell people to worry about the data structures that you want the database to maintain for you, and not worry about the SQL. You can always use Google to look up the SQL, or now ChatGPT to generate it for you. SQL is a not-that-great language and it intentionally hides what's going on. It is also different enough between databases that you need to pay attention. So learning to design/think in terms of SQL is probably not worth doing.

The set of data structures that you use to model and index a dataset is worth understanding, and designing in that space is a skill worth learning.

replies(4): >>45078199 #>>45078627 #>>45078711 #>>45081027 #
sgarland ◴[30 Aug 25 22:44 UTC] No.45078627[source]▶
Frankly, this is terrible advice. If you’re not designing your data model around the language it’s going to be queried in, how do you expect to get decent performance out of the database?

Also, in no way does SQL hide anything - it’s a declarative language, and will produce exactly what you tell it to, provided you understand what it is you asked it to do. The query engine is somewhat of a black box, but that is completely orthogonal.

replies(2): >>45078761 #>>45079856 #
paulddraper ◴[30 Aug 25 23:02 UTC] No.45078761[source]▶
SQL is a declarative language so it —- by definition —- hides the execution.

Not really sure what you’re trying to argue here.

replies(3): >>45079245 #>>45079749 #>>45082341 #
1. crazygringo ◴[31 Aug 25 02:16 UTC] No.45079749[source]▶
You missed the "performance" part.

Depending on how you write your query and how you structure your data, a query can take 0.005 seconds or 500 seconds.

SQL hiding the execution is an extremely leaky abstraction. To get the performance you need, you have to plan your possible queries in advance together with how to structure the data.

I mean, it doesn't matter if you only have 100 rows per table, but once you're dealing with multiple tables with millions of rows each it's everything.

replies(1): >>45083574 #
2. greekrich92 ◴[31 Aug 25 14:49 UTC] No.45083574[source]▶
If you use bubblesort instead of quicksort it will take longer as well. Knowing the language and understanding the schema solves this.