package de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants; /* This file is part of ELKI: Environment for Developing KDD-Applications Supported by Index-Structures Copyright (C) 2013 Ludwig-Maximilians-Universität München Lehr- und Forschungseinheit für Datenbanksysteme ELKI Development Team This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. 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 Affero General Public License for more details. You should have received a copy of the GNU Affero General Public License along with this program. If not, see . */ import de.lmu.ifi.dbs.elki.data.NumberVector; import de.lmu.ifi.dbs.elki.data.type.TypeInformation; import de.lmu.ifi.dbs.elki.data.type.TypeUtil; import de.lmu.ifi.dbs.elki.index.Index; import de.lmu.ifi.dbs.elki.index.PagedIndexFactory; import de.lmu.ifi.dbs.elki.index.tree.spatial.SpatialEntry; import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.bulk.BulkSplit; import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.insert.CombinedInsertionStrategy; import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.insert.InsertionStrategy; import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.overflow.LimitedReinsertOverflowTreatment; import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.overflow.OverflowTreatment; import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.split.SplitStrategy; import de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.split.TopologicalSplitter; import de.lmu.ifi.dbs.elki.persistent.PageFileFactory; import de.lmu.ifi.dbs.elki.utilities.optionhandling.OptionID; import de.lmu.ifi.dbs.elki.utilities.optionhandling.constraints.GreaterConstraint; import de.lmu.ifi.dbs.elki.utilities.optionhandling.constraints.LessConstraint; import de.lmu.ifi.dbs.elki.utilities.optionhandling.parameterization.Parameterization; import de.lmu.ifi.dbs.elki.utilities.optionhandling.parameters.DoubleParameter; import de.lmu.ifi.dbs.elki.utilities.optionhandling.parameters.ObjectParameter; /** * Abstract factory for R*-Tree based trees. * * @author Erich Schubert * * @apiviz.stereotype factory * @apiviz.uses AbstractRStarTree oneway - - «create» * * @param Object type * @param Node type * @param Entry type * @param Index type */ public abstract class AbstractRStarTreeFactory, N extends AbstractRStarTreeNode, E extends SpatialEntry, I extends AbstractRStarTree & Index, S extends AbstractRTreeSettings> extends PagedIndexFactory { /** * Tree settings */ protected S settings; /** * Constructor. * * @param pageFileFactory Page file factory * @param settings Tree settings */ public AbstractRStarTreeFactory(PageFileFactory pageFileFactory, S settings) { super(pageFileFactory); this.settings = settings; } @Override public TypeInformation getInputTypeRestriction() { return TypeUtil.NUMBER_VECTOR_FIELD; } /** * Parameterization class. * * @author Erich Schubert * * @apiviz.exclude * * @param Object type * @param Settings class */ public abstract static class Parameterizer, S extends AbstractRTreeSettings> extends PagedIndexFactory.Parameterizer { /** * Fast-insertion parameter. Optional. */ public static OptionID INSERTION_STRATEGY_ID = new OptionID("rtree.insertionstrategy", "The strategy to use for object insertion."); /** * Split strategy parameter. Optional. */ public static OptionID SPLIT_STRATEGY_ID = new OptionID("rtree.splitstrategy", "The strategy to use for node splitting."); /** * Parameter for bulk strategy */ public static final OptionID BULK_SPLIT_ID = new OptionID("spatial.bulkstrategy", "The class to perform the bulk split with."); /** * Parameter for the relative minimum fill. */ public static final OptionID MINIMUM_FILL_ID = new OptionID("rtree.minimum-fill", "Minimum relative fill required for data pages."); /** * Overflow treatment. */ public static OptionID OVERFLOW_STRATEGY_ID = new OptionID("rtree.overflowtreatment", "The strategy to use for handling overflows."); /** * Tree settings */ protected S settings; /** * Create the settings object * * @return Settings instance. */ abstract protected S createSettings(); @Override protected void makeOptions(Parameterization config) { super.makeOptions(config); settings = createSettings(); ObjectParameter insertionStrategyP = new ObjectParameter<>(INSERTION_STRATEGY_ID, InsertionStrategy.class, CombinedInsertionStrategy.class); if (config.grab(insertionStrategyP)) { settings.insertionStrategy = insertionStrategyP.instantiateClass(config); } ObjectParameter splitStrategyP = new ObjectParameter<>(SPLIT_STRATEGY_ID, SplitStrategy.class, TopologicalSplitter.class); if (config.grab(splitStrategyP)) { settings.nodeSplitter = splitStrategyP.instantiateClass(config); } DoubleParameter minimumFillP = new DoubleParameter(MINIMUM_FILL_ID, 0.4); minimumFillP.addConstraint(new GreaterConstraint(0.0)); minimumFillP.addConstraint(new LessConstraint(0.5)); if (config.grab(minimumFillP)) { settings.relativeMinFill = minimumFillP.getValue(); } ObjectParameter overflowP = new ObjectParameter<>(OVERFLOW_STRATEGY_ID, OverflowTreatment.class, LimitedReinsertOverflowTreatment.class); if (config.grab(overflowP)) { settings.setOverflowTreatment(overflowP.instantiateClass(config)); } configBulkLoad(config); } /** * Configure the bulk load parameters. * * @param config Parameterization */ protected void configBulkLoad(Parameterization config) { ObjectParameter bulkSplitP = new ObjectParameter<>(BULK_SPLIT_ID, BulkSplit.class, true); if (config.grab(bulkSplitP)) { settings.bulkSplitter = bulkSplitP.instantiateClass(config); } } @Override protected abstract AbstractRStarTreeFactory makeInstance(); } }