Get the latest tech news
Not all graphs are trees
It's pretty easy to imagine how to represent relational algebra expressions as a tree—they are already structurally rooted trees where each operator has its...
April 29, 2024 It's pretty easy to imagine how to represent relational algebra expressions as a tree—they are already structurally rooted trees where each operator has its inputs as children. And then the language can provide an explicit "fixpoint" operator that takes an initial state and the lambda to iterate to close the loop for us: If we want the full flexibility of graph construction, we can go all the way to how something like Datalog works, where we simply write out each edge explicitly.
Or read this on Hacker News
