| Package | Description |
|---|---|
| org.aksw.sparqlify.core | |
| org.aksw.sparqlify.expr.util |
| Modifier and Type | Method and Description |
|---|---|
static RdfTermPattern |
RdfTermPatternDerivation._deriveRegex(com.hp.hpl.jena.sparql.expr.E_Function expr) |
static RdfTermPattern |
RdfTermPatternDerivation._deriveRegex(E_RdfTerm expr) |
static RdfTermPattern |
RdfTermPatternDerivation._deriveRegex(com.hp.hpl.jena.sparql.expr.NodeValue expr) |
static RdfTermPattern |
RdfTermPatternDerivation.deriveRegex(com.hp.hpl.jena.sparql.expr.Expr expr) |
RdfTermPattern |
ConstraintContainer.getPattern(com.hp.hpl.jena.sparql.core.Var var) |
RdfTermPattern |
MetaExpr.getRegex() |
static RdfTermPattern |
RdfTermPattern.intersect(RdfTermPattern a,
RdfTermPattern b) |
| Modifier and Type | Method and Description |
|---|---|
Map<com.hp.hpl.jena.sparql.core.Var,RdfTermPattern> |
ConstraintContainer.getVarPatternConstraints() |
Map<com.hp.hpl.jena.sparql.core.Var,RdfTermPattern> |
RdfView.getVarToPattern() |
| Modifier and Type | Method and Description |
|---|---|
static RdfTermPattern |
RdfTermPattern.intersect(RdfTermPattern a,
RdfTermPattern b) |
| Constructor and Description |
|---|
MetaExpr(com.hp.hpl.jena.sparql.expr.Expr expr,
RdfTermPattern regex) |
RdfTermPattern(RdfTermPattern other) |
| Constructor and Description |
|---|
ConstraintContainer(Map<com.hp.hpl.jena.sparql.core.Var,RdfTermPattern> varRegexConstraints) |
ConstraintContainer(Map<com.hp.hpl.jena.sparql.core.Var,RdfTermPattern> varRegexConstraints,
Map<com.hp.hpl.jena.sparql.core.Var,PrefixSet> varPrefixConstraints) |
| Modifier and Type | Method and Description |
|---|---|
static RdfTermPattern |
ExprPatternSatisfiability.getPattern(com.hp.hpl.jena.sparql.expr.Expr expr) |
| Modifier and Type | Method and Description |
|---|---|
static void |
ExprPatternSatisfiability.isSatisfiable(Set<Set<com.hp.hpl.jena.sparql.expr.Expr>> dnf,
Map<com.hp.hpl.jena.sparql.core.Var,RdfTermPattern> varToPattern)
Given a set of views and a query such as:
select * { ?s ?p ?o .
|
Copyright © 2013. All Rights Reserved.