CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

An Aggressive Concurrency Control Protocol for Main Memory Databases

by Mohammed Hamdi, Weidong Xiong, Feng Yu, Sarah Alswedani, Wen-Chi Hou
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 155 - Number 2
Year of Publication: 2016
Authors: Mohammed Hamdi, Weidong Xiong, Feng Yu, Sarah Alswedani, Wen-Chi Hou
10.5120/ijca2016912260

Mohammed Hamdi, Weidong Xiong, Feng Yu, Sarah Alswedani, Wen-Chi Hou . An Aggressive Concurrency Control Protocol for Main Memory Databases. International Journal of Computer Applications. 155, 2 ( Dec 2016), 7-13. DOI=10.5120/ijca2016912260

@article{ 10.5120/ijca2016912260,
author = { Mohammed Hamdi, Weidong Xiong, Feng Yu, Sarah Alswedani, Wen-Chi Hou },
title = { An Aggressive Concurrency Control Protocol for Main Memory Databases },
journal = { International Journal of Computer Applications },
issue_date = { Dec 2016 },
volume = { 155 },
number = { 2 },
month = { Dec },
year = { 2016 },
issn = { 0975-8887 },
pages = { 7-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume155/number2/26575-2016912260/ },
doi = { 10.5120/ijca2016912260 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:00:10.957182+05:30
%A Mohammed Hamdi
%A Weidong Xiong
%A Feng Yu
%A Sarah Alswedani
%A Wen-Chi Hou
%T An Aggressive Concurrency Control Protocol for Main Memory Databases
%J International Journal of Computer Applications
%@ 0975-8887
%V 155
%N 2
%P 7-13
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, we propose a concurrency control protocol, called the Prudent-Precedence Concurrency Control (PPCC) protocol, for high data contention main memory databases. PPCC is prudently more aggressive in permitting more serializable schedules than two-phase locking. It maintains a restricted precedence among conflicting transactions and commits the transactions according to the serialization order established in the executions. A detailed simulation model has been constructed and extensive experiments have been conducted to evaluate the performance of the proposed approach. The results demonstrate that the proposed algorithm outperforms the two-phase locking in all ranges of system workload.

References
  1. R. Agrawal, M. J. Carey, and M. Livny, “Concurrency Control Performance Modeling: Alternatives and Implications,” ACM Transactions on Database Systems, 12(4), pp. 609-654, 1987.
  2. P. A. Bernstein, V. Hadzilacos, and N. Goodman. (1987) Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA.
  3. P. Bernstein, N. Goodman, “Timestamp-based Algorithm for Concurrency Control in Distributed Database Systems”, Proc. VLDB 1980, pp. 285 – 300.
  4. P. Bernstein, N. Goodman, J. Rothnie, Jr., C. Papadimitriou, “Analysis of Serializability in SDD-1: a System of Distributed Databases”, IEEE Transaction on Software Engineering SE-4:3, 1978, pp. 154 -168.
  5. M. Carey, M. Livny, “Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication”, Proc. 14th VLDB Conference, pp. 13-25, 1988.
  6. S. Ceri, S. Owicki, “On The Use Of Optimistic Methods for Concurrency Control in Distributed Databases”, Proc. 6th Berkeley Workshop, pp. 117-130, 1982.
  7. P. Eswaran , J. N. Gray , R. A. Lorie , I. L. Traiger, (1976) The Notions of Consistency and Predicate Locks in a Database System, Communications of the ACM, Vol. 19, No. 11, p.624-633.
  8. T. Haerder, (1984) Observations on Optimistic Concurrency Control Schemes. Information Syst., 9, 111-120.
  9. J. R. Haritsa, , M. J. Carey, and M. Livny, (1990) Dynamic Real-Time Optimistic Concurrency Control. In Proc. 11th Real-Time Systems Symp., Lake Buena Vista, FL,5-7 December, pp. 94-103.
  10. H. Kung, and J. Robinson, (1981) On Optimistic Methods for Concurrency Control. ACM Trans. Database Syst., 6, 213-226.
  11. K.W. Lam, K.Y. Lam and S.L. Hung. Distributed Real-time Optimistic Concurrency Control Protocol. In Proceedings of International Workshop on Parallel and Distributed Real-time Systems, Hawaii, pp. 122-125, IEEE Computer Society Press (1996).
  12. S. Mullender and A. S. Tanenbaum. ”A Distributed File Service Based on Optimistic Concurrency Control,” Proc. 10th ACM Symp. On Operating System Principles, 1985, pp. 51-62.
  13. D. Reed, “Implementing Atomic Actions on Decentralized Data”, ACM Transactions on Computer Systems, 1,1, pp. 3-23, 1983.
  14. I. Ryu, A. Thomasian, “Performance Evaluation of Centralized Databases with Optimistic Concurrency Control”, Performance Eval. U, 3, 195, 211, 1987.
  15. Özgür, U and Alejandro, B. "Exploiting main memory DBMS features to improve real-time concurrency control protocols." ACM SIGMOD Record 25.1 (1996): 23-25.
  16. Ren K, Thomson A, Abadi DJ. "Lightweight locking for main memory database systems". In Proceedings of the VLDB Endowment 2012; 6(2): 145-156. VLDB Endowment.https:/doi.org/10.14778/2535568.2448947
  17. Larson PÅ, Blanas S, Diaconu C, Freedman C, Patel JM, Zwilling M. "High-performance concurrency control mechanisms for main-memory databases". Proceedings of the VLDB Endowment 2011; 5(4), 298-309.https:/doi.org/10.14778/2095686.2095689
  18. Neumann T, Mühlbauer T, Kemper A. Fast serializable multi-version concurrency control for main-memory database systems. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data 2015; 677-689. ACM.https:/doi.org/10.1145/2723372.2749436
  19. Yu X, Bezerra G, Pavlo A, Devadas S, Stonebraker M. Staring into the abyss: An evaluation of concurrency control with one thousand cores. Proceedings of the VLDB Endowment 2014; 8(3): 209-220.https:/doi.org/10.14778/2735508.2735511
  20. Jones EP, Abadi DJ, and Madden S. Low overhead concurrency control for partitioned main memory databases. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data 2010; 603-614. ACM.https:/doi.org/10.1145/1807167.1807233
Index Terms

Computer Science
Information Sciences

Keywords

Concurrency Control Main Memory Database Serializability Serialization Graph 2PL

Powered by PhDFocusTM