메뉴 건너뛰기
Library Notice
Institutional Access
If you certify, you can access the articles for free.
Check out your institutions.
ex)Hankuk University, Nuri Motors
Log in Register Help KOR
Subject
Humanities
General Humanities History Philosophy Religious Studies Linguistics and Literature Other Humanities
Social science
General Social Science Business Management Tourism Education Military Science Library and Information Science Law Sociology Journalism and Media Studies Psychological Science Political Science and Diplomacy Geography Public Administration Economics International Trade Anthropology Other Social Science
Natural science
General Natural Science Physics Biology Life Sciences Mathematics/Statistics Astronomy Earth Science Chemistry Other Natural Science
Engineering
General Engineering Architectural Engineering Mechanical Engineering Industrial Engineering Material/Energy Engineering Electrical and Electronic Engineering Marine and Ocean Engineering Chemical Engineering Computer Science Other Engineering
Medical science
General Medical Science Nursing Science Veterinary Pharmacy Traditional Korean Medicine Basic Medicine Clinical Medicine Other Medicine
Agriculture and Fishery
General Agriculture and Fishery Agriculture Fishery Science Food Science Forestry Animal Husbandry Marine Transportation Studies Other Agriculture and Fishery
Art and Kinesiology
General Arts Design Fine Arts Cosmetology Photography Music Fashion Kinesiology Performing Media Arts Other Arts and Kinesiology
Interdisciplinary Studies
Interdisciplinary Research Science and Technology Studies Brain and Cognitive Science Technology Policy Other Interdisciplinary Studies

KOR

Reordering-based Optimistic Concurrency Control Scheme Space Overhead
Recommendations
Search
Questions

적은 공간을 사용하는 재배열 기반의 낙관적 동시성 제어 기법

논문 기본 정보

Type
Academic journal
Author
Journal
Korean Institute of Information Scientists and Engineers Journal of KISS(B): Software and Applications Vol.26 No.7
Published
1999.7
Pages
879 - 888 (10page)

Usage

cover
📌
Topic
📖
Background
🔬
Method
🏆
Result
Reordering-based Optimistic Concurrency Control Scheme Space Overhead
Ask AI
Recommendations
Search
Questions

Abstract· Keywords

Report Errors
Even if the abort probability of the optimistic concurrency control scheme may be reduced by re-ordering, the re-ordering scheme has space and time overhead such as maintaining a serialization graph, multiple versions or time-stamp histories. Furthermore, in optimistic concurrency control schemes except for broadcast optimistic concurrency control scheme, they may perform unnecessary operations due to write-write conflicts. In this paper, we propose an optimistic concurrency control scheme based on broadcast mechanism which reduces space and time overhead. Our scheme maintains only one time-stamp per data item for re-ordering, since re-ordering information is distributed in clients. In addition, our scheme does not make any spurious aborts that happen in the broadcast optimistic concurrency control scheme. By simulation experiments, we shows that our scheme outperforms time-stamp history based certification scheme.

Contents

요약

Abstract

1. 서론

2. 낙관적 동시성 제어 기법

3. 검증 프로토콜

4. 성능 평가

5. 결론

참고문헌

저자소개

References (0)

Add References
If the reference is being serviced by DBpia, please register through [Add Reference]

Recommendations

It is an article recommended by DBpia according to the article similarity. Check out the related articles!

Related Authors

Recently viewed articles

Three-Dimensional Numerical Analysis of the Mechanical Function of the Plate Fixation for the Long Bone Fracture
Hyoun Oh Cho, Kyoung Duck Kwak, Sung Do Cho 외 4명THE KOREAN ORTHOPAEDIC ASSOCIATION1990.08

Comments(0)

0

Write first comments.

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