By Topic

A declarative language for similarity queries

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bufi, C. ; Rensselaer Polytech. Inst., Troy, NY, USA ; Adali, S.

In recent years, there has been much work on the retrieval of information from multimedia repositories. In particular, researchers have shown a great deal of interest in merging the results returned by multiple multimedia repositories into a single result. This task is challenging due to the heterogeneities among such systems, e.g. differences in the indexing methods and similarity functions employed by individual systems. In this paper, we define a declarative language for expressing queries that combine results from multiple similarity computations. We demonstrate the unique characteristics of this language and show how it provides for interesting and novel similarity queries. Numerous examples are given throughout

Published in:

Knowledge and Data Engineering Exchange, 1999. (KDEX '99) Proceedings. 1999 Workshop on

Date of Conference: