Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Neural Computing and Applications
Erschienen in: Neural Computing and Applications 1/2013

01.01.2013 | Original Article

A neural-based concurrency control algorithm for database systems

verfasst von: Mansour Sheikhan, Mohsen Rohani, Saeed Ahmadluei

Erschienen in: Neural Computing and Applications | Ausgabe 1/2013

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.
Vorheriger Artikel Synchronization criteria and pinning control for complex networks with multiple delays
Nächster Artikel Superior robustness of power-sum activation functions in Zhang neural networks for time-varying quadratic programs perturbed with large implementation errors

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
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–673CrossRef
4.
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–524CrossRef
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–615MathSciNetCrossRef
9.
Lee JS, Shin JR, Yoo JS (2001) An efficient distributed concurrency control algorithm using two phase priority. Lect Notes Comput Sci 2113:933–942CrossRef
10.
Halici U, Dogac A (1991) An optimistic locking technique for concurrency control in distributed databases. IEEE Trans Softw Eng 17:712–724CrossRef
11.
Carpenter GA, Grossberg S (1987) Self-organization of stable category recognition codes for analog input patterns. Appl Opt 26:4919–4930CrossRef
12.
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–156MATHCrossRef
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–800CrossRef
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–125CrossRef
22.
23.
Ulosoy Ö, Buchmann A (1998) A real-time concurrency control protocol for main-memory database systems. Inform Syst 23:109–125CrossRef
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–149MATHCrossRef
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–876CrossRef
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–286CrossRef
27.
Jung S, Choi K (2009) A concurrency control scheme for mobile transactions in broadcast disk environments. Data Knowl Eng 68:926–945CrossRef
28.
Lee J (1999) Precise serialization for optimistic concurrency control. Data Knowl Eng 29:163–178CrossRef
29.
Chen JK, Chin YH, Huang YF (2001) Key factors for improving performance of concurrency control algorithms. Inf Sci 138:137–154MATHCrossRef
30.
Bernstein AJ, Gerstl DS, Lewis PM (1999) Concurrency control for step-decomposed transactions. Inform Syst 24:673–698CrossRef
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–297MATHCrossRef
32.
Jung I, Lee J, Moon S (1998) Concurrency control in multidatabase systems: a performance study. J Syst Architect 45:97–114CrossRef
33.
Sohn K, Moon S (2000) Achieving high degree of concurrency in multidatabase transaction scheduling: MTOS. J Syst Architect 46:687–698CrossRef
34.
Jun W, Gruenwald L (1998) An effective class hierarchy concurrency control technique in object-oriented database systems. Inform Softw Technol 40:45–53CrossRef
35.
Taniar D, Goel S (2007) Concurrency control issues in Grid databases. Future Generat Comput Syst 23:154–162CrossRef
36.
Jea K-F, Chen S-Y (2006) A high concurrency XPath-based locking protocol for XML databases. Inform Softw Technol 48:708–716CrossRef
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.
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–1023MATHCrossRef
40.
Tukey JW (1977) Exploratory data analysis. Addison-Wesley, ReadingMATH
41.
Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recogn Lett 31:651–666CrossRef
42.
Duda R, Hart P, Stork D (2001) Pattern classification. Wiley, LondonMATH
43.
Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice Hall, Englewood CliffsMATH
44.
Mao J, Jain AK (1996) A self-organizing network for hyper-ellipsoidal clustering (HEC). IEEE Trans Neural Netw 7:16–29CrossRef
45.
Banerjee A, Merugu S, Dhillon I, Ghosh J (2005) Clustering with Bregman divergences. J Mach Learn Res 6:1705–1749MathSciNetMATH
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–9852CrossRef
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–1022MATH
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
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–1085CrossRef
54.
Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22:888–905CrossRef
55.
Belkin M, Niyogi P (2002) Laplacian eigenmaps and spectral techniques for embedding and clustering. Adv Neural Inform Process Syst 14:585–591
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–2521MATHCrossRef
59.
Massey L (2003) On the quality of ART1 text clustering. Neural Networks 16:771–778CrossRef
60.
Charalampidis D, Muldrey B (2009) Clustering using multilayer perceptrons. Nonlinear Anal Theory Meth Appl 71:2807–2813CrossRef
61.
Du KL (2010) Clustering: a neural network approach. Neural Networks 23:89–107CrossRef
62.
Graaff AJ, Engelbrecht AP (2011) Clustering data in an uncertain environment using an artificial immune system. Pattern Recogn Lett 32:342–351CrossRef
63.
Ng MK, Wong JC (2002) Clustering categorical data sets using tabu search techniques. Pattern Recogn 35:2783–2790MATHCrossRef
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–944MathSciNetMATHCrossRef
65.
Parmar D, Wu T, Blackhurst J (2007) MMR: an algorithm for clustering categorical data using rough set theory. Data Knowl Eng 63:879–893CrossRef
66.
Herawan T, Deris MM, Abawajy JH (2010) A rough set approach for selecting clustering attribute. Knowl Based Syst 23:220–231CrossRef
67.
He Z, Xu X, Deng S (2008) k-ANMI: a mutual information based clustering algorithm for categorical data. Inform Fusion 9:223–233CrossRef
68.
Güngör Z, Ünler A (2007) K-harmonic means data clustering with simulated annealing heuristic. Appl Math Comput 184:199–209MathSciNetMATHCrossRef
69.
Kao Y-T, Zahara E, Kao I-W (2008) A hybridized approach to data clustering. Exp Syst Appl 34:1754–1762CrossRef
70.
Saha S, Bandyopadhyay S (2009) A new point symmetry based fuzzy genetic clustering technique for automatic evolution of clusters. Inf Sci 179:3230–3246MATHCrossRef
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–1380MATHCrossRef
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–1225CrossRef
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–317CrossRef
74.
Lippmann RP (1987) An introduction to computing with neural nets. IEEE ASSP Magaz 4:4–22CrossRef
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–115MATHCrossRef
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–1185MathSciNetCrossRef
78.
Lampson BW, Redell DD (1980) Experiences with processes and monitors in Mesa. Commun ACM 23:105–117CrossRef
79.
Fausett L (1993) Fundamentals of neural network, architectures, algorithms, and applications. Prentice Hall, Englewood Cliffs
80.
Hore P, Hall LO, Goldgof DB (2009) A scalable framework for cluster ensembles. Pattern Recogn 42:676–688MATHCrossRef
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–3689CrossRef
84.
Fan J, Song Y, Fei MR (2008) ART2 neural network interacting with environment. Neurocomputing 72:170–176CrossRef
Metadaten
Titel
A neural-based concurrency control algorithm for database systems
verfasst von
Mansour Sheikhan
Mohsen Rohani
Saeed Ahmadluei
Publikationsdatum
01.01.2013
Verlag
Springer-Verlag
Erschienen in
Neural Computing and Applications / Ausgabe 1/2013
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-011-0691-6

Weitere Artikel der Ausgabe 1/2013

Neural Computing and Applications 1/2013 Zur Ausgabe

Cont. Dev. of Neural Compt. & Appln.

Improving combination method of NCL experts using gating network

Cont. Dev. of Neural Compt. & Appln.

Time series forecasting by evolving artificial neural networks with genetic algorithms, differential evolution and estimation of distribution algorithm

Original Article

Guaranteed cost synchronous control of time-varying delay cellular neural networks

Cont. Dev. of Neural Compt. & Appln.

A support vector machine based MSM model for financial short-term volatility forecasting

Original Article

Research of assembling optimized classification algorithm by neural network based on Ordinary Least Squares (OLS)

Cont. Dev. of Neural Compt. & Appln.

New classification techniques for electroencephalogram (EEG) signals and a real-time EEG control of a robot

Premium Partner

    Bildnachweise