2015
DOI: 10.1007/978-3-319-11227-5_13
|View full text |Cite
|
Sign up to set email alerts
|

Hash Based Incremental Optimistic Concurrency Control Algorithm in Distributed Databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…Based on thorough review, we identified that each category of concurrency control protocol has some pros and cons at broader level. Optimistic concurrency control solutions 72,73,[84][85][86] are preferred for recent applications that have scalability requirements. In contrast to pessimistic concurrency control algorithms, optimistic concurrency control can aid the system to scale well generally as there is no need to acquire expensive lock while accessing the resource.…”
Section: Protocol Typementioning
confidence: 99%
“…Based on thorough review, we identified that each category of concurrency control protocol has some pros and cons at broader level. Optimistic concurrency control solutions 72,73,[84][85][86] are preferred for recent applications that have scalability requirements. In contrast to pessimistic concurrency control algorithms, optimistic concurrency control can aid the system to scale well generally as there is no need to acquire expensive lock while accessing the resource.…”
Section: Protocol Typementioning
confidence: 99%