[Bug Fix] Fix the alias of GetV of ExpandBase in PathExpand, an…

interactive_engine/compiler/src/main/java/com/alibaba/graphscope/common/ir/tools/config/PathExpandConfig.java

@@ -163,7 +163,7 @@ public Builder getV(GetVConfig config) {
                                 config.getOpt(),
                                 innerBuilder.getTableConfig(
                                         config.getLabels(), GraphOpt.Source.VERTEX),
-                                config.getAlias()); // hack ways: to be consistent with runtime
+                                AliasInference.DEFAULT_NAME);
                 // (the alias of endV is given in the getV
                 // base)
                 innerBuilder.push(this.getV);

interactive_engine/compiler/src/test/java/com/alibaba/graphscope/common/ir/plan/HepPlannerTest.java

@@ -82,8 +82,8 @@ public void push_filter_2_test() {
                         .filter(
                                 builder.call(
                                         GraphStdOperatorTable.EQUALS,
-                                        pxdBuilder.variable("z", "age"),
-                                        pxdBuilder.literal(10)))
+                                        builder.variable("z", "age"),
+                                        builder.literal(10)))
                         .build();
         RelOptPlanner planner = Utils.mockPlanner(FilterMatchRule.Config.DEFAULT.toRule());
         planner.setRoot(before);
@@ -95,7 +95,7 @@ public void push_filter_2_test() {
                     + "  GraphLogicalPathExpand(expand=[GraphLogicalExpand(tableConfig=[{isAll=false,"
                     + " tables=[knows]}], alias=[DEFAULT], opt=[OUT])\n"
                     + "], getV=[GraphLogicalGetV(tableConfig=[{isAll=false, tables=[person]}],"
-                    + " alias=[z], opt=[END])\n"
+                    + " alias=[DEFAULT], opt=[END])\n"
                     + "], offset=[1], fetch=[3], path_opt=[SIMPLE], result_opt=[AllV],"
                     + " alias=[DEFAULT])\n"
                     + "    GraphLogicalSource(tableConfig=[{isAll=false, tables=[person]}],"

interactive_engine/compiler/src/test/java/com/alibaba/graphscope/cypher/antlr4/MatchTest.java

@@ -86,7 +86,7 @@ public void match_4_test() {
                     + " tables=[knows]}], alias=[DEFAULT], fusedFilter=[[=(DEFAULT.weight,"
                     + " 1.0E0)]], opt=[OUT])\n"
                     + "], getV=[GraphLogicalGetV(tableConfig=[{isAll=false, tables=[person]}],"
-                    + " alias=[c], opt=[END])\n"
+                    + " alias=[DEFAULT], opt=[END])\n"
                     + "], offset=[1], fetch=[2], path_opt=[ARBITRARY], result_opt=[EndV],"
                     + " alias=[b])\n"
                     + "    GraphLogicalSource(tableConfig=[{isAll=false, tables=[person]}],"

interactive_engine/executor/ir/core/src/glogue/extend_step.rs

@@ -66,7 +66,6 @@ impl ExactExtendEdge {
         &self, mut path_opr: pb::PathExpand,
     ) -> IrPatternResult<pb::logical_plan::Operator> {
         path_opr.start_tag = Some((self.src_vertex_id as KeyId).into());
-        path_opr.alias = None;
         path_opr
             .base
             .as_mut()

interactive_engine/executor/ir/core/src/plan/physical.rs

@@ -772,15 +772,14 @@ impl AsPhysical for LogicalPlan {
 // 3. To intersect a->c, b->c with key=c, with filters
 // we support expanding vertices with filters on edges (i.e., filters on a->c, b->c), e.g., Intersect{{a-filter->c, b-filter->c}, key=c};
 // if expanding vertices with filters on vertices (i.e., filters on c), translate into Intersect{{a->c, b->c}, key=c} + Select {filter on c}
-// For now, this logic is in the translation rule in Pattern in logical plan
-// TODO: move this logic into physical layer, as we may able to directly filter vertices during intersection if we have the global view of storage.
+// 4. To intersect a->...->d->c and b->c with key=c, where a->..->d->c is a path from a to c,
+// if so, translate into PathExpand{a->d} + Intersect{d->c, b->c, key=c}.
 
 // Thus, after build intersect, the physical plan looks like:
 // 1. the last ops in intersect's sub_plans are the ones to intersect;
-// 2. the intersect op can be:
-//     1) EdgeExpand with Opt = ExpandE followed by GetV with Opt = End, which is to expand and intersect on id-only vertices; (supported currently)
+// 2. the intersect op includes:
+//     1) EdgeExpand with Opt = ExpandV, which is to expand and intersect on id-only vertices; (supported currently)
 //     2) EdgeExpand with Opt = ExpandE, which is to expand and intersect on edges (although, not considered in Pattern yet);
-// and 3) GetV with Opt = Self, which is to expand and intersect on vertices, while there may be some filters on the intersected vertices. (TODO e2e)
 
 fn add_intersect_job_builder(
     builder: &mut JobBuilder, plan_meta: &mut PlanMeta, intersect_opr: &pb::Intersect,
@@ -827,6 +826,8 @@ fn add_intersect_job_builder(
                 //    and the last edge_expand is the one to intersect.
                 //    Notice that if we have predicates for vertices in path_expand, or for the last vertex of path_expand,
                 //    do the filtering after intersection.
+                // TODO: there might be a bug here:
+                // if path_expand has an alias which indicates that the path would be referred later, it may not as expected.
                 let mut path_expand = path_expand.clone();
                 let path_expand_base = path_expand
                     .base