Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

104

Voted

VLDB
2000
ACM

114views Database» more VLDB 2000»

The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation

15 years 6 months ago

The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation

Download www.vldb.org

We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the

Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uem

Real-time Traffic

Approximation Tree | Database | VLDB 2000 |

claim paper

Related Content

» Quality and efficiency in high dimensional nearest neighbor search

» An Adaptive Index Structure for HighDimensional Similarity Search

» On MBR Approximation of Histories for Historical Queries Expectations and Limitations

» Dimensionality reduction using magnitude and shape approximations

» Efficient kNN search on vertically decomposed data

» Using structure indices for efficient approximation of network properties

» Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases

» Filaments of Meaning in Word Space

» Secondary indexing in one dimension beyond btrees and bitmap indexes

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	2000
Where	VLDB
Authors	Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uemura, Haruhiko Kojima

Comments (0)