High-Dimensional Indexing: Transformational Approaches to High-Dimensional Range and Similarity Searches
In this monograph, we study the problem of high-dimensional indexing and systematically introduce two efficient index structures: one for range queries and the other for similarity queries. Extensive experiments and comparison studies are conducted to demonstrate the superiority of the proposed indexing methods.

Many new database applications, such as multimedia databases or sk price information systems, transform important features or properties of data objects into high-dimensional points. Searching for objects based on these features is thus a search of points in this feature space. To support efficient retrieval in such high-dimensional databases, indexes are required to prune the search space. Indexes for low-dimensional databases are well studied, whereas most of these application specific indexes are not scaleable with the number of dimensions, and they are not designed to support similarity searches and high-dimensional joins.

"1111354487"
High-Dimensional Indexing: Transformational Approaches to High-Dimensional Range and Similarity Searches
In this monograph, we study the problem of high-dimensional indexing and systematically introduce two efficient index structures: one for range queries and the other for similarity queries. Extensive experiments and comparison studies are conducted to demonstrate the superiority of the proposed indexing methods.

Many new database applications, such as multimedia databases or sk price information systems, transform important features or properties of data objects into high-dimensional points. Searching for objects based on these features is thus a search of points in this feature space. To support efficient retrieval in such high-dimensional databases, indexes are required to prune the search space. Indexes for low-dimensional databases are well studied, whereas most of these application specific indexes are not scaleable with the number of dimensions, and they are not designed to support similarity searches and high-dimensional joins.

54.99 In Stock
High-Dimensional Indexing: Transformational Approaches to High-Dimensional Range and Similarity Searches

High-Dimensional Indexing: Transformational Approaches to High-Dimensional Range and Similarity Searches

by Cui Yu
High-Dimensional Indexing: Transformational Approaches to High-Dimensional Range and Similarity Searches

High-Dimensional Indexing: Transformational Approaches to High-Dimensional Range and Similarity Searches

by Cui Yu

Paperback(2002)

$54.99 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Related collections and offers


Overview

In this monograph, we study the problem of high-dimensional indexing and systematically introduce two efficient index structures: one for range queries and the other for similarity queries. Extensive experiments and comparison studies are conducted to demonstrate the superiority of the proposed indexing methods.

Many new database applications, such as multimedia databases or sk price information systems, transform important features or properties of data objects into high-dimensional points. Searching for objects based on these features is thus a search of points in this feature space. To support efficient retrieval in such high-dimensional databases, indexes are required to prune the search space. Indexes for low-dimensional databases are well studied, whereas most of these application specific indexes are not scaleable with the number of dimensions, and they are not designed to support similarity searches and high-dimensional joins.


Product Details

ISBN-13: 9783540441991
Publisher: Springer Berlin Heidelberg
Publication date: 12/16/2002
Series: Lecture Notes in Computer Science , #2341
Edition description: 2002
Pages: 156
Product dimensions: 6.10(w) x 9.17(h) x (d)

Table of Contents

High-Dimensional Indexing.- Indexing the Edges — A Simple and Yet Efficient Approach to High-Dimensional Range Search.- Performance Study of Window Queries.- Indexing the Relative Distance — An Efficient Approach to KNN Search.- Similarity Range and Approximate KNN Searches with iMinMax.- Performance Study of Similarity Queries.- Conclusions.
From the B&N Reads Blog

Customer Reviews