Closed szarnyasg closed 5 years ago
I my opinion, this task can be approached in many ways. To get the requirements straight, we would like to implement a non-incremental relational engine that
So we need a parallel, memory-efficient solution. I'd approach this like this:
Postponing this into infinity.
ire
- incremental relational enginenre
- naïve relational enginesre
- search-based relational enginenre
should use Akka and utilise multiple CPU cores, but should not use expensive caching like Rete does.There are relational algebra nodes that have no use of caching, e.g. selection and projection nodes. We call these stateless nodes (L). Others that can utilise caching called stateful nodes (F).
We currently have the following nodes:
There are many more to come: evaluating
CASE
expressions, creating list comprehensions, pattern comprehensions (!), etc.