참고문헌
- K.I. Lin, H. Jagadish, and C, Faloutsos, 'The TV-tree : An Index Structure for High Dimensional Data,' VLDB Journal, Vol 3, pp. 517-542, 1994 https://doi.org/10.1007/BF01231606
- S. Berchtold, D. A. Keim and H-P. Kriegel, 'The X-tree : An Index Structure for High-Dimensional Data,' In Proc. 22nd VLDB Coni pp. 28-39, 1996
- D. A. White and R. Jain, 'Similarity Indexing with the SS-tree,' In Proc. ICDE, New Orleans, pp. 516-523, 1996
- N. Katayama and S. Satoh, 'The SR-Tree : An index structure for high dimensional nearest neighbor queries,' In Proc. SIGMOD conf., pp. 369-380 1997 https://doi.org/10.1145/253262.253347
- 이석회, 유재수, 조기형, 허대영, 'CIR-Tree : 효율적인 고차원 색인기법', 한국정보과학회 논문지(B), 한국정보과학회 제26권 제6호, pp. 724-734, Jun 1999
- J.T. Robinson. 'The K-D-B-tree: A search structure for large multidimensional dynamic indexed.' In Proc. ACM SIGMOD Conf., pp. 10-18, 1981 https://doi.org/10.1145/582318.582321
- Lomet D. and Salzberg B, 'The hB-Tree: A Robust Multiattribute Search Structure,' In Proc. ICDE Conf, pp. 296-304, 1989 https://doi.org/10.1109/ICDE.1989.47229
- A. Henrich, H.-W. Six and P. Widmayer, 'The LSD-tree: spatial access to multidimensional point and non-point objects,' In Proc. VLDB Conf., pp. 45-53, 1989
- M. Freeston, 'The BANG file: a new kind of grid file,' In Proc. VLDB conf., pp. 260-269, 1987
- J. Nievergelt, H. Hinterberger, and K. Sevcik, 'The grid file: An adaptable, symmetric multikey file structure,' ACM Transactions on Database Systems(TODS). 1984 https://doi.org/10.1145/348.318586
- K. Chakrabarti and S. Mehrotra. 'The Hybrid Tree : An Index Structure for High-Dimensional Feature Spaces,' In Proc. ICDE conf., pp. 440-447, 1999 https://doi.org/10.1109/ICDE.1999.754960
- Aristides Gionis, Piotr Indyk and Rajeev Motwani, 'Similarity Search in High Dimensions via Hashing,' In Proc. VLDB Conf., pp. 518-529, 1999
- Weber R., Scheck H.-J and Blott S., 'A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces,' In Proc. VLDB Conf., pp. 194-205, 1998
- Berchtold S., 'Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces,' In Proc. ICDE Conf., pp. 577-588, 2000 https://doi.org/10.1109/ICDE.2000.839456
- Ning An, Liujian Quian, Anand Sivasubramaniam and Tom Kecfe, 'Evaluating Parallel R-Tree Implementations on a Network of Workstations,' In Proc. ACM GIS Conf., pp. 159-160, 1998 https://doi.org/10.1145/288692.288721
- 조성훈, 김성주, 이준호, 이주영, 박석천, 'SANS의 구조와 기술 요소', 정보처리학회지 제8권 제4호, pp.19-28, 2001
- I. Kamel and C. Faloutsos, 'Parallel R-trees,' CS-TR-2820, UMIACS-TR-92-1, Computer Science Technical Report Series, University of Maryland, Collage Park, MD, 1992
- Stefan Berchtold, Christian Bohm, Bemhard Braunmuller, Daniel A.Keim and Hans-Peter Kriegel, 'Fast Parallel Similarity Search in Multimedia Databases,' In Proc. SIGMOD Conf., pp. 1-12, 1997 https://doi.org/10.1145/253262.253263
- Kap S. Bang and Huizu Lu, 'The PML-tree: An Efficient Parallel Spatial Index Structure for Spatial Databases,' In Proc. ACM Conf., pp. 79-88. 1996 https://doi.org/10.1145/228329.228338
- N. Koudas, C. Faloutsos and I. Kamel, 'Declus-tering R-trees on Multi-Computer Architectures,' Technical Research Report ISR 1994
- Bemad Scnnitzer and Scott T.Leutenegger, 'Master-Client R-trees: A New Parallel R-trec Architecture,' In Proc. SSDBM Conf. pp. 68-77, 1999 https://doi.org/10.1109/SSDM.1999.787622
- Botao Wang, Hiroyuki Horinokuchi, Kunihiko Kaneko and Akifumi Makinouchi, 'Parallel R-tree Search Algorithm on DSVM,' In Proc. DASFAA Conf., pp. 237-245, 1999 https://doi.org/10.1109/DASFAA.1999.765757
- Xiaodong Fu, Dingxing Wang, Weimin Zheng and Mciming Sheng, 'GPR-Tree: A Global Parallel Index Structure for Multiattribute Declustering on Cluster of Workstations,' IEEE, 1997 https://doi.org/10.1109/APDC.1997.574047
- Roger Weber, 'Parallel VA-File,' VLDB, 1999
- http://www.metastor.com/products/sans/E4400_ datasheet.pdf
- N. Beckmann, H.P. Komacker, R. Schneider and B. Seeger, 'The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,' In Proc. ACM SIGMOD Conf., pp. 322-331, 1990
- A. Guttman, 'R-Trees: A dynamic index structure for spatial searching,' In Proc. ACM SIGMOD Conf., pp. 47-57, 1984 https://doi.org/10.1145/602259.602266
- K. Lin, H. V. Jagadish, and C. Faloutsos, 'The TV-Tree an index structure for high dimensional data,' VLDB Journal, pp. 517-542, 1994 https://doi.org/10.1007/BF01231606
- A. Henrich, 'Improving the performance of multidimensional access structures based on k-d-trees,' In Proc. Information and Knowledge Management Conf., pp. 68-75, 1996 https://doi.org/10.1109/ICDE.1996.492090
- T.Sellis, N. Roussopoulos and C. Faloutsos, 'The R--Tree: a dynamic index for multi-dimensional objects,' In Proc. VLDB Conf., pp. 507-518, 1987
- Ibrahim Kamel and Christos Faloutsos, 'Parallel R-trees,' In Proc. ACM SIGMOD Conf., pp. 195-204, 1992 https://doi.org/10.1145/130283.130315
- Stefan Berchtold, 'Improving the Query performance of High-Dimensional Index Structure by Bulk Load Operation,' In Proc. EDBT Conf., pp. 216-230, 1998