In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
— In this paper we present a novel cost benefit operator that assists multi level genetic algorithm searches. Through the use of the cost benefit operator, it is possible to dyna...
George G. Mitchell, Barry McMullin, James Decraene
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
Holger Bast, Christian Worm Mortensen, Ingmar Webe...
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...