최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기정보과학회논문지. Journal of KIISE. 데이타베이스, v.29 no.1, 2002년, pp.58 - 71
박춘서 (한국전자통신연구원) , 송석일 (충북대학교 정보통신공학과) , 신재룡 (충북대학교 정보통신공학과) , 유재수 (충북대학교 정보통신공학과)
Generally, multi-dimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amount of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
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
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
이석회, 유재수, 조기형, 허대영, 'CIR-Tree : 효율적인 고차원 색인기법', 한국정보과학회 논문지(B), 한국정보과학회 제26권 제6호, pp. 724-734, Jun 1999
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
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
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
N. Koudas, C. Faloutsos and I. Kamel, 'Declus-tering R-trees on Multi-Computer Architectures,' Technical Research Report ISR 1994
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
K. Lin, H. V. Jagadish, and C. Faloutsos, 'The TV-Tree an index structure for high dimensional data,' VLDB Journal, pp. 517-542, 1994
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
Stefan Berchtold, 'Improving the Query performance of High-Dimensional Index Structure by Bulk Load Operation,' In Proc. EDBT Conf., pp. 216-230, 1998
※ AI-Helper는 부적절한 답변을 할 수 있습니다.