You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Test that f is a Component expression over the Components of ds_1 (static).
Model interactions with other operators, such as if a filter is performed on a union, the filter gets applied on the datasets (evaluate the performance impact as well)
The text was updated successfully, but these errors were encountered:
…ns to develop
* commit '5407e4d27523f79cdfaa6d8515d3d15a66507b0c':
Generalize boolean comparision operation to handle a mix of component and scalar operands
Impement boolean comparison operators
Boolean expression with equal to for join
I used guava graph to represent the hierarchy in memory. I deviated from the specification in the sense that it is possible to send a dataset instead of a hierarchy name, provided that it follows the following rules:
one and only one column must be named from
one and only one column must be named to
one and only one column must be named sign
from and to must be of the same type
from must be string (until we have a strong type system)
the values in the column sign can be "+"/"plus", "-"/"minus"
The resulting graph must be acyclic, the operation will fail and return a message containing the cycle if not. Only sum is supported but adding the product should be easy.
Dataset ds_1 := Dataset ds_2
[filter Component f]
The text was updated successfully, but these errors were encountered: