public class MutableLSH<E> extends LSH<E>
Constructor and Description |
---|
MutableLSH(int d,
int L,
int k,
double w)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
java.util.List<double[]> |
keys()
Returns the keys.
|
void |
put(double[] key,
E value)
Insert an item into the hash table.
|
void |
remove(double[] key,
E value)
Remove an entry from the hash table.
|
void |
update(double[] key,
E value)
Update an entry with new key.
|
java.util.List<E> |
values()
Returns the values.
|
public MutableLSH(int d, int L, int k, double w)
d
- the dimensionality of data.L
- the number of hash tables.k
- the number of random projection hash functions, which is usually
set to log(N) where N is the dataset size.w
- the width of random projections. It should be sufficiently
away from 0. But we should not choose an w value that is too
large, which will increase the query time.public void put(double[] key, E value)
LSH
public void remove(double[] key, E value)
public void update(double[] key, E value)
public java.util.List<double[]> keys()
public java.util.List<E> values()