2 Commits (9ae34e68a7ff6eaec7922b5fda167d1d0859dfd0)

Author	SHA1	Message	Date
Christian Haudum	9bdd5d15bf	chore: Add tree printer for physical plan (#16716) ... This PR adds a generic tree printer (similar to the Unix utility `tree`). Additionally it provides an implementation to convert the DAG of the physical plan into the generic tree used by the tree printer. This allows to print plans like this (note, these examples do not make sense, they are only for demonstrating the visual output of the printer). Simple DAG with single child node: ``` Limit #limit offset=0 limit=0 └── Filter #filter predicates=() └── SortMerge #merge column=<nil> order=UNDEFINED ├── DataObjScan #scan1 location= stream_ids=() projections=() predicates=() direction=0 limit=0 └── DataObjScan #scan2 location= stream_ids=() projections=() predicates=() direction=0 limit=0 ``` DAG with multple root nodes: ``` Limit #limit1 offset=0 limit=0 └── DataObjScan #scan1 location= stream_ids=() projections=() predicates=() direction=0 limit=0 Limit #limit2 offset=0 limit=0 └── DataObjScan #scan2 location= stream_ids=() projections=() predicates=() direction=0 limit=0 ``` DAG with parent node that share the same child node: ``` Limit #limit offset=0 limit=0 ├── Limit #filter1 offset=0 limit=0 │ └── DataObjScan #scan location= stream_ids=() projections=() predicates=() direction=0 limit=0 └── Limit #filter2 offset=0 limit=0 └── DataObjScan #scan location= stream_ids=() projections=() predicates=() direction=0 limit=0 ``` --- Signed-off-by: Christian Haudum <christian.haudum@gmail.com>	1 year ago
Christian Haudum	5a76a04684	chore: Add basic building blocks of a physical plan (#16710) ... This PR adds the basic components of a physical plan. For the first iteration of the new execution engine, we need to support nodes to represent limited and filter queries (with only label/line filters). These nodes are: * DataObjScan * SortMerge * Projection * Filter * Limit The physical plan is implemented as a [directed acyclic graph](https://en.wikipedia.org/wiki/Directed_acyclic_graph) (DAG). It has convenience functions for adding nodes (vertices) and edges, getting parents and children of a node, as well as for traversing the graph using the [depth-first-search](https://en.wikipedia.org/wiki/Depth-first_search) algorithm. Additionally to the node types, the PR also contains the basic types of expressions, which can be properties of the nodes. --- Signed-off-by: Christian Haudum <christian.haudum@gmail.com>	1 year ago