
Storing trees in a database table
Relational databases are very good at storing tabular data, but what if you need to store arbitrarily-sized trees?
Relational databases are very good at storing tabular data, but what if you need to store arbitrarily-sized trees?
The Dutch have a lot of long words that aren’t in dictionaries. But that doesn’t necessarily mean they’re difficult (if you’re Dutch).
Relational databases make it very easy to join data from different tables, but did you know you can also JOIN data within the same table?
Want to let number or rank your query results? Let your database do the hard work for you.
If you have your own blog and like the simplicity of Markdown, but don’t want to give up JSX, you may want to give MDX a try.
How you can detect the language of texts, without using the “ML” word.
Alternatively: why word counting is nothing like bean counting.
This post discusses three common array functions: map, reduce, and filter.
Go’s time
package takes a novel approach to defining datetime serialisation formats. Is it an improvement over existing alternatives?