如何使用Hive / Pig / MapReduce展平递归层次结构

时间:2016-09-15 20:10:50

标签: hadoop mapreduce hive apache-pig

我有以表格格式存储的不平衡树数据,如:

parent,child
a,b
b,c
c,d
c,f
f,g

enter image description here

树的深度是未知的。

如何展平此层次结构,其中每行包含从一行中的叶节点到根节点的整个路径:

leaf node, root node, intermediate nodes
d,a,d:c:b
f,a,e:b

使用hive,pig或mapreduce解决上述问题的任何建议?提前谢谢。

1 个答案:

答案 0 :(得分:0)

我试图用猪解决它,这里是示例代码:

加入功能:

-- Join parent and child
Define join_hierarchy ( leftA, source, result) returns output {
    joined= join $leftA by parent left, $source by child;
    tmp_filtered= filter joined by source::parent is null;
    part= foreach tmp_filtered leftA::child as child, leftA::path as path;
    $result= union part, $result;
    part_remaining= filter joined by source::parent is not null;
    $output= foreach part_remaining generate $leftA::child as child, source::parent as parent, concat(concat(source::parent,':'),$leftA::path)
 }

加载数据集:

--My dataset field delimiter is ','.    
source= load '*****' using pigStorage(',') as (parent:chararray, child:chararray);
--create additional column for path
leftA= foreach source generate child, parent, concat(parent,':');  

--initially result table will be blank.
result= limit leftA 1;
result= foreach result generate '' as child , '' as parent;
--Flatten hierarchy to 4 levels. Add below lines equivalent to hierarchy depth.

leftA= join_hierarchy(leftA, source, result);
leftA= join_hierarchy(leftA, source, result);
leftA= join_hierarchy(leftA, source, result);
leftA= join_hierarchy(leftA, source, result);