Uses of Interface
de.lmu.ifi.dbs.elki.database.datastore.DataStore

Packages that use DataStore

de.lmu.ifi.dbs.elki.algorithm	Algorithms suitable as a task for the KDDTask main routine.
de.lmu.ifi.dbs.elki.algorithm.clustering	Clustering algorithms Clustering algorithms are supposed to implement the Algorithm-Interface.
de.lmu.ifi.dbs.elki.algorithm.outlier	Outlier detection algorithms
de.lmu.ifi.dbs.elki.algorithm.outlier.spatial.neighborhood	Spatial outlier neighborhood classes
de.lmu.ifi.dbs.elki.database.datastore	General data store layer API (along the lines of Map<DBID, T> - use everywhere!)
de.lmu.ifi.dbs.elki.database.datastore.memory	Memory data store implementation for ELKI.
de.lmu.ifi.dbs.elki.database.relation	Relations, materialized and virtual (views).
de.lmu.ifi.dbs.elki.result	Result types, representation and handling

Uses of DataStore in de.lmu.ifi.dbs.elki.algorithm

Methods in de.lmu.ifi.dbs.elki.algorithm that return DataStore

DataStore<KNNList<D>>

KNNJoin.run(Database database, Relation<V> relation) Joins in the given spatial database to each object its k-nearest neighbors.

Uses of DataStore in de.lmu.ifi.dbs.elki.algorithm.clustering

Fields in de.lmu.ifi.dbs.elki.algorithm.clustering declared as DataStore

private DataStore<D>

SLINK.CompareByLambda.lambda Lambda storage

Methods in de.lmu.ifi.dbs.elki.algorithm.clustering with parameters of type DataStore

private void	DeLiClu.expandLeafNodes(SpatialPrimitiveDistanceFunction<NV,D> distFunction, DeLiCluNode node1, DeLiCluNode node2, DataStore<KNNList<D>> knns) Expands the specified leaf nodes.
private void	DeLiClu.expandNodes(DeLiCluTree index, SpatialPrimitiveDistanceFunction<NV,D> distFunction, DeLiClu.SpatialObjectPair nodePair, DataStore<KNNList<D>> knns) Expands the spatial nodes of the specified pair.
private Clustering<Model>	SLINK.extractClusters_erich(DBIDs ids, DataStore<DBID> pi, DataStore<D> lambda, int minclusters) Extract all clusters from the pi-lambda-representation.
private Clustering<Model>	SLINK.extractClusters_erich(DBIDs ids, DataStore<DBID> pi, DataStore<D> lambda, int minclusters) Extract all clusters from the pi-lambda-representation.
private Clustering<DendrogramModel<D>>	SLINK.extractClusters(DBIDs ids, DataStore<DBID> pi, DataStore<D> lambda, int minclusters) Extract all clusters from the pi-lambda-representation.
private Clustering<DendrogramModel<D>>	SLINK.extractClusters(DBIDs ids, DataStore<DBID> pi, DataStore<D> lambda, int minclusters) Extract all clusters from the pi-lambda-representation.
private DBID	SLINK.lastObjectInCluster(DBID id, D stopdist, DataStore<DBID> pi, DataStore<D> lambda)
private DBID	SLINK.lastObjectInCluster(DBID id, D stopdist, DataStore<DBID> pi, DataStore<D> lambda)
private void	DeLiClu.reinsertExpanded(SpatialPrimitiveDistanceFunction<NV,D> distFunction, DeLiCluTree index, List<TreeIndexPathComponent<DeLiCluEntry>> path, DataStore<KNNList<D>> knns) Reinserts the objects of the already expanded nodes.
private void	DeLiClu.reinsertExpanded(SpatialPrimitiveDistanceFunction<NV,D> distFunction, DeLiCluTree index, List<TreeIndexPathComponent<DeLiCluEntry>> path, int pos, SpatialDirectoryEntry parentEntry, DataStore<KNNList<D>> knns)
private Cluster<DendrogramModel<D>>	SLINK.root(Map<DBID,ModifiableDBIDs> cluster_ids, Map<DBID,D> cluster_distances, DataStore<DBID> pi, DataStore<D> lambda, ModifiableHierarchy<Cluster<DendrogramModel<D>>> hier, FiniteProgress progress)
private Cluster<DendrogramModel<D>>	SLINK.root(Map<DBID,ModifiableDBIDs> cluster_ids, Map<DBID,D> cluster_distances, DataStore<DBID> pi, DataStore<D> lambda, ModifiableHierarchy<Cluster<DendrogramModel<D>>> hier, FiniteProgress progress)

Constructors in de.lmu.ifi.dbs.elki.algorithm.clustering with parameters of type DataStore

SLINK.CompareByLambda(DataStore<D> lambda)
Constructor.

Uses of DataStore in de.lmu.ifi.dbs.elki.algorithm.outlier

Methods in de.lmu.ifi.dbs.elki.algorithm.outlier that return DataStore

protected DataStore<Double>	DBOutlierDetection.computeOutlierScores(Database database, DistanceQuery<O,D> distFunc, D neighborhoodSize)
protected abstract DataStore<Double>	AbstractDBOutlier.computeOutlierScores(Database database, DistanceQuery<O,D> distFunc, D d) computes an outlier score for each object of the database.
protected DataStore<Double>	DBOutlierScore.computeOutlierScores(Database database, DistanceQuery<O,D> distFunc, D d)

Methods in de.lmu.ifi.dbs.elki.algorithm.outlier with parameters of type DataStore

protected Pair<WritableDataStore<Double>,DoubleMinMax>

LOF.computeLOFs(DBIDs ids, DataStore<Double> lrds, KNNQuery<O,D> knnRefer) Computes the Local outlier factor (LOF) of the specified objects.

Uses of DataStore in de.lmu.ifi.dbs.elki.algorithm.outlier.spatial.neighborhood

Fields in de.lmu.ifi.dbs.elki.algorithm.outlier.spatial.neighborhood declared as DataStore

protected DataStore<DBIDs>

AbstractPrecomputedNeighborhood.store The data

Methods in de.lmu.ifi.dbs.elki.algorithm.outlier.spatial.neighborhood that return DataStore

private DataStore<DBIDs>	ExtendedNeighborhood.Factory.extendNeighborhood(Relation<? extends O> database) Method to load the external neighbors.
private DataStore<DBIDs>	ExternalNeighborhood.Factory.loadNeighbors(Relation<?> database) Method to load the external neighbors.

Constructors in de.lmu.ifi.dbs.elki.algorithm.outlier.spatial.neighborhood with parameters of type DataStore

AbstractPrecomputedNeighborhood(DataStore<DBIDs> store)
Constructor.

ExtendedNeighborhood(DataStore<DBIDs> store)
Constructor.

ExternalNeighborhood(DataStore<DBIDs> store)
Constructor.

PrecomputedKNearestNeighborNeighborhood(DataStore<DBIDs> store)
Constructor.

Uses of DataStore in de.lmu.ifi.dbs.elki.database.datastore

Subinterfaces of DataStore in de.lmu.ifi.dbs.elki.database.datastore

interface

WritableDataStore<T> Writable data store.

Methods in de.lmu.ifi.dbs.elki.database.datastore that return DataStore

<T> DataStore<T>

RecordStore.getStorage(int col, Class<? super T> datatype) Get a DataStore instance for a particular record column.

Uses of DataStore in de.lmu.ifi.dbs.elki.database.datastore.memory

Classes in de.lmu.ifi.dbs.elki.database.datastore.memory that implement DataStore

protected class	ArrayRecordStore.StorageAccessor<T> Access a single record in the given data.
class	ArrayStore<T> A class to answer representation queries using the stored Array.
protected class	MapRecordStore.StorageAccessor<T> Access a single record in the given data.
class	MapStore<T> A class to answer representation queries using a map.

Uses of DataStore in de.lmu.ifi.dbs.elki.database.relation

Fields in de.lmu.ifi.dbs.elki.database.relation declared as DataStore

private DataStore<O>

MaterializedRelation.content Map to hold the objects of the database.

Constructors in de.lmu.ifi.dbs.elki.database.relation with parameters of type DataStore

MaterializedRelation(Database database, SimpleTypeInformation<O> type, DBIDs ids, String name, DataStore<O> content)
Constructor.

MaterializedRelation(String name, String shortname, SimpleTypeInformation<O> type, DataStore<O> content, DBIDs ids)
Constructor.

Uses of DataStore in de.lmu.ifi.dbs.elki.result

Fields in de.lmu.ifi.dbs.elki.result declared as DataStore

protected DataStore<? extends T>

OrderingFromDataStore.map HashMap with object values

Constructors in de.lmu.ifi.dbs.elki.result with parameters of type DataStore

OrderingFromDataStore(String name, String shortname, DBIDs ids, DataStore<? extends T> map)
Minimal Constructor

OrderingFromDataStore(String name, String shortname, DBIDs ids, DataStore<? extends T> map, boolean descending)
Constructor without comparator

OrderingFromDataStore(String name, String shortname, DBIDs ids, DataStore<? extends T> map, Comparator<T> comparator, boolean descending)
Constructor with comparator