# Exact and approximate flexible aggregate similarity search

Exact and approximate flexible aggregate similarity search Aggregate similarity search, also known as aggregate nearest-neighbor ( Ann ) query, finds many useful applications in spatial and multimedia databases. Given a group Q of M query objects, it retrieves from a database the objects most similar to Q , where the similarity is an aggregation (e.g., $${{\mathrm{sum}}}$$ sum , $$\max$$ max ) of the distances between each retrieved object p and all the objects in Q . In this paper, we propose an added flexibility to the query definition, where the similarity is an aggregation over the distances between p and any subset of $$\phi M$$ ϕ M objects in Q for some support $$0< \phi \le 1$$ 0 < ϕ ≤ 1 . We call this new definition flexible aggregate similarity search and accordingly refer to a query as a flexible aggregate nearest-neighbor ( Fann ) query . We present algorithms for answering Fann queries exactly and approximately. Our approximation algorithms are especially appealing, which are simple, highly efficient, and work well in both low and high dimensions. They also return near-optimal answers with guaranteed constant-factor approximations in any dimensions. Extensive experiments on large real and synthetic datasets from 2 to 74 dimensions have demonstrated their superior efficiency and high quality. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

# Exact and approximate flexible aggregate similarity search

, Volume 25 (3) – Jun 1, 2016
22 pages

/lp/springer_journal/exact-and-approximate-flexible-aggregate-similarity-search-jwVghIMFbB
Publisher
Springer Berlin Heidelberg
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-015-0418-x
Publisher site
See Article on Publisher Site

### Abstract

Aggregate similarity search, also known as aggregate nearest-neighbor ( Ann ) query, finds many useful applications in spatial and multimedia databases. Given a group Q of M query objects, it retrieves from a database the objects most similar to Q , where the similarity is an aggregation (e.g., $${{\mathrm{sum}}}$$ sum , $$\max$$ max ) of the distances between each retrieved object p and all the objects in Q . In this paper, we propose an added flexibility to the query definition, where the similarity is an aggregation over the distances between p and any subset of $$\phi M$$ ϕ M objects in Q for some support $$0< \phi \le 1$$ 0 < ϕ ≤ 1 . We call this new definition flexible aggregate similarity search and accordingly refer to a query as a flexible aggregate nearest-neighbor ( Fann ) query . We present algorithms for answering Fann queries exactly and approximately. Our approximation algorithms are especially appealing, which are simple, highly efficient, and work well in both low and high dimensions. They also return near-optimal answers with guaranteed constant-factor approximations in any dimensions. Extensive experiments on large real and synthetic datasets from 2 to 74 dimensions have demonstrated their superior efficiency and high quality.

### Journal

The VLDB JournalSpringer Journals

Published: Jun 1, 2016

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations