Towards synchronizing linear collaborative objects with operational transformation
Identifieur interne :
000484 ( PascalFrancis/Corpus );
précédent :
000483;
suivant :
000485
Towards synchronizing linear collaborative objects with operational transformation
Auteurs : Abdessamad Imine ;
Pascal Molli ;
Gérald Oster ;
Michaël RusinowitchSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2005.
RBID : Pascal:06-0067105
Descripteurs français
- Pascal (Inist)
- Méthode formelle,
Synchronisation,
Type donnée,
Texte,
Réplication,
Disponibilité,
Système réparti,
Mise à jour,
Mémoire partagée,
Structure donnée,
Langage XML,
Présentation document,
Comportement rendez vous.
English descriptors
- KwdEn :
- Availability,
Data structure,
Data type,
Dating behavior,
Distributed system,
Document layout,
Formal method,
Replication,
Shared memory,
Synchronization,
Text,
Updating,
XML language.
Abstract
A collaborative object represents a data type (such as a text document or a filesystem) designed to be shared by multiple geographically separated users. Data replication is a technology to improve performance and availability of data in distributed systems. Indeed, each user has a local copy of the shared objects, upon which he may perform updates. Locally executed updates are then transmitted to the other users. This replication potentially leads, however, to divergent (i.e. different) copies. In this respect, Operational Transformation (OT) algorithms are applied for achieving convergence of all copies, i.e. all users view the same objects. Using these algorithms users can apply the same set of updates but possibly in different orders since the convergence should be ensured in all cases. However, achieving convergence with the OT approach is still a critical and challenging issue. In this paper, we address an open convergence problem when the shared data has a linear structure such as list, text, ordered XML tree, etc. We analyze the source of this problem and we propose a generic solution with its formal correctness.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 3731 |
|---|
| A08 | 01 | 1 | ENG | @1 Towards synchronizing linear collaborative objects with operational transformation |
|---|
| A09 | 01 | 1 | ENG | @1 Formal techniques for networked and distributed systems : FORTE 2005 : 25th IFIP WG 6.1 international conference, Taipei, Taiwan, October 2-5, 2005 : proceedings |
|---|
| A11 | 01 | 1 | | @1 IMINE (Abdessamad) |
|---|
| A11 | 02 | 1 | | @1 MOLLI (Pascal) |
|---|
| A11 | 03 | 1 | | @1 OSTER (Gérald) |
|---|
| A11 | 04 | 1 | | @1 RUSINOWITCH (Michaël) |
|---|
| A12 | 01 | 1 | | @1 WANG (Farn) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA-INRIA Lorraine @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. @Z 4 aut. |
|---|
| A20 | | | | @1 411-427 |
|---|
| A21 | | | | @1 2005 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-29189-X |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000138667290300 |
|---|
| A44 | | | | @0 0000 @1 © 2006 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 20 ref. |
|---|
| A47 | 01 | 1 | | @0 06-0067105 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 A collaborative object represents a data type (such as a text document or a filesystem) designed to be shared by multiple geographically separated users. Data replication is a technology to improve performance and availability of data in distributed systems. Indeed, each user has a local copy of the shared objects, upon which he may perform updates. Locally executed updates are then transmitted to the other users. This replication potentially leads, however, to divergent (i.e. different) copies. In this respect, Operational Transformation (OT) algorithms are applied for achieving convergence of all copies, i.e. all users view the same objects. Using these algorithms users can apply the same set of updates but possibly in different orders since the convergence should be ensured in all cases. However, achieving convergence with the OT approach is still a critical and challenging issue. In this paper, we address an open convergence problem when the shared data has a linear structure such as list, text, ordered XML tree, etc. We analyze the source of this problem and we propose a generic solution with its formal correctness. |
|---|
| C02 | 01 | X | | @0 001D02B04 |
|---|
| C03 | 01 | X | FRE | @0 Méthode formelle @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Formal method @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Método formal @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Synchronisation @5 06 |
|---|
| C03 | 02 | X | ENG | @0 Synchronization @5 06 |
|---|
| C03 | 02 | X | SPA | @0 Sincronización @5 06 |
|---|
| C03 | 03 | X | FRE | @0 Type donnée @5 07 |
|---|
| C03 | 03 | X | ENG | @0 Data type @5 07 |
|---|
| C03 | 03 | X | SPA | @0 Tipo dato @5 07 |
|---|
| C03 | 04 | X | FRE | @0 Texte @5 08 |
|---|
| C03 | 04 | X | ENG | @0 Text @5 08 |
|---|
| C03 | 04 | X | SPA | @0 Texto @5 08 |
|---|
| C03 | 05 | X | FRE | @0 Réplication @5 09 |
|---|
| C03 | 05 | X | ENG | @0 Replication @5 09 |
|---|
| C03 | 05 | X | SPA | @0 Replicación @5 09 |
|---|
| C03 | 06 | X | FRE | @0 Disponibilité @5 10 |
|---|
| C03 | 06 | X | ENG | @0 Availability @5 10 |
|---|
| C03 | 06 | X | SPA | @0 Disponibilidad @5 10 |
|---|
| C03 | 07 | X | FRE | @0 Système réparti @5 11 |
|---|
| C03 | 07 | X | ENG | @0 Distributed system @5 11 |
|---|
| C03 | 07 | X | SPA | @0 Sistema repartido @5 11 |
|---|
| C03 | 08 | X | FRE | @0 Mise à jour @5 12 |
|---|
| C03 | 08 | X | ENG | @0 Updating @5 12 |
|---|
| C03 | 08 | X | SPA | @0 Actualización @5 12 |
|---|
| C03 | 09 | X | FRE | @0 Mémoire partagée @5 13 |
|---|
| C03 | 09 | X | ENG | @0 Shared memory @5 13 |
|---|
| C03 | 09 | X | SPA | @0 Memoria compartida @5 13 |
|---|
| C03 | 10 | X | FRE | @0 Structure donnée @5 14 |
|---|
| C03 | 10 | X | ENG | @0 Data structure @5 14 |
|---|
| C03 | 10 | X | SPA | @0 Estructura datos @5 14 |
|---|
| C03 | 11 | X | FRE | @0 Langage XML @5 15 |
|---|
| C03 | 11 | X | ENG | @0 XML language @5 15 |
|---|
| C03 | 11 | X | SPA | @0 Lenguaje XML @5 15 |
|---|
| C03 | 12 | X | FRE | @0 Présentation document @5 18 |
|---|
| C03 | 12 | X | ENG | @0 Document layout @5 18 |
|---|
| C03 | 12 | X | SPA | @0 Presentación documento @5 18 |
|---|
| C03 | 13 | X | FRE | @0 Comportement rendez vous @5 19 |
|---|
| C03 | 13 | X | ENG | @0 Dating behavior @5 19 |
|---|
| C03 | 13 | X | SPA | @0 Conducta cita @5 19 |
|---|
| N21 | | | | @1 037 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems @2 25 @3 Taipei TWN @4 2005-10-02 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 06-0067105 INIST |
|---|
| ET : | Towards synchronizing linear collaborative objects with operational transformation |
|---|
| AU : | IMINE (Abdessamad); MOLLI (Pascal); OSTER (Gérald); RUSINOWITCH (Michaël); WANG (Farn) |
|---|
| AF : | LORIA-INRIA Lorraine/France (1 aut., 2 aut., 3 aut., 4 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3731; Pp. 411-427; Bibl. 20 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | A collaborative object represents a data type (such as a text document or a filesystem) designed to be shared by multiple geographically separated users. Data replication is a technology to improve performance and availability of data in distributed systems. Indeed, each user has a local copy of the shared objects, upon which he may perform updates. Locally executed updates are then transmitted to the other users. This replication potentially leads, however, to divergent (i.e. different) copies. In this respect, Operational Transformation (OT) algorithms are applied for achieving convergence of all copies, i.e. all users view the same objects. Using these algorithms users can apply the same set of updates but possibly in different orders since the convergence should be ensured in all cases. However, achieving convergence with the OT approach is still a critical and challenging issue. In this paper, we address an open convergence problem when the shared data has a linear structure such as list, text, ordered XML tree, etc. We analyze the source of this problem and we propose a generic solution with its formal correctness. |
|---|
| CC : | 001D02B04 |
|---|
| FD : | Méthode formelle; Synchronisation; Type donnée; Texte; Réplication; Disponibilité; Système réparti; Mise à jour; Mémoire partagée; Structure donnée; Langage XML; Présentation document; Comportement rendez vous |
|---|
| ED : | Formal method; Synchronization; Data type; Text; Replication; Availability; Distributed system; Updating; Shared memory; Data structure; XML language; Document layout; Dating behavior |
|---|
| SD : | Método formal; Sincronización; Tipo dato; Texto; Replicación; Disponibilidad; Sistema repartido; Actualización; Memoria compartida; Estructura datos; Lenguaje XML; Presentación documento; Conducta cita |
|---|
| LO : | INIST-16343.354000138667290300 |
|---|
| ID : | 06-0067105 |
|---|
Links to Exploration step
Pascal:06-0067105
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Towards synchronizing linear collaborative objects with operational transformation</title>
<author><name sortKey="Imine, Abdessamad" sort="Imine, Abdessamad" uniqKey="Imine A" first="Abdessamad" last="Imine">Abdessamad Imine</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Molli, Pascal" sort="Molli, Pascal" uniqKey="Molli P" first="Pascal" last="Molli">Pascal Molli</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Oster, Gerald" sort="Oster, Gerald" uniqKey="Oster G" first="Gérald" last="Oster">Gérald Oster</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">06-0067105</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 06-0067105 INIST</idno>
<idno type="RBID">Pascal:06-0067105</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000484</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Towards synchronizing linear collaborative objects with operational transformation</title>
<author><name sortKey="Imine, Abdessamad" sort="Imine, Abdessamad" uniqKey="Imine A" first="Abdessamad" last="Imine">Abdessamad Imine</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Molli, Pascal" sort="Molli, Pascal" uniqKey="Molli P" first="Pascal" last="Molli">Pascal Molli</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Oster, Gerald" sort="Oster, Gerald" uniqKey="Oster G" first="Gérald" last="Oster">Gérald Oster</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2005">2005</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Availability</term>
<term>Data structure</term>
<term>Data type</term>
<term>Dating behavior</term>
<term>Distributed system</term>
<term>Document layout</term>
<term>Formal method</term>
<term>Replication</term>
<term>Shared memory</term>
<term>Synchronization</term>
<term>Text</term>
<term>Updating</term>
<term>XML language</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Méthode formelle</term>
<term>Synchronisation</term>
<term>Type donnée</term>
<term>Texte</term>
<term>Réplication</term>
<term>Disponibilité</term>
<term>Système réparti</term>
<term>Mise à jour</term>
<term>Mémoire partagée</term>
<term>Structure donnée</term>
<term>Langage XML</term>
<term>Présentation document</term>
<term>Comportement rendez vous</term>
</keywords><front><div type="abstract" xml:lang="en">A collaborative object represents a data type (such as a text document or a filesystem) designed to be shared by multiple geographically separated users. Data replication is a technology to improve performance and availability of data in distributed systems. Indeed, each user has a local copy of the shared objects, upon which he may perform updates. Locally executed updates are then transmitted to the other users. This replication potentially leads, however, to divergent (i.e. different) copies. In this respect, Operational Transformation (OT) algorithms are applied for achieving convergence of all copies, i.e. all users view the same objects. Using these algorithms users can apply the same set of updates but possibly in different orders since the convergence should be ensured in all cases. However, achieving convergence with the OT approach is still a critical and challenging issue. In this paper, we address an open convergence problem when the shared data has a linear structure such as list, text, ordered XML tree, etc. We analyze the source of this problem and we propose a generic solution with its formal correctness.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>3731</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Towards synchronizing linear collaborative objects with operational transformation</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Formal techniques for networked and distributed systems : FORTE 2005 : 25th IFIP WG 6.1 international conference, Taipei, Taiwan, October 2-5, 2005 : proceedings</s1>
</fA09><fA11 i1="01" i2="1"><s1>IMINE (Abdessamad)</s1>
</fA11><fA11 i1="02" i2="1"><s1>MOLLI (Pascal)</s1>
</fA11><fA11 i1="03" i2="1"><s1>OSTER (Gérald)</s1>
</fA11><fA11 i1="04" i2="1"><s1>RUSINOWITCH (Michaël)</s1>
</fA11><fA12 i1="01" i2="1"><s1>WANG (Farn)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA-INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14><fA20><s1>411-427</s1>
</fA20><fA21><s1>2005</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-29189-X</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000138667290300</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>20 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>06-0067105</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>A collaborative object represents a data type (such as a text document or a filesystem) designed to be shared by multiple geographically separated users. Data replication is a technology to improve performance and availability of data in distributed systems. Indeed, each user has a local copy of the shared objects, upon which he may perform updates. Locally executed updates are then transmitted to the other users. This replication potentially leads, however, to divergent (i.e. different) copies. In this respect, Operational Transformation (OT) algorithms are applied for achieving convergence of all copies, i.e. all users view the same objects. Using these algorithms users can apply the same set of updates but possibly in different orders since the convergence should be ensured in all cases. However, achieving convergence with the OT approach is still a critical and challenging issue. In this paper, we address an open convergence problem when the shared data has a linear structure such as list, text, ordered XML tree, etc. We analyze the source of this problem and we propose a generic solution with its formal correctness.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B04</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Méthode formelle</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Formal method</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Método formal</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Synchronisation</s0>
<s5>06</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Synchronization</s0>
<s5>06</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Sincronización</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Type donnée</s0>
<s5>07</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Data type</s0>
<s5>07</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Tipo dato</s0>
<s5>07</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Texte</s0>
<s5>08</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Text</s0>
<s5>08</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Texto</s0>
<s5>08</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Réplication</s0>
<s5>09</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Replication</s0>
<s5>09</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Replicación</s0>
<s5>09</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Disponibilité</s0>
<s5>10</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Availability</s0>
<s5>10</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Disponibilidad</s0>
<s5>10</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Système réparti</s0>
<s5>11</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Distributed system</s0>
<s5>11</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Sistema repartido</s0>
<s5>11</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Mise à jour</s0>
<s5>12</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Updating</s0>
<s5>12</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Actualización</s0>
<s5>12</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Mémoire partagée</s0>
<s5>13</s5>
</fC03><fC03 i1="09" i2="X" l="ENG"><s0>Shared memory</s0>
<s5>13</s5>
</fC03><fC03 i1="09" i2="X" l="SPA"><s0>Memoria compartida</s0>
<s5>13</s5>
</fC03><fC03 i1="10" i2="X" l="FRE"><s0>Structure donnée</s0>
<s5>14</s5>
</fC03><fC03 i1="10" i2="X" l="ENG"><s0>Data structure</s0>
<s5>14</s5>
</fC03><fC03 i1="10" i2="X" l="SPA"><s0>Estructura datos</s0>
<s5>14</s5>
</fC03><fC03 i1="11" i2="X" l="FRE"><s0>Langage XML</s0>
<s5>15</s5>
</fC03><fC03 i1="11" i2="X" l="ENG"><s0>XML language</s0>
<s5>15</s5>
</fC03><fC03 i1="11" i2="X" l="SPA"><s0>Lenguaje XML</s0>
<s5>15</s5>
</fC03><fC03 i1="12" i2="X" l="FRE"><s0>Présentation document</s0>
<s5>18</s5>
</fC03><fC03 i1="12" i2="X" l="ENG"><s0>Document layout</s0>
<s5>18</s5>
</fC03><fC03 i1="12" i2="X" l="SPA"><s0>Presentación documento</s0>
<s5>18</s5>
</fC03><fC03 i1="13" i2="X" l="FRE"><s0>Comportement rendez vous</s0>
<s5>19</s5>
</fC03><fC03 i1="13" i2="X" l="ENG"><s0>Dating behavior</s0>
<s5>19</s5>
</fC03><fC03 i1="13" i2="X" l="SPA"><s0>Conducta cita</s0>
<s5>19</s5>
</fC03><fN21><s1>037</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems</s1>
<s2>25</s2>
<s3>Taipei TWN</s3>
<s4>2005-10-02</s4>
</fA30><server><NO>PASCAL 06-0067105 INIST</NO>
<ET>Towards synchronizing linear collaborative objects with operational transformation</ET>
<AU>IMINE (Abdessamad); MOLLI (Pascal); OSTER (Gérald); RUSINOWITCH (Michaël); WANG (Farn)</AU>
<AF>LORIA-INRIA Lorraine/France (1 aut., 2 aut., 3 aut., 4 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3731; Pp. 411-427; Bibl. 20 ref.</SO>
<LA>Anglais</LA>
<EA>A collaborative object represents a data type (such as a text document or a filesystem) designed to be shared by multiple geographically separated users. Data replication is a technology to improve performance and availability of data in distributed systems. Indeed, each user has a local copy of the shared objects, upon which he may perform updates. Locally executed updates are then transmitted to the other users. This replication potentially leads, however, to divergent (i.e. different) copies. In this respect, Operational Transformation (OT) algorithms are applied for achieving convergence of all copies, i.e. all users view the same objects. Using these algorithms users can apply the same set of updates but possibly in different orders since the convergence should be ensured in all cases. However, achieving convergence with the OT approach is still a critical and challenging issue. In this paper, we address an open convergence problem when the shared data has a linear structure such as list, text, ordered XML tree, etc. We analyze the source of this problem and we propose a generic solution with its formal correctness.</EA>
<CC>001D02B04</CC>
<FD>Méthode formelle; Synchronisation; Type donnée; Texte; Réplication; Disponibilité; Système réparti; Mise à jour; Mémoire partagée; Structure donnée; Langage XML; Présentation document; Comportement rendez vous</FD>
<ED>Formal method; Synchronization; Data type; Text; Replication; Availability; Distributed system; Updating; Shared memory; Data structure; XML language; Document layout; Dating behavior</ED>
<SD>Método formal; Sincronización; Tipo dato; Texto; Replicación; Disponibilidad; Sistema repartido; Actualización; Memoria compartida; Estructura datos; Lenguaje XML; Presentación documento; Conducta cita</SD>
<LO>INIST-16343.354000138667290300</LO>
<ID>06-0067105</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000484 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000484 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:06-0067105
|texte= Towards synchronizing linear collaborative objects with operational transformation
}}
| This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 |  |
