\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={A Comprehensive Concurrency Control Technique for Real-Time Database System},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{A Comprehensive Concurrency Control Technique for Real-Time Database System}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Dr. Md. Anisur  Rahman}

             \author[2]{Md. Sahadat  Hossain}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 11 December 2012 Accepted: 4 January 2013 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


Real-time database must maintain the Temporal Consistency of the data which cannot be achieved with the conventional concurrency control techniques as they focus only on the consistency of the data. Different protocols exhibit good performance on different situations. But a single technique is inadequate to meet the demand of real-time database. To improve the concurrency control technique for real-time transactions, this paper will present a comprehensive technique that coordinates multi-version, OCC Sacrifice, Speculative Concurrency Control and 2PL-HP protocols. The presented technique uses best suited protocol based on the contention of transactions. Thus it can significantly improve the concurrency of transactions as well as increase the number of transactions.

\end{abstract}


\keywords{multi-version, speculative concurrency control, real-time transaction, temporal consistency.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
eal-time database systems are identified as having timing constraints and can be found in applications such as defence systems, Internet and multimedia applications, industrial automation, programmed stock trading and air traffic control etc.\par
The timing constraints of real-time database are typically specified in the form of deadlines that require a transaction to be completed by a specified time. Failure to meet a deadline can cause the results to lose their value, and in some cases a result produced too late may be useless or even harmful. So unlike traditional database Real-time databases (RTDBMS) must maintain Temporal Consistency of data. Temporal Consistency requires two main requirements: Absolute validity and relative consistency. Absolute validity is the notion of consistency between environment and its reflection in the database. Relative consistency is the notion of consistency of the data that are used to derive new data. The correctness of the system depends not only on the logical results but also on the time used to produce these results, as the transactions for their concurrent implementation has own timing constrains and dependence. That is Real-time systems are to ensure completion of more transactions within the deadline.\par
The conventional pessimistic concurrency control mechanism based on locking e.g. two phase locking with higher priority (2PL-HP) can assure the transactions serializability \hyperref[b0]{[1]}, so as to strongly assure Author ? : Department of CSE, Dhaka University of Engineering \& Technology Gazipur, Bangladesh. E-mails : anisur.rahman.duet@gmail.com, sahadat39@yahoo.com the consistency of data. However, because of a high rate of restart of transactions, it cannot satisfy the need of the real-time database systems very well. The optimistic concurrency control techniques assume that the probability of any two concurrent transactions requesting the same data is not often. So it allows all operations to be performed directly whenever transactions request. But these transactions must pass through the validation checking before they are allowed to be committed to database.\par
The Multi-version Time-stamp Ordering (MVTO) technique is one type of optimistic concurrency control (OCC)mechanism which provides a large degree of concurrency for the transactions by maintaining multiple versions of data items \hyperref[b0]{[1]}. So it is more appropriate for real-time database systems where the transaction has a low rate of restart and delay of cut-off time but a high degree of concurrency. It ensures transactions serializability using Time-stamp Ordering mechanism.\par
In OCC Broadcast Commit (OCC-BC) protocol, which is another OCC method, when a transaction commits, it notifies its intentions to all other currently running transactions \hyperref[b4]{[5]}. Each of these running transactions carries out a check to test whether it has any conflicts with the committing transaction. If any conflicts are detected, the transaction carrying out the check immediately aborts itself and restarts. Note that there is no need for a committing transaction to check for conflicts with already committed transactions, because if it were in conflicts with any of the committed transactions, it would have already been aborted. Thus, in OCC-BC once a transaction reaches its validation phase, it ensures its commitment. Compared to OCC Forward protocol, it encounters earlier restarts and less wasted computations. Therefore this protocol should perform better than the OCC-forward protocol in meeting task deadlines. However, a problem with this protocol is that it does not consider the priorities of transactions. On the other hand, it may be possible to achieve better performance by explicitly considering the priorities of the transactions.\par
OCC Sacrifice (OCC -S) is another type of Optimistic method that considers the priority of a transaction in the validation check phase to determine which transaction(s) should be restarted \hyperref[b4]{[5]}. Transaction with higher priority commits and In Speculative Concurrency Control (SCC) technique, conflicts are checked at every read and write operation. Whenever conflicts are detected a new version of each of the conflicting transactions is initiated. The primary version executes as any transaction would execute under an OCC protocol, ignoring the conflicts that develop. Meanwhile the new version executes as any transaction would do under a pessimistic protocol-subjected to locking and restarts. Improving the concurrency control protocol, this paper will present a new concurrency control method which adopts multi-version, OCC Sacrifice, SCC or 2PL-HP depending on the contention of transaction in the system. In this way, it can effectively improve the concurrency of transactions and increase the amount of the transactions completed within the deadline. The feasible analysis denotes that this new method is better than the traditional one on performance. 
\section[{II.}]{II.} 
\section[{The Description of the Proposed Technique}]{The Description of the Proposed Technique}\par
Several concurrency control techniques exhibits better performance in different idiographic situations. In some cases locking protocols shows better performance but fails to meet the requirement in some other cases. So we have classified the type of transactions as well as consider the actual condition of the contention based on the time required to executer that transaction. Transactions in the Real-time database can be split into three categories according to Multi-version Timestamp Ordering concurrency control method depending on the type of operations they performs \hyperref[b0]{[1]}. They are: a) Read-Only Transactions (Txn-R) This type of transaction always read the data elements that is the maximum Timestamp with a less than or equal Txn-R in Time-stamp TS (Txn-R). That is Txn-R gets the most recent version of the data before it, so reading-reading conflicts or reading -writing conflicts do not occur, and Txn-R are always succeeded. 
\section[{b) Write-Only Transactions (Txn-W)}]{b) Write-Only Transactions (Txn-W)}\par
For this transaction type, the old data elements are not modified. Just a new version of data element will be created which is given by Txn-W as timestamp TS (Txn-W). So writing-writing conflicts do not occur and Txn-W will not be blocked by another transactions. So, writing-writing conflicts between update transactions most likely to be occurred Now, it is necessary to resolve the conflicts between the update transactions effectively to provide enhanced concurrency. The proposed method considers the contention of transactions in order to adopt best suited technique for that situation.\par
Contention is the number of transactions that are running in the system or waiting in concurrency control queue of Transaction manager to be executed. Conflicts among Update transactions (Txn-U) are resolved according to following rules:\par
If Contention is low, adopt OCC Sacrifice method. Allow all transactions (Txn-U) to be executed freely without any checking. When a transaction Txn-U i reaches its validation stage, Txn-U i checks for the conflicts with currently executing Txn-Us by means of the Read-set and Write-set of transactions. In the real-time database system Execution-Time (ET) of a transaction is predictable \hyperref[b0]{[1]}. Let Conflict -Set (CS) be the set of Txn-Us that are conflicting with Txn-U i . Now Txn-U i restarts with rolling back its operations already performed, If ET( Txn-U i ) < ? j ET( Txn-U j ) , For all Txn-U j ? CS; otherwise Txn-U i commits and For all Txn-U j ? CS restart with updated data item.\par
If Contention is medium, adopt SCC method. When a transaction Txn-U i begins to execute, it issues Exclusive Write (EW) lock on data object. If it completes the work with an data object D, it produces a new-image of that object D n and converts EW lock into Speculative-Write (SPW) lock. After producing D n , Txn-U i allows any transaction Txn-U j requesting for D to get speculative execution Txn-U j begins speculative execution with new-image D n and old image D o . After the completion of its operation, Txn-U j commits speculative execution with D n or D o according to the abort or commit of Txn-U i respectively.\par
If Contention is high, adopt 2PL-HP that ensures more transactions to be completed within the deadline. The transaction priority P (Txn-U) is principally determined by deadline of the transactions. So as in Real time database system we can have the deadline of the transactions and take it as the priority for that transaction. That is for all Txn-U j , Txn-U j ? T, whenever deadline (Txn-U i ) > = deadline (Txn-U j ), then P (Txn-U i ) < = P(Txn-U j ), the higher-priority transaction will get the priority of execution. When a transaction Txn-U j begins to execute, it tries to issue write lock on data object D. If D is already occupied by another transaction Txn-U i , Txn-U i have to sacrifice and restart. If P (Txn-U j ) > P(Txn-U j ) otherwise Txn-U j waits for D to be free by the completion or abort of Txn-U i. 
\section[{III.}]{III.} 
\section[{Analysis of the Performance}]{Analysis of the Performance}\par
Through the comparison testing between the new and traditional method, Fig. 1  C increases, Contention decreases, the rate of restart of transaction becomes small due to the less opportunity of conflicts. But when the interval is not long, Contention increases the new method is considerably better than conventional one. The performance of real-time database systems has a fundamentally different target compared with the traditional database systems. The real-time database systems require the more number of transactions to be completed within the deadline of the transactions rather than the number of concurrent transaction for execution to maintain the largest concurrency. The new method makes read-only and write-only transactions never fail and avoids their unnecessary restart using multi-version method. It effectively saves the systems expense and improves the systems through put. As for the update transactions, the new technique makes the same data element to be operated by more transactions without interfering by another one by using suitable method to resolve conflicts, according to the contention of transactions in the system. This method can adaptively use the optimistic mechanism and speculation based mechanisms for the implementation of the resolution of conflicts and creates a new version of data elements to improve the concurrency degree of transaction and the amount of transactions completed before deadline. In summary, in different contention size, the new method can flexibly take advantage of the traditional concurrency control mechanism with multiple versions, OCC Sacrifice, Speculative Concurrency Control and 2PL-HP; it can get better the concurrency of the system, save effectively the expense of the system. Compared with the traditional concurrency control mechanisms, the improved one is better on performance.  
\section[{Conclusions}]{Conclusions}\par
As the real-time database systems have a tight time constraints for the transactions as well as data, and the very well. So there is a demand of comprehensive traditional concurrency control mechanisms cannot satisfy their needs method to meet the requirements of the real time database system. By improving the concurrency control protocols, this paper has presented a comprehensive concurrency control technique that highly reduces the rate of abortion as well as considers the timing constraints of the transactions.\par
With a strong self-adaptability, this method is able to use best suited method among different concurrency control mechanisms according to different situations of contention in the system. It can also effectively improve the performance of system providing higher concurrency considering deadline. The next step is to do further test and evaluation so that the other protocols can be justified with respect to comprehensive method that would be a good verification which is left as well as verification in the actual environment so as to refine and improve the algorithm.\par
Volume XIII Issue II Version I \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}C}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}}\end{figure}
   			\footnote{© 2013 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Park and Park (1997)]{b10}\label{b10} 	 		‘Alternative Correctness Criteria for Multi-version Concurrency Control and a Locking Protocol via Freezing’.  		 			C Park 		,  		 			S Park 		.  	 	 		\textit{Proc. Int'l Database Eng. and Applications Symp},  				 (Int'l Database Eng. and Applications Symp)  		Aug. 1997. p. .  	 
\bibitem[Jorwekar et al. ()]{b9}\label{b9} 	 		‘Automating the detection of snapshot isolation anomalies’.  		 			S Jorwekar 		,  		 			A Fekete 		,  		 			K Ramamritham 		,  		 			S Sudarshan 		.  	 	 		\textit{Proceedings of the VLDB'07},  				 (the VLDB'07)  		2007. p. .  	 
\bibitem[Bernstein et al. ()]{b12}\label{b12} 	 		\textit{Concurrency Control and Recovery in Database Systems},  		 			P Bernstein 		,  		 			V Hadzilacos 		,  		 			N Goodman 		.  		1987. Addison-Wesley.  	 
\bibitem[Hedayati et al. ()]{b2}\label{b2} 	 		‘Evaluation of performance concurrency control algorithm for secure firm real-time database systems via simulation model’.  		 			M Hedayati 		,  		 			S H Kamali 		,  		 			R Shakerian 		,  		 			M Rahmani 		.  	 	 		\textit{Proceeding of the International conference on Networking and Information Technology},  				 (eeding of the International conference on Networking and Information Technology)  		2010. p. .  	 
\bibitem[Prakash Lingam ()]{b1}\label{b1} 	 		‘Freezing as a correctness measure for multi-version time-stamp ordering protocol’.  		 			K M Prakash Lingam 		.  	 	 		\textit{Computer Engineering and Technology}  		2010. 3 p. .  	 
\bibitem[Laiho and Laux ()]{b3}\label{b3} 	 		‘Implementing Optimistic Concurrency control for persistence Middleware using row version verification’.  		 			M Laiho 		,  		 			F Laux 		.  	 	 		\textit{Proceeding of the Second International Conference on Advances in databases, knowledge and Data Applications},  				 (eeding of the Second International Conference on Advances in databases, knowledge and Data Applications)  		2010. p. .  	 
\bibitem[Fekete et al. ()]{b8}\label{b8} 	 		‘Making snapshot isolation serializable’.  		 			D Fekete 		,  		 			E Liarokapis 		,  		 			P O'neil 		,  		 			D O'neil 		,  		 			Shasha 		.  	 	 		\textit{ACM Trans. Database Syst}  		2005. 30  (2)  p. .  	 
\bibitem[Bernstein and Goodman (1983)]{b11}\label{b11} 	 		‘Multi-version Concurrency Control-Theory and Algorithms’.  		 			P A Bernstein 		,  		 			N Goodman 		.  	 	 		\textit{ACM Trans. Database Systems}  		Dec. 1983. 8  (4)  p. .  	 
\bibitem[Park et al. (2002)]{b7}\label{b7} 	 		‘Multi-version locking protocol with Freezing for secure Real-Time Database Systems’.  		 			C Park 		,  		 			S Park 		,  		 			S H Son 		.  	 	 		\textit{IEEE Transactions on Knowledge and Data Engineering}  		Oct -2002. 14  (5)  p. .  	 
\bibitem[Park et al. (2002)]{b13}\label{b13} 	 		‘Multi-version Locking Protocol with Freezing for Secure Real-Time Database Systems’.  		 			C Park 		,  		 			S Park 		,  		 			S H Son 		.  	 	 		\textit{IEEE Transactions on Knowledge and Data Engineering}  		Oct. 2002. 14  (5)  p. .  	 
\bibitem[Mall and Iisc]{b4}\label{b4} 	 		\textit{Real Time systems: Theory and Practice},  		 			Rajib Mall 		,  		 			Bangalore Iisc 		.  		10 p. 8131771016.  	 
\bibitem[Wu and Pang ()]{b0}\label{b0} 	 		‘Research on the Improvement of the Concurrency Control Protocol for Real-Time Transaction’.  		 			S P Wu 		,  		 			Z Pang 		.  	 	 		\textit{Proceedings of International Conference on Machine Vision and Human-Machine Interface},  				 (International Conference on Machine Vision and Human-Machine Interface)  		2010. p. .  	 
\bibitem[Yang and Jun ()]{b6}\label{b6} 	 		‘The comparative study on the implementation of concurrency control’.  		 			X M Yang 		,  		 			Y X Jun 		.  	 	 		\textit{Computer Application Research}  		2006.  (6)  p. .  	 
\bibitem[Molina et al. ()]{b5}\label{b5} 	 		\textit{The Implementation of Database System},  		 			H G Molina 		,  		 			J D Ullman 		,  		 			J Widom 		.  		2002. China Machine Press. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
