Package | Description |
---|---|
com.bigdata.rdf.sail.sparql |
This package was imported from the
org.openrdf.query.parser.sparql
package of the openrdf distribution. |
com.bigdata.rdf.sparql.ast |
This package contains an Abstract Syntax Tree which provides an intermediate translation
target for SPARQL parsers.
|
com.bigdata.rdf.sparql.ast.eval | |
com.bigdata.rdf.sparql.ast.optimizers |
Modifier and Type | Method and Description |
---|---|
protected FunctionNode |
ValueExprBuilder.aggregate(ASTAggregate node,
org.openrdf.model.URI functionURI) |
protected FunctionNode |
ValueExprBuilder.binary(SimpleNode node,
org.openrdf.model.URI functionURI)
Handle a simple binary function (both children of the node are arguments
to the function).
|
protected FunctionNode |
ValueExprBuilder.nary(SimpleNode node,
org.openrdf.model.URI functionURI)
Handle a simple nary function (all children of the node are arguments to
the function).
|
protected FunctionNode |
ValueExprBuilder.noneary(SimpleNode node,
org.openrdf.model.URI functionURI)
Handle a simple function without any arguments.
|
protected FunctionNode |
ValueExprBuilder.quadary(SimpleNode node,
org.openrdf.model.URI functionURI)
Handle a function with four arguments (there are four children of the
node which are the arguments to the function).
|
protected FunctionNode |
ValueExprBuilder.ternary(SimpleNode node,
org.openrdf.model.URI functionURI)
Handle a simple ternary function (there are three children of the node
which are the arguments to the function).
|
protected FunctionNode |
ValueExprBuilder.unary(SimpleNode node,
org.openrdf.model.URI functionURI)
Handle a simple unary function (the child of the node is the argument to
the function).
|
FunctionNode |
ValueExprBuilder.visit(ASTAbs node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTAnd node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTAvg node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTBNodeFunc node,
Object data)
TODO Same functionURI for BNode() and BNode(Literal)?
|
FunctionNode |
ValueExprBuilder.visit(ASTBound node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTCeil node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTCoalesce node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTCompare node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTConcat node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTContains node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTCount node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTDatatype node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTDay node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTEncodeForURI node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTFloor node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTFunctionCall node,
Object data)
ASTFunctionCall (IRIRef, ArgList).
|
FunctionNode |
ValueExprBuilder.visit(ASTGroupConcat node,
Object data)
TODO additional scalar values (sparql.jjt specifies "separator EQ" as a
constant in the grammar, but we support additional scalar values for
GROUP_CONCAT . |
FunctionNode |
ValueExprBuilder.visit(ASTHours node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTIf node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTInfix node,
Object data)
Unwrap an
ASTInfix node, returning the inner FunctionNode
constructed for it. |
FunctionNode |
ValueExprBuilder.visit(ASTIn node,
Object data)
"IN" and "NOT IN" are infix notation operators.
|
FunctionNode |
ValueExprBuilder.visit(ASTIRIFunc node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTIsBlank node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTIsIRI node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTIsLiteral node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTIsNumeric node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTLangMatches node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTLang node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTLowerCase node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTMath node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTMax node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTMD5 node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTMin node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTMinutes node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTMonth node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTNotIn node,
Object data)
See IN above.
|
FunctionNode |
ValueExprBuilder.visit(ASTNot node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTNow node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTOr node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTRand node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTRegexExpression node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTReplace node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTRound node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSameTerm node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSample node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSeconds node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSHA1 node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSHA224 node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSHA256 node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSHA384 node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSHA512 node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTStrAfter node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTStrBefore node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTStrDt node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTStrEnds node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTStrLang node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTStrLen node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTStr node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTStrStarts node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSTRUUID node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSubstr node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTSum node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTTimezone node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTTz node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTUpperCase node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTUUID node,
Object data) |
FunctionNode |
ValueExprBuilder.visit(ASTYear node,
Object data) |
Modifier and Type | Class and Description |
---|---|
class |
ExistsNode
A special function node for modeling EXISTS.
|
class |
NotExistsNode
A special function node for modeling NOT EXISTS.
|
class |
SubqueryFunctionNodeBase
A special function node for modeling value expression nodes which are
evaluated against an inner graph expression, such as EXISTS and NOT EXISTS.
|
Modifier and Type | Method and Description |
---|---|
static FunctionNode |
FunctionNode.add(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
t1 + t2 (aka ADD). |
static FunctionNode |
FunctionNode.AND(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
t1 AND t2 . |
static FunctionNode |
FunctionNode.binary(org.openrdf.model.URI uri,
TermNode t1,
TermNode t2)
Return a binary function
op(t1,t2) |
static FunctionNode |
FunctionNode.EQ(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
t1 = t2 (aka EQ aka RDFTERM-EQUALS). |
static FunctionNode |
FunctionNode.GE(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
t1 >= t2 |
static FunctionNode |
FunctionNode.GT(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
t1 > t2 |
static FunctionNode |
FunctionNode.LE(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
t1 <= t2 |
static FunctionNode |
FunctionNode.LT(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
t1 < t2 |
static FunctionNode |
FunctionNode.MAX(ValueExpressionNode v1,
ValueExpressionNode v2)
Return
max(v1,v2) |
static FunctionNode |
FunctionNode.MIN(ValueExpressionNode v1,
ValueExpressionNode v2)
Return
min(v1,v2) |
static FunctionNode |
FunctionNode.NE(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
t1 != t2 |
static FunctionNode |
FunctionNode.NOT(ValueExpressionNode inner)
Return
t1 OR t2 . |
static FunctionNode |
FunctionNode.OR(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
t1 OR t2 . |
static FunctionNode |
FunctionNode.sameTerm(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
sameTerm(t1,t2) (aka EQ). |
static FunctionNode |
FunctionNode.subtract(ValueExpressionNode t1,
ValueExpressionNode t2)
Return
t1 - t2 (aka SUBTRACT). |
Modifier and Type | Method and Description |
---|---|
static boolean |
StaticAnalysis.isCNFDisjunct(FunctionNode functionNode)
Check if filter node is an inner disjunct within a CNF.
|
static boolean |
StaticAnalysis.isCNFNegationOrTerminal(FunctionNode functionNode)
Check if filter node is a negation (possibly recursive) or terminal
within a CNF.
|
Constructor and Description |
---|
FunctionNode(FunctionNode op)
Constructor required for
com.bigdata.bop.BOpUtility#deepCopy(FilterNode) . |
Modifier and Type | Method and Description |
---|---|
protected FunctionNode |
ASTSearchInSearchOptimizer.convert(AST2BOpContext ctx,
FunctionNode searchInSearch)
Perform the conversion from one function (BDS.SEARCH_IN_SEARCH) to
another (IN).
|
Modifier and Type | Method and Description |
---|---|
protected FunctionNode |
ASTSearchInSearchOptimizer.convert(AST2BOpContext ctx,
FunctionNode searchInSearch)
Perform the conversion from one function (BDS.SEARCH_IN_SEARCH) to
another (IN).
|
Modifier and Type | Method and Description |
---|---|
protected FunctionNode |
AbstractOptimizerTestCase.Helper.bound(VarNode varNode) |
protected FunctionNode |
AbstractOptimizerTestCase.Helper.knownUnbound(VarNode varNode) |
protected FunctionNode |
AbstractOptimizerTestCase.Helper.or(ValueExpressionNode v1,
ValueExpressionNode v2)
Logical OR of two value expressions.
|
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.