A discussion of one of the possible solution’s to Dave Thomas’s 19th code kata. I formulated it as a fully-distributed MapReduce job for Hadoop. Excessive? You bet.
Has-and-belongs-to-many relationships are quite common, but they require some special database/index love to make sure their performance stays up as data volume increases.
Clustering is one of the most compelling reasons to use Erlang. Take a look at this basic example showing what it takes to connect multiple Erlang nodes to distribute work.