de.lmu.ifi.dbs.elki.database.query.knn

Class DoubleOptimizedKNNQuery<O>

java.lang.Object

de.lmu.ifi.dbs.elki.database.query.AbstractDataBasedQuery<O>

de.lmu.ifi.dbs.elki.database.query.knn.AbstractDistanceKNNQuery<O,D>

de.lmu.ifi.dbs.elki.database.query.knn.LinearScanKNNQuery<O,DoubleDistance>

de.lmu.ifi.dbs.elki.database.query.knn.DoubleOptimizedKNNQuery<O>

Type Parameters:

O - Object type

All Implemented Interfaces:

DatabaseQuery, KNNQuery<O,DoubleDistance>, LinearScanQuery

public class DoubleOptimizedKNNQuery<O>
extends LinearScanKNNQuery<O,DoubleDistance>

Optimized linear scan query for PrimitiveDoubleDistanceFunctions.

Field Summary

Fields

Modifier and Type	Field and Description
(package private) PrimitiveDoubleDistanceFunction<O>	rawdist Raw distance function.

Fields inherited from class de.lmu.ifi.dbs.elki.database.query.knn.AbstractDistanceKNNQuery

distanceQuery

Fields inherited from class de.lmu.ifi.dbs.elki.database.query.AbstractDataBasedQuery

relation

Fields inherited from interface de.lmu.ifi.dbs.elki.database.query.DatabaseQuery

HINT_BULK, HINT_EXACT, HINT_HEAVY_USE, HINT_NO_CACHE, HINT_OPTIMIZED_ONLY, HINT_SINGLE

Constructor Summary

Constructors

Constructor and Description
DoubleOptimizedKNNQuery(PrimitiveDistanceQuery<O,DoubleDistance> distanceQuery) Constructor.

Method Summary

Methods

Modifier and Type	Method and Description
KNNList<DoubleDistance>	getKNNForDBID(DBIDRef id, int k) Get the k nearest neighbors for a particular id.
KNNList<DoubleDistance>	getKNNForObject(O obj, int k) Get the k nearest neighbors for a particular id.
(package private) KNNList<DoubleDistance>	getKNNForObjectBenchmarked(O obj, int k) It does not make sense, but this version is faster in our larger benchmarks.
(package private) KNNList<DoubleDistance>	getKNNForObjectBenchmarked2(O obj, int k) Another attempt at getting a faster knn heap.
(package private) KNNList<DoubleDistance>	getKNNForObjectBenchmarked3(O obj, int k) Next attempt at exploiting the JIT fully.
(package private) KNNList<DoubleDistance>	getKNNForObjectBenchmarked4(O obj, int k) Next attempt at exploiting the JIT fully.
(package private) KNNList<DoubleDistance>	getKNNForObjectBenchmarked5(O obj, int k) Next attempt at exploiting the JIT fully.
(package private) KNNList<DoubleDistance>	getKNNForObjectBenchmarked6(O obj, int k) Next attempt at exploiting the JIT fully.
(package private) KNNList<DoubleDistance>	getKNNForObjectClean(O obj, int k) This is the cleaner, supposedly faster implementation.
(package private) KNNList<DoubleDistance>	getKNNForObjectKNNHeap(O obj, int k) This is the straightforward implementation using the optimized heap.

Methods inherited from class de.lmu.ifi.dbs.elki.database.query.knn.LinearScanKNNQuery

getKNNForBulkDBIDs

Methods inherited from class de.lmu.ifi.dbs.elki.database.query.AbstractDataBasedQuery

getRelation

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

rawdist

PrimitiveDoubleDistanceFunction<O> rawdist

Raw distance function.

Constructor Detail

DoubleOptimizedKNNQuery

public DoubleOptimizedKNNQuery(PrimitiveDistanceQuery<O,DoubleDistance> distanceQuery)

Constructor.

Parameters:

distanceQuery - Distance function to use

Method Detail

getKNNForDBID

public KNNList<DoubleDistance> getKNNForDBID(DBIDRef id,
                                    int k)

Description copied from interface: KNNQuery

Get the k nearest neighbors for a particular id.

Specified by:

getKNNForDBID in interface KNNQuery<O,DoubleDistance>

Overrides:

getKNNForDBID in class LinearScanKNNQuery<O,DoubleDistance>

Parameters:

id - query object ID

k - Number of neighbors requested

Returns:

neighbors

getKNNForObject

public KNNList<DoubleDistance> getKNNForObject(O obj,
                                      int k)

Description copied from interface: KNNQuery

Get the k nearest neighbors for a particular id.

Specified by:

getKNNForObject in interface KNNQuery<O,DoubleDistance>

Overrides:

getKNNForObject in class LinearScanKNNQuery<O,DoubleDistance>

Parameters:

obj - Query object

k - Number of neighbors requested

Returns:

neighbors

getKNNForObjectKNNHeap

KNNList<DoubleDistance> getKNNForObjectKNNHeap(O obj,
                                             int k)

This is the straightforward implementation using the optimized heap.

Parameters:

obj - Query object

k - Desired number of neighbors

Returns:

kNN result

getKNNForObjectClean

KNNList<DoubleDistance> getKNNForObjectClean(O obj,
                                           int k)

This is the cleaner, supposedly faster implementation.

Parameters:

obj - Query object

k - Desired number of neighbors

Returns:

kNN result

getKNNForObjectBenchmarked

KNNList<DoubleDistance> getKNNForObjectBenchmarked(O obj,
                                                 int k)

It does not make sense, but this version is faster in our larger benchmarks. Apparently, some JIT optimization kicks in better.

Parameters:

obj - Query object

k - Desired number of neighbors

Returns:

kNN result

getKNNForObjectBenchmarked2

KNNList<DoubleDistance> getKNNForObjectBenchmarked2(O obj,
                                                  int k)

Another attempt at getting a faster knn heap.

Parameters:

obj - Query object

k - Desired number of neighbors

Returns:

kNN result

getKNNForObjectBenchmarked3

KNNList<DoubleDistance> getKNNForObjectBenchmarked3(O obj,
                                                  int k)

Next attempt at exploiting the JIT fully.

Parameters:

obj - Query object

k - Desired number of neighbors

Returns:

kNN result

getKNNForObjectBenchmarked4

KNNList<DoubleDistance> getKNNForObjectBenchmarked4(O obj,
                                                  int k)

Next attempt at exploiting the JIT fully.

Parameters:

obj - Query object

k - Desired number of neighbors

Returns:

kNN result

getKNNForObjectBenchmarked5

KNNList<DoubleDistance> getKNNForObjectBenchmarked5(O obj,
                                                  int k)

Next attempt at exploiting the JIT fully.

Parameters:

obj - Query object

k - Desired number of neighbors

Returns:

kNN result

getKNNForObjectBenchmarked6

KNNList<DoubleDistance> getKNNForObjectBenchmarked6(O obj,
                                                  int k)

Next attempt at exploiting the JIT fully.

Parameters:

obj - Query object

k - Desired number of neighbors

Returns:

kNN result