Spatial indexing of high-dimensional data based on relative approximation

VLDB Journal

Volumn 11, Issue 2, 2002, Pages 93-108

  Sakurai, Yasushi ^a   Yoshikawa, Masatoshi ^b   Uemura, Shunsuke ^b   Kojima, Haruhiko ^a  

^a NTT CORPORATION   (Japan)

^b NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

High dimensional data; Relative approximation; Similarity search

Indexed keywords

APPROXIMATION THEORY; DATABASE SYSTEMS; NONBIBLIOGRAPHIC RETRIEVAL SYSTEMS; SEARCH ENGINES; TREES (MATHEMATICS);

VIRTUAL BOUNDING RECTANGLES (VBR);

INDEXING (OF INFORMATION);

EID: 0036824102     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-002-0066-9     Document Type: Article

References (24)

1. Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1994) An optimal algorithm for approximate nearest neighbor searching. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 573-582
2. Berchtold S, Böhm C, Jagadish HV, Kriegel HP, Sander J (2000) Independent quantization: an index compression technique for high-dimensional data spaces. In: Proc. IEEE 16th International Conference on Data Engineering, pp. 577-588
3. Berchtold S, Böhm C, Keim DA, Kriegel HP (1997) A cost model for nearest neighbor search in high-dimensional data space. In: Proc. ACM Symposium on Principles of Database Systems, pp. 78-86
4. Belussi A, Faloutsos C (1995) Estimating the selectivity of spatial queries using the 'correlation'. In: Proc. 21st International Conference on Very Large Data Bases (VLDB), pp. 299-310
5. Berchtold S, Keim DA, Kriegel HP (1996) The X-tree: an index structure for high-dimensional data. In: Proc. 22nd International Conference on Very Large Data Bases (VLDB), pp. 28-39
6. Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 322-331
7. Faloutsos C, Gaede V (1996) Analysis of n-dimensional quadtrees using the Hausdorff fractal dimension. In: Proc. 22nd International Conference on Very Large Data Bases (VLDB), pp. 40-50
8. Gaede V, Günther O (1998) Multidimensional access methods. ACM Comput Surv 30(2): 170-231
9. Gionis A, Indyk P, Motwani R (1999) Similarity search in high dimensions via hashing. In: Proc. 25th International Conference on Very Large Data Bases (VLDB), pp. 518-529
10. Guttman A (1984) R-Trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 47-57
11. Henrich A (1994) A distance scan algorithm for spatial access structures. In: Proc. ACM International Workshop on Advances in Geographic Information Systems, pp. 136-143
12. Hjaltason GR, Samet H (1995) Ranking in spatial databases. In: Proc. 4th Symposium on Spatial Databases, pp. 83-95
13. Kamel I, Faloutsos C (1994) Hubert R-tree: An improved R-tree using fractals. In: Proc. 20th International Conference on Very Large Databases, pp. 500-509
14. Korn F, Pagel BU, Faloutsos C (2001) On the "dimensionality curse" and the "self-similarity blessing". IEEE Trans Data Knowl Eng 13(1):96-111
15. Katayama N, Satoh S (1997) The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 369-380
16. Murase H, Nayar S (1995) Visual learning and recognition of 3-D objects from appearance. Int J Comput Vision 14(1):5-24
17. Pentland A, Moghaddam B, Starner C (1994) View-based and modular eigenspaces for face recognition. In: Proc. IEEE Conf. on CVPR, pp. 84-91
18. Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 71-79
19. Seeger B, Kriegel HP (1990) The Buddy tree: an efficient and robust access method for spatial data base systems. In: Proc. 16th International Conference on Very Large Data Bases (VLDB), pp. 590-601
20. Sellis TK, Roussopoulos N, Faloutsos C (1997) Multidimensional access methods: trees have grown everywhere. In: Proc. 23rd International Conference on Very Large Data Bases (VLDB), pp. 13-14
21. Sakurai Y, Yoshikawa M, Uemura S, Kojima H (2000) The A-tree: an index structure for high-dimensional spaces using relative approximation. In: Proc. 26th International Conference on Very Large Data Bases (VLDB), pp. 516-526
22. White DA, Jain R (1996) Similarity Indexing with the SS-tree. In: Proc. IEEE 12th International Conference on Data Engineering, pp. 516-523
23. Wactlar HD, Kanade T, Smith MA, Stevens SM (1996) Intelligent access to digital video: informedia project. IEEE Comput 29(5):46-52
24. Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. 24th International Conference on Very Large Data Bases (VLDB), pp. 194-205