An Eager and Pessimistic Space Reservation Method for Tables Frequently Accessed by Concurrent Transactions
Summary :
Space reservation is important in allocating and releasing storage space in DBMSs to support recoverable actions. Since most existing space reservation methods are designed to perform well when few data pages have spaces reserved by more than one transaction, they are not suitable for some of the newly emerging applications, such as workflow and inventory control systems. In these applications, many concurrent transactions frequently insert and delete records into/from a relatively small table. This paper proposes a new space reservation method that performs well for these types of applications by extending the lock control structures to keep detailed and up-to-date information in a reserved state. This paper also shows, by simulation, that the new method performs better than existing ones for applications in which many concurrent transactions frequently insert and delete records into/from a table, and even for applications where data pages rarely have space reserved by more than one transaction.
- Publication
- IEICE TRANSACTIONS on Information Vol.E82-D No.1 pp.246-257
- Publication Date
- 1999/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on New Generation Database Technologies)
- Category
- Concurrency Control
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kang-Woo LEE, Hyoung-Joo KIM, "An Eager and Pessimistic Space Reservation Method for Tables Frequently Accessed by Concurrent Transactions" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 1, pp. 246-257, January 1999, doi: .
Abstract: Space reservation is important in allocating and releasing storage space in DBMSs to support recoverable actions. Since most existing space reservation methods are designed to perform well when few data pages have spaces reserved by more than one transaction, they are not suitable for some of the newly emerging applications, such as workflow and inventory control systems. In these applications, many concurrent transactions frequently insert and delete records into/from a relatively small table. This paper proposes a new space reservation method that performs well for these types of applications by extending the lock control structures to keep detailed and up-to-date information in a reserved state. This paper also shows, by simulation, that the new method performs better than existing ones for applications in which many concurrent transactions frequently insert and delete records into/from a table, and even for applications where data pages rarely have space reserved by more than one transaction.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_1_246/_p
Copy
@ARTICLE{e82-d_1_246,
author={Kang-Woo LEE, Hyoung-Joo KIM, },
journal={IEICE TRANSACTIONS on Information},
title={An Eager and Pessimistic Space Reservation Method for Tables Frequently Accessed by Concurrent Transactions},
year={1999},
volume={E82-D},
number={1},
pages={246-257},
abstract={Space reservation is important in allocating and releasing storage space in DBMSs to support recoverable actions. Since most existing space reservation methods are designed to perform well when few data pages have spaces reserved by more than one transaction, they are not suitable for some of the newly emerging applications, such as workflow and inventory control systems. In these applications, many concurrent transactions frequently insert and delete records into/from a relatively small table. This paper proposes a new space reservation method that performs well for these types of applications by extending the lock control structures to keep detailed and up-to-date information in a reserved state. This paper also shows, by simulation, that the new method performs better than existing ones for applications in which many concurrent transactions frequently insert and delete records into/from a table, and even for applications where data pages rarely have space reserved by more than one transaction.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - An Eager and Pessimistic Space Reservation Method for Tables Frequently Accessed by Concurrent Transactions
T2 - IEICE TRANSACTIONS on Information
SP - 246
EP - 257
AU - Kang-Woo LEE
AU - Hyoung-Joo KIM
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 1999
AB - Space reservation is important in allocating and releasing storage space in DBMSs to support recoverable actions. Since most existing space reservation methods are designed to perform well when few data pages have spaces reserved by more than one transaction, they are not suitable for some of the newly emerging applications, such as workflow and inventory control systems. In these applications, many concurrent transactions frequently insert and delete records into/from a relatively small table. This paper proposes a new space reservation method that performs well for these types of applications by extending the lock control structures to keep detailed and up-to-date information in a reserved state. This paper also shows, by simulation, that the new method performs better than existing ones for applications in which many concurrent transactions frequently insert and delete records into/from a table, and even for applications where data pages rarely have space reserved by more than one transaction.
ER -
English
