Package lupos.engine.operators.singleinput

Examples of lupos.engine.operators.singleinput.ReplaceLit

68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
    startNode = repLit;
  }

  @Override
  protected boolean checkPrecondition(final Map<String, BasicOperator> mso) {
    final ReplaceLit repLit = (ReplaceLit) mso.get("repLit");

    if (repLit.getPrecedingOperators().size() > 1) {
      System.out
          .println("ReplaceLit has more than one precessor => Change RuleInsertGenerateAddEnv!!!");
      return false;
    }

    final TriplePattern pat1 = (TriplePattern) mso.get("pat1");
    final TriplePattern pat2 = (TriplePattern) mso.get("pat2");
    if (!isSpecialCase(pat2.getItems(), pat1.getItems())) {
      return false;
    }

    // ReplaceLit should add the minimum of the extras from general to
    // special TriplePattern
    if (!replaceLitAddsExtras(pat2.getItems(), pat1.getItems(), repLit)) {
      return false;
    }

    final LinkedList<OperatorIDTuple> succsRepLit = (LinkedList<OperatorIDTuple>) repLit
        .getSucceedingOperators();
    final LinkedList<OperatorIDTuple> succsPat2 = (LinkedList<OperatorIDTuple>) pat2
        .getSucceedingOperators();
    // And they have got only the same successors with same operand-IDs
    return (equal(succsRepLit, succsPat2));
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
      final Map<String, BasicOperator> mso,
      final BasicOperator rootOperator) {
    final Collection<BasicOperator> deleted = new LinkedList<BasicOperator>();
    final Collection<BasicOperator> added = new LinkedList<BasicOperator>();
    final TriplePattern pat1 = (TriplePattern) mso.get("pat1");
    final ReplaceLit repLit = (ReplaceLit) mso.get("repLit");
    final TriplePattern pat2 = (TriplePattern) mso.get("pat2");

    final LinkedList<OperatorIDTuple> succs = (LinkedList<OperatorIDTuple>) repLit
        .getSucceedingOperators();

    final HashMap<Variable, Literal> constants = new HashMap<Variable, Literal>();

    final LinkedList<Variable> repLitLeft = repLit
        .getSubstitutionsLiteralLeft();
    final LinkedList<Literal> repLitRight = repLit
        .getSubstitutionsLiteralRight();
    for (int i = 0; i < repLitLeft.size(); i++) {
      constants.put(repLitLeft.get(i), repLitRight.get(i));
    }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
52
53
public class RuleReplaceLitOverFilter extends Rule {

  @Override
  protected void init() {
    final ReplaceLit replaceLit = new ReplaceLit();
    final Filter filter = new Filter();

    replaceLit.setSucceedingOperator(new OperatorIDTuple(filter, -1));
    filter.setPrecedingOperator(replaceLit);

    subGraphMap = new HashMap<BasicOperator, String>();
    subGraphMap.put(replaceLit, "replaceLit");
    subGraphMap.put(filter, "filter");
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
67
68
69
  }

  @Override
  protected boolean checkPrecondition(final Map<String, BasicOperator> mso) {
    final Filter filter = (Filter) mso.get("filter");
    final ReplaceLit replaceLit = (ReplaceLit) mso.get("replaceLit");

    final Object[] filterVars = filter.getUsedVariables().toArray();
    final LinkedList<Variable> v = replaceLit.getSubstitutionsLiteralLeft();

    // If there is minimum one substitution which can be pulled down
    for (int i = 0; i < v.size(); i++) {
      if (!arrayContains(filterVars, v.get(i))) {
        return true;
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
  public Tuple<Collection<BasicOperator>, Collection<BasicOperator>> transformOperatorGraph(
      final Map<String, BasicOperator> mso,
      final BasicOperator rootOperator) {
    final Collection<BasicOperator> deleted = new LinkedList<BasicOperator>();
    final Collection<BasicOperator> added = new LinkedList<BasicOperator>();
    final ReplaceLit replaceLit = (ReplaceLit) mso.get("replaceLit");
    final Filter filter = (Filter) mso.get("filter");

    final ReplaceLit replaceLitUnder = new ReplaceLit();
    added.add(replaceLitUnder);
    final Collection<Variable> vars = new HashSet<Variable>();
    vars.addAll(filter.getIntersectionVariables());
    replaceLitUnder.setIntersectionVariables(vars);
    replaceLitUnder.setUnionVariables(vars);

    final Object[] filterVars = filter.getUsedVariables().toArray();
    final LinkedList<Variable> replaceLitLeft = replaceLit
        .getSubstitutionsLiteralLeft();
    final LinkedList<Literal> replaceLitRight = replaceLit
        .getSubstitutionsLiteralRight();
    Variable var;
    Literal lit;
    for (int i = replaceLitLeft.size() - 1; i >= 0; i--) {
      var = replaceLitLeft.get(i);
      // Split ReplaceLit and pull only not intersection variables
      // downwards
      if (!arrayContains(filterVars, var)) {
        lit = replaceLitRight.get(i);
        replaceLitUnder.addSubstitution(var, lit);
        replaceLit.removeSubstitutionVars(i);
        replaceLitUnder.getIntersectionVariables().add(var); // var is
        // also
        // added
        // to
        // unionVariables
        // as
        // they
        // are
        // the
        // same
        // objects
        // !
      }
    }

    final LinkedList<BasicOperator> pres = (LinkedList<BasicOperator>) replaceLit
        .getPrecedingOperators();
    final LinkedList<OperatorIDTuple> succs = (LinkedList<OperatorIDTuple>) filter
        .getSucceedingOperators();
    final int index = replaceLit.getOperatorIDTuple(filter).getId();

    // If everything could be pushed downwards, the old ReplaceLit can be
    // deleted
    if (replaceLit.getSubstitutionsLiteralLeft().size() == 0) {
      BasicOperator pre;
      for (int i = 0; i < pres.size(); i++) {
        pre = pres.get(i);
        pre.addSucceedingOperator(new OperatorIDTuple(filter, index));
        pre.removeSucceedingOperator(replaceLit);
        filter.addPrecedingOperator(pre);
      }
      filter.removePrecedingOperator(replaceLit);
      deleted.add(replaceLit);
    }

    // Insert the new ReplaceLit under the Join
    filter.setSucceedingOperator(new OperatorIDTuple(replaceLitUnder, 0));

    replaceLitUnder.setPrecedingOperator(filter);
    replaceLitUnder.setSucceedingOperators(succs);

    BasicOperator succ;
    for (int i = 0; i < succs.size(); i++) {
      succ = succs.get(i).getOperator();
      succ.addPrecedingOperator(replaceLitUnder);
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
52
53
public class RuleReplaceLitOverJoin extends Rule {

  @Override
  protected void init() {
    final ReplaceLit replaceLit = new ReplaceLit();
    final Join join = new Join();

    replaceLit.setSucceedingOperator(new OperatorIDTuple(join, -1));
    join.setPrecedingOperator(replaceLit);

    subGraphMap = new HashMap<BasicOperator, String>();
    subGraphMap.put(replaceLit, "replaceLit");
    subGraphMap.put(join, "join");
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
  }

  @Override
  protected boolean checkPrecondition(final Map<String, BasicOperator> mso) {
    final Join join = (Join) mso.get("join");
    final ReplaceLit replaceLit = (ReplaceLit) mso.get("replaceLit");

    // final Object[] joinVars = join.getIntersectionVariables().toArray();
    final Object[] joinVars = join.getUnionVariables().toArray();
    final LinkedList<Variable> v = replaceLit.getSubstitutionsLiteralLeft();

    // If there is minimum one substitution which can be pulled down
    for (int i = 0; i < v.size(); i++) {
      // Otherwise join could trigger after transformation
      if (!arrayContains(joinVars, v.get(i))) {
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
  public Tuple<Collection<BasicOperator>, Collection<BasicOperator>> transformOperatorGraph(
      final Map<String, BasicOperator> mso,
      final BasicOperator rootOperator) {
    final Collection<BasicOperator> deleted = new LinkedList<BasicOperator>();
    final Collection<BasicOperator> added = new LinkedList<BasicOperator>();
    final ReplaceLit replaceLit = (ReplaceLit) mso.get("replaceLit");
    final Join join = (Join) mso.get("join");

    final ReplaceLit replaceLitUnder = new ReplaceLit();
    final Collection<Variable> vars = new HashSet<Variable>();
    vars.addAll(join.getIntersectionVariables());
    replaceLitUnder.setIntersectionVariables(vars);
    replaceLitUnder.setUnionVariables(vars);

    final Object[] joinVars = join.getIntersectionVariables().toArray();
    final LinkedList<Variable> replaceLitLeft = replaceLit
        .getSubstitutionsLiteralLeft();
    final LinkedList<Literal> replaceLitRight = replaceLit
        .getSubstitutionsLiteralRight();
    Variable var;
    Literal lit;
    for (int i = replaceLitLeft.size() - 1; i >= 0; i--) {
      var = replaceLitLeft.get(i);
      // Split ReplaceLit and pull only not intersection variables
      // downwards
      if (!arrayContains(joinVars, var)) {
        lit = replaceLitRight.get(i);
        replaceLitUnder.addSubstitution(var, lit);
        replaceLit.removeSubstitutionVars(i);
        replaceLitUnder.getIntersectionVariables().add(var); // var is
        // also
        // added
        // to
        // unionVariables
        // as
        // they
        // are
        // the
        // same
        // objects
        // !
      }
    }

    final LinkedList<BasicOperator> pres = (LinkedList<BasicOperator>) replaceLit
        .getPrecedingOperators();
    final LinkedList<OperatorIDTuple> succs = (LinkedList<OperatorIDTuple>) join
        .getSucceedingOperators();
    final int index = replaceLit.getOperatorIDTuple(join).getId();

    // If everything could be pushed downwards, the old ReplaceLit can be
    // deleted
    if (replaceLit.getSubstitutionsLiteralLeft().size() == 0) {
      BasicOperator pre;
      for (int i = 0; i < pres.size(); i++) {
        pre = pres.get(i);
        pre.addSucceedingOperator(new OperatorIDTuple(join, index));
        pre.removeSucceedingOperator(replaceLit);
        join.addPrecedingOperator(pre);
      }
      join.removePrecedingOperator(replaceLit);
      deleted.add(replaceLit);
    }

    // Insert the new ReplaceLit under the Join
    // (only if there is not already an equivalent ReplaceLit!)
    if (!((join.getSucceedingOperators().size() == 1)
        && (join.getSucceedingOperators().get(0).getOperator() instanceof ReplaceLit) && (replaceLitUnder
        .equals(join.getSucceedingOperators().get(0).getOperator())))) {
      join.setSucceedingOperator(new OperatorIDTuple(replaceLitUnder, 0));

      replaceLitUnder.setPrecedingOperator(join);
      replaceLitUnder.setSucceedingOperators(succs);
      added.add(replaceLitUnder);
    }

    BasicOperator succ;
    for (int i = 0; i < succs.size(); i++) {
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
public class RuleReplaceLitOverOptional extends Rule {

  @Override
  protected void init() {
    final ReplaceLit replaceLit = new ReplaceLit();
    final Optional optional = new Optional();

    // Only left Operand
    replaceLit.setSucceedingOperator(new OperatorIDTuple(optional, 0));
    optional.setPrecedingOperator(replaceLit);

    subGraphMap = new HashMap<BasicOperator, String>();
    subGraphMap.put(replaceLit, "replaceLit");
    subGraphMap.put(optional, "optional");
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
  }

  @Override
  protected boolean checkPrecondition(final Map<String, BasicOperator> mso) {
    final Optional optional = (Optional) mso.get("optional");
    final ReplaceLit replaceLit = (ReplaceLit) mso.get("replaceLit");

    final Object[] optionalVars = optional.getIntersectionVariables()
        .toArray();
    final LinkedList<Variable> v = replaceLit.getSubstitutionsLiteralLeft();

    // If there is minimum one substitution which can be pulled down
    for (int i = 0; i < v.size(); i++) {
      if (!arrayContains(optionalVars, v.get(i))) {
        // Operator should be the left operand of optional
        return (replaceLit.getOperatorIDTuple(optional).getId() == 0);
      }
    }
    return false;
  }
View Full Code Here
TOP

Related Classes of lupos.engine.operators.singleinput.ReplaceLit

  • lupos.datastructures.items.literal.Literal
  • lupos.datastructures.items.Variable
  • lupos.datastructures.queryresult.QueryResult
  • lupos.optimizations.logical.rules.rdfs.RuleDeleteEmptyReplaceLit
  • lupos.optimizations.logical.rules.rdfs.RuleInsertGenerateAddEnv
  • lupos.optimizations.logical.rules.rdfs.RuleReplaceLitOverFilter
  • lupos.optimizations.logical.rules.rdfs.RuleReplaceLitOverJoin
  • lupos.optimizations.logical.rules.rdfs.RuleReplaceLitOverOptional
  • lupos.optimizations.logical.rules.rdfs.RuleReplaceLitOverProjection
  • lupos.optimizations.logical.rules.rdfs.RuleReplaceLitOverUnion
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.