Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Wactlar, T. Kanade, Michael Smith, S. Stevens (1996)
Intelligent Access to Digital Video: Informedia ProjectComputer, 29
A. Pentland, B. Moghaddam, Thad Starner (1994)
View-based and modular eigenspaces for face recognition1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition
A. Henrich (1994)
A Distance Scan Algorithm for Spatial Access Structures
S. Arya, D. Mount, N. Netanyahu, R. Silverman, A. Wu (1998)
An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJ. ACM, 45
A. Belussi, C. Faloutsos (1995)
Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension
A. Guttman (1984)
R-trees: a dynamic index structure for spatial searching
Gísli Hjaltason, H. Samet (1995)
Ranking in Spatial Databases
Daizhan Cheng, Hongsheng Qi, Yin Zhao (2012)
Multi-Dimensional Data
Flip Korn, Bernd-Uwe Pagel, C. Faloutsos (2001)
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'IEEE Trans. Knowl. Data Eng., 13
T. Sellis, N. Roussopoulos, C. Faloutsos (1997)
Multidimensional Access Methods: Trees Have Grown Everywhere
N. Roussopoulos, Stephen Kelley, F. Vincent (1995)
Nearest neighbor queries
N. Beckmann, H. Kriegel, R. Schneider, B. Seeger (1990)
The R*-tree: an efficient and robust access method for points and rectangles
Stefan Berchtold, C. Böhm, D. Keim, H. Kriegel (1997)
A cost model for nearest neighbor search in high-dimensional data space
Norio Katayama, S. Satoh (1997)
The SR-tree: an index structure for high-dimensional nearest neighbor queries
V. Gaede, O. Günther (1998)
Multidimensional access methodsACM Comput. Surv., 30
Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uemura, Haruhiko Kojima (2000)
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
(1994)
FaloutsosC (1994)Hilbert R-tree:An improvedR-tree using fractals
Stefan Berchtold, C. Böhm, H. Jagadish, H. Kriegel, J. Sander (2000)
Independent quantization: an index compression technique for high-dimensional data spacesProceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)
I. Kamel, C. Faloutsos (1994)
Hilbert R-tree: An Improved R-tree using Fractals
A. Gionis, P. Indyk, R. Motwani (1999)
Similarity Search in High Dimensions via Hashing
Stefan Berchtold, D. Keim, H. Kriegel (2001)
The X-tree : An Index Structure for High-Dimensional Data
R. Weber, H. Schek, Stephen Blott (1998)
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces
(1990)
TheBuddy tree : anefficient and robust access method for spatial data base systems
C. Faloutsos, V. Gaede (1996)
Analysis of n-Dimensional Quadtrees using the Hausdorff Fractal Dimension
We propose a novel index structure, the A-tree (approximation tree), for similarity searches in high-dimensional data. The basic idea of the A-tree is the introduction of virtual bounding rectangles (VBRs) which contain and approximate MBRs or data objects. VBRs can be represented quite compactly and thus affect the tree configuration both quantitatively and qualitatively. First, since tree nodes can contain a large number of VBR entries, fanout becomes large, which increases search speed. More importantly, we have a free hand in arranging MBRs and VBRs in the tree nodes. Each A-tree node contains an MBR and its children VBRs. Therefore, by fetching an A-tree node, we can obtain information on the exact position of a parent MBR and the approximate position of its children. We have performed experiments using both synthetic and real data sets. For the real data sets, the A-tree outperforms the SR-tree and the VA-file in all dimensionalities up to 64 dimensions, which is the highest dimension in our experiments. Additionally, we propose a cost model for the A-tree. We verify the validity of the cost model for synthetic and real data sets.
The VLDB Journal – Springer Journals
Published: Oct 1, 2002
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.