# HG changeset patch # User Daichi TOMA # Date 1391988640 -32400 # Node ID 130082e3f79092d38941339392d840dab6f2add5 # Parent 4675d3e5fee349dfc7e4ebf596e27580b8b55623 add abstract written by english diff -r 4675d3e5fee3 -r 130082e3f790 paper/abstract_eng.tex --- a/paper/abstract_eng.tex Mon Feb 10 08:18:16 2014 +0900 +++ b/paper/abstract_eng.tex Mon Feb 10 08:30:40 2014 +0900 @@ -3,10 +3,13 @@ It provides a modern type system, type-safe and type inference makes it possible to write a program reliable\cite{types}. Haskell has referential transparency that allows the programmer and the compiler to reason about program behavior. -In this study, we implement the parallel database using Haskell and non-destructive tree. +In this study, we implement the parallel database using Haskell. +It is use non-destructive tree structure. +Non-destructive tree structure is not the destruction of data. +Editing of data is done creating by new tree. +Haskell compatible with non-destructive tree, because Haskell is destructive updates does not exist We measures the performance for reading and writing of parallel database. We achieve to bring out the performance of the multi-core processor. - Further, in order to indicate the availability of practical applications, we have developed a Web bulletin board service. \end{abstract_eng} diff -r 4675d3e5fee3 -r 130082e3f790 paper/master_paper.pdf Binary file paper/master_paper.pdf has changed diff -r 4675d3e5fee3 -r 130082e3f790 paper/master_paper.tex --- a/paper/master_paper.tex Mon Feb 10 08:18:16 2014 +0900 +++ b/paper/master_paper.tex Mon Feb 10 08:30:40 2014 +0900 @@ -65,7 +65,7 @@ %要旨 \input{abstract.tex} -% \input{abstract_eng.tex} +\input{abstract_eng.tex} %目次 \tableofcontents