The Transactions of the Korea Information Processing Society (한국정보처리학회논문지)

Korea Information Processing Society (한국정보처리학회)
권호 표지

Design and Implementation of a Recovery Method for High Dimensional Index Structures

고차원 색인구조를 위한 회복기법의 설계 및 구현

  • Song, Seok-Il (Dept. of Information Communication Engineering, Graduate School of Chungbuk National University) ;
  • Lee, Seok-Hui (Dept.of Internet BroadCast, Dongah Broadcasting College) ;
  • Yu, Jae-Su (Dept. of Electrical Elecronic Engineering, Chungbuk National University)
  • 송석일 (충북대학교 대학원 정보통신공학과) ;
  • 이석희 (동아방송대학 인터넷방송과) ;
  • 유재수 (충북대학교 전기전자공학부)
  • Published : 2000.07.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose a recovery method for high dimensional index structures. It recovers efficiently transactions including reinsert operations that needs undo or rollback due to system failures or transaction failures. It is based on WAL(Write Ahead Logging) protocol. We apply the method to the FCIR-Tree and implement it based on MiDAS-III which is the storage system of a multimedia DBMS, called BADA-III. We also show through performance evaluation that the recovery method with our algorithm recovers reinsert operations efficiently over that without our algorithm.

Keywords

References

  1. 이석희, 유재수, 조기형, 허대영, 'CIR-Tree : 효율적인 고차원 색인기법', 한국정보과학회 논문지, Vol.26, No.6, pp.724-734, June 1999
  2. C. Mohan, D. Harderle, B. Lindsay, H. Pirahesh and P.Schwarz, 'ARIES : A Transaction Revovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write Ahead Logging,' ACM TODS, Vol.7, No.1, pp.94-162, 1992 https://doi.org/10.1145/128765.128770
  3. C. Mohan and F. Levine, 'ARIES/IM : An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging,' ACM SIGMOD Proc., pp.371-380, 1992 https://doi.org/10.1145/130283.130338
  4. D. A. White and R. Jain, 'Similarity Indexing with the SS-trees,' ICDE96 Proc., pp.515-523, 1996 https://doi.org/10.1109/ICDE.1996.492202
  5. K.-I. Lin, H. Jagadish and C.Faloutsos, 'The TV-tree: An Index Structure for High-Dimensional Data,' VLDB Journal, Vol.3, No.4, pp.517-523, 1994 https://doi.org/10.1007/BF01231606
  6. M. Kornacker, C. Mohan and J. Hellerstein, 'Concurrency and Revovery in Generalized Search Trees,' ACM SIGMOD, pp.62-72, 1997 https://doi.org/10.1145/253260.253272
  7. M. Kornacker and D. Banks, 'High-Concurrency Locking in R-trees,' 21'nd VLDB Proc., pp.134-145, 1995
  8. 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 Proc., pp.322-331, 1990 https://doi.org/10.1145/93597.98741
  9. N. Katayama and S. Satoh, 'The SR-tree : An Index Structure for High-Dimensional Nearest Neighbor Queries,' ACM SIGMOD Proc., pp.369-380, 1997 https://doi.org/10.1145/253262.253347
  10. S. Wang, J. M. Hellerstein and I. Lipkind. 'Near-Neighbor Query Performance in Search Tree,' UC Berkeley Technical Report CSD-98-1012, 1998