Similarity search is very useful in many applications. Because of the complex-ity and expensive nature of such search operations, many existing methods re-quire special access methods and cannot be directly integrated with commercialDBMSs(Database Management Systems). NTNUStore is a framework to aid re-search in this eld and focuses on disk-based metric indexing to keep it compatiblewith commercial DBMSs.This project has implemented and experimented with a version of the LAESA(Linear Approximating and Eliminating Search Algorithm) in NTNUStore. Theresults are close to what was represented in Erik Bagge Ottesen's master thesis. The biggest contribution in this project is that the new algorithm solves KNNsearch without the need of providing a range parameter in the query.