-
Chapter and Conference Paper
Finding Data Broadness Via Generalized Nearest Neighbors
A data object is broad if it is one of the k-Nearest Neighbors (k-NN) of many data objects. We introduce a new database primitive called Generalized Nearest Neighbor (GNN) to express data broadness. We also devel...
-
Article
Reference-based indexing for metric spaces with costly distance measures
We consider the problem of similarity search in databases with costly metric distance measures. Given limited main memory, our goal is to develop a reference-based index that reduces the number of comparisons ...
-
Reference Work Entry In depth
Index Structures for Biological Sequences
-
Living Reference Work Entry In depth
Index Structures for Biological Sequences
-
Reference Work Entry In depth
Index Structures for Biological Sequences