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

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

615
616
617
618
619
620
621
622
623
                best = index;
            }
        }

        if (bestCost == Double.POSITIVE_INFINITY && traversalFallback) {
            best = new TraversingIndex();
        }
        return best;
    }
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
            LOG.debug("cost using filter " + filter);
        }
        List<QueryIndex> indexes = new ArrayList<QueryIndex>(
                indexProvider.getQueryIndexes(rootState));
        if (traversalFallback) {
            indexes.add(new TraversingIndex());
        }

        double bestCost = Double.POSITIVE_INFINITY;
        for (QueryIndex index : indexes) {
            double cost = index.getCost(filter, rootState);
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
        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
692
693
694
695
696
697
698
699
700
701
702
703
                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
143
144
145
146
147
148
149
150
151
152
153
        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
172
173
174
175
176
177
178
179
180
181
182
            LOG.debug("cost using filter " + filter);
        }
        List<QueryIndex> indexes = new ArrayList<QueryIndex>(
                indexProvider.getQueryIndexes(rootState));
        if (traversalFallback) {
            indexes.add(new TraversingIndex());
        }

        double bestCost = Double.POSITIVE_INFINITY;
        for (QueryIndex index : indexes) {
            double cost = index.getCost(filter, rootState);
View Full Code Here
103
104
105
106
107
108
109
110
111
            if (cost < bestCost) {
                best = index;
            }
        }
        if (best == null) {
            best = new TraversingIndex(mk);
        }
        return best;
    }
View Full Code Here
828
829
830
831
832
833
834
835
836
837
838
839
840
841
                bestPlan = indexPlan;
            }
        }

        if (traversalEnabled) {
            QueryIndex traversal = new TraversingIndex();
            double cost = traversal.getCost(filter, rootState);
            if (LOG.isDebugEnabled()) {
                LOG.debug("cost for " + traversal.getIndexName() + " is " + cost);
            }
            if (cost < bestCost || bestCost == Double.POSITIVE_INFINITY) {
                bestCost = cost;
                bestIndex = traversal;
            }
View Full Code Here
812
813
814
815
816
817
818
819
820
821
822
823
824
825
                bestPlan = indexPlan;
            }
        }

        if (traversalEnabled) {
            QueryIndex traversal = new TraversingIndex();
            double cost = traversal.getCost(filter, rootState);
            if (LOG.isDebugEnabled()) {
                LOG.debug("cost for " + traversal.getIndexName() + " is " + cost);
            }
            if (cost < bestCost || bestCost == Double.POSITIVE_INFINITY) {
                bestCost = cost;
                bestIndex = traversal;
            }
View Full Code Here
112
113
114
115
116
117
118
119
120
            if (cost < bestCost) {
                best = index;
            }
        }
        if (best == null) {
            best = new TraversingIndex(mk);
        }
        return best;
    }
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.