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: email@example.com 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
The VLDB Journal – Springer Journals
Published: Jul 1, 2000
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
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.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera