3 ms·
The author ignores a huge amount of research done in the last 10 years on query evaluation. A series of filter operations and successive sub-selects can't reac
by j-pb 5y ago
The author ignores a huge amount of research done in the last 10 years on query evaluation.
A series of filter operations and successive sub-selects can't reach the same performance a worst case optimal multiway join can reach (and not even the performance of a series of two way joins that are smarter than linear scans, e.g. a hash join).
Similarly, there is no reason why incremental view maintenance should be possible for NoSQL, but not for SQL.
Materialize has shown that incremental view maintenance for PostgreSQL is very possible and very fast.
This article also seems to very narrowly limit NoSQL to Document Store, which is extremely narrow minded.
All in all it does NoSQL a huge disservice.
- dmpk2k 5y agoCould you elaborate on your second paragraph?
- j-pb 5y agoTL;DR Your intermediary result sets can be significantly bigger than your ouput set. By instead of combining whole relations but performing a depth first search through the variable assignment space, while peforming constraint propagation, you can achieve a runtime that is much better than what classical pairwise joining systems can achieve. Since the proposed solution for joins in RxDB is an especially naive kind of pairwise join, it will be especially bad. https://cs.stanford.edu/people/chrismre/papers/paper49.Ngo.pdf https://cs.stanford.edu/people/chrismre/papers/paper49.Ngo.p...