References
- 최길성, 이석희, 송석일, 유재수, 조기형, 고차원 색인 구조를 위한 효율적인 동시성제어 알고리즘, KISS 98 가을 학술발표(Ⅰ), pages 54-56, October 1998
- 이석희, 송석일, 유재수, 이미지 검색을 위한 고차원 색인구조, KISS 데이타베이스 연구회 논문지, 제14권 제 4호, pages 53-68, December 1998
- 이석희, 유재수, 조기형, 허대영, 'CIR-Tree : 효율적인 고차원 색인기법', 한국정보과학회 논문지(B), 한국정보과학회, 제26권 제6호, pages 724-734, Jun 1999
- M. Kornacker, C. Mohan and J. M. Hellerstein, Concurrency and Recovery in Generalized Search Trees, In Proc. ACM SIGMOD Conf., pages 62-72, May 1997 https://doi.org/10.1145/253260.253272
- M. Kornacker and D. Banks, 'High-Concurrency Locking in R-Trees,' In Proc. 21st Int'l Conference on VLDB, pages 134-145, September 1995
- C. Mohan, D. Harderle, B. Lindsay, H. Pirahesh, and P. Schwarz, 'ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write Ahead Logging,' ACM TODS, 17(1), pages 94-162, March 1992 https://doi.org/10.1145/128765.128770
- C. Mohan and F. Levine, 'ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging,' In Proc. ACM SIGMOD Conf., pages 371-380, June 1992 https://doi.org/10.1145/141484.130338
- P.L. Lehmann and S.B. Yao, 'Efficient Locking for Concurrent Operations on B-Trees,' ACM TODS, 6(4), pages 650-670, December 1981 https://doi.org/10.1145/319628.319663
- V. Ng and T. Kamada, 'Concurrent Accesses to R-Trees,' In Proc. of Symposium on Large Spatial Databases, pages 142-161, 1993
- Shuanhu Wang, Joseph M. Hellerstein and Ilya Lipkind. 'Near-Neighbor Query Performance in Search Trees.' UC Berkeley Tech Report CSD-98-1012, eptember 1998
- J. Nievergelt, H. Hinterberger, and K. Sevcik. 'The grid file: An adaptable, symmetric multikey file structure.' ACM Transactions on Database Systems(TODS), 1984
- A. Guttman. 'R-Trees: A dynamic index structure for spatial searching.' In Proc. ACM SIGMOD Conf., pages. 47-57, 1984 https://doi.org/10.1145/602259.602266
- N.Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. 'The R*-Tree: an efficient and robust access method for points and rectangles.' ACM SIGMOD, pages 322-331, May, 1990
- K. Lin, H. V. Jagadish, and C. Faloutsos. 'The TV-Tree an index stucture for high dimensional data.' In VLDB Journal, 1994
- S. Berchtold, D. A. Keim, and H. P. Kriegel. 'The X-Tree: An index structure for high-dimensional data.' Proc. of VLDB, 1996
- D. White and R. Jain. 'Similarity indexing with the SS-Tree.' Proc. of ICDE, 1995
- N. Katayama and S. Satoh. 'The SR-Tree: An index structure for high dimensional nearest neighbor queries.' Proc. of SIGMOD, 1997 https://doi.org/10.1145/253262.253347
- K. Chakrabarti and S. Mehrotra. 'The Hibrid Tree:An Index Structure for High-Dimensional Feature Spaces.' Proc. of ICDE, 1999 https://doi.org/10.1109/ICDE.1999.754960