Journal of KIISE:Databases (한국정보과학회논문지:데이타베이스)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Efficient Integrity Checking using Hashed B-Tree Index

Hashed B-트리 인덱스를 이용한 효율적인 무결성 검사

  • 박선섭 (한국증권전산주식회사 전산기술연구소) ;
  • 정재목 (서울대학교 컴퓨터공학과) ;
  • 김형주 (서울대학교 컴퓨터공학과)
  • Published : 2000.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper suggests a new access path, hashed B-tree which is an efficient access method for integrity checking. Hashed B-tree is based on the observation that most query patterns in enforcing integrity constraints are point queries. Hashed B-tree compresses the key by hashing procedure, which reduces the height of tree and results in fast node search. This method has the advantages such as it can be implemented easily and use the B-tree concurrency control and recovery algorithm with minor modifications.

본 논문에서는 무결성 제약을 효율적으로 유지하기 위한 접근 경로인 Hashed B-트리를 제안하고, 기존의 B-트라와 성능을 비교한다. 무결성 제약을 만족시키기 위해 필요한 질의 패턴들이 종점 질의로 구성되어 있다는 점에 착안하여, Hashed B-트리는 키를 해슁을 통해 압축하여 저장한다. 따라서 트리의 높이가 줄어들게 되고 트리의 탐색이 빠르다. 이 기법은 기존의 B-트리와 유사하게 작동하기 때문에 기존 시스템에 많은 수정을 요하지 않고 병행성 제어나 회복 기법을 그대로 사용할 수 있는 장점이 있다.

Keywords

References

  1. C. J. Date with Hugh Darwen. A Guide to The SQL Standared. Addison Wesley, 1993
  2. J. Melton and A. R. Simon. Undertanding the new SQL: A Complete Guide, Morgan Kaufman Publishers, Inc., 1993
  3. 이상구, 장재영, '무결성 제약의 효율적 검증을 위한 최적화 방법', 정보과학학회논문지(B), 제 23 권 제 5 호:466-476, 1996년 5월
  4. T. Harder and J. Reinert. 'Access Path Support for Referential Integrity in SQL2'. VLDB Journal, 5(3):196-214, July 1996 https://doi.org/10.1007/s007780050024
  5. E. F. Codd. 'A Relational Model of Data for Large Shared Data Banks'. Communications of ACM, 13: 377-387, 1970 https://doi.org/10.1145/362384.362685
  6. C. J. Date. 'Referential Integrity'. Proc. of the Conf. on VLDB, pages 2-12, Sept. 1981
  7. K. P. Eswaran and D. D. Chamberlin. 'Functional Specification of a Subsystem for Data Base Integrity'. Proc. of the Conf. on VLDB, Sept. 1975
  8. D. Z. Badal, G. J. Popek. 'Cost and Performance Analysis of Semantic Integrity Validation Methods'. Proc. of the ACM SIGMOD Conf. on Management of Data, pages 109-115, May 1979 https://doi.org/10.1145/582095.582112
  9. G. Antoshenkov, D. Lomet, and J. Murray. 'Order Preserving String Compression'. International Conference on Data Engineeringt(ICDE), pages 655-663, 1996 https://doi.org/10.1109/ICDE.1996.492216
  10. R. Bayer and K. Unterauer. 'Prefix B-Trees'. ACM Trans. Database Syst., 2(1):11-26, Mar. 1977 https://doi.org/10.1145/320521.320530
  11. M. Blasgen, R. Casey, and K. Eswaran. 'An Encoding Method for Multi-field Sorting and Indexing'. Communications of ACM, 20(11):846-876, Nov. 1977 https://doi.org/10.1145/359863.359892
  12. D. A. Bell and S. M. Deen. 'Key Space Compression and Hashing in PRECI'. The Computer Journal, 25(4), 1982
  13. D. A. Bell and S. M. Deen. 'Hash Trees Versus B-Trees'. The Computer Journal, 27(3), 1984 https://doi.org/10.1093/comjnl/27.3.218
  14. S. M. Deen. 'An Implementation of Impure Surrogates'. Proc. of the Conf. on VLDB, pages 245-246, Sept. 1982
  15. C. Mohan. 'ARIES/IM: An Efficient and High Concurrency Index management Method Using Write-Ahead Logging'. Technical Report RJ6846, IBM Research Division, Aug. 1989
  16. C. Mohan. 'ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transaction Operating on B-Tree Indexes'. Proc. of the Conf. on VLDB, pages 392-405, Brisbane, Australia, Aug. 1990
  17. C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwarz. 'ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging'. ACM Trans. Database Syst., 17(1):94-162, Mar. 1992 https://doi.org/10.1145/128765.128770
  18. P. Mishra and M. H. Eich. 'Join Processing in Relational Databases'. ACM Computing Surveys, 24(1), 1992 https://doi.org/10.1145/128762.128764
  19. E. J. Otoo. 'Linearizing the Directory Growth in Order Preserving Extendible Hashing'. International Conference on Data Engineering(ICDE), pages 580-588, 1988
  20. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufman Publishers, Inc., 1993