4 ms·
I'm amazed how people tend to overcomplicate simple things. Isn't the noSQL algebra is just relational algebra without the Cartesian product operator?
by a18x 16y ago
I'm amazed how people tend to overcomplicate simple things.
Isn't the noSQL algebra is just relational algebra without the Cartesian product operator?
- kenjackson 16y agoHuh? I'm going to need more than hand waving to get that assertion. Please expand.
- a18x 16y agoMy assertion means that relational algebra without Cartesian product operator can be used for noSQL databases, except graph databases. Primitive operators of relational algebra such as projection, selection and set operators are pretty much scalable. Cartesian product is not. Authors mentioned that property of the Cartesian product in the example with WWW database. In order to emulate Cartesian product in noSQL developers have to use external tools such as Map Reduce which has nothing to do with databases. http://typicalprogrammer.com/?p=16 http://typicalprogrammer.com/?p=16
- a18x 16y agoContinuation of the previous post... Why wouldn’t the noSQL providers use SQL as a starting point? Take SQL standard, relax transactional requirements from ACID to BASE, add functions for searching in columns, add a note that execution of queries with Cartesian product may be extremely slow (with Map Reduce or other parallelization technology. Let the database vendors compete in that field). I recommend book “Data-Intensive Text Processing with MapReduce” by Jimmy Lin and Chris Dyer book for further reading on how to implement relational joins with MapReduce. DML and DDL will be changed substantially, though. Drop or relax relational constraints, different table definition etc. As for coSQL, it looks to me like it introduces Codasyl-syle queries instead of relational algebra.