[1991] Proceedings. Seventh International Conference on Data Engineering
DOI: 10.1109/icde.1991.131508 View full text |Buy / Rent full text
|
|

Abstract: There is growing evidence that, for a wide variety of database workloads and system configurations, locking-based concurrency control outperforms other types of concurrency control strats gies. However, in the presence of increased data contention locking protocols such as two phase locking perform poorly. In this paper, we analyze a family of locking-based protocols that employ a new mode of locks called ordered sharing. Using a centralized database simulation model, we demonstrate that these protocols exhibi… Show more

Help me understand this report

Search citation statements

Order By: Relevance
Select...
1
1
1
0
3
0

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

0
3
0
Order By: Relevance
“…The two-phase locking protocol with ordered sharing described in this paper may suffer from deadlocks when transactions wait for their commitment. In [5], it has been shown that the number of deadlocks resulting from the ordered commitment rule is comparable to that in two-phase locking. In this section, we consider the problem of deadlocks that can arise in the N2PL/OS protocol.…”
Section: Deadlocks In N2pl/osmentioning
See 1 more Smart Citation
Create an account to read the remaining citation statements from this report. You will also get access to:
  • Search over 1.2b+ citation statments to see what is being said about any topic in the research literature
  • Advanced Search to find publications that support or contrast your research
  • Citation reports and visualizations to easily see what publications are saying about each other
  • Browser extension to see Smart Citations wherever you read research
  • Dashboards to evaluate and keep track of groups of publications
  • Alerts to stay on top of citations as they happen
  • Automated reference checks to make sure you are citing reliable research in your manuscripts
  • 7 day free preview of our premium features.

Trusted by researchers and organizations around the world

Over 130,000 students researchers, and industry experts at use scite

See what students are saying

rupbmjkragerfmgwileyiopcupepmcmbcthiemesagefrontiersapsiucrarxivemeralduhksmucshluniversity-of-gavle
“…The two-phase locking protocol with ordered sharing described in this paper may suffer from deadlocks when transactions wait for their commitment. In [5], it has been shown that the number of deadlocks resulting from the ordered commitment rule is comparable to that in two-phase locking. In this section, we consider the problem of deadlocks that can arise in the N2PL/OS protocol.…”
Section: Deadlocks In N2pl/osmentioning
“…We first describe an extension of two-phase locking with ordered sharing for executing flat transactions, which are sequences of arbitrary atomic operations on classes and instances. The new lock relationship does not block the execution of conflicting operations, and hence increases concurrency and improves performance [5]. The protocol permits more concurrency than the original two-phase locking protocol for abstract data types [38].…”
Section: Introductionmentioning
“…Other lock-based protocols for real-time databases include ordered sharing [5], [6], [7] that eliminates blocking, and dynamic adjustment of the serialization order [133] of transactions in order to execute high-priority transactions before lowpriority transactions.…”
Section: B2 Processing Transactions With Soft Deadlinesmentioning