Replicated Data Management for Mobile Computing

Terry, Douglas B.

doi:10.1007/978-3-031-02477-1

Cited by 10 publications

(2 citation statements)

References 87 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is equally valid that this song had already been in the list before and has just been deleted by the mother and would therefore have to be removed from the reconciled list. This uncertainty is commonly referred to as the create-delete ambiguity [17]. A common workaround is to apply a heuristic instead, like building the superset of the conflicting lists [5].…”

Section: B Lost Updatesmentioning

confidence: 99%

“…OT does not require explicit conflict resolution or total ordering of conflicting operations. Instead, concurrent operations arriving in different orders at replicas are transformed, so that the effects of the operations are the same as if they had arrived at each replica in the same order [17] [26]. OT has been studied thoroughly in the context of groupware, in particular with collaborative text editing scenarios including Jupiter [27], Google Docs [28] and Google Realtime API.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Semantics-Driven Optimistic Data Replication: Towards a Framework Supporting Software Architects and Developers

Braun

2017

2017 IEEE International Conference on Software Architecture Workshops (ICSAW)

View full text Add to dashboard Cite

Optimistic data replication is an important enabling technology for high availability and scalability, but the disadvantage is that it can only guarantee eventual consistency. Inconsequence, apps might observe stale data and write conflicts. In practice, optimistic data replication is usually part of data base systems that implement detection and resolution of conflicts with purely syntactic techniques. On the downside, this can lead to conflicts that are impossible to detect and resolve correctly by using the database framework only, ultimately resulting in concurrency anomalies. In order to avoid concurrency anomalies, developers are forced to use error-prone workarounds, there by increasing application complexity significantly. An alternative to using existing database replication would be to implement a custom solution tailored to the application semantics that could minimize the occurrence of write conflicts and concurrency anomalies. However, the realization of custom solutions driven by application semantics is very difficult in practice, due to the complexity of concurrency control in distributed systems. In this position paper we demonstrate practical problems related to state of-the-practice optimistic data replication and motivate the need for semantics-driven solutions. Our research aims at simplifying the development of custom solutions by delivering a frame workfor semantics-driven optimistic data replication. This frame work consists of a technical part and accompanying concepts for the design of extended domain models optimized for optimistic data replication and conflict minimization

show abstract

Section: B Lost Updatesmentioning

confidence: 99%