Cart (Loading....) | Create Account
Close category search window
 

Reducing I/O Cost of Similarity Queries by Processing Several at a Time

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)
Muller, W. ; University of Bayreuth, Germany ; Henrich, A.

Current research on high-dimensional indexing structures for multimedia retrieval is focused on obtaining optimal performance for single k-NN queries. Within this paper, we argue for parallel processing of multiple nearest neighbor queries. This is beneficial when there is heavy load on the server and efficiency is important. We argue that query performance for parallel queries is an important parameter in the evaluation of the usefulness of indexing structures. We show that by processing multiple queries simultaneously we can dramatically reduce the cost of each single query involved. We support these findings via experiments on VA- and inverted VA-files, an improved variant of VA-files.

Published in:

Computer Vision and Pattern Recognition Workshop, 2004. CVPRW '04. Conference on

Date of Conference:

27-02 June 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.