Add merge_many_datasets_as_delayed#243
Conversation
xhochy
force-pushed
the
merge-many-dispatch-by
branch
from
a023291 to
9c3765f
Compare
Codecov Report
@@ Coverage Diff @@
## master #243 +/- ##
==========================================
- Coverage 89.73% 89.64% -0.09%
==========================================
Files 39 39
Lines 3720 3795 +75
Branches 901 927 +26
==========================================
+ Hits 3338 3402 +64
- Misses 224 230 +6
- Partials 158 163 +5
Continue to review full report at Codecov.
|
xhochy
force-pushed
the
merge-many-dispatch-by
branch
from
273271d to
3bc661b
Compare
xhochy
force-pushed
the
merge-many-dispatch-by
branch
from
3bc661b to
3bfa595
Compare
| from kartothek.io_components.utils import _instantiate_store, _make_callable | ||
|
|
||
| if TYPE_CHECKING: | ||
| from simplekv import KeyValueStore |
There was a problem hiding this comment.
| from simplekv import KeyValueStore | |
| from simplekv import KeyValueStore # noqa: F401 |
linting fails: kartothek/io_components/merge.py:14:5: F401 'simplekv.KeyValueStore' imported but unused
| ---------- | ||
| dataset_uuids : List[str] | ||
| match_how : Union[str, Callable] | ||
| Define the partition label matching scheme. |
There was a problem hiding this comment.
Why is the whole thing label-based and not index-based?
| Define the partition label matching scheme. | ||
| Available implementations are: | ||
|
|
||
| * first : The partitions of the first dataset are considered to be the base |
There was a problem hiding this comment.
related to the question above: do we really need different string-based join modes?
| * first : The partitions of the first dataset are considered to be the base | ||
| partitions and **all** partitions of the remaining datasets are | ||
| joined to the partitions of the first dataset. This should only be | ||
| used if all but the first dataset contain very few partitions. |
There was a problem hiding this comment.
What does "few" mean? What happens if this is not the case? Please give the user more guidance and try to provide a more failure-proof API.
| explicit instructions for a specific merge. | ||
| Each dict should contain key/values: | ||
|
|
||
| * 'output_label' : The table for the merged dataframe |
There was a problem hiding this comment.
what about the tables key from the example below?
| * `merge_func`: A callable with signature | ||
| `merge_func(dfs, merge_kwargs)` to | ||
| handle the data preprocessing and merging. | ||
| * 'merge_kwargs' : The kwargs to be passed to the `merge_func` |
There was a problem hiding this comment.
not required, use a partial instead.
| If False (Default), the partition labels of the dataset with fewer | ||
| partitions are interpreted as prefixes. | ||
| merge_tasks : List[Dict] | ||
| A list of merge tasks. Each item in this list is a dictionary giving |
There was a problem hiding this comment.
does a merge task drop/consume its input tables? if not, I think this might be a memory issue.
3 participants
This implements a merge that works on multiple datasets. For the moment, I have kept the code separate from the existing merge. Aligning partitions is done depending on
match_howas in some cases, we can speed it up greatly by using e.g. the indices dataframes.Fixes #235
Missing:
exactmatching