Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances

Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances The VLDB Journal (2000) 9: 154–173 The VLDB Journal c Springer-Verlag 2000 Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances Ada Wai-chee Fu, Polly Mei-shuen Chan, Yin-Ling Cheung, Yiu Sang Moon Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong; e-mail: adafu@cse.cuhk.edu.hk Edited by T. Ozsu and S. Christodoulakis. Received June 9, 1998 / Accepted January 31, 2000 Abstract. For some multimedia applications, it has been a collection of images, users can use existing images as found that domain objects cannot be represented as feature query templates and ask the system for images similar to vectors in a multidimensional space. Instead, pair-wise dis- the query images. This is the so-called “like-this” query. tances between data objects are the only input. To support Alternatively, the user can sketch a picture that serves as content-based retrieval, one approach maps each object to the query template. a k-dimensional (k-d) point and tries to preserve the dis- To support content-based retrieval, often we have to rely tances among the points. Then, existing spatial access index on feature extraction capabilities to map each domain ob- methods such as the R-trees and KD-trees can support fast ject into http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances

Loading next page...
 
/lp/springer_journal/dynamic-vp-tree-indexing-for-n-nearest-neighbor-search-given-pair-wise-VRgdIl768W
Publisher
Springer-Verlag
Copyright
Copyright © 2000 by Springer-Verlag Berlin Heidelberg
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/PL00010672
Publisher site
See Article on Publisher Site

There are no references for this article.

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
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

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.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$49/month

Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588

$360/year

billed annually
Start Free Trial

14-day Free Trial