Package com.hp.hpl.jena.sparql.algebra

Examples of com.hp.hpl.jena.sparql.algebra.Table

122
123
124
125
126
127
128
129
130
131
132
        {
            // Use the reference query engine
            // Create a table for the input stream (so it uses working memory at this point,
            // which is why this is not the preferred way). 
            // Then join to expression for this stage.
            Table table = TableFactory.create(input) ;
            Op op2 = OpJoin.create(OpTable.create(table), filter) ;
            return Algebra.exec(op2, execCxt.getDataset()) ;
        }       
       
        // Use the default, optimizing query engine.
View Full Code Here
46
47
48
49
50
51
52
53
54
        this.right = right ;
        this.result = calc(left, right, joinType, exprs, execCxt) ;
    }

    private static QueryIterator calc(QueryIterator left, QueryIterator right, JoinType joinType, ExprList exprs, ExecutionContext execCxt) {
        Table tableRight = TableFactory.create(right) ;
        return TableJoin.joinWorker(left, tableRight, joinType, exprs, execCxt) ;

    }
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
   
    @Override public Op transform(OpTable opTable)
    {
        if ( opTable.isJoinIdentity() )
            return opTable ;
        Table table = opTable.getTable() ;
        if ( table.isEmpty() )
            return opTable ;
        if ( TableUnit.isTableUnit(table) )
            return opTable ;
        if ( table.getVars().size() == 0 )
            return opTable ;
        Table table2 = NodeTransformLib.transform(table, transform) ;
        return OpTable.create(table2) ;
    }
View Full Code Here
72
73
74
75
76
77
78
79
80
        if ( binding.vars().hasNext() )
            op = Substitute.substitute(op, binding) ;

        ExecutionContext execCxt = new ExecutionContext(context, dsg.getDefaultGraph(), dsg, QC.getFactory(context)) ;
        Evaluator eval = EvaluatorFactory.create(execCxt) ;
        Table table = Eval.eval(eval, op) ;
        QueryIterator qIter = table.iterator(execCxt) ;
        return QueryIteratorCheck.check(qIter, execCxt) ;
    }
View Full Code Here
392
393
394
395
396
397
398
399
400
401
            }
            possibleValues.get(inequalityTest.getLeft()).add(inequalityTest.getRight());
        }

        // Then combine them into all possible rows to be eliminated
        Table table = buildTable(possibleValues);

        // Then apply the MINUS
        return OpMinus.create(op, OpTable.create(table));
    }
View Full Code Here
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
    }

    private static Table buildTable(Map<Var, Set<NodeValue>> possibleValues) {
        if (possibleValues.size() == 0)
            return TableFactory.createEmpty();
        Table table = TableFactory.create();

        // Although each filter condition must apply for a row to be accepted
        // they are actually independent since only one condition needs to fail
        // for the filter to reject the row. Thus for each unique variable/value
        // combination a single row must be produced
        for (Var v : possibleValues.keySet()) {
            for (NodeValue value : possibleValues.get(v)) {
                BindingMap b = BindingFactory.create();
                b.add(v, value.asNode());
                table.addBinding(b);
            }
        }
        return table;
    }
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
        {
            // Use the reference query engine
            // Create a table for the input stream (so it uses working memory at this point,
            // which is why this is not the preferred way). 
            // Then join to expression for this stage.
            Table table = TableFactory.create(input) ;
            Op op2 = OpJoin.create(OpTable.create(table), filter) ;
            return Algebra.exec(op2, execCxt.getDataset()) ;
        }       
       
        // Use the default, optimizing query engine.
View Full Code Here
55
56
57
58
59
60
61
62
    Table getResult()
    {
        if ( stack.size() != 1 )
            Log.warn(this, "Warning: getResult: stack size = "+stack.size()) ;
       
        Table table = pop() ;
        return table ;
    }
View Full Code Here
62
63
64
65
66
67
68
69
    }
   
    @Override
    public void visit(OpBGP opBGP)
    {
        Table table = evaluator.basicPattern(opBGP.getPattern()) ;
        push(table) ;
    }
View Full Code Here
93
94
95
96
97
98
99
100
        visit(opQuad.asQuadPattern()) ;
    }
    @Override
    public void visit(OpPath opPath)
    {
        Table table = evaluator.pathPattern(opPath.getTriplePath()) ;
        push(table) ;
    }
View Full Code Here
TOP

Related Classes of com.hp.hpl.jena.sparql.algebra.Table

  • arq.examples.propertyfunction.labelSearch
  • com.hp.hpl.jena.sparql.algebra.op.OpJoin
  • com.hp.hpl.jena.sparql.algebra.optimize.TransformFilterInequality
  • com.hp.hpl.jena.sparql.algebra.table.TableBase
  • com.hp.hpl.jena.sparql.engine.main.iterator.QueryIterJoinBase
  • com.hp.hpl.jena.sparql.engine.ref.Eval
  • com.hp.hpl.jena.sparql.engine.ref.EvaluatorDispatch
  • com.hp.hpl.jena.sparql.engine.ref.QueryEngineRef
  • com.hp.hpl.jena.sparql.graph.NodeTransformOp
  • com.hp.hpl.jena.sparql.sse.builders.BuilderTable
    • 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.