@inproceedings{liu2003repository,
  abstract = {The Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH) began as an alternative to distributed searching of scholarly eprint repositories. The model embraced by the OAI-PMH is that of metadata harvesting, where value-added services (by a "service provider") are constructed on cached copies of the metadata extracted from the repositories of the harvester's choosing. While this model dispenses with the well known problems of distributed searching, it introduces the problem of synchronization. Stated simply, this problem arises when the service provider's copy of the metadata does not match the metadata currently at the constituent repositories. We define some metrics for describing the synchronization problem in the OAI-PMH. Based on these metrics, we study the synchronization problem of the OAI-PMH framework and propose several approaches for harvesters to implement better synchronization. In particular, if a repository knows its update frequency, it can publish it in an OAI-PMH Identify response using an optional About container that borrows from RDF Site Syndication (RSS) Format.},
  acmid = {827172},
  address = {Washington, DC, USA},
  author = {Liu, Xiaoming and Maly, Kurt and Zubair, Mohammad and Nelson, Michael L.},
  booktitle = {Proceedings of the 3rd ACM/IEEE-CS joint conference on Digital libraries},
  interhash = {ccdfcb620c74992cfffe946cf4fdd93a},
  intrahash = {77474654b2e57fc8eff45a0190294547},
  isbn = {0-7695-1939-3},
  location = {Houston, Texas},
  numpages = {8},
  pages = {191--198},
  publisher = {IEEE Computer Society},
  title = {Repository synchronization in the OAI framework},
  url = {http://dl.acm.org/citation.cfm?id=827140.827172},
  year = 2003
}

@inproceedings{vandesompel2010httpbased,
  abstract = {Dereferencing a URI returns a representation of the current state of the resource identified by that URI. But, on the Web representations of prior states of a resource are also available, for example, as resource versions in Content Management Systems or archival resources in Web Archives such as the Internet Archive. This paper introduces a resource versioning mechanism that is fully based on HTTP and uses datetime as a global version indicator. The approach allows "follow your nose" style navigation both from the current time-generic resource to associated time-specific version resources as well as among version resources. The proposed versioning mechanism is congruent with the Architecture of the World Wide Web, and is based on the Memento framework that extends HTTP with transparent content negotiation in the datetime dimension. The paper shows how the versioning approach applies to Linked Data, and by means of a demonstrator built for DBpedia, it also illustrates how it can be used to conduct a time-series analysis across versions of Linked Data descriptions.},
  author = {Van de Sompel, Herbert and Sanderson, Robert and Nelson, Michael L. and Balakireva, Lyudmila L. and Shankar, Harihar and Ainsworth, Scott},
  booktitle = {Proceedings of Linked Data on the Web (LDOW2010)},
  interhash = {0c517e7799d2c2da3f9b2a0daff27885},
  intrahash = {8f9405e8056dd827d9c72a48e229a65a},
  number = {1003.3661},
  publisher = {arXiv},
  series = {cs.DL},
  title = {An HTTP-Based Versioning Mechanism for Linked Data},
  url = {http://arxiv.org/abs/1003.3661},
  year = 2010
}