All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.bigdata.rdf.sparql.ast.optimizers.TestASTFlattenJoinGroupsOptimizer Maven / Gradle / Ivy

There is a newer version: 2.1.4
Show newest version
/**

Copyright (C) SYSTAP, LLC DBA Blazegraph 2006-2016.  All rights reserved.

Contact:
     SYSTAP, LLC DBA Blazegraph
     2501 Calvert ST NW #106
     Washington, DC 20008
     [email protected]

This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/

package com.bigdata.rdf.sparql.ast.optimizers;

import static com.bigdata.rdf.sparql.ast.optimizers.AbstractOptimizerTestCase.HelperFlag.*;


public class TestASTFlattenJoinGroupsOptimizer extends AbstractOptimizerTestCase {

	public TestASTFlattenJoinGroupsOptimizer(String name) {
		super(name);
	}

	public TestASTFlattenJoinGroupsOptimizer() {
	}
	@Override
	IASTOptimizer newOptimizer() {
		return new ASTFlattenJoinGroupsOptimizer();
	}

	public void testBasicFlattening() {

    	new Helper(){{

    		given = select( varNode(z), 
    				where (
    						joinGroupNode( 
    						    statementPatternNode(varNode(x), constantNode(c),  constantNode(d)),
    						    joinGroupNode( statementPatternNode(varNode(x), constantNode(e), varNode(z)) ),
                                joinGroupNode( statementPatternNode(varNode(x), constantNode(f), varNode(z)) ) 
                            )
    				),
    				 DISTINCT );
    		
    		
    		expected = select( varNode(z), 
    				where (
    						statementPatternNode(varNode(x), constantNode(c),  constantNode(d)),
    						statementPatternNode(varNode(x), constantNode(e), varNode(z)),
                            statementPatternNode(varNode(x), constantNode(f), varNode(z))
    				),
    				 DISTINCT );
    		
    	}}.test();
	}
	public void testContextChange() {

    	new Helper(){{

    		given = select( varNode(z), 
    				where (
    						joinGroupNode( 
    						    statementPatternNode(varNode(x), constantNode(c),  constantNode(d)),
    						    joinGroupNode( varNode(w), 
    						    		statementPatternNode(varNode(x), constantNode(e), varNode(z), varNode(w), NAMED_CONTEXTS) ),
                                joinGroupNode( statementPatternNode(varNode(x), constantNode(f), varNode(z), DEFAULT_CONTEXTS) ) 
                            )
    				),
    				 DISTINCT );
    		
    		
    		expected = select( varNode(z), 
    				where (
    						statementPatternNode(varNode(x), constantNode(c),  constantNode(d)),
    						statementPatternNode(varNode(x), constantNode(e), varNode(z), varNode(w), NAMED_CONTEXTS),
                            statementPatternNode(varNode(x), constantNode(f), varNode(z), DEFAULT_CONTEXTS)
    				),
    				 DISTINCT );
    		
    	}}.test();
	}

	public void testSingleALPP() {

    	new Helper(){{

    		given = select( varNode(z), 
    				where (
    						joinGroupNode( 
    								arbitartyLengthPropertyPath(varNode(x), varNode(y), ZERO_OR_ONE,
    										joinGroupNode( 
    												statementPatternNode(leftVar(), constantNode(c),  rightVar())
    												) )
    										
    										)
    				) );
    		
    		varCount = 0;
    		
    		expected = select( varNode(z), 
    				where (
							arbitartyLengthPropertyPath(varNode(x), varNode(y), ZERO_OR_ONE,
									joinGroupNode( 
											statementPatternNode(leftVar(), constantNode(c),  rightVar())
											) )
    				) );
    		
    	}}.test();
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy