Package org.openrdf.query.algebra

Examples of org.openrdf.query.algebra.TupleExpr

137
138
139
140
141
142
143
144
145
146
147
148
    @Override
    public void meet(Intersection intersection) {
      super.meet(intersection);

      TupleExpr leftArg = intersection.getLeftArg();
      TupleExpr rightArg = intersection.getRightArg();

      if (leftArg instanceof EmptySet || rightArg instanceof EmptySet) {
        intersection.replaceWith(leftArg);
      }
    }
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
   * constraints in this graph pattern.
   *
   * @return A tuple expression for this graph pattern.
   */
  public TupleExpr buildTupleExpr() {
    TupleExpr result;

    if (requiredTEs.isEmpty()) {
      result = new SingletonSet();
    }
    else {
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
    throws VisitorException
  {
    // Start with building the graph pattern
    graphPattern = new GraphPattern();
    node.getWhereClause().jjtAccept(this, null);
    TupleExpr tupleExpr = graphPattern.buildTupleExpr();

    // Apply result ordering
    ASTOrderClause orderNode = node.getOrderClause();
    if (orderNode != null) {
      List<OrderElem> orderElemements = (List<OrderElem>)orderNode.jjtAccept(this, null);
View Full Code Here
210
211
212
213
214
215
216
217
218
219
220
  @Override
  public TupleExpr visit(ASTSelect node, Object data)
    throws VisitorException
  {
    TupleExpr result = (TupleExpr)data;

    ProjectionElemList projElemList = new ProjectionElemList();

    for (int i = 0; i < node.jjtGetNumChildren(); i++) {
      Var projVar = (Var)node.jjtGetChild(i).jjtAccept(this, null);
View Full Code Here
235
236
237
238
239
240
241
242
243
244
245
    throws VisitorException
  {
    // Start with building the graph pattern
    graphPattern = new GraphPattern();
    node.getWhereClause().jjtAccept(this, null);
    TupleExpr tupleExpr = graphPattern.buildTupleExpr();

    // Apply result ordering
    ASTOrderClause orderNode = node.getOrderClause();
    if (orderNode != null) {
      List<OrderElem> orderElemements = (List<OrderElem>)orderNode.jjtAccept(this, null);
View Full Code Here
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
  @Override
  public TupleExpr visit(ASTConstruct node, Object data)
    throws VisitorException
  {
    TupleExpr result = (TupleExpr)data;

    // Collect construct triples
    graphPattern = new GraphPattern();
    super.visit(node, null);
    TupleExpr constructExpr = graphPattern.buildTupleExpr();

    // Retrieve all StatementPattern's from the construct expression
    List<StatementPattern> statementPatterns = StatementPatternCollector.process(constructExpr);

    Set<Var> constructVars = getConstructVars(statementPatterns);
View Full Code Here
353
354
355
356
357
358
359
360
361
362
363
  @Override
  public TupleExpr visit(ASTDescribeQuery node, Object data)
    throws VisitorException
  {
    TupleExpr tupleExpr = null;

    if (node.getWhereClause() != null) {
      // Start with building the graph pattern
      graphPattern = new GraphPattern();
      node.getWhereClause().jjtAccept(this, null);
View Full Code Here
394
395
396
397
398
399
400
401
402
403
404
  @Override
  public TupleExpr visit(ASTDescribe node, Object data)
    throws VisitorException
  {
    TupleExpr result = (TupleExpr)data;

    // Create a graph query that produces the statements that have the
    // requests resources as subject or object
    Var subjVar = createAnonVar("-descr-subj");
    Var predVar = createAnonVar("-descr-pred");
View Full Code Here
443
444
445
446
447
448
449
450
451
452
  {
    graphPattern = new GraphPattern();

    super.visit(node, null);

    TupleExpr tupleExpr = graphPattern.buildTupleExpr();
    tupleExpr = new Slice(tupleExpr, 0, 1);

    return tupleExpr;
  }
View Full Code Here
515
516
517
518
519
520
521
522
523
524
525
526
    super.visit(node, null);

    // Optional constraints also apply to left hand side of operator
    List<ValueExpr> constraints = graphPattern.removeAllConstraints();

    TupleExpr leftArg = parentGP.buildTupleExpr();
    TupleExpr rightArg = graphPattern.buildTupleExpr();

    LeftJoin leftJoin;

    if (constraints.isEmpty()) {
      leftJoin = new LeftJoin(leftArg, rightArg);
View Full Code Here
TOP

Related Classes of org.openrdf.query.algebra.TupleExpr

  • edu.mit.simile.backstage.model.data.Expression
  • edu.mit.simile.backstage.model.TupleQueryBuilder
  • org.openrdf.query.algebra.evaluation.impl.ConjunctiveConstraintSplitter$ConstraintVisitor
  • org.openrdf.query.algebra.evaluation.impl.DisjunctiveConstraintOptimizer$OrSameTermOptimizer
  • org.openrdf.query.algebra.evaluation.impl.EvaluationStrategyImpl
  • org.openrdf.query.algebra.evaluation.impl.QueryJoinOptimizer$JoinVisitor
  • org.openrdf.query.algebra.evaluation.impl.QueryModelPruner$TreeSanitizer
  • org.openrdf.query.algebra.evaluation.impl.SameTermFilterOptimizer$SameTermFilterVisitor
  • org.openrdf.query.parser.serql.ConstructorBuilder
  • org.openrdf.query.parser.serql.GraphPattern
    • 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.