Examples of org.apache.derby.vti.Restriction

org.apache.derby.vti.Restriction

An expression to be pushed into a Table Function so that the Table Function can short-circuit its processing and return fewer rows. A restriction is represented as a binary tree. The non-leaf nodes are ANDs and ORs. The leaf nodes are ColumnQualifiers. A ColumnQualifier is a simple expression comparing a constant value to a column in the Table Function.

            Predicate predicate = (Predicate) parentPredicates.elementAt( i );


            if ( canBePushedDown( predicate ) )
            {
                // A Predicate has a top level AND node
                Restriction newRestriction = makeRestriction( predicate.getAndNode(), columnNameMap );


                // If newRestriction is null, then we are confused. Don't push
                // the restriction into the table function
                if ( newRestriction == null )
                {

View Full Code Here

                andOperator.getRightOperand() instanceof BooleanConstantNode &&
                ( ((BooleanConstantNode) andOperator.getRightOperand()).isBooleanTrue() )
                )
            { return makeRestriction( andOperator.getLeftOperand(), columnNameMap ); }
            
            Restriction leftRestriction = makeRestriction( andOperator.getLeftOperand(), columnNameMap );
            Restriction rightRestriction = makeRestriction( andOperator.getRightOperand(), columnNameMap );


            if ( (leftRestriction == null) || (rightRestriction == null) ) { return null; }


            return new Restriction.AND( leftRestriction, rightRestriction );
        }
        else if ( clause instanceof OrNode )
        {
            OrNode orOperator = (OrNode) clause;
            
            // strip off trailing vacuous FALSE constant if present
            if (
                orOperator.getRightOperand() instanceof BooleanConstantNode &&
                ( ((BooleanConstantNode) orOperator.getRightOperand()).isBooleanFalse() )
                )
            { return makeRestriction( orOperator.getLeftOperand(), columnNameMap ); }
            
            Restriction leftRestriction = makeRestriction( orOperator.getLeftOperand(), columnNameMap );
            Restriction rightRestriction = makeRestriction( orOperator.getRightOperand(), columnNameMap );


            if ( (leftRestriction == null) || (rightRestriction == null) ) { return null; }


            return new Restriction.OR( leftRestriction, rightRestriction );
        }

View Full Code Here

        for (Predicate pp : parentPredicates)
        {
            if ( canBePushedDown( pp ) )
            {
                // A Predicate has a top level AND node
                Restriction newRestriction =
                        makeRestriction( pp.getAndNode(), columnNameMap );


                // If newRestriction is null, then we are confused. Don't push
                // the restriction into the table function
                if ( newRestriction == null )

View Full Code Here


            // strip off trailing vacuous TRUE constant if present
            if ( andOperator.getRightOperand().isBooleanTrue() )
            { return makeRestriction( andOperator.getLeftOperand(), columnNameMap ); }
            
            Restriction leftRestriction = makeRestriction( andOperator.getLeftOperand(), columnNameMap );
            Restriction rightRestriction = makeRestriction( andOperator.getRightOperand(), columnNameMap );


            if ( (leftRestriction == null) || (rightRestriction == null) ) { return null; }


            return new Restriction.AND( leftRestriction, rightRestriction );
        }
        else if ( clause instanceof OrNode )
        {
            OrNode orOperator = (OrNode) clause;
            
            // strip off trailing vacuous FALSE constant if present
            if ( orOperator.getRightOperand().isBooleanFalse() )
            { return makeRestriction( orOperator.getLeftOperand(), columnNameMap ); }
            
            Restriction leftRestriction = makeRestriction( orOperator.getLeftOperand(), columnNameMap );
            Restriction rightRestriction = makeRestriction( orOperator.getRightOperand(), columnNameMap );


            if ( (leftRestriction == null) || (rightRestriction == null) ) { return null; }


            return new Restriction.OR( leftRestriction, rightRestriction );
        }

View Full Code Here

            Predicate predicate = (Predicate) parentPredicates.elementAt( i );


            if ( canBePushedDown( predicate ) )
            {
                // A Predicate has a top level AND node
                Restriction newRestriction = makeRestriction( predicate.getAndNode(), columnNameMap );


                // If newRestriction is null, then we are confused. Don't push
                // the restriction into the table function
                if ( newRestriction == null )
                {

View Full Code Here


            // strip off trailing vacuous TRUE constant if present
            if ( andOperator.getRightOperand().isBooleanTrue() )
            { return makeRestriction( andOperator.getLeftOperand(), columnNameMap ); }
            
            Restriction leftRestriction = makeRestriction( andOperator.getLeftOperand(), columnNameMap );
            Restriction rightRestriction = makeRestriction( andOperator.getRightOperand(), columnNameMap );


            if ( (leftRestriction == null) || (rightRestriction == null) ) { return null; }


            return new Restriction.AND( leftRestriction, rightRestriction );
        }
        else if ( clause instanceof OrNode )
        {
            OrNode orOperator = (OrNode) clause;
            
            // strip off trailing vacuous FALSE constant if present
            if ( orOperator.getRightOperand().isBooleanFalse() )
            { return makeRestriction( orOperator.getLeftOperand(), columnNameMap ); }
            
            Restriction leftRestriction = makeRestriction( orOperator.getLeftOperand(), columnNameMap );
            Restriction rightRestriction = makeRestriction( orOperator.getRightOperand(), columnNameMap );


            if ( (leftRestriction == null) || (rightRestriction == null) ) { return null; }


            return new Restriction.OR( leftRestriction, rightRestriction );
        }

View Full Code Here

            Predicate predicate = (Predicate) parentPredicates.elementAt( i );


            if ( canBePushedDown( predicate ) )
            {
                // A Predicate has a top level AND node
                Restriction newRestriction = makeRestriction( predicate.getAndNode(), columnNameMap );


                // If newRestriction is null, then we are confused. Don't push
                // the restriction into the table function
                if ( newRestriction == null )
                {

View Full Code Here


            // strip off trailing vacuous TRUE constant if present
            if ( andOperator.getRightOperand().isBooleanTrue() )
            { return makeRestriction( andOperator.getLeftOperand(), columnNameMap ); }
            
            Restriction leftRestriction = makeRestriction( andOperator.getLeftOperand(), columnNameMap );
            Restriction rightRestriction = makeRestriction( andOperator.getRightOperand(), columnNameMap );


            if ( (leftRestriction == null) || (rightRestriction == null) ) { return null; }


            return new Restriction.AND( leftRestriction, rightRestriction );
        }
        else if ( clause instanceof OrNode )
        {
            OrNode orOperator = (OrNode) clause;
            
            // strip off trailing vacuous FALSE constant if present
            if ( orOperator.getRightOperand().isBooleanFalse() )
            { return makeRestriction( orOperator.getLeftOperand(), columnNameMap ); }
            
            Restriction leftRestriction = makeRestriction( orOperator.getLeftOperand(), columnNameMap );
            Restriction rightRestriction = makeRestriction( orOperator.getRightOperand(), columnNameMap );


            if ( (leftRestriction == null) || (rightRestriction == null) ) { return null; }


            return new Restriction.OR( leftRestriction, rightRestriction );
        }

View Full Code Here

            Predicate predicate = (Predicate) parentPredicates.elementAt( i );


            if ( canBePushedDown( predicate ) )
            {
                // A Predicate has a top level AND node
                Restriction newRestriction = makeRestriction( predicate.getAndNode(), columnNameMap );


                // If newRestriction is null, then we are confused. Don't push
                // the restriction into the table function
                if ( newRestriction == null )
                {

View Full Code Here


            // strip off trailing vacuous TRUE constant if present
            if ( andOperator.getRightOperand().isBooleanTrue() )
            { return makeRestriction( andOperator.getLeftOperand(), columnNameMap ); }
            
            Restriction leftRestriction = makeRestriction( andOperator.getLeftOperand(), columnNameMap );
            Restriction rightRestriction = makeRestriction( andOperator.getRightOperand(), columnNameMap );


            if ( (leftRestriction == null) || (rightRestriction == null) ) { return null; }


            return new Restriction.AND( leftRestriction, rightRestriction );
        }
        else if ( clause instanceof OrNode )
        {
            OrNode orOperator = (OrNode) clause;
            
            // strip off trailing vacuous FALSE constant if present
            if ( orOperator.getRightOperand().isBooleanFalse() )
            { return makeRestriction( orOperator.getLeftOperand(), columnNameMap ); }
            
            Restriction leftRestriction = makeRestriction( orOperator.getLeftOperand(), columnNameMap );
            Restriction rightRestriction = makeRestriction( orOperator.getRightOperand(), columnNameMap );


            if ( (leftRestriction == null) || (rightRestriction == null) ) { return null; }


            return new Restriction.OR( leftRestriction, rightRestriction );
        }

View Full Code Here

0 1

TOP

Related Classes of org.apache.derby.vti.Restriction

org.apache.derby.impl.sql.compile.FromVTI

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.