Authors:
and
Elod P. Csirmaz
elod@epcsirmaz.com
Elod P. Csirmaz
Rényi Insititute, Budapest, Hungary
Search for other papers by Elod P. Csirmaz in
Current site
Google Scholar
PubMed
Search for other papers by Elod P. Csirmaz in
Current site
Google Scholar
PubMed
Laszlo Csirmaz
csirmaz@renyi.hu
Laszlo Csirmaz
Rényi Insititute, Budapest, Hungary
UTIA, Prague, Czechia
Search for other papers by Laszlo Csirmaz in
Current site
Google Scholar
PubMed
UTIA, Prague, Czechia
Search for other papers by Laszlo Csirmaz in
Current site
Google Scholar
PubMed
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.
ProCite
RefWorks
Reference Manager
BibTeX
Zotero
EndNote
-
[1]
F. Baader and T. Nupkow. Term rewriting and All That. Cambridge Univ. Press, 1998.
-
[2]
S. Balasubramaniam and B. C. Pierce. What is a File Synchronizer? In Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking. New York, NY. ACM, 1998, pp. 98–108.
-
[3]
M. Beaudry. Finite Idempotent Grupoids and Regular Languages. Informatique Théorique et Applications, 32:127–140, 1998.
-
[4]
C. Berzan and N. Ramsey. Summer Scholars Technical Report. Tuftst University, Medford, MA, 2010. Available as http://thirld.com/files/summerscholars_techreport.pdf.
-
[5]
E. P. Csirmaz. Algebraic File Synchronization: Adequacy and Completeness. arXiv: 1601.01736.
-
[6]
J. N. Foster, M. B. Greenwald, C. Kirkegaard, B. C. Pierce and A. Schmitt. Exploiting Schemas in Data Synchronization. In G. Bierman and C. Koch (eds) Database Program- ming Languages. Springer Berlin Heidelberg, 2005, pp. 42–57.
-
[7]
A-M. Kermarrec, A. Rowstron, M. Shapiro and P. Druschel. The IceCube Approach to the Reconciliation of Divergent Replicas. In Proceedings of the Twentieth Annual ACM Sym-posium on Principles of Distributed Computing. New York, NY. ACM, 2001, pp. 210–218.
-
[8]
V. Martins, E. Pacitti and P. Valduriez. Distributed Semantic Reconciliation of Replicated Data. in Proc. of CDUR, Paris, France. CNAM, 2005, pp. 48–53.
-
[9]
A. Ng and C. Sun. Operational Transformation for Real-time Synchronization of Shared Workspace in Cloud Storage. In Proceedings of the 19th International Conference on Sup- porting Group Work (GROUP ’16). Association for Computing Machinery, New York, NY, ACM, 61–70, 2016.
-
[10]
B. C. Pierce and J. Vouillon. What’s in Unison? A Formal Specification and Reference Im- plementation of a File Synchronizer. U. of Pennsylvania Technical Reports (CIS) 40, 2004. Available as http://repository.upenn.edu/cis_reports/40.
-
[11]
N. Ramsey and E. Csirmaz. An Algebraic Approach to File Synchronization. In Proceedings of the Joint 8th European Software Engineering Conference and 9th ACM SIGSOFT Symposium on the Foundations of Software Engineering. New York, NY. ACM, 2001, pp. 175–185.
-
[12]
Y. Saito and M. Shapiro. Optimistic Replication. In ACM Computing Surveys 2005, vol. 37, no. 1. pp. 42–81.
-
[13]
M. Shapiro, N. Preguiça, C. Baquero and M. Zawirski. Confiict-Free Replicated Data Types. In: X. Défago, F. Petit, V. Villain (eds) Stabilization, Safety, and Security of Distributed Systems. Lecture Notes in Computer Science, vol 6976. Springer, 2011, pp. 386–400.
-
[14]
C. Sun and C. Ellis. (1998, November). Operational Transformation in Real-time Group Editors: Issues, Algorithms, and Achievements. In Proceedings of the 1998 ACM conference on Computer supported cooperative work. pp. 59–68.
-
[15]
V. Tao and M. Shapiro and V. Rancurel. Merging Semantics for Confiict Updates in Geo- distributed File Systems. In Proceedings of the 8th ACM International Systems and Storage Conference. New York, NY. ACM, 2015, pp. 10:1–10:12.
-
[16]
D. B. Terry et al. Managing Update Confiicts in Bayou, a Weakly Connected Replicated Storage System. In Proceedings of the Fifteenth ACM Symposium on Operating Systems Prin- ciples. New York, NY. ACM, 1995, pp. 172–182.
Editors in Chief
Gábor SIMONYI (Rényi Institute of Mathematics)
András STIPSICZ (Rényi Institute of Mathematics)
Géza TÓTH (Rényi Institute of Mathematics)
Managing Editor
Gábor SÁGI (Rényi Institute of Mathematics)
Editorial Board
- Imre BÁRÁNY (Rényi Institute of Mathematics)
- Károly BÖRÖCZKY (Rényi Institute of Mathematics and Central European University)
- Péter CSIKVÁRI (ELTE, Budapest)
- Joshua GREENE (Boston College)
- Penny HAXELL (University of Waterloo)
- Andreas HOLMSEN (Korea Advanced Institute of Science and Technology)
- Ron HOLZMAN (Technion, Haifa)
- Satoru IWATA (University of Tokyo)
- Tibor JORDÁN (ELTE, Budapest)
- Roy MESHULAM (Technion, Haifa)
- Frédéric MEUNIER (École des Ponts ParisTech)
- Márton NASZÓDI (ELTE, Budapest)
- Eran NEVO (Hebrew University of Jerusalem)
- János PACH (Rényi Institute of Mathematics)
- Péter Pál PACH (BME, Budapest)
- Andrew SUK (University of California, San Diego)
- Zoltán SZABÓ (Princeton University)
- Martin TANCER (Charles University, Prague)
- Gábor TARDOS (Rényi Institute of Mathematics)
- Paul WOLLAN (University of Rome "La Sapienza")
STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA
Gábor Sági
Address: P.O. Box 127, H–1364 Budapest, Hungary
Phone: (36 1) 483 8344 ---- Fax: (36 1) 483 8333
E-mail: smh.studia@renyi.mta.hu
Indexing and Abstracting Services:
- CABELLS Journalytics
- CompuMath Citation Index
- Essential Science Indicators
- Mathematical Reviews
- Science Citation Index Expanded (SciSearch)
- SCOPUS
- Zentralblatt MATH
| 2023 | |
|---|---|
| Web of Science | |
| Journal Impact Factor | 0.4 |
| Rank by Impact Factor | Q4 (Mathematics) |
| Journal Citation Indicator | 0.49 |
| Scopus | |
| CiteScore | 1.3 |
| CiteScore rank | Q2 (General Mathematics) |
| SNIP | 0.705 |
| Scimago | |
| SJR index | 0.239 |
| SJR Q rank | Q3 |
| Studia Scientiarum Mathematicarum Hungarica | |
|---|---|
| Publication Model | Hybrid |
| Submission Fee | none |
| Article Processing Charge | 900 EUR/article (only for OA publications) |
| Printed Color Illustrations | 40 EUR (or 10 000 HUF) + VAT / piece |
| Regional discounts on country of the funding agency | World Bank Lower-middle-income economies: 50% World Bank Low-income economies: 100% |
| Further Discounts | Editorial Board / Advisory Board members: 50% Corresponding authors, affiliated to an EISZ member institution subscribing to the journal package of Akadémiai Kiadó: 100% |
| Subscription fee 2025 | Online subsscription: 796 EUR / 876 USD Print + online subscription: 900 EUR / 988 USD |
| Subscription Information | Online subscribers are entitled access to all back issues published by Akadémiai Kiadó for each title for the duration of the subscription, as well as Online First content for the subscribed content. |
| Purchase per Title | Individual articles are sold on the displayed price. |
| Studia Scientiarum Mathematicarum Hungarica | |
|---|---|
| Language | English French German |
| Size | B5 |
| Year of Foundation |
1966 |
| Volumes per Year |
1 |
| Issues per Year |
4 |
| Founder | Magyar Tudományos Akadémia  |
| Founder's Address |
H-1051 Budapest, Hungary, Széchenyi István tér 9. |
| Publisher | Akadémiai Kiadó |
| Publisher's Address |
H-1117 Budapest, Hungary 1516 Budapest, PO Box 245. |
| Responsible Publisher |
Chief Executive Officer, Akadémiai Kiadó |
| ISSN | 0081-6906 (Print) |
| ISSN | 1588-2896 (Online) |
Monthly Content Usage
| Abstract Views | Full Text Views | PDF Downloads | |
|---|---|---|---|
| Oct 2024 | 55 | 1 | 1 |
| Nov 2024 | 42 | 0 | 0 |
| Dec 2024 | 39 | 0 | 0 |
| Jan 2025 | 29 | 0 | 0 |
| Feb 2025 | 32 | 0 | 0 |
| Mar 2025 | 25 | 0 | 0 |
| Apr 2025 | 0 | 0 | 0 |
Author:
Author:
Author:
Author:
Copyright Akadémiai Kiadó AKJournals is the trademark of Akadémiai Kiadó's journal publishing business branch.
Powered by PubFactory