Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.hadoop.hive.ql.optimizer.physical;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import org.apache.hadoop.fs.Path;
import org.apache.hadoop.hive.ql.Context;
import org.apache.hadoop.hive.ql.exec.ConditionalTask;
import org.apache.hadoop.hive.ql.exec.MapJoinOperator;
import org.apache.hadoop.hive.ql.exec.Operator;
import org.apache.hadoop.hive.ql.exec.Task;
import org.apache.hadoop.hive.ql.exec.TaskFactory;
import org.apache.hadoop.hive.ql.exec.Utilities;
import org.apache.hadoop.hive.ql.exec.mr.MapredLocalTask;
import org.apache.hadoop.hive.ql.lib.DefaultGraphWalker;
import org.apache.hadoop.hive.ql.lib.DefaultRuleDispatcher;
import org.apache.hadoop.hive.ql.lib.Dispatcher;
import org.apache.hadoop.hive.ql.lib.GraphWalker;
import org.apache.hadoop.hive.ql.lib.Node;
import org.apache.hadoop.hive.ql.lib.NodeProcessor;
import org.apache.hadoop.hive.ql.lib.NodeProcessorCtx;
import org.apache.hadoop.hive.ql.lib.Rule;
import org.apache.hadoop.hive.ql.lib.RuleRegExp;
import org.apache.hadoop.hive.ql.lib.TaskGraphWalker;
import org.apache.hadoop.hive.ql.parse.ParseContext;
import org.apache.hadoop.hive.ql.parse.SemanticException;
import org.apache.hadoop.hive.ql.plan.ConditionalResolver;
import org.apache.hadoop.hive.ql.plan.ConditionalResolverCommonJoin;
import org.apache.hadoop.hive.ql.plan.ConditionalResolverCommonJoin.ConditionalResolverCommonJoinCtx;
import org.apache.hadoop.hive.ql.plan.ConditionalResolverSkewJoin;
import org.apache.hadoop.hive.ql.plan.ConditionalResolverSkewJoin.ConditionalResolverSkewJoinCtx;
import org.apache.hadoop.hive.ql.plan.ConditionalWork;
import org.apache.hadoop.hive.ql.plan.MapredLocalWork;
import org.apache.hadoop.hive.ql.plan.MapredWork;
import org.apache.hadoop.hive.ql.plan.OperatorDesc;
/**
* An implementation of PhysicalPlanResolver. It iterator each MapRedTask to see whether the task
* has a local map work if it has, it will move the local work to a new local map join task. Then it
* will make this new generated task depends on current task's parent task and make current task
* depends on this new generated task.
*/
public class MapJoinResolver implements PhysicalPlanResolver {
@Override
public PhysicalContext resolve(PhysicalContext pctx) throws SemanticException {
// create dispatcher and graph walker
Dispatcher disp = new LocalMapJoinTaskDispatcher(pctx);
TaskGraphWalker ogw = new TaskGraphWalker(disp);
// get all the tasks nodes from root task
ArrayList topNodes = new ArrayList();
topNodes.addAll(pctx.getRootTasks());
// begin to walk through the task tree.
ogw.startWalking(topNodes, null);
return pctx;
}
/**
* Iterator each tasks. If this task has a local work,create a new task for this local work, named
* MapredLocalTask. then make this new generated task depends on current task's parent task, and
* make current task depends on this new generated task
*/
class LocalMapJoinTaskDispatcher implements Dispatcher {
private PhysicalContext physicalContext;
public LocalMapJoinTaskDispatcher(PhysicalContext context) {
super();
physicalContext = context;
}
private void processCurrentTask(Task currTask,
ConditionalTask conditionalTask) throws SemanticException {
// get current mapred work and its local work
MapredWork mapredWork = (MapredWork) currTask.getWork();
MapredLocalWork localwork = mapredWork.getMapWork().getMapRedLocalWork();
if (localwork != null) {
// get the context info and set up the shared tmp URI
Context ctx = physicalContext.getContext();
Path tmpPath = Utilities.generateTmpPath(ctx.getLocalTmpPath(), currTask.getId());
localwork.setTmpPath(tmpPath);
mapredWork.getMapWork().setTmpHDFSPath(Utilities.generateTmpPath(
ctx.getMRTmpPath(), currTask.getId()));
// create a task for this local work; right now, this local work is shared
// by the original MapredTask and this new generated MapredLocalTask.
MapredLocalTask localTask = (MapredLocalTask) TaskFactory.get(localwork);
// set the backup task from curr task
localTask.setBackupTask(currTask.getBackupTask());
localTask.setBackupChildrenTasks(currTask.getBackupChildrenTasks());
currTask.setBackupChildrenTasks(null);
currTask.setBackupTask(null);
if (currTask.getTaskTag() == Task.CONVERTED_MAPJOIN) {
localTask.setTaskTag(Task.CONVERTED_MAPJOIN_LOCAL);
} else {
localTask.setTaskTag(Task.HINTED_MAPJOIN_LOCAL);
currTask.setTaskTag(Task.HINTED_MAPJOIN);
}
// replace the map join operator to local_map_join operator in the operator tree
// and return all the dummy parent
LocalMapJoinProcCtx localMapJoinProcCtx = adjustLocalTask(localTask);
List> dummyOps =
localMapJoinProcCtx.getDummyParentOp();
// create new local work and setup the dummy ops
MapredLocalWork newLocalWork = localwork.extractDirectWorks(
localMapJoinProcCtx.getDirectWorks());
newLocalWork.setDummyParentOp(dummyOps);
mapredWork.getMapWork().setMapRedLocalWork(newLocalWork);
if (localwork.getAliasToFetchWork().isEmpty()) {
// no alias to stage.. no local task
newLocalWork.setHasStagedAlias(false);
currTask.setBackupTask(localTask.getBackupTask());
currTask.setBackupChildrenTasks(localTask.getBackupChildrenTasks());
return;
}
newLocalWork.setHasStagedAlias(true);
// get all parent tasks
List> parentTasks = currTask.getParentTasks();
currTask.setParentTasks(null);
if (parentTasks != null) {
for (Task tsk : parentTasks) {
// make new generated task depends on all the parent tasks of current task.
tsk.addDependentTask(localTask);
// remove the current task from its original parent task's dependent task
tsk.removeDependentTask(currTask);
}
} else {
// in this case, current task is in the root tasks
// so add this new task into root tasks and remove the current task from root tasks
if (conditionalTask == null) {
physicalContext.addToRootTask(localTask);
physicalContext.removeFromRootTask(currTask);
} else {
// set list task
List> listTask = conditionalTask.getListTasks();
ConditionalWork conditionalWork = conditionalTask.getWork();
int index = listTask.indexOf(currTask);
listTask.set(index, localTask);
// set list work
List listWork = (List) conditionalWork.getListWorks();
index = listWork.indexOf(mapredWork);
listWork.set(index, localwork);
conditionalWork.setListWorks(listWork);
ConditionalResolver resolver = conditionalTask.getResolver();
if (resolver instanceof ConditionalResolverSkewJoin) {
// get bigKeysDirToTaskMap
ConditionalResolverSkewJoinCtx context = (ConditionalResolverSkewJoinCtx) conditionalTask
.getResolverCtx();
HashMap> bigKeysDirToTaskMap = context
.getDirToTaskMap();
// to avoid concurrent modify the hashmap
HashMap> newbigKeysDirToTaskMap = new HashMap>();
// reset the resolver
for (Map.Entry> entry : bigKeysDirToTaskMap
.entrySet()) {
Task task = entry.getValue();
Path key = entry.getKey();
if (task.equals(currTask)) {
newbigKeysDirToTaskMap.put(key, localTask);
} else {
newbigKeysDirToTaskMap.put(key, task);
}
}
context.setDirToTaskMap(newbigKeysDirToTaskMap);
conditionalTask.setResolverCtx(context);
} else if (resolver instanceof ConditionalResolverCommonJoin) {
// get bigKeysDirToTaskMap
ConditionalResolverCommonJoinCtx context = (ConditionalResolverCommonJoinCtx) conditionalTask
.getResolverCtx();
HashMap, Set> taskToAliases = context.getTaskToAliases();
// to avoid concurrent modify the hashmap
// Must be deterministic order map for consistent q-test output across Java versions
HashMap, Set> newTaskToAliases =
new LinkedHashMap, Set>();
// reset the resolver
for (Map.Entry, Set> entry : taskToAliases.entrySet()) {
Task task = entry.getKey();
Set key = new HashSet(entry.getValue());
if (task.equals(currTask)) {
newTaskToAliases.put(localTask, key);
} else {
newTaskToAliases.put(task, key);
}
}
context.setTaskToAliases(newTaskToAliases);
conditionalTask.setResolverCtx(context);
}
}
}
// make current task depends on this new generated localMapJoinTask
// now localTask is the parent task of the current task
localTask.addDependentTask(currTask);
}
}
@Override
public Object dispatch(Node nd, Stack stack, Object... nodeOutputs)
throws SemanticException {
Task currTask = (Task) nd;
// not map reduce task or not conditional task, just skip
if (currTask.isMapRedTask()) {
if (currTask instanceof ConditionalTask) {
// get the list of task
List> taskList = ((ConditionalTask) currTask).getListTasks();
for (Task tsk : taskList) {
if (tsk.isMapRedTask()) {
this.processCurrentTask(tsk, ((ConditionalTask) currTask));
}
}
} else {
this.processCurrentTask(currTask, null);
}
}
return null;
}
// replace the map join operator to local_map_join operator in the operator tree
private LocalMapJoinProcCtx adjustLocalTask(MapredLocalTask task)
throws SemanticException {
LocalMapJoinProcCtx localMapJoinProcCtx = new LocalMapJoinProcCtx(task, physicalContext
.getParseContext());
Map opRules = new LinkedHashMap();
opRules.put(new RuleRegExp("R1", MapJoinOperator.getOperatorName() + "%"),
LocalMapJoinProcFactory.getJoinProc());
// The dispatcher fires the processor corresponding to the closest
// matching rule and passes the context along
Dispatcher disp = new DefaultRuleDispatcher(LocalMapJoinProcFactory.getDefaultProc(),
opRules, localMapJoinProcCtx);
GraphWalker ogw = new DefaultGraphWalker(disp);
// iterator the reducer operator tree
ArrayList topNodes = new ArrayList();
topNodes.addAll(task.getWork().getAliasToWork().values());
ogw.startWalking(topNodes, null);
return localMapJoinProcCtx;
}
public PhysicalContext getPhysicalContext() {
return physicalContext;
}
public void setPhysicalContext(PhysicalContext physicalContext) {
this.physicalContext = physicalContext;
}
}
/**
* A container of current task and parse context.
*/
public static class LocalMapJoinProcCtx implements NodeProcessorCtx {
private Task currentTask;
private ParseContext parseCtx;
private List> dummyParentOp = null;
private boolean isFollowedByGroupBy;
private Map>> directWorks;
public LocalMapJoinProcCtx(Task task, ParseContext parseCtx) {
currentTask = task;
this.parseCtx = parseCtx;
dummyParentOp = new ArrayList>();
directWorks = new HashMap>>();
isFollowedByGroupBy = false;
}
public Task getCurrentTask() {
return currentTask;
}
public void setCurrentTask(Task currentTask) {
this.currentTask = currentTask;
}
public boolean isFollowedByGroupBy() {
return isFollowedByGroupBy;
}
public void setFollowedByGroupBy(boolean isFollowedByGroupBy) {
this.isFollowedByGroupBy = isFollowedByGroupBy;
}
public ParseContext getParseCtx() {
return parseCtx;
}
public void setParseCtx(ParseContext parseCtx) {
this.parseCtx = parseCtx;
}
public void setDummyParentOp(List> op) {
this.dummyParentOp = op;
}
public List> getDummyParentOp() {
return this.dummyParentOp;
}
public void addDummyParentOp(Operator op) {
this.dummyParentOp.add(op);
}
public void setDirectWorks(
Map>> directWorks) {
this.directWorks = directWorks;
}
public Map>> getDirectWorks() {
return directWorks;
}
public void addDirectWorks(
MapJoinOperator mapJoinOp, List> directOperators) {
directWorks.put(mapJoinOp, directOperators);
}
}
}
