<?xml version="1.0" encoding="utf-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2d1 20170631//EN" "JATS-journalpublishing1.dtd">
<ArticleSet>
  <Article>
    <Journal>
      <PublisherName>IJIRCSTJournal</PublisherName>
      <JournalTitle>International Journal of Innovative Research in Computer Science and Technology</JournalTitle>
      <PISSN>I</PISSN>
      <EISSN>S</EISSN>
      <Volume-Issue>Volume 8 Issue 3</Volume-Issue>
      <PartNumber/>
      <IssueTopic>Computer Science and Engineering</IssueTopic>
      <IssueLanguage>English</IssueLanguage>
      <Season>May - June 2020</Season>
      <SpecialIssue>N</SpecialIssue>
      <SupplementaryIssue>N</SupplementaryIssue>
      <IssueOA>Y</IssueOA>
      <PubDate>
        <Year>2020</Year>
        <Month>05</Month>
        <Day>26</Day>
      </PubDate>
      <ArticleType>Computer Sciences</ArticleType>
      <ArticleTitle>Version Locking Mechanism in Database</ArticleTitle>
      <SubTitle/>
      <ArticleLanguage>English</ArticleLanguage>
      <ArticleOA>Y</ArticleOA>
      <FirstPage>81</FirstPage>
      <LastPage>86</LastPage>
      <AuthorList>
        <Author>
          <FirstName>Swati   </FirstName>          
          <AuthorLanguage>English</AuthorLanguage>
          <Affiliation/>
          <CorrespondingAuthor>Y</CorrespondingAuthor>
          <ORCID/>
             
        </Author>
      </AuthorList>
      <DOI>https://doi.org/10.21276/ijircst.2020.8.3.8</DOI>
      <Abstract>The distributed database provides a resource sharing environment, where multiple transactions at different sites coexist in order to access the resources. In this paper we investigate multi version locking protocol in distributed environment. Multi-version database has the potential to significantly increase the amount of concurrency in transaction processing as they can avoid read-write conflict by completing the read requests with older versions of data while the write operation is in progress. These algorithms are particularly effective for long queries, which otherwise cannot finish due to the high probability of conflict with other transactions. We have given an improvement on the algorithm proposed by Jie shao. We have not imposed any restriction on the involvement of all the existing sites to obtain a global version which thereby reduces the burden on each individual site. Our scheme involves the collection of local transaction identifier only from the participating site whether it can be one or many. We have proposed our new algorithm to obtain a correct version for a particular data item during read and write operation.</Abstract>
      <AbstractLanguage>English</AbstractLanguage>
      <Keywords>Local transaction identifier; Global consistent snapshot version; Serializability.</Keywords>
      <URLs>
        <Abstract>https://ijircst.org/abstract.php?article_id=390</Abstract>
      </URLs>      
    </Journal>
  </Article>
</ArticleSet>