<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0569846</ARLID> <utime>20230418232832.5</utime><mtime>20230309235959.9</mtime>   <SCOPUS>85140367648</SCOPUS> <WOS>000903720300005</WOS>  <DOI>10.1556/012.2022.01529</DOI>           <title language="eng" primary="1">Algebra of data reconciliation</title>  <specification> <page_count>23 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0255737</ARLID><ISSN>0081-6906</ISSN><title>Studia Scientiarum Mathematicarum Hungarica</title><part_num/><part_title/><volume_id>59</volume_id><page_num>209-231</page_num><publisher><place/><name>Akadémiai Kiadó</name><year/></publisher></serial>    <keyword>file synchronization</keyword>   <keyword>algebraic model</keyword>   <keyword>confluence</keyword>   <keyword>rewriting system</keyword>    <author primary="1"> <ARLID>cav_un_auth*0447301</ARLID> <name1>Csirmaz</name1> <name2>E. P.</name2> <country>HU</country> </author> <author primary="0"> <ARLID>cav_un_auth*0398469</ARLID> <name1>Csirmaz</name1> <name2>Laszlo</name2> <institution>UTIA-B</institution> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <country>HU</country> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2023/SI/csirmaz-0569846-preprint.pdf</url> </source> <source> <url>https://akjournals.com/view/journals/012/59/3-4/article-p209.xml</url>  </source>        <cas_special> <project> <project_id>GA19-04579S</project_id> <agency>GA ČR</agency> <country>CZ</country> <ARLID>cav_un_auth*0380558</ARLID> </project>  <abstract language="eng" primary="1">With distributed computing and mobile applications becoming ever more prevalent, synchronizing diverging replicas of the same data is a common problem. Reconciliation – bringing two replicas of the same data structure as close as possible without overriding local changes – is investigated in an algebraic model. Our approach is to consider two sequences of simple commands that describe the changes in the replicas compared to the original structure, and then determine the maximal subsequences of each that can be propagated to the other. The proposed command set is shown to be functionally complete, and an update detection algorithm is presented which produces a command sequence transforming the original data structure into the replica while traversing both simultaneously. Syntactical characterization is provided in terms of a rewriting system for semantically equivalent command sequences. Algebraic properties of sequence pairs that are applicable to the same data structure are investigated. Based on these results the reconciliation problem is shown to have a unique maximal solution. In addition, syntactical properties of the maximal solution allow for an efficient algorithm that produces it.</abstract>     <result_subspec>WOS</result_subspec> <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10101</FORD2>    <reportyear>2023</reportyear>      <num_of_auth>2</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>https://hdl.handle.net/11104/0341180</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> n.a. Article Mathematics </unknown> <unknown tag="mrcbC91"> C </unknown>         <unknown tag="mrcbT16-e">MATHEMATICS</unknown> <unknown tag="mrcbT16-f">0.8</unknown> <unknown tag="mrcbT16-g">0.2</unknown> <unknown tag="mrcbT16-h">18.5</unknown> <unknown tag="mrcbT16-i">0.00054</unknown> <unknown tag="mrcbT16-j">0.379</unknown> <unknown tag="mrcbT16-k">570</unknown> <unknown tag="mrcbT16-s">0.351</unknown> <unknown tag="mrcbT16-5">0.700</unknown> <unknown tag="mrcbT16-6">20</unknown> <unknown tag="mrcbT16-7">Q3</unknown> <unknown tag="mrcbT16-C">38.6</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q3</unknown> <unknown tag="mrcbT16-M">0.66</unknown> <unknown tag="mrcbT16-N">Q2</unknown> <unknown tag="mrcbT16-P">38.6</unknown> <arlyear>2022</arlyear>       <unknown tag="mrcbU14"> 85140367648 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000903720300005 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0255737 Studia Scientiarum Mathematicarum Hungarica 0081-6906 1588-2896 Roč. 59 3-4 2022 209 231 Akadémiai Kiadó </unknown> </cas_special> </bibitem>