Exploiting schemas in data synchronization

  • Authors:
  • J. Nathan Foster;Michael B. Greenwald;Christian Kirkegaard;Benjamin C. Pierce;Alan Schmitt

  • Affiliations:
  • University of Pennsylvania;Bell Labs, Lucent Technologies;BRICS, University of Aarhus;University of Pennsylvania;INRIA, Rhône-Alpes

  • Venue:
  • DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Increased reliance on optimistic data replication has led to burgeoning interest in tools and frameworks for synchronizing disconnected updates to replicated data. We have implemented a generic synchronization framework, called Harmony, that can be used to build statebased synchronizers for a wide variety of tree-structured data formats. A novel feature of this framework is that the synchronization process—in particular, the recognition of conflicts—is driven by the schema of the structures being synchronized. We formalize Harmony’s synchronization algorithm, state a simple and intuitive specification, and illustrate how it can be used to synchronize trees representing a variety of specific forms of application data, including sets, records, and tuples.