News for hackers. Stuff that matters.
Re:How NoSQL forced the evolution of a scalable relational d... by dragonwriter on Friday July 13, 2018 @01:54PM (#17525125)
> There are plenty of models that don't work well modelled relationally.

There are plenty of data shapes and access patterns for which existing RDBMS implementations are inefficient, as I acknowledged. That's not a feature of whether the data is or is not relational—“relational” is a feature of a data model, and any data can be modelled relationally—but rather of the available RDBMS implementations.

> Wide table with 100K analytical features keyed against a customer. Now if you need to combine a few dozen of these features for predictive purposes then how do you do that in SQL ?

In terms of both the relational model and the SQL language, this is trivial. In most concrete SQL implementations, it is both inefficient and requires a concrete schema that diverges from the abstract relational model of the data, because you need multiple tables with a common key rather than a single table, even if abstractly it is a single relation in a normalized model. There's nothing fundamental about either SQL or the relational model that requires this, its just not the usage pattern common RDBMS storage implementations are optimized for.

> Time series data can be many orders of magnitude faster in JSON document stores where you can have embedded/nested records.

Yes, that's an efficiency of access patterns issue, not an “is the data relational” issue.

Of course, outside the strict relational model of data, SQL based object-relational databases like Oracle and Postgres have supported embedded and nested records (via the combination of composite and collection data types) since before “JSON object stores” existed.

There are no comments on this comment yet.