Examples with LogicalVertex com.alibaba.maxgraph.compiler.logical.LogicalVertex used on opensource projects

Example 31 with LogicalVertex

use of com.alibaba.maxgraph.compiler.logical.LogicalVertex in project GraphScope by alibaba.

the class LogicalChainSourceVertex method toString.

@Override
public String toString() {
    StringBuilder oplist = new StringBuilder(this.logicalSourceVertex.toString());
    for (LogicalVertex vertex : vertexList) {
        oplist.append("_").append(vertex.toString());
    }
    oplist.append("_").append(this.getId());
    return oplist.toString();
}

Example 32 with LogicalVertex

use of com.alibaba.maxgraph.compiler.logical.LogicalVertex in project GraphScope by alibaba.

the class LogicalChainSourceVertex method computeOutputEstimates.

@Override
public void computeOutputEstimates(DataStatistics statistics, GraphSchema schema) {
    logicalSourceVertex.computeOutputEstimates(statistics, schema);
    for (LogicalVertex logicalVertex : vertexList) {
        logicalVertex.computeOutputEstimates(statistics, schema);
    }
    LogicalVertex lastVertex = vertexList.get(vertexList.size() - 1);
    this.estimatedNumRecords = lastVertex.getEstimatedNumRecords();
    this.estimatedValueSize = lastVertex.getEstimatedOutputSize();
}

Example 33 with LogicalVertex

use of com.alibaba.maxgraph.compiler.logical.LogicalVertex in project GraphScope by alibaba.

the class RatioEdgeVertexTreeNode method buildLogicalQueryPlan.

@Override
public LogicalSubQueryPlan buildLogicalQueryPlan(ContextManager contextManager) {
    TreeNodeLabelManager labelManager = contextManager.getTreeNodeLabelManager();
    VertexIdManager vertexIdManager = contextManager.getVertexIdManager();
    TreeNode inputNode = this.getInputNode();
    LogicalVertex inputVertex = inputNode.getOutputVertex();
    TreeNode sourceNode = UnaryTreeNode.class.cast(inputNode).getInputNode();
    LogicalVertex sourceVertex = sourceNode.getOutputVertex();
    LogicalSubQueryPlan logicalSubQueryPlan = new LogicalSubQueryPlan(contextManager);
    logicalSubQueryPlan.addLogicalVertex(inputVertex);
    logicalSubQueryPlan.addLogicalVertex(sourceVertex);
    ProcessorFunction countFunction = new ProcessorFunction(QueryFlowOuterClass.OperatorType.COUNT);
    LogicalUnaryVertex countVertex = new LogicalUnaryVertex(vertexIdManager.getId(), countFunction, false, sourceVertex);
    logicalSubQueryPlan.addLogicalVertex(countVertex);
    LogicalEdge countEdge = new LogicalEdge(EdgeShuffleType.SHUFFLE_BY_CONST);
    countEdge.setStreamIndex(1);
    logicalSubQueryPlan.addLogicalEdge(sourceVertex, countVertex, countEdge);
    ProcessorFunction enterKeyFunction = new ProcessorFunction(QueryFlowOuterClass.OperatorType.ENTER_KEY, Message.Value.newBuilder().setPayload(QueryFlowOuterClass.EnterKeyArgumentProto.newBuilder().setEnterKeyType(QueryFlowOuterClass.EnterKeyTypeProto.KEY_SELF).setUniqFlag(true).build().toByteString()));
    LogicalVertex enterKeyVertex = new LogicalUnaryVertex(vertexIdManager.getId(), enterKeyFunction, false, sourceVertex);
    logicalSubQueryPlan.addLogicalVertex(enterKeyVertex);
    logicalSubQueryPlan.addLogicalEdge(sourceVertex, enterKeyVertex, new LogicalEdge(EdgeShuffleType.FORWARD));
    ProcessorFunction valueFunction = new ProcessorFunction(QueryFlowOuterClass.OperatorType.valueOf(direction.name() + "_V"));
    LogicalUnaryVertex valueVertex = new LogicalUnaryVertex(vertexIdManager.getId(), valueFunction, false, enterKeyVertex);
    logicalSubQueryPlan.addLogicalVertex(valueVertex);
    LogicalEdge valueEdge = new LogicalEdge(EdgeShuffleType.SHUFFLE_BY_KEY);
    logicalSubQueryPlan.addLogicalEdge(enterKeyVertex, valueVertex, valueEdge);
    ProcessorFunction countByKeyFunction = new ProcessorFunction(QueryFlowOuterClass.OperatorType.COUNT_BY_KEY, Message.Value.newBuilder().addIntValueList(0));
    LogicalUnaryVertex countByKeyVertex = new LogicalUnaryVertex(vertexIdManager.getId(), countByKeyFunction, false, valueVertex);
    logicalSubQueryPlan.addLogicalVertex(countByKeyVertex);
    logicalSubQueryPlan.addLogicalEdge(valueVertex, countByKeyVertex, new LogicalEdge(EdgeShuffleType.SHUFFLE_BY_KEY));
    ProcessorFunction ratioFunction = new ProcessorFunction(QueryFlowOuterClass.OperatorType.JOIN_RATIO, Message.Value.newBuilder().setIntValue(CompilerUtils.parseCompareType(predicate, predicate.getBiPredicate()).getNumber()).setDoubleValue(Double.parseDouble(predicate.getValue().toString())));
    LogicalBinaryVertex logicalBinaryVertex = new LogicalBinaryVertex(vertexIdManager.getId(), ratioFunction, true, countVertex, countByKeyVertex);
    logicalSubQueryPlan.addLogicalVertex(logicalBinaryVertex);
    logicalSubQueryPlan.addLogicalEdge(countVertex, logicalBinaryVertex, new LogicalEdge(EdgeShuffleType.BROADCAST));
    logicalSubQueryPlan.addLogicalEdge(countByKeyVertex, logicalBinaryVertex, new LogicalEdge(EdgeShuffleType.FORWARD));
    setFinishVertex(logicalBinaryVertex, labelManager);
    addUsedLabelAndRequirement(logicalBinaryVertex, labelManager);
    return logicalSubQueryPlan;
}

Example 34 with LogicalVertex

use of com.alibaba.maxgraph.compiler.logical.LogicalVertex in project GraphScope by alibaba.

the class RatioVertexTreeNode method buildLogicalQueryPlan.

@Override
public LogicalSubQueryPlan buildLogicalQueryPlan(ContextManager contextManager) {
    TreeNodeLabelManager treeNodeLabelManager = contextManager.getTreeNodeLabelManager();
    VertexIdManager vertexIdManager = contextManager.getVertexIdManager();
    LogicalVertex sourceVertex = getInputNode().getOutputVertex();
    LogicalSubQueryPlan logicalSubQueryPlan = new LogicalSubQueryPlan(contextManager);
    logicalSubQueryPlan.addLogicalVertex(sourceVertex);
    ProcessorFunction countFunction = new ProcessorFunction(QueryFlowOuterClass.OperatorType.COUNT);
    LogicalUnaryVertex countVertex = new LogicalUnaryVertex(vertexIdManager.getId(), countFunction, false, sourceVertex);
    logicalSubQueryPlan.addLogicalVertex(countVertex);
    LogicalEdge countEdge = new LogicalEdge(EdgeShuffleType.SHUFFLE_BY_CONST);
    countEdge.setStreamIndex(0);
    logicalSubQueryPlan.addLogicalEdge(sourceVertex, countVertex, countEdge);
    ProcessorFunction enterKeyFunction = new ProcessorFunction(QueryFlowOuterClass.OperatorType.ENTER_KEY, Message.Value.newBuilder().setPayload(QueryFlowOuterClass.EnterKeyArgumentProto.newBuilder().setEnterKeyType(QueryFlowOuterClass.EnterKeyTypeProto.KEY_SELF).setUniqFlag(true).build().toByteString()));
    LogicalVertex enterKeyVertex = new LogicalUnaryVertex(vertexIdManager.getId(), enterKeyFunction, false, sourceVertex);
    logicalSubQueryPlan.addLogicalVertex(enterKeyVertex);
    LogicalEdge enterKeyEdge = new LogicalEdge(EdgeShuffleType.FORWARD);
    enterKeyEdge.setStreamIndex(1);
    logicalSubQueryPlan.addLogicalEdge(sourceVertex, enterKeyVertex, enterKeyEdge);
    QueryFlowOuterClass.OperatorType valueOperatorType = QueryFlowOuterClass.OperatorType.valueOf(StringUtils.upperCase(direction.name()));
    Message.Value.Builder argumentBuilder = Message.Value.newBuilder();
    if (null != labelList) {
        for (String label : labelList) {
            try {
                argumentBuilder.addIntValueList(schema.getElement(label).getLabelId());
            } catch (Exception e) {
                throw new RuntimeException("There's no edge label=>" + label);
            }
        }
    }
    ProcessorFunction valueFunction = new ProcessorFunction(valueOperatorType, argumentBuilder);
    LogicalUnaryVertex valueVertex = new LogicalUnaryVertex(vertexIdManager.getId(), valueFunction, false, enterKeyVertex);
    logicalSubQueryPlan.addLogicalVertex(valueVertex);
    LogicalEdge valueEdge = new LogicalEdge(EdgeShuffleType.SHUFFLE_BY_KEY);
    logicalSubQueryPlan.addLogicalEdge(enterKeyVertex, valueVertex, valueEdge);
    ProcessorFunction countByKeyFunction = new ProcessorFunction(QueryFlowOuterClass.OperatorType.COUNT_BY_KEY, Message.Value.newBuilder().addIntValueList(0));
    LogicalUnaryVertex countByKeyVertex = new LogicalUnaryVertex(vertexIdManager.getId(), countByKeyFunction, false, valueVertex);
    logicalSubQueryPlan.addLogicalVertex(countByKeyVertex);
    logicalSubQueryPlan.addLogicalEdge(valueVertex, countByKeyVertex, new LogicalEdge(EdgeShuffleType.SHUFFLE_BY_KEY));
    ProcessorFunction ratioFunction = new ProcessorFunction(QueryFlowOuterClass.OperatorType.JOIN_RATIO, Message.Value.newBuilder().setIntValue(CompilerUtils.parseCompareType(predicate, predicate.getBiPredicate()).getNumber()).setDoubleValue(Double.parseDouble(predicate.getValue().toString())));
    LogicalBinaryVertex logicalBinaryVertex = new LogicalBinaryVertex(vertexIdManager.getId(), ratioFunction, true, countVertex, countByKeyVertex);
    logicalSubQueryPlan.addLogicalVertex(logicalBinaryVertex);
    logicalSubQueryPlan.addLogicalEdge(countVertex, logicalBinaryVertex, new LogicalEdge(EdgeShuffleType.BROADCAST));
    logicalSubQueryPlan.addLogicalEdge(countByKeyVertex, logicalBinaryVertex, new LogicalEdge(EdgeShuffleType.FORWARD));
    setFinishVertex(logicalBinaryVertex, treeNodeLabelManager);
    addUsedLabelAndRequirement(logicalBinaryVertex, treeNodeLabelManager);
    return logicalSubQueryPlan;
}

Example 35 with LogicalVertex

use of com.alibaba.maxgraph.compiler.logical.LogicalVertex in project GraphScope by alibaba.

the class RepeatTreeNode method buildFilterResultPlan.

private LogicalVertex buildFilterResultPlan(ContextManager contextManager, VertexIdManager vertexIdManager, TreeNodeLabelManager labelManager, LogicalSubQueryPlan logicalSubQueryPlan, LogicalVertex delegateSourceVertex, TreeNode emitTreeNode) {
    TreeNode currentEmitTreeNode = TreeNodeUtils.buildSingleOutputNode(emitTreeNode, schema);
    LogicalSubQueryPlan untilPlan = TreeNodeUtils.buildSubQueryPlan(currentEmitTreeNode, delegateSourceVertex, contextManager);
    LogicalVertex enterKeyVertex = TreeNodeUtils.getSourceTreeNode(currentEmitTreeNode).getOutputVertex();
    LogicalVertex untilResultVertex = untilPlan.getOutputVertex();
    logicalSubQueryPlan.mergeLogicalQueryPlan(untilPlan);
    if (currentEmitTreeNode instanceof HasTreeNode && ((HasTreeNode) currentEmitTreeNode).getInputNode() instanceof SourceDelegateNode) {
        return untilResultVertex;
    } else {
        LogicalVertex currentOutputVertex = new LogicalBinaryVertex(vertexIdManager.getId(), new ProcessorFunction(QueryFlowOuterClass.OperatorType.JOIN_DIRECT_FILTER), false, enterKeyVertex, untilResultVertex);
        logicalSubQueryPlan.addLogicalVertex(currentOutputVertex);
        logicalSubQueryPlan.addLogicalEdge(enterKeyVertex, currentOutputVertex, new LogicalEdge());
        logicalSubQueryPlan.addLogicalEdge(untilResultVertex, currentOutputVertex, new LogicalEdge());
        return currentOutputVertex;
    }
}