• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    迪恩网络公众号

Java OpJoin类代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了Java中com.hp.hpl.jena.sparql.algebra.op.OpJoin的典型用法代码示例。如果您正苦于以下问题:Java OpJoin类的具体用法?Java OpJoin怎么用?Java OpJoin使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。



OpJoin类属于com.hp.hpl.jena.sparql.algebra.op包,在下文中一共展示了OpJoin类的13个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。

示例1: transform

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
@Override
public Op transform(OpJoin opJoin, Op left, Op right) {
	if(left instanceof OpLabel){
		if(right instanceof OpLabel){
			return OpLabel.create(PRUNED ,null);
		}else
		{
			return substitute((Op0) right);
		}
	}else{
		if(right instanceof OpLabel){
			return substitute((Op0) left);
		}
	}
	return substitute(opJoin, left, right);
}
 
开发者ID:peterjohnlawrence,项目名称:com.inova8.remediator,代码行数:17,代码来源:Substituter.java


示例2: compile

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
public Op compile(Query query) {
    Op pattern = compile(query.getQueryPattern());     // Not compileElement - may need to apply simplification.
    Op op = compileModifiers(query, pattern);
    
    if (query.hasValues()) {
        List<Binding> bindings = query.getValuesData();
        Table table = TableFactory.create();
        for ( Binding binding : bindings )
            table.addBinding(binding);
        OpTable opTable = OpTable.create(table);
        op = OpJoin.create(op, opTable);
    }
    
    return op ;
}
 
开发者ID:KMax,项目名称:cqels,代码行数:16,代码来源:LogicCompiler.java


示例3: visit

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
@Override
public void visit(OpJoin opJoin) {
}
 
开发者ID:aschaetzle,项目名称:S2X,代码行数:4,代码来源:AlgebraTranslator.java


示例4: visit

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
@Override
public void visit(OpJoin opJoin) {
    SqlOp rightOp = stack.pop();
    SqlOp leftOp = stack.pop();
    stack.push(new SqlJoin(opJoin, leftOp, rightOp, prefixes));
}
 
开发者ID:aschaetzle,项目名称:S2RDF,代码行数:7,代码来源:AlgebraTransformer.java


示例5: SqlJoin

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
public SqlJoin(OpJoin _opJoin, SqlOp _leftOp, SqlOp _rightOp,
		PrefixMapping _prefixes) {
	super(_leftOp, _rightOp, _prefixes);
	opJoin = _opJoin;
	resultName = Tags.JOIN;
}
 
开发者ID:aschaetzle,项目名称:S2RDF,代码行数:7,代码来源:SqlJoin.java


示例6: PigJoin

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
public PigJoin(OpJoin _opJoin, PigOp _leftOp, PigOp _rightOp, PrefixMapping _prefixes) {
    super(_leftOp, _rightOp, _prefixes);
    opJoin = _opJoin;
    resultName = Tags.JOIN;
}
 
开发者ID:aschaetzle,项目名称:PigSPARQL,代码行数:6,代码来源:PigJoin.java


示例7: visit

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
@Override
public void visit(OpJoin opJoin) {
	ImpalaOp rightOp = stack.pop();
	ImpalaOp leftOp = stack.pop();
	stack.push(new ImpalaJoin(opJoin, leftOp, rightOp, prefixes));
}
 
开发者ID:aschaetzle,项目名称:Sempala,代码行数:7,代码来源:AlgebraTransformer.java


示例8: ImpalaJoin

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
public ImpalaJoin(OpJoin _opJoin, ImpalaOp _leftOp, ImpalaOp _rightOp,
		PrefixMapping _prefixes) {
	super(_leftOp, _rightOp, _prefixes);
	opJoin = _opJoin;
	resultName = Tags.JOIN;
}
 
开发者ID:aschaetzle,项目名称:Sempala,代码行数:7,代码来源:ImpalaJoin.java


示例9: checkMoveDownFilterExprAndVisitOpJoin

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
/**
 * Checks first if a filterexpression can be moved down. And after visits
 * the operator
 */
private void checkMoveDownFilterExprAndVisitOpJoin(OpJoin opJoin) {
	Op left = null;
	Op right = null;
	Op newOp;
	List<Expr> filterExprBeforeOpJoin, filterExprAfterOpJoin, notMoveableFilterExpr;

	// contains the filterexpressions that are valid before this op2
	filterExprBeforeOpJoin = new ArrayList<Expr>(this.filterExpr);
	// contains the filterexpressions that are valid after this op2
	// this is needed because during the bottom-up-stepping all
	// filterexpressions
	// which could not be transformed down, must be inserted by means of an
	// OpFilter
	// above this op2
	filterExprAfterOpJoin = new ArrayList<Expr>();

	// check left subtree
	if ((left = opJoin.getLeft()) != null) {
		// calculate the set of filterexpressions that are also valid for
		// the
		// left subtree
		this.filterExpr = calcValidFilterExpr(filterExprBeforeOpJoin, left);
		filterExprAfterOpJoin.addAll(this.filterExpr);
		// step down
		opJoin.getLeft().visit(this);
		left = stack.pop();
	}

	// check the right subtree
	if ((right = opJoin.getRight()) != null) {
		// calculate the set of filterexpressions that are also valid for
		// the
		// right subtree
		this.filterExpr = calcValidFilterExpr(filterExprBeforeOpJoin, right);
		filterExprAfterOpJoin.addAll(this.filterExpr);
		// step down
		opJoin.getRight().visit(this);
		right = stack.pop();
	}

	// note: filterExprAfterOpUnion contains now all filterexpressions which
	// could
	// be moved down
	// now calculate all filterexpressions which were not moveable
	notMoveableFilterExpr = new ArrayList<Expr>(filterExprBeforeOpJoin);
	notMoveableFilterExpr.removeAll(filterExprAfterOpJoin);

	// if there are some filterexpressions which could not be moved down,
	// an opFilter must be inserted that contains this filterexpressions
	if (!notMoveableFilterExpr.isEmpty()) {
		// create the filter
		newOp = OpFilter.filter(OpJoin.create(left, right));
		// add the conditions
		((OpFilter) newOp).getExprs().getList()
				.addAll(notMoveableFilterExpr);
	} else {
		// nothing must be done
		newOp = opJoin;
	}

	// restore filterexpressions
	this.filterExpr = filterExprBeforeOpJoin;

	this.stack.push(newOp);
}
 
开发者ID:aitoralmeida,项目名称:c4a_data_repository,代码行数:70,代码来源:PushDownOpFilterVisitor.java


示例10: transform

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
@Override
public Op transform(OpJoin opJoin, Op left, Op right) {
	return mergeToBGP(left, right);
}
 
开发者ID:peterjohnlawrence,项目名称:com.inova8.remediator,代码行数:5,代码来源:Simplifier.java


示例11: JoinRouter

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
public JoinRouter(ExecContext context, OpJoin op, 
        OpRouter left, OpRouter right) {
    super(context, op, left, right);
}
 
开发者ID:KMax,项目名称:cqels,代码行数:5,代码来源:JoinRouter.java


示例12: join

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
protected Op join(Op current, Op newOp) { 
    return OpJoin.create(current, newOp);
}
 
开发者ID:KMax,项目名称:cqels,代码行数:4,代码来源:LogicCompiler.java


示例13: visit

import com.hp.hpl.jena.sparql.algebra.op.OpJoin; //导入依赖的package包/类
/**
 * When visiting an OpJoin 3 conditions for moving down the filterconditions
 * are checked. Only when a condition is satisfied, the filtercondition can
 * be moved down to the next operator in the tree. Otherwise the condition
 * will stay here and during the bottum-up-stepping an OpFilter containing
 * these remained filterconditions will be inserted in the operator-tree.
 * Conditions for moving down a filtercondition: (M1, M2 are graphpatterns,
 * F is a filtercondition) 1) Filter(Join(M1, M2), F)) will become
 * Join(Filter(M1, F), M2) when the filterexpression is only referenced to
 * M1 2) Filter(Join(M1, M2), F)) will become Join(M1, Filter(M2, F)) when
 * the filterexpression is only referenced to M2 3) Filter(Join(M1, M2), F))
 * will become Join(Filter(M1, F), Filter(M2, F)) when the filterexpression
 * is referenced to M1 and M2
 */
public void visit(OpJoin opJoin) {
	checkMoveDownFilterExprAndVisitOpJoin(opJoin);
}
 
开发者ID:aitoralmeida,项目名称:c4a_data_repository,代码行数:18,代码来源:PushDownOpFilterVisitor.java



注:本文中的com.hp.hpl.jena.sparql.algebra.op.OpJoin类示例整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。


鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
Java ServiceCreds类代码示例发布时间:2022-05-22
下一篇:
Java AlphaValue类代码示例发布时间:2022-05-22
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap