Skip to main content

Advertisement

Springer Nature Link
Log in

A neural-based concurrency control algorithm for database systems

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Concurrency control (CC) algorithms guarantee the correctness and consistency criteria for concurrent execution of a set of transactions in a database. A precondition that is seen in many CC algorithms is that the writeset (WS) and readset (RS) of transactions should be known before the transaction execution. However, in real operational environments, we know the WS and RS only for a fraction of transaction set before execution. However, optional knowledge about WS and RS of transactions is one of the advantages of the proposed CC algorithm in this paper. If the WS and RS are known before the transaction execution, the proposed algorithm will use them to improve the concurrency and performance. On the other hand, the concurrency control algorithms often use a specific static or dynamic equation in making decision about granting a lock or detection of the winner transaction. The proposed algorithm in this paper uses an adaptive resonance theory (ART)-based neural network for such a decision making. In this way, a parameter called health factor (HF) is defined for transactions that is used for comparing the transactions and detecting the winner one in accessing the database objects. HF is calculated using ART2 neural network. Experimental results show that the proposed neural-based CC (NCC) algorithm increases the level of concurrency by decreasing the number of aborts. The performance of proposed algorithm is compared with strict two-phase locking (S2PL) algorithm, which has been used in most commercial database systems. Simulation results show that the performance of proposed NCC algorithm, in terms of number of aborts, is better than S2PL algorithm in different transaction rates.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Bernstein PA, Hadzilacos V, Goodman N (1987) Concurrency control and recovery in database systems. Addison Wesley, Reading

  2. Boukerche A, Tuck TW (2000) T3C: a temporally correct concurrency control algorithm for distributed databases. In: The proceedings of IEEE 8th international symposium on modeling, analysis and simulation of computer and telecommunication systems, pp 155–163

  3. Kuo TW, Liang MC, Shu L (2001) Abort-oriented concurrency control for real-time databases. IEEE Trans Comput 50:660–673

    Article  Google Scholar 

  4. Liu P, Li J, Jajodia S, Ammann P (2007) Can-follow concurrency control. IEEE Trans Comput 56:1425–1430

    Article  MathSciNet  Google Scholar 

  5. Halici U, Dogac A (1991) Concurrency control for distributed multiversion databases through time intervals. In: The proceedings of ACM 19th annual conference on computer science, pp 365–374

  6. Kuo TW, Kao YT, Kuo CF (2003) Two-version based concurrency control and recovery in real-time client/server databases. IEEE Trans Comput 52:506–524

    Article  Google Scholar 

  7. Burger A, Kumar V (1990) PRABHA-a distributed concurrency control mechanism. In: The proceedings of ACM annual conference on cooperation, pp 392–397

  8. Bernstein PA, Goodman N (1984) An algorithm for concurrency control and recovery in replicated distributed databases. ACM Trans Database Syst 9:596–615

    Article  MathSciNet  Google Scholar 

  9. Lee JS, Shin JR, Yoo JS (2001) An efficient distributed concurrency control algorithm using two phase priority. Lect Notes Comput Sci 2113:933–942

    Article  Google Scholar 

  10. Halici U, Dogac A (1991) An optimistic locking technique for concurrency control in distributed databases. IEEE Trans Softw Eng 17:712–724

    Article  Google Scholar 

  11. Carpenter GA, Grossberg S (1987) Self-organization of stable category recognition codes for analog input patterns. Appl Opt 26:4919–4930

    Article  Google Scholar 

  12. Bernstein PA, Goodman N (1983) Multiversion concurrency control—theory and algorithms. ACM Trans Database Syst 8:465–483

    Article  MathSciNet  MATH  Google Scholar 

  13. Bayer R, Elhardt E, Heller H, Reiser A (1980) Distributed concurrency control in database systems. In: The proceedings of IEEE 6th international conference on very large databases, pp 275–284

  14. Bayer R, Heller H, Reiser A (1980) Parallelism and recovery in database systems. ACM Trans Database Syst 5:139–156

    Article  MATH  Google Scholar 

  15. Chan A, Fox S, Lin WT, Nori A, Ries DR (1982) The implementation of an integrated concurrency control and recovery scheme. In: The proceedings of ACM SIGMOD international conference on management of data, pp 184–191

  16. Dubourdieu DJ (1982) Implementation of distributed transactions. In: The proceedings of 6th Berkeley conference on distributed data management and computer networks, pp 81–94

  17. Sha L, Rajkumar R, Son SH, Chang CH (1991) A real-time locking protocol. IEEE Trans Comput 40:793–800

    Article  Google Scholar 

  18. Nystrom D, Nolin M, Tesanovic A, Norstrdm C, Hansson J (2004) Pessimistic concurrency control and versioning to support database pointers in real-time databases. In: The proceedings of 16th Euromicro conference on real-time systems, pp 261–270

  19. Makni A, Bouaziz R, Gargouri F (2006) Formal verification of an optimistic concurrency control algorithm using SPIN. In: The proceedings of 13th international symposium on temporal representation and reasoning, pp 160–167

  20. Mao Q, Wang J, Zhan Y (2004) The optimistic locking concurrency controlling algorithm based on relative position and its application in real-time collaborative editing system. In: The proceedings of 8th international conference on computer supported cooperative work in design, vol 1, pp 99–105

  21. Park C, Park S (2003) The Freeze algorithms for concurrency control in secure real-time database systems. Data Knowl Eng 45:101–125

    Article  Google Scholar 

  22. Xiao YY, Lü K (2011) Secure concurrency control protocol with timeliness guarantees in real-time database systems. Math Comput Modell. doi:10.1016/j.mcm.2011.01.009 (in press)

  23. Ulosoy Ö, Buchmann A (1998) A real-time concurrency control protocol for main-memory database systems. Inform Syst 23:109–125

    Article  Google Scholar 

  24. Lam K-Y, Kuo T-W, Kao B, Lee Tony SH, Cheng R (2002) Evaluation of concurrency control strategies for mixed soft real-time database systems. Inform Syst 27:123–149

    Article  MATH  Google Scholar 

  25. Xiangdong L, Yuelong Z, Songqiao C, Xiaoli Y (2009) Concurrency control in mobile distributed real-time database systems. J Parallel Distrib Comput 69:866–876

    Article  Google Scholar 

  26. Lam K-Y, Kuo T-W, Tsang W-H, Law Gary CK (2000) Concurrency control in mobile distributed real-time database systems. Inform Syst 25:261–286

    Article  Google Scholar 

  27. Jung S, Choi K (2009) A concurrency control scheme for mobile transactions in broadcast disk environments. Data Knowl Eng 68:926–945

    Article  Google Scholar 

  28. Lee J (1999) Precise serialization for optimistic concurrency control. Data Knowl Eng 29:163–178

    Article  Google Scholar 

  29. Chen JK, Chin YH, Huang YF (2001) Key factors for improving performance of concurrency control algorithms. Inf Sci 138:137–154

    Article  MATH  Google Scholar 

  30. Bernstein AJ, Gerstl DS, Lewis PM (1999) Concurrency control for step-decomposed transactions. Inform Syst 24:673–698

    Article  Google Scholar 

  31. Xiong M, Ramamritham K, Haritsa JR, Stankovic JA (2002) MIRROR: a state-conscious concurrency control protocol for replicated real-time databases. Inform Syst 27:277–297

    Article  MATH  Google Scholar 

  32. Jung I, Lee J, Moon S (1998) Concurrency control in multidatabase systems: a performance study. J Syst Architect 45:97–114

    Article  Google Scholar 

  33. Sohn K, Moon S (2000) Achieving high degree of concurrency in multidatabase transaction scheduling: MTOS. J Syst Architect 46:687–698

    Article  Google Scholar 

  34. Jun W, Gruenwald L (1998) An effective class hierarchy concurrency control technique in object-oriented database systems. Inform Softw Technol 40:45–53

    Article  Google Scholar 

  35. Taniar D, Goel S (2007) Concurrency control issues in Grid databases. Future Generat Comput Syst 23:154–162

    Article  Google Scholar 

  36. Jea K-F, Chen S-Y (2006) A high concurrency XPath-based locking protocol for XML databases. Inform Softw Technol 48:708–716

    Article  Google Scholar 

  37. Pleshachkov P, Chardin P, Kuznetsov SD (2005) A dataguide-based concurrency control protocol for cooperation on XML data. In: The proceedings of ADBIS, pp 268–282

  38. Moreira LO, Sousa FRC, Machado JC (2011) A distributed concurrency control mechanism for XML data. Journal of Computer and System Sciences. doi:10.1016/jjcss.2011.02.006 (in press)

  39. Usui T, Behrends R, Evans J, Smaragdakis Y (2010) Adaptive locks: combining transactions and locks for efficient concurrency. J Parallel Distrib Comput 70:1009–1023

    Article  MATH  Google Scholar 

  40. Tukey JW (1977) Exploratory data analysis. Addison-Wesley, Reading

    MATH  Google Scholar 

  41. Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recogn Lett 31:651–666

    Article  Google Scholar 

  42. Duda R, Hart P, Stork D (2001) Pattern classification. Wiley, London

    MATH  Google Scholar 

  43. Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

  44. Mao J, Jain AK (1996) A self-organizing network for hyper-ellipsoidal clustering (HEC). IEEE Trans Neural Netw 7:16–29

    Article  Google Scholar 

  45. Banerjee A, Merugu S, Dhillon I, Ghosh J (2005) Clustering with Bregman divergences. J Mach Learn Res 6:1705–1749

    MathSciNet  MATH  Google Scholar 

  46. Kashima H, Hu J, Ray B, Singh M (2008) K-means clustering of proportional data using L1 distance. In: The proceedings of 19th international conference on pattern recognition, pp 1–4

  47. Yang F, Sun T, Zhang C (2009) An efficient hybrid data clustering method based on K-harmonic means and particle swarm optimization. Exp Syst Appl 36:9847–9852

    Article  Google Scholar 

  48. McLachlan GL, Basford KE (1987) Mixture models: Inference and applications to clustering. Marcel Dekker, New York

  49. Blei DM, Ng AY, Jordan MI (2003) Latent dirichlet allocation. J Mach Learn Res 3:993–1022

    MATH  Google Scholar 

  50. Li W, McCallum A (2006) Pachinko allocation: DAG-structured mixture models of topic correlations. In: The proceedings of 23rd international conference on machine learning, pp 577–584

  51. Welling M, Rosen-Zvi M, Hinton G (2005) Exponential family harmoniums with an application to information retrieval. Adv Neural Inform Process Syst 17:1481–1488

    Google Scholar 

  52. Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: The proceedings of ACM SIGMOD international conference on management of data, pp 94–105

  53. Hagen L, Kahng AB (1992) New spectral methods for ratio cut partitioning and clustering. IEEE Trans Comput Aid Des Integrat Circuits Syst 11:1074–1085

    Article  Google Scholar 

  54. Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22:888–905

    Article  Google Scholar 

  55. Belkin M, Niyogi P (2002) Laplacian eigenmaps and spectral techniques for embedding and clustering. Adv Neural Inform Process Syst 14:585–591

    Google Scholar 

  56. Yu SX, Shi J (2003) Multiclass spectral clustering. In: The proceedings of 9th international conference on computer vision, vol 1, pp 313–319

  57. Roberts SJ, Holmes C, Denison D (2001) Minimum-entropy data clustering using reversible jump Markov chain Monte Carlo. In: The proceedings of international conference on artificial neural networks, pp 103–110

  58. Markou M, Singh S (2003) Novelty detection: a review-part 2: neural network based approaches. Sig Process 83:2499–2521

    Article  MATH  Google Scholar 

  59. Massey L (2003) On the quality of ART1 text clustering. Neural Networks 16:771–778

    Article  Google Scholar 

  60. Charalampidis D, Muldrey B (2009) Clustering using multilayer perceptrons. Nonlinear Anal Theory Meth Appl 71:2807–2813

    Article  Google Scholar 

  61. Du KL (2010) Clustering: a neural network approach. Neural Networks 23:89–107

    Article  Google Scholar 

  62. Graaff AJ, Engelbrecht AP (2011) Clustering data in an uncertain environment using an artificial immune system. Pattern Recogn Lett 32:342–351

    Article  Google Scholar 

  63. Ng MK, Wong JC (2002) Clustering categorical data sets using tabu search techniques. Pattern Recogn 35:2783–2790

    Article  MATH  Google Scholar 

  64. Chen Y-L, Hsu W-H, Lee U-H (2006) TASC: two-attribute-set clustering through decision tree construction. Eur J Oper Res 174:930–944

    Article  MathSciNet  MATH  Google Scholar 

  65. Parmar D, Wu T, Blackhurst J (2007) MMR: an algorithm for clustering categorical data using rough set theory. Data Knowl Eng 63:879–893

    Article  Google Scholar 

  66. Herawan T, Deris MM, Abawajy JH (2010) A rough set approach for selecting clustering attribute. Knowl Based Syst 23:220–231

    Article  Google Scholar 

  67. He Z, Xu X, Deng S (2008) k-ANMI: a mutual information based clustering algorithm for categorical data. Inform Fusion 9:223–233

    Article  Google Scholar 

  68. Güngör Z, Ünler A (2007) K-harmonic means data clustering with simulated annealing heuristic. Appl Math Comput 184:199–209

    Article  MathSciNet  MATH  Google Scholar 

  69. Kao Y-T, Zahara E, Kao I-W (2008) A hybridized approach to data clustering. Exp Syst Appl 34:1754–1762

    Article  Google Scholar 

  70. Saha S, Bandyopadhyay S (2009) A new point symmetry based fuzzy genetic clustering technique for automatic evolution of clusters. Inf Sci 179:3230–3246

    Article  MATH  Google Scholar 

  71. Maulik U, Mukhopadhyay A (2010) Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data. Comput Oper Res 37:1369–1380

    Article  MATH  Google Scholar 

  72. Feng L, Qiu M-H, Wang Y-X, Xiang Q-L, Yang Y-F, Liu K (2010) A fast divisive clustering algorithm using an improved discrete particle swarm optimizer. Pattern Recogn Lett 31:1216–1225

    Article  Google Scholar 

  73. Niknam T, Taherian Fard E, Pourjafarian N, Rousta A (2011) An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering. Eng Appl Artif Intell 24:306–317

    Article  Google Scholar 

  74. Lippmann RP (1987) An introduction to computing with neural nets. IEEE ASSP Magaz 4:4–22

    Article  Google Scholar 

  75. Carpenter GA, Grossberg S (1987) A massively parallel architecture for a self-organizing neural pattern recognition machine. Comput Vis Graph Image Process 37:54–115

    Article  MATH  Google Scholar 

  76. Lim CP, Harrison RF (1995) Probabilistic fuzzy ARTMAP: an autonomous neural network architecture for Bayesian probability estimation. In: The proceedings of 4th international conference on artificial neural networks, pp 148–153

  77. Sha L, Rajkumar R, Lehoczky JP (1990) Priority inheritance protocols: an approach to real-time synchronization. IEEE Trans Comput 39:1175–1185

    Article  MathSciNet  Google Scholar 

  78. Lampson BW, Redell DD (1980) Experiences with processes and monitors in Mesa. Commun ACM 23:105–117

    Article  Google Scholar 

  79. Fausett L (1993) Fundamentals of neural network, architectures, algorithms, and applications. Prentice Hall, Englewood Cliffs

    Google Scholar 

  80. Hore P, Hall LO, Goldgof DB (2009) A scalable framework for cluster ensembles. Pattern Recogn 42:676–688

    Article  MATH  Google Scholar 

  81. Chapelle O, Schlkopf B, Zien A (2006) Semi-supervised learning. MIT Press, Cambridge

  82. Liu Y, Jin R, Jain AK (2007) Boostcluster: boosting clustering by pairwise constraints. In: The proceedings of 13th international conference of ACM SIGKDD, pp 450–459

  83. Yeh M-F, Wen C, Chiang S–S (2008) Data classification using hybrid GrayART network. Neurocomputing 71:3685–3689

    Article  Google Scholar 

  84. Fan J, Song Y, Fei MR (2008) ART2 neural network interacting with environment. Neurocomputing 72:170–176

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Faculty of Engineering, Islamic Azad University, South Tehran Branch, P.O. Box: 11365-4435, Tehran, Iran

    Mansour Sheikhan

  2. Department of Computer Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran

    Mohsen Rohani & Saeed Ahmadluei

Authors
  1. Mansour Sheikhan
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Mohsen Rohani
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Saeed Ahmadluei
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Mansour Sheikhan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sheikhan, M., Rohani, M. & Ahmadluei, S. A neural-based concurrency control algorithm for database systems. Neural Comput & Applic 22, 161–174 (2013). https://doi.org/10.1007/s00521-011-0691-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-011-0691-6

Keywords