Robust Data Partitioning for Ad-hoc Query Processing论文阅读
目录RobustDataPartitioningforAd-hocQueryProcessing超分区树的selection超分区树的joinjoin分区分组方法算法1:IndexNestedLoopJoin算法1b:IndexNestedLoops,Split算法2:MinimizingReplicationoftheLargerTable算法3:Bottom-upGroupingRobustD