Package org.apache.jackrabbit.oak.query.index

Examples of org.apache.jackrabbit.oak.query.index.TraversingIndex

798
799
800
801
802
803
804
805
806
807
808
809
                bestPlan = indexPlan;
            }
        }

        if (traversalEnabled) {
            QueryIndex traversal = new TraversingIndex();
            double cost = traversal.getCost(filter, rootState);
            if (cost < bestCost || bestCost == Double.POSITIVE_INFINITY) {
                bestCost = cost;
                bestIndex = traversal;
            }
        }
View Full Code Here
168
169
170
171
172
173
174
175
176
177
178
179
180
181
            if (cost < bestCost) {
                bestCost = cost;
                best = index;
            }
        }
        QueryIndex index = new TraversingIndex();
        double cost = index.getCost(filter, rootState);
        if (LOG.isDebugEnabled()) {
            LOG.debug("cost for " + index.getIndexName() + " is " + cost);
        }
        if (cost < bestCost) {
            bestCost = cost;
            best = index;
        }
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
185
186
187
            if (cost < bestCost) {
                bestCost = cost;
                best = index;
            }
        }
        QueryIndex index = new TraversingIndex();
        double cost = index.getCost(filter, rootState);
        if (LOG.isDebugEnabled()) {
            LOG.debug("cost for " + index.getIndexName() + " is " + cost);
        }
        if (cost < bestCost) {
            bestCost = cost;
            best = index;
        }
View Full Code Here
700
701
702
703
704
705
706
707
708
709
710
711
                best = index;
            }
        }

        if (traversalEnabled) {
            QueryIndex traversal = new TraversingIndex();
            double cost = traversal.getCost(filter, rootState);
            if (cost < bestCost || bestCost == Double.POSITIVE_INFINITY) {
                bestCost = cost;
                best = traversal;
            }
        }
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
        FilterImpl f = createFilter(indexed, NT_BASE);

        PropertyIndexLookup lookup = new PropertyIndexLookup(indexed);
        double cost = lookup.getCost(f, "foo",
                PropertyValues.newString("azerty"));
        double traversal = new TraversingIndex().getCost(f, indexed);

        assertTrue("Estimated cost for " + nodes
                + " nodes should not be higher than traversal (" + cost + ")",
                cost < traversal);
    }
View Full Code Here
63
64
65
66
67
68
69
    }


    @Override
    public void prepare(MicroKernel mk) {
        index = new TraversingIndex(mk);
    }
View Full Code Here
TOP

Related Classes of org.apache.jackrabbit.oak.query.index.TraversingIndex

  • org.apache.jackrabbit.oak.plugins.index.property.PropertyIndexTest
  • org.apache.jackrabbit.oak.query.ast.SelectorImpl
  • org.apache.jackrabbit.oak.query.QueryEngineImpl
  • org.apache.jackrabbit.oak.query.QueryImpl
  • org.apache.jackrabbit.oak.spi.query.Filter.PathRestriction
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.