Optimistic secure real-time concurrency control using multiple data version

Byeong Soo Jeong; Daeho Kim; Sungyoung Lee

doi:10.1007/3-540-45245-1_3

Optimistic secure real-time concurrency control using multiple data version

Byeong Soo Jeong
, Daeho Kim
, Sungyoung Lee

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Citations (Scopus)

Abstract

In many real time applications, security is an important requirement, since the system maintains sensitive information to be shared by multiple users with different security levels. A secure real-time database system must satisfy not only logical data consistency but also the timing constraints and security requirements associated with transactions. Even though an optimistic concurrency control method outperforms locking based methods in firm realtime database systems, in which late transactions are immediately discarded, existing secure real-time concurrency control methods are mostly based on locking. In this paper, we propose a new optimistic concurrency control protocol for secure real-time database systems. We also compare the performance characteristics of our protocol with locking based methods while varying workloads. The results show that optimistic concurrency control performs well over a wide range of system loading and resource availability conditions.

Original language	English
Title of host publication	Languages, Compilers and Tools for Embedded Systems - ACM SIGPLAN Workshop LCTES 2000, Proceedings
Editors	Jack Davidson, Sang Lyul Min
Publisher	Springer Verlag
Pages	33-47
Number of pages	15
ISBN (Print)	3540417818, 9783540417811
DOIs	https://doi.org/10.1007/3-540-45245-1_3
Publication status	Published - 2001
Event	ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems, LCTES 2000 - Vancouver, Canada Duration: 18 Jun 2000 → 18 Jun 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1985
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems, LCTES 2000
Country/Territory	Canada
City	Vancouver
Period	18/06/00 → 18/06/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Access to Document

10.1007/3-540-45245-1_3

Cite this

Jeong, B. S., Kim, D., & Lee, S. (2001). Optimistic secure real-time concurrency control using multiple data version. In J. Davidson, & S. L. Min (Eds.), Languages, Compilers and Tools for Embedded Systems - ACM SIGPLAN Workshop LCTES 2000, Proceedings (pp. 33-47). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1985). Springer Verlag. https://doi.org/10.1007/3-540-45245-1_3

Jeong, Byeong Soo ; Kim, Daeho ; Lee, Sungyoung. / Optimistic secure real-time concurrency control using multiple data version. Languages, Compilers and Tools for Embedded Systems - ACM SIGPLAN Workshop LCTES 2000, Proceedings. editor / Jack Davidson ; Sang Lyul Min. Springer Verlag, 2001. pp. 33-47 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d87df6f7623b4fe7914735867da74b27,

title = "Optimistic secure real-time concurrency control using multiple data version",

abstract = "In many real time applications, security is an important requirement, since the system maintains sensitive information to be shared by multiple users with different security levels. A secure real-time database system must satisfy not only logical data consistency but also the timing constraints and security requirements associated with transactions. Even though an optimistic concurrency control method outperforms locking based methods in firm realtime database systems, in which late transactions are immediately discarded, existing secure real-time concurrency control methods are mostly based on locking. In this paper, we propose a new optimistic concurrency control protocol for secure real-time database systems. We also compare the performance characteristics of our protocol with locking based methods while varying workloads. The results show that optimistic concurrency control performs well over a wide range of system loading and resource availability conditions.",

author = "Jeong, \{Byeong Soo\} and Daeho Kim and Sungyoung Lee",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems, LCTES 2000 ; Conference date: 18-06-2000 Through 18-06-2000",

year = "2001",

doi = "10.1007/3-540-45245-1\_3",

language = "English",

isbn = "3540417818",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "33--47",

editor = "Jack Davidson and Min, \{Sang Lyul\}",

booktitle = "Languages, Compilers and Tools for Embedded Systems - ACM SIGPLAN Workshop LCTES 2000, Proceedings",

address = "Germany",

}

Jeong, BS, Kim, D & Lee, S 2001, Optimistic secure real-time concurrency control using multiple data version. in J Davidson & SL Min (eds), Languages, Compilers and Tools for Embedded Systems - ACM SIGPLAN Workshop LCTES 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1985, Springer Verlag, pp. 33-47, ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems, LCTES 2000, Vancouver, Canada, 18/06/00. https://doi.org/10.1007/3-540-45245-1_3

Optimistic secure real-time concurrency control using multiple data version. / Jeong, Byeong Soo; Kim, Daeho; Lee, Sungyoung.
Languages, Compilers and Tools for Embedded Systems - ACM SIGPLAN Workshop LCTES 2000, Proceedings. ed. / Jack Davidson; Sang Lyul Min. Springer Verlag, 2001. p. 33-47 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1985).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimistic secure real-time concurrency control using multiple data version

AU - Jeong, Byeong Soo

AU - Kim, Daeho

AU - Lee, Sungyoung

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - In many real time applications, security is an important requirement, since the system maintains sensitive information to be shared by multiple users with different security levels. A secure real-time database system must satisfy not only logical data consistency but also the timing constraints and security requirements associated with transactions. Even though an optimistic concurrency control method outperforms locking based methods in firm realtime database systems, in which late transactions are immediately discarded, existing secure real-time concurrency control methods are mostly based on locking. In this paper, we propose a new optimistic concurrency control protocol for secure real-time database systems. We also compare the performance characteristics of our protocol with locking based methods while varying workloads. The results show that optimistic concurrency control performs well over a wide range of system loading and resource availability conditions.

AB - In many real time applications, security is an important requirement, since the system maintains sensitive information to be shared by multiple users with different security levels. A secure real-time database system must satisfy not only logical data consistency but also the timing constraints and security requirements associated with transactions. Even though an optimistic concurrency control method outperforms locking based methods in firm realtime database systems, in which late transactions are immediately discarded, existing secure real-time concurrency control methods are mostly based on locking. In this paper, we propose a new optimistic concurrency control protocol for secure real-time database systems. We also compare the performance characteristics of our protocol with locking based methods while varying workloads. The results show that optimistic concurrency control performs well over a wide range of system loading and resource availability conditions.

UR - https://www.scopus.com/pages/publications/84886582404

U2 - 10.1007/3-540-45245-1_3

DO - 10.1007/3-540-45245-1_3

M3 - Conference contribution

AN - SCOPUS:84886582404

SN - 3540417818

SN - 9783540417811

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 33

EP - 47

BT - Languages, Compilers and Tools for Embedded Systems - ACM SIGPLAN Workshop LCTES 2000, Proceedings

A2 - Davidson, Jack

A2 - Min, Sang Lyul

PB - Springer Verlag

T2 - ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems, LCTES 2000

Y2 - 18 June 2000 through 18 June 2000

ER -

Jeong BS, Kim D, Lee S. Optimistic secure real-time concurrency control using multiple data version. In Davidson J, Min SL, editors, Languages, Compilers and Tools for Embedded Systems - ACM SIGPLAN Workshop LCTES 2000, Proceedings. Springer Verlag. 2001. p. 33-47. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45245-1_3

Optimistic secure real-time concurrency control using multiple data version

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this