\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={Incremental Maintenance of a Materialized View in Data Warehousing: An Effective Approach},
 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{2018-01-15 (revised: 15 January 2018)}
\def\TheID{\makeatother }
\def\TheDate{2018-01-15}
\title{Incremental Maintenance of a Materialized View in Data Warehousing: An Effective Approach}
\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. Sanjay S  Solanki}

             \affil[1]{  JSPMs Abacus Institute of Computer Application}

\renewcommand\Authands{ and }

\date{\small \em Received: 11 December 2017 Accepted: 2 January 2018 Published: 15 January 2018}

\maketitle


\begin{abstract}
        


A view is a derived relation defined in terms of base relations. A view can be materialized by storing its extent in the database. An index can be made of these views and access to materialized view is much faster that recomputing the view from scratch. A Data Warehouse stores large amount of information collected from a different data sources. In order to speed up query processing, warehouse usually contains a large number of materialized views. When the data sources are updated, the views need to be updated. The process of keeping view up to date called as materialize view maintenance. Accessing base relations for view maintenance can be difficult, because the relations may be being used by users. Therefore materialize view maintenance in data warehousing is an important issue. For these reasons, the issue of self-maintainability of the view is an important issue in data warehousing. In this paper we have shown that a materialized view can be maintained without accessing the view itself by materializing additional relations at the data warehouse site. We have developed a cost effective approach to reduce the burden of view maintenance and also proved that proposed approach is optimum as compared to other approaches. Here incremental evaluation algorithm to compute changes to materialized views in relational is presented.

\end{abstract}


\keywords{optimized view, ETL, incremental maintenance, view maintenance process, DMWS, view synchronization, expression tree.}

\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
t has been observed that in most typical data analysis and data mining applications, timeliness and interactivity are more important considerations than accuracy; thus, data analysts are often willing to overlook small inaccuracies in the answer, provided that the answer can be obtained fast enough. This observation has been the primary driving force behind the recent development of approximate query processing techniques for aggregation queries in traditional databases and decision support systems \hyperref[b3]{[4]}, \hyperref[b4]{[5]}. Numerous approximate query processing techniques have been developed: The most popular ones are based on random sampling, where a small random sample of the rows of the database is drawn, the query is executed on this small sample, and the results are extrapolated to the whole database. In addition to simplicity of implementation, random sampling has the compelling advantage that, in addition to an estimate of the aggregate, one can also provide confidence intervals of the error, with high probability.\par
Broadly, two types of sampling-based approaches have been investigated: 1) pre-computed samples, where a random sample is pre-computed by scanning the database and the same sample is reused for several queries and 2) online samples, where the sample is drawn "on the fly" upon encountering a query. So the selection of these random samples in distributed environments for query processing is addressed in \hyperref[b5]{[6]}. Data warehouses (DW) \hyperref[b5]{[6]} are built by gathering information from data sources and integrating it into one virtual repository customized to users' needs. One important task of a Data Warehouse Management System (DWMS) is to maintain the materialized view upon changes of the data sources, since frequent updates are common for most data sources. In addition, the requirements of a data source are likely to change during its life-cycle, which may force schema changes for the data source. A schema change could occur for numerous other reasons, including design errors, the addition of new functionalities and even new developments in the modeled application domain. Even in fairly standard business applications, rapid schema changes have been observed. In [10], significant changes (about 59\% of attributes on the average) were reported for seven different applications over relational databases. A similar report can also be found in \hyperref[b13]{[15]}. These applications ranged from project tracking, sales management, to government administration.\par
In situations that real-time refreshment of the data ware-house content is not critical; changes to the sources are usually buffered and propagated periodically such as once a day to refresh the view extent. Two benefits are possible. One is to gain better maintenance performance. The other is that there are less conflicts with DW read sessions. In a data update only environment, most view maintenance (VM) algorithms proposed in the literature \hyperref[b15]{[17,}\hyperref[b0]{1,}\hyperref[b12]{14]} group the updates from the same relation and maintain such a large delta change in a batch fashion. However, these algorithms would fail whenever source schema changes occur, which are also common as stated above. One obvious reason is that the data updates in this group may be schema inconsistent with each other if there are some schema changes in between. On the other hand, work has begun on incorporating source schema changes into the data warehouse, namely, view synchronization (VS) \hyperref[b7]{[8]} aims at rewriting the DW view definition when the source schema has been changed.\par
To handle the delete of any schema information of a data source, VS tries to locate an alternative source for replacement to keep the new view semantically as close to the original view as possible. Thereafter, view adaptation (VA) \hyperref[b10]{[12]} incrementally adapts the view extent to keep the new view consistent. Such algorithms are also not sufficient to batch a group of mixed data updates and schema changes, since there could be a number of schema changes interleaved with some data updates. In this paper, we propose a solution strategy that is capable of batching a mixture of both source data updates II. 
\section[{Definition of Terms}]{Definition of Terms}\par
View evaluation can be represented by a tree, called an expression tree \hyperref[b4]{[5,}\hyperref[b8]{9]}. An expression tree is a tree, where the leaf nodes represent base relations and non-leaf nodes represent binary expressions in the relational algebra. The unary relational algebraic expressions are associated along the edges. A view or a query is optimized by the query optimizer before executing it. A query optimizer takes an expression tree as input and produces an output, called an optimized expression tree, which determines the internal sequence of operations for executing a query. Thus, an optimized expression tree defines a partial order in which operations must be performed in order to produce the result of the view. 
\section[{Depth:}]{Depth:}\par
The depth of leaf nodes, that is data base relations is 0. The depth d of a node is defined as max(depth of descendents)+1. 
\section[{Height:}]{Height:}\par
The height of the optimized expression tree is defined as the maximum depth of any node in the tree.\par
Given a node i in the expression tree, its parent is denoted by i, and op(i) and op( i) are the expressions associated with i and i, respectively. The children of node i are denoted by i' and i'' where i' is a sibling of i'' and vice versa. IR i denotes the intermediate result of node i. The auxiliary relation associated with node I is denoted AR i in the case where only one relation is needed, and by AR 1 i and AR 2 i when two are needed. The key of IR i is denoted by K i , and the keys of IR i' and IR i'' are denoted by K i' and K i'' , respectively. Insertion and deletion of tuples are denoted by and respectively. The symbol ? either an inserted set or a deleted set of tuples. The instance of a relation, say Ri, before and after an update is denoted by Ri old an d Ri n ew respectively, similiary for an auxiliary relation AR and a materialized view V. 
\section[{III.}]{III.} 
\section[{Example \& Simplification}]{Example \& Simplification}\par
Consider a data warehouse for a large research organization which has got many departments and each department has many research groups. Suppose this data warehouse is collecting data from four base relations whose schemas are as follows: 
\section[{R1:}]{R1:}\par
emp\textunderscore rschr(rschr\textunderscore id,rname,deptno,major) This relation gives the researchers id, name, department and major. 
\section[{R2:emp\textunderscore paperpublish(rschrid,paper\textunderscore id,paper\textunderscore title,sour ce\textunderscore of\textunderscore publiscation, year\textunderscore of\textunderscore publish)}]{R2:emp\textunderscore paperpublish(rschrid,paper\textunderscore id,paper\textunderscore title,sour ce\textunderscore of\textunderscore publiscation, year\textunderscore of\textunderscore publish)}\par
This gives researchers id,paper id, paper title, source of publication and year of publish. 
\section[{R3: emp\textunderscore manager(rschr\textunderscore id,deptno)}]{R3: emp\textunderscore manager(rschr\textunderscore id,deptno)}\par
This relation contain one record for each manager and his department. Assume that each department has one manager. Since a manager is also a researcher, relation emp\textunderscore rschr has a tuple for each manager. 
\section[{R4: emp\textunderscore groupleader(rschr\textunderscore id,deptno)}]{R4: emp\textunderscore groupleader(rschr\textunderscore id,deptno)}\par
This relation contains information about th research group name and who is leading this group. Since a group leader is also a researcher, relation emp\textunderscore rshcr has a tuple for each group leader.\par
Suppose a user of the organization is interested in materializing and maintaining the following view:\par
'Researchers other than managers and group leaders along with their departments who have published more than 10 papers in the year 2010.'\par
In  
\section[{C}]{C}\par
to the auxiliary relations incrementally. Deferring the changes allows analysts that query the warehouse to see a consistent snapshot of the data throughout the day, and can make the maintenance more efficient. Figure  {\ref 1} shows the optimized expression tree for the above view. Here, the nodes at leaf level are base relations and non-leaf nodes are expressions. Each nonleaf node in the tree corresponds to a relational algebraic expression given above. 
\section[{Figure 1: Expression tree}]{Figure 1: Expression tree}\par
Suppose Researchers or Paper\textunderscore Public relations are updated. In this case we materialize the two auxiliary relations View2 and View3. The contents of these views are derived while computing the view first time. By materializing these two auxiliary relations in the warehouse, the view is self-maintainable along with these auxiliary relations. Suppose new researchers joined the organization, therefore, one tuple for each new researcher in emp\textunderscore rschr relation has to be inserted. These insertions will led to generate tuples that to be inserted in rschr\textunderscore ex\textunderscore manager\textunderscore groupleader. Since these new researchers have not published any paper at the time of joining, these tuples cannot join with any tuples of emp\textunderscore paper\textunderscore publish, thus there will no change in the materialized views. Therefore, all auxiliary relations and materialized views are self\textunderscore maintainable. Now consider another case where a set of tuples is inserted in emp\textunderscore paper\textunderscore publish relation, say R. Then, we first compute the research paper those are published in year 2010 and then it is join with rschr\textunderscore ex\textunderscore managergroupleader view. Lastly the intermediate result is grouped in the final auxiliary relation by performing count operation. In this case also, the view and auxiliary relations are self-maintainable. 
\section[{IV.}]{IV.} 
\section[{Procedure of Materialize Views Maintenance}]{Procedure of Materialize Views Maintenance}\par
The materialize view maintenance process can be divided into two functions: 1. Propagate and 2. Refresh. The work of computing the auxiliary relations happens within the propagate function, which can take place without locking materialize views so that the warehouse can continue to be made available for querying by analysts. Materialize views are not locked until the refresh function, during which time the materialize views are updated from the auxiliary relations.\par
The propagate function involves updating the auxiliary views incrementally from deferred set of changes. The final auxiliary view represents the net changes to the materialize views due to the changes in the underlying data sources.\par
The refresh function applies the net changes represented in the final auxiliary relation to the materialize views. This process carried out after a specific time interval or when the system has free cycles. So none of the data warehouse users or operations are affected by the view maintenance process. None of the query has to pay for view maintenance. The materialize view maintenance process totally hidden by users and running transactions. Whenever an interested change happens in the underlying data source, simply this desire change is stored in the auxiliary relations by comparing and joining it with others relations if required. This change is passed to the higher level auxiliary relations. Again the change is integrated and circulated to final auxiliary relation. Lastly the change is refreshed into the data warehouse when the refresh trigger is occur. 
\section[{a) Analytical Cost Model}]{a) Analytical Cost Model}\par
In this section we show the performance results of our materialize view maintenance method. The results are based on the following cost model. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XVIII Issue III Version I  
\section[{i. Cost Model}]{i. Cost Model}\par
The overall view maintenance cost of materialized views includes the cost of propagate the changes and the cost of refresh operations. Let V 1 ,V 2 ,?.,V m be the m materialized views. Let B 1 , B 2 ,?,B n be the n base relations and A 1 ,A2,?A i be the i auxiliary relations. Let f u1 B1 ,?..,f un Bn be the update frequency to the base relations. Let C ij B->A be the cost of propagating an update on base relation B i to auxiliary relation A j and C jk A->V be the cost of refresh of auxiliary A j to materialized view V k . The overall cost of maintaining the views when keeping both the materialized views and the auxiliary relations is:C MV +AR=? ?f ???? ???? ? * (? C?> ??? ?? ?? ??? ?? ?? ????? ?? =1 ?? =1 ?? ?? ?? ??? ??=?? ??=1\par
The total view maintenance cost with no auxiliary relations is:C MV =? ?f ???? ???? ? * ??=?? ??=1 (? C ??=?? ??=1\par
It is obvious that the cost of maintaining the materialized views directly from base relations is much more than the cost of maintaining materialized views through auxiliary relations.\par
V. 
\section[{Evaluation}]{Evaluation}\par
To verify the feasibility and effectiveness of our view maintenance strategies and corresponding optimization framework, we have implemented the proposed techniques using Oracle 9i. All experiments were performed on a workstation with Pentium D 3.2 GHz processor, 1 GB of memory and 160 GB disks, running Windows XP.\par
Relation R1 contain 500000 records, R2 contains 25000 records, where as in R3 there are records of individual manager of a department and in R4 holds the records of group leaders. We considered two types of changes:\par
Update-Generating changes: Insertions and deletions of an equal number of tuples over existing researchers and paper publishers. These changes mostly cause updates amongst the existing tuples in materialized view.\par
Insertion-Generating changes: Insertions over new researchers those who published certain number of research papers. These changes cause only insert into paper publish table.\par
The insertion-generating changes are very meaningful since in many data warehousing applications the only changes to the fact tables are insertions of tuples for new dates, which leads to insertions into materialized views.\par
Figure 2 shows four graphs illustrating the performance advantage of using incremental materialized view maintenance method which uses auxiliary views to store intermediate results. The view maintenance time is split into two functions propogate and refresh. While computing the intermediate result the data warehouse is remain free to the user.\par
Figure 2 (a) and (b) plot the variation in elapsed time as the size of the change set changes(delta relation), for a fixed size 500000 records in emp\textunderscore rschr relation and 250000 records in emp\textunderscore paperpublish relation.\par
We found that the incremental materialize view maintenance using auxiliary relations wins for both types of changes, but it wins with a greater margin for the update generating changes. The refresh time is going down by 20\% in figure 2(b).    
\section[{Conclusions}]{Conclusions}\par
We have investigated one of the significant problems of a data warehouse, that is, materialized view maintenance and how to make warehouse materialized views self maintainable without accessing the data from underlying data sources. The study shows that it is possible to make warehouse views self maintainable by materializing additional auxiliary relations, which contain intermediate results, at a data warehouse site. Using efficient incremental materialize view maintenance technique it is possible to reduce the cost of view maintenance. Proposed materialize view maintenance technique using auxiliary relation and dividing the maintenance process into two steps: propagate and refresh require less maintenance time as compared to counting algorithm. Here the propagate function works implicitly and whenever the data warehouse is ideal the refresh function integrate the data into data warehouse views. The entire maintenance process is hidden from the data warehouse users.   \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.7635505481120585\textwidth}P{0.08644945188794154\textwidth}}
Year 2018\tabcellsep \\
12\tabcellsep \\
Volume XVIII Issue III Version I\tabcellsep Create view mngr\textunderscore or\textunderscore groupleader (rschr\textunderscore id, deptno) as select rschr\textunderscore id, deptno from emp\textunderscore rschr\\
\multicolumn{2}{l}{UNION // This view is for finding manager and group leader Create view rschr\textunderscore ex\textunderscore  manager\textunderscore or\textunderscore groupleader (rschr\textunderscore id, deptno) as select reshr\textunderscore id, deptno from emp\textunderscore rschr where NOT EXISTS (select *from mngr\textunderscore or\textunderscore grouple ader where emp\textunderscore rschr.id=mngr\textunderscore  or\textunderscore groupleader.id) //This view is for finding researcher, those are not manager or group leader. Create view rschrpaperview2010 (rschr\textunderscore id, paper\textunderscore id, deptno) as select emp\textunderscore paperpublish.rschr\textunderscore id, paper\textunderscore id, deptno from rschr\textunderscore ex\textunderscore manager\textunderscore or\textunderscore group leader, emp\textunderscore paperpublish where rschr\textunderscore ex\textunderscore  manager\textunderscore or\textunderscore  group leader.rschr\textunderscore id=emp\textunderscore paperpublish.rschr\textunderscore id and year= '2010'. //This view gives the researcher those who have published paper in the year 2010. Create view rschrpaperview(rschr\textunderscore id,deptno) as Select rschr\textunderscore id, deptno from rschrpaper view2010 group by rschr\textunderscore id having count(*)>10; // Global Journal of Computer Science and Technology (select rschr\textunderscore id, deptno from emp\textunderscore groupleader) ( )}\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 			\footnote{© 2018 Global JournalsIncremental Maintenance of a Materialized View in Data Warehousing: An Effective Approach} 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Solanki and Kumar (2011)]{b26}\label{b26} 	 		‘A Comparative Study of Materialized View Maintenance Techniques in Data Warehousing’.  		 			S Solanki 		,  		 			Dr 		,  		 			Ajay Kumar 		.  	 	 		\textit{IJRIME}  		August 2011. 1  (2) .  	 
\bibitem[Solanki and Kumar (2012)]{b27}\label{b27} 	 		\textit{A Comprehensive Study of Data Warehousing},  		 			S Solanki 		,  		 			Dr 		,  		 			Ajay Kumar 		.  		January 2012.  	 	 (IJMR, Vol1, Issue 1) 
\bibitem[Hull and Zhou ()]{b22}\label{b22} 	 		‘A framework for supporting data integration using the materialized \& virtual approaches’.  		 			R Hull 		,  		 			\& G Zhou 		.  	 	 		\textit{SIGMOD Int'l Conference},  				June 4 -6,1996.  	 
\bibitem[Hanson ()]{b6}\label{b6} 	 		‘A performance analysis of view materialization strategies’.  		 			E N Hanson 		.  	 	 		\textit{SIGMOD pages},  				1987. p. .  	 
\bibitem[Latha et al. ()]{b16}\label{b16} 	 		‘Algorithms for Defered View Maintenance’.  		 			S Latha 		,  		 			Timothy Colby 		,  		 			Leonid Griffin 		,  		 			Singh Libkin 		,  		 			Howard Mumick 		,  		 			Tricky 		.  	 	 		\textit{proceedings of ACM SIGMOD},  				 (ACM SIGMOD)  		1996.  	 
\bibitem[Roussopoulos ()]{b20}\label{b20} 	 		‘An Incremental Access Method for Viewcache: Concept, Algorithms and Cost Analysis’.  		 			N Roussopoulos 		.  	 	 		\textit{ACM Trans. On Database Systems}  		1991. 16  (3)  p. .  	 
\bibitem[Chaudhuri and Dayal ()]{b24}\label{b24} 	 		‘An Overview of Data Warehousing and OLAP Technology’.  		 			S Chaudhuri 		,  		 			U Dayal 		.  	 	 		\textit{ACM SIGMOD Record, volume26},  				1974. p. .  	 
\bibitem[Hao He et al. ()]{b9}\label{b9} 	 		‘Asymmetric Batch Incremental View Maintenance’.  		 			Junyi Hao He 		,  		 			Jun Xie 		,  		 			Hai Yang 		,  		 			Yu 		.  	 	 		\textit{the Proceedings of the 21 st International Conference on Data Engineering},  				1084-4627/05, 2005.  	 
\bibitem[Mohnia ()]{b18}\label{b18} 	 		‘Avoiding re-computation: View Adaptation in Data Warehouses’.  		 			M Mohnia 		.  	 	 		\textit{Proc. Of 8 th International Database Workshop},  				 (Of 8 th International Database WorkshopHong Kong)  		1997. p. .  	 
\bibitem[Segev and Fang ()]{b1}\label{b1} 	 		‘Currency based updates to distributed materialized Views’.  		 			W Segev 		,  		 			Fang 		.  	 	 		\textit{proceedings of the IEEE International Conference on Data Engineering},  				 (the IEEE International Conference on Data Engineering)  		1990.  	 
\bibitem[Adiba and Line\dsay (1980)]{b17}\label{b17} 	 		‘Database Snapshots’.  		 			M Adiba 		,  		 			\& B Line\textbackslash dsay 		.  	 	 		\textit{Proceedings of the sixth International Conference on Very Large Databases},  				 (the sixth International Conference on Very Large DatabasesMontreal, Canada)  		October 1980. p. .  	 
\bibitem[Heney et al. ()]{b10}\label{b10} 	 		\textit{Database System Concepts},  		 			E Heney 		,  		 			Abraham Korth 		,  		 			Silberschatz 		.  		1986. McGraw Hill.  	 
\bibitem[Chen et al. ()]{b12}\label{b12} 	 		‘DyDa: Data Warehouse Maintenance under Fully Concurrent Environments’.  		 			J Chen 		,  		 			X Zhang 		,  		 			S Chen 		,  		 			K Andreas 		,  		 			E A Rundensteiner 		.  	 	 		\textit{Proc. ACM SIGMOD Demo Session},  				 (ACM SIGMOD Demo Session)  		2001. p. 619.  	 
\bibitem[Ramakrishan et al. ()]{b23}\label{b23} 	 		‘Efficient Incremental Evaluation of Queries with Aggregation’.  		 			R Ramakrishan 		,  		 			K A Ross 		,  		 			D Srivastava 		,  		 			S Sudarshan 		.  	 	 		\textit{International Logic Programming Symposium},  				1994.  	 
\bibitem[Blakeley et al. (1986)]{b11}\label{b11} 	 		‘Efficient Updating Materialized Views’.  		 			J A Blakeley 		,  		 			P A Larson 		,  		 			F W Tompa 		.  	 	 		\textit{Proc. ACM SIGMOD},  				 (ACM SIGMOD)  		May 1986. p. .  	 
\bibitem[Agarwal et al. ()]{b4}\label{b4} 	 		‘Efficient View Maintenance at Data Warehouses’.  		 			D Agarwal 		,  		 			A E Abbadi 		,  		 			A Singh 		,  		 			T Yurek 		.  	 	 		\textit{Proc. ACM SIGMOD},  				 (ACM SIGMOD)  		1997. p. .  	 
\bibitem[Hyun (1996)]{b19}\label{b19} 	 		‘Efficient View Self-Maintenance’.  		 			N Hyun 		.  	 	 		\textit{Proceeding of ACM workshop on Materialized views: Techniques \& Applications},  				 (eeding of ACM workshop on Materialized views: Techniques \& Applications)  		June 7, 1996.  	 
\bibitem[Wolfson et al. ()]{b21}\label{b21} 	 		‘Incremental Evaluation of Rules \& Its Relationship to Parallesim’.  		 			O Wolfson 		,  		 			H M Dewan 		,  		 			S J Stolfo 		,  		 			Yemini 		.  	 	 		\textit{Proceedings ACM IGMOD, International Conference on Management of Data},  				 (ACM IGMOD, International Conference on Management of Data)  		1991. p. .  	 
\bibitem[Moro and Sartori ()]{b7}\label{b7} 	 		\textit{Incremental View Maintenance on Multi-Source},  		 			Gianluca Moro 		,  		 			Claudio Sartori 		.  		2001.  	 	 (In proceedings of IEEE) 
\bibitem[Abdulaziz et al. ()]{b2}\label{b2} 	 		‘Incremental View Maintenance: An Algorithmic Approach’.  		 			S Abdulaziz 		,  		 			Almazyad \& Mohammad Khubeb 		,  		 			Siddiqui 		.  	 	 		\textit{Internatioinal Journal of Electrical \& Computer Sciences IJECS-IJENS}  		2009. 10  (03) .  	 
\bibitem[Zhou et al. ()]{b14}\label{b14} 	 		‘Lazy Maintenance of Materialized Views’.  		 			Jingren Zhou 		,  		 			Perake Larson 		,  		 			Hicham G Elmongui 		.  	 	 		\textit{Proceddings of 33 rd International conference on VLDB},  				 (eddings of 33 rd International conference on VLDBVienna, Austria)  		2007.  	 
\bibitem[Segev and Park ()]{b0}\label{b0} 	 		‘Maintaining Materialised Views in Distributed databases’.  		 			A Segev 		,  		 			J Park 		.  	 	 		\textit{Proceedings of the IEEE International Conference on Data Engineering},  				 (the IEEE International Conference on Data Engineering)  		1989.  	 
\bibitem[Gray et al. (2005)]{b8}\label{b8} 	 		‘Multi agent Immediate Incremental View Maintenance for Data 10. Warehouses’.  		 			C H Gray 		,  		 			William A Yeung 		,  		 			Gruver 		.  	 	 		\textit{IEEE Transaction on Systems, Man \& Cybermetics-Part A: Systems \& Human},  				March 2005. 35.  	 
\bibitem[Chen et al. ()]{b25}\label{b25} 	 		‘Multiversion Based View Maintenance over Distributed Data Sources’.  		 			S Chen 		,  		 			B Liu 		,  		 			E A Rundensteiner 		.  	 	 		\textit{ACM Trans. Database Systems (TODS)}  		2004. 29  (4)  p. .  	 
\bibitem[Liu & Elke and Rundensteiner (2006)]{b3}\label{b3} 	 		‘Optimizing Cyclic Join View Maintenance over Distributed Data Sources’.  		 			Bin Liu \& Elke 		,  		 			A Rundensteiner 		.  	 	 		\textit{IEEE Transactions on Knowledge and Data Engineering}  		March 2006. 18  (3) .  	 
\bibitem[Lomet and Widom (1995)]{b5}\label{b5} 	 		‘Special Issue on Materialized Views and Data Warehousing’.  		 			D Lomet 		,  		 			J Widom 		.  	 	 		\textit{IEEE Data Engineering Bulletin}  		June 1995. 18  (2) .  	 
\bibitem[Colby et al. ()]{b15}\label{b15} 	 		‘Supporting Multiple View Maintenance Policies’.  		 			L S Colby 		,  		 			A Kawaguchi 		,  		 			D F Lieuwen 		,  		 			I S Mumick 		,  		 			K A Ross 		.  	 	 		\textit{Proceeding ACM SIGMOD International Conference on Management of Data},  				 (eeding ACM SIGMOD International Conference on Management of Data)  		1977.  	 
\bibitem[Hammer et al. ()]{b13}\label{b13} 	 		‘The Stanford Data Ware housing Project’.  		 			J Hammer 		,  		 			H Garcia-Molina 		,  		 			J Widom 		,  		 			W Labio \& Zhuge 		.  	 	 		\textit{IEEE Data Engineering Bulletin}  		June1995.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
