News for hackers. Stuff that matters.
Re:Why scaling and parallelism remain hard even with new too... by hbogert on Wednesday August 10, 2016 @02:19PM (#12263772)
LAMP scalable for a couple of decades? PHP is hardly usuable for two decades, let alone scalable since that very beginning. Same for Mysql. Did you actually ever try to scale Mysql? Not trivial. Did you every try to scale webserver with PHP where sessions are being used? Not trivial.
Re:Why scaling and parallelism remain hard even with new too... by njharman on Friday August 12, 2016 @06:54PM (#12279357)
P is Perl PHP Python. The other letters have various incarnations. Point being horizontal scale is known, and not difficult solution for many, many domains. Starting a long time ago.
Re:Why scaling and parallelism remain hard even with new too... by Thaxll on Wednesday August 10, 2016 @02:52PM (#12263976)
Yes it's called sharding for MySQL.
Re:Why scaling and parallelism remain hard even with new too... by prodigal_erik on Wednesday August 10, 2016 @03:15PM (#12264144)
The query engine doesn't support sharding. You're starting with a straightforward relational database and ending up with a bunch of fragments of relations that must only be used with great caution because most joins quietly give incorrect results.
Re:Why scaling and parallelism remain hard even with new too... by duaneb on Wednesday August 10, 2016 @03:30PM (#12264243)
If you dislike joins and love data inconsistencies, go for it.
Re:Why scaling and parallelism remain hard even with new too... by kod on Wednesday August 10, 2016 @03:41PM (#12264311)
Joins are still possible in sharded relational models. I wouldn't want to roll my own on mysql, but there are plenty of data stores that use this model (vertica, citus, etc)
Re:Why scaling and parallelism remain hard even with new too... by duaneb on Wednesday August 10, 2016 @05:11PM (#12264788)
> Joins are still possible in sharded relational models.

For some definition of joins, this is true. For a SQL-oriented version, I don't think it's possible, let alone easy, to run arbitrary joins across sharded data. Can you write subqueries that cross shard boundaries? How about aggregate functions? I would be (very pleasantly) surprised if this were possible outside of directly calling the aggregation/join.

> I wouldn't want to roll my own on mysql, but there are plenty of data stores that use this model (vertica, citus, etc)

Yes, and none of them have succeed at scaling mysql without sacrificing heavily in functionality. I don't believe foreign keys are supported cross-shard anywhere. I'm also pretty sure the shard schemes heavily dictate which operations are efficient and even possible, and which are not, so you really need to design around scaling to begin with anyway. So—yes, you can scale MySQL, but avoid using any of the features that make MySQL worth using, except intrashard.

Re:Why scaling and parallelism remain hard even with new too... by kod on Wednesday August 10, 2016 @07:15PM (#12265347)
None of the stores I mentioned use mysql. I'm not talking about scaling mysql, I'm talking about scaling relational databases, specifically the comment about joins.

Joins arent a big deal, just join on (at least) the shard key, or for smaller hash joins ship the small side of the join.

If you have multiple kinds of joins keep multiple copies with different shard keys.

Yes, (monoidal) aggregations are possible with this, yes subqueries are possible with this.

Re:Why scaling and parallelism remain hard even with new too... by Thaxll on Wednesday August 10, 2016 @04:12PM (#12264483)
It's the method that largest companies are using, it's not as bad as it sounds.
Re:Why scaling and parallelism remain hard even with new too... by duaneb on Wednesday August 10, 2016 @05:31PM (#12264878)
> It's the method that largest companies are using

....in addition to other data stores. I don't know of any company exclusively using mysql; I hear that billing was migrated onto a sharded mysql cluster much more frequently due to the inherently transactional nature of billing operations and queries.