메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
The applications for real-time database systems must satisfy timing constraints. Typically the timing constraints are expressed in the form of deadlines which are represented by priorities to be used by schedulers. In many real-time applications, since the system maintains sensitive information to be shared by multiple users with different levels of security clearance, security is another important requirement. As more advanced database systems are being used in applications that need to support timeliness while managing sensitive information, protocols that satisfy both requirements need to be developed. In this paper, we propose a new priority-driven secure multiversion locking(PSMVL) protocol for real-time secure database systems. The schedules produced by PSMVL are proven to be one-copy serializable. We have also shown that the protocol eliminates covert channels and priority inversions. The details of the protocol, including the compatibility matrix and the version selection algorithm are presented. The results of the performance comparisons of our protocol with other protocols are described.

목차

Abstract

Ⅰ. Introduction

Ⅱ. Background

Ⅲ. The PSMVL protocol

Ⅳ. Correctness proofs

Ⅴ. Performance Evaluation

Ⅵ. Conclusion

Acknowledgement

References

저자소개

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2009-569-017764886