<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>April</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>An HTTP-Based Versioning Mechanism for Linked Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Herbert Van de Sompel</string-name>
          <email>herbertv@lanl.gov</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lyudmila L. Balakireva</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Robert Sanderson</string-name>
          <email>rsanderson@lanl.gov</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Harihar Shankar</string-name>
          <email>harihar@lanl.gov</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michael L. Nelson</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Scott Ainsworth</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Los Alamos National, Laboratory</institution>
          ,
          <addr-line>NM</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Old Dominion University</institution>
          ,
          <addr-line>Norfolk, VA</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2010</year>
      </pub-date>
      <volume>27</volume>
      <issue>2010</issue>
      <abstract>
        <p>Dereferencing a URI returns a representation of the current state of the resource identi ed 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-speci c 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.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Categories and Subject Descriptors</title>
      <p>H.3.5 [Information Storage and Retrieval]: Online
Information Services</p>
    </sec>
    <sec id="sec-2">
      <title>1. INTRODUCTION</title>
      <p>
        The Architecture of the World Wide Web [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] states that
dereferencing a URI yields a representation of the (current)
state of the resource identi ed by that URI, and highlights
the impracticality of keeping prior states accessible at their
own distinct URIs:
      </p>
      <p>Resource state may evolve over time. Requiring a
URI owner to publish a new URI for each change
in resource state would lead to a signi cant
number of broken references. For robustness, Web
architecture promotes independence between an
identi er and the state of the identi ed resource.</p>
      <p>Nevertheless, use cases abound that require the
availability of (representations of) distinct prior states of resources.
Resource versioning is of crucial importance in areas as
diverse as community-driven content creation, open
government, and scienti c communication. Also, as more data
becomes available in the Linked Data cloud, the need to version
them will increase if only to allow e cient update of stores
that leverage the data, and to trace their provenance. Web
archives and content management systems possess signi
cant amounts of prior versions of resources, but these prior
versions are largely disconnected from current versions and
discoverable only in an ad-hoc manner. Given this state of
Web resource versioning, we consider these challenges:
1. Given the current version of a resource, how can
\follow your nose" style navigation to prior versions of the
resource be achieved?
2. Given any version of a resource and a particular
timestamp, how can \follow your nose" style navigation
towards another version that matches the timestamp be
achieved?</p>
      <p>
        This paper is concerned with versioning mechanisms that
are machine-actionable, have global scope, and are
independent of media-type. Hence, approaches that are
mainly bene cial to human users such as untyped hyperlinks
in HTML with anchor text that provides navigational
guidance (e.g. \previous/next version"), or version semantics
expressed in metadata-carrying URIs [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] are not
considered. Also, mechanisms that have version indicators speci c
to a certain server such as the deprecated \Content-Version"
header eld from RFC 2068 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] are not considered. Similarly,
versioning mechanisms that are speci c to media-types such
as the link element combined with the \prev" and \next"
relationships as used in HTML [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] or Atom [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] are not
considered.
      </p>
      <p>Our contributions are a resource versioning mechanism
based on the global notion of time and an HTTP-based
mechanism to navigate across versions. Furthermore, we
demonstrate how these contributions can be applied for time
series analysis across resource versions, and illustrate this
using a linked data example.</p>
      <p>The remainder of this paper is structured as follows:
Section 2 discusses and illustrates characteristics of resource
versioning approaches; Section 3 provides an introduction
to the Memento framework that extends HTTP with
transparent datetime content negotiation capabilities; Section 4
shows how the Memento framework suggests an elegant
resource versioning approach that is fully based on HTTP;
Section 5 shows how the Memento versioning ideas apply to
Linked Data; Section 6 describes the demonstrator we built
for the DBpedia environment to illustrate how the proposed
versioning mechanism can be used to access prior
descriptions of DBpedia concepts via their existing DBpedia URIs.
In the same section, we also show how this mechanism was
used to conduct a time-series analysis of Gross Domestic
Product values for several countries across DBpedia
versions. Section 7 reviews some related work, and Section
8 holds our conclusions.</p>
    </sec>
    <sec id="sec-3">
      <title>RESOURCE VERSIONING</title>
      <p>This Section introduces core characteristics of versioning
approaches, discusses these characteristics for a typical
resource versioning approach, and evaluates how that
versioning approach can meet the challenges (1) and (2) from the
Introduction.
2.1</p>
    </sec>
    <sec id="sec-4">
      <title>Versioning Characteristics</title>
      <p>The following four core characteristics of versioning
approaches are considered:
1. Identi cation: By which means are di erent versions
identi ed?
2. Versioning Strategy : What is the approach used to
assign identi ers to versions, e.g. do new versions receive
a new identi er, do they inherit a prior identi er, etc.?
3. Version Relationships: How are version relationships
between resources expressed?
4. Version Timestamping : How is the datetime
associated with versions conveyed?
2.2</p>
      <p>
        A Typical Resource Versioning Approach
The quote from the Architecture of the World Wide Web
implicitly suggests a versioning approach as depicted at the
top of Figure 1. This approach is described in terms of the
aforementioned core characteristics:
1. Identi cation: HTTP URIs are used to identify
versions of resources; each version has its own URI.
2. Versioning Strategy : A new URI is minted for each for
each new version. When a use case requires that a
resource URI-R0 that started its existence at t0, but at
time t1 changes state in such a way that a distinct
identity is needed, a new resource with URI-R1 is minted.
And, if consecutively at time t2 a change in state of
URI-R1 again requires a new identity, a resource
URIR2 is created (top of Figure 1). URI-R0, URI-R1, and
URI-R2 co-exist and, in terms of [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and its
associated ontology1 are time-speci c resources. They
represent the evolving state of a not explicitly de ned,
1Ontology for Relating Generic and Speci c Information
Resources http://www.w3.org/2006/gen/ont
      </p>
      <p>
        abstract resource and are interlinked by the http:
//www.w3.org/2006/gen/ont#sameWorkAs property.
3. Version Relationships: Can be made available as RDF
metadata published about and linked from the related
resources. The common Dublin Core Terms2
hasVersion and isVersionOf predicates (bottom of Figure 1)
can be used. Alternatively, the machine-processable
and media-independent HTTP Link header [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] can
be used in combination with the registered prev and
next relationships to express version-relationship
semantics. In both cases, it should be noted that the
semantics of the relationships do not strictly only
apply to time-based version relationships: hasVersion is
used in cases where \a related resource is a version,
edition, or adaptation of the described resource", whereas
next refers to \the next resource in an ordered series
of resources".
4. Version Timestamping : In case of the aforementioned
RDF approach, additional triples can be introduced
to express version timestamps. For example, at the
bottom of Figure 1, the Dublin Core Terms
predicates created and modi ed are used in accordance to
the description for time-speci c resource given in the
aforementioned ontology as being a resource for which
\the dates of creation and of last modi cation are
the same". It is unclear how a version timestamp
can appropriately be expressed when using the HTTP
Link element: conveying such information is not
speci ed for the prev and next relationships, the HTTP
Last-Modi ed header does not provide reliable
version semantics, and use of metadata embedded in the
linked resource yields an approach that is dependent
on media-type.
      </p>
      <p>The above characterization reveals the technological
substrates that are used in the considered versioning approaches:
2http://dublincore.org/documents/dcmi-terms/
for the RDF approach, URIs, HTTP, RDF, and an
appropriate RDF vocabulary; for the HTTP Link approach, URIs,
HTTP, HTTP Link, and registered link relationships. For
both approaches, applications such as browser plug- ins, can
be created to support the navigation described in question
(1) above, whereby the starting point would be the current
resource URI-R2. Also (2) can be achieved for the RDF
approach, although a processor would need to traverse versions
until a matching datetime is found. Lacking appropriate
version datetime information, (2) can not reliably be achieved
in case of the HTTP Link header.</p>
      <p>To summarize, both (1) and (2) can be achieved for the
RDF approach, however: (a) Two technological substrates,
HTTP and RDF, must be combined (b) Version datetime
can not be used as a primary entry point; rather resource
versions must be traversed until a version with a
matching datetime is found (3) The common predicates used to
express version relationships do not necessarily imply
timebased version relations.</p>
    </sec>
    <sec id="sec-5">
      <title>THE MEMENTO FRAMEWORK</title>
      <p>
        The basic motivation for the Memento3 work [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] is
achieving a tighter integration between the current and the past
Web. Remnants of the past Web exist both in version-aware
servers such as Content Management Systems (CMS, e.g.
Wikipedia) and Version Control Systems, and in
specialpurpose Web Archives such as the Internet Archive4 and
the on-demand WebCite5 archive. Whereas a current
representation of a resource is available from its URI-R, prior
representations - if they exist - are available from distinct
resources URI-Mi (i=1..n) that encapsulate the state
URIR had at times ti, with ti prior to the current time. In the
Memento framework, the resource that provides the current
representation is named the Original Resource, whereas
resources that provide prior representations are named
Mementos. More formally, a Memento for a resource URI-R
(as it existed) at time ti is a resource URI-Mi[URI-R@ti]
for which a representation at any moment past its creation
time tc is the same as a representation that was available
from URI-R at time ti, with tc ti. Implicit in this
definition is the notion that, once created, a Memento always
keeps the same representation.
      </p>
      <p>
        From a HTTP perspective, URI-R and URI-Mi are
disconnected in that HTTP provides no means to navigate
towards a URI-Mi via its original URI-R. The Memento
framework introduces this missing capability as follows (Figure 2):
Inspired by Transparent Content Negotiation for HTTP
(conneg from now on) speci ed in RFC 2295 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] that
allows HTTP clients to negotiate with HTTP servers
in four dimensions (media type, language, character
set, compression), Memento introduces conneg in a
fth dimension: datetime. RFC 2295 introduces the
notion of a transparently negotiable resource as the
resource that is the target of conneg, and variant
resources that vary according to the aforementioned
negotiable dimensions. Similarly, Memento introduces
the notion of a TimeGate URI-G as a resource that
supports conneg in the datetime dimension, and
Mementos URI-Mi[URI-R@ti] as the resources that vary
3http://mementoweb.org/
4http://archive.org/
5http://webcitation.org/
according to the datetime dimension. In a manner
symmetrical to the way RFC 2295 introduces the
AcceptLanguage request header to express the client's
language preferences, and the Content-Language response
header to express the language returned by the server,
Memento introduces the Accept-Datetime and
ContentDatetime headers to express the client's preferred
datetime for a Memento, and the datetime of the Memento
returned by its hosting server, respectively. It can be
noted that, although RFC 2295 did not specify
datetime conneg, its desirability is at least suggested by
Tim Berners-Lee's Generic Resources Statement [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
as all other dimensions of genericity described in it
(language, media-type, target-medium) are covered by
RFC 2295.
      </p>
      <p>
        In order to support discovery of a TimeGate URI-G
for a resource URI-R, a relationship type of timegate is
introduced for the HTTP Link response header [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. In
case of servers that have internal versioning/archiving
support (such as CMS) a TimeGate URI-G for URI-R
can typically be exposed by the server of URI-R itself.
In cases whereby servers rely on third parties for their
versioning/archiving (for example by being recurrently
crawled by the Internet Archive), URI-R and URI-G
will reside on di erent servers. In addition, in order
to allow discovering the Original Resource associated
with a Memento, another special-purpose HTTP Link
header, this time with a relationship type of original
is introduced.
      </p>
      <p>
        Memento also introduces the notion of a
TimeBundle resource via which an overview is available of all
Mementos that a server hosts for a given (internal or
external) URI-R. A TimeBundle is a non-information
resource [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] modeled as an ORE Aggregation [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] in
which all Aggregated Resources share a temporal
relationship with the Original Resource. A TimeBundle is
described by a TimeMap, which is a specialization of
an ORE Resource Map. A TimeMap lists all URI-Mi
for a given URI-R as well as their associated
metadata including timestamp. It also lists the Original
Resource URI-R and its TimeGate URI-G. Appendix
A shows an example RDF/XML TimeMap; other
serializations such as Turtle and Atom are possible.
Discovery of TimeBundles is supported by the rel value
timebundle in the HTTP Link response header.
      </p>
      <p>
        Three aspects of the Memento architecture ensure that the
globally deployed HTTP caching infrastructure can be
leveraged. First, the Original Resource URI-R and its TimeGate
URI-G are always separate resources: URI-R is a
conventional resource and URI-G is dedicated to datetime conneg.
This eliminates caching problems that would be caused by
transitioning URI-R between non-negotiable and negotiable
if URI-R and URI-G were to coincide. Second, the initial
Memento architecture [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], required the Original Resource
URI-R to 302 redirect to its TimeGate URI-G; as a result,
cached versions of URI-R could not be leveraged. By using
the timegate HTTP Link for discovery of URI-G, Memento
clients work with caches instead of against them. Third,
URI-G and URI-M are never the same resource so the
Mementos (URI-M) can be cached as well.
      </p>
      <p>
        A detailed overview of HTTP request/response
scenarios is available in the Memento HTTP Transactions Guide6.
Here, we highlight certain aspects related to HTTP
interactions with the TimeGate URI-G. A choice was made to
handle cases in which URI-G is dereferenced without the
Accept-Datetime header, by issuing a \302 Found" redirect
to the most recent Memento, as opposed to o ering a list
of choices to the client. While a list would be feasible for a
top-level resource (say, an HTML page), it would be
cumbersome for the potentially many embedded resources (say, the
images in the HTML page). URI-G will only return HTTP
response code \300 Multiple Choices" if explicitly requested
with a \Negotiate: 1.0" request header or when there are
multiple Mementos with the same Content-Datetime7.
URIG will return HTTP response code \406 Not Acceptable"
when the Accept-Datetime is outside of the datetime range
of known Mementos. For further technical details about the
Memento framework, we refer to the original paper [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], and
the more recent overview of the evolved solution [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] that
has resulted from feedback to the original ideas provided by
both the Linked Data and Web Archiving communities.
      </p>
      <p>Since its publication, Memento has received signi cant
attention. Major Web Archives have started implementing
support8, and work is ongoing to develop support for
common CMS platforms such as MediaWiki and Drupal. Also,
the establishment of a Memento-track at the JISC
Developer Days (Dev8D)9 organized by the UK's Joint
Information Systems Committee is an early indication of interest by
both funders and implementers.</p>
      <p>As an illustration, Figure 3 shows a Memento HTTP ow
whereby a client requests a November 8 2009 version of the
Wikipedia page for DJ Shadow, by interacting with its
current URI http://en.wikipedia.org/wiki/DJ_Shadow; the
client is pointed by http://en.wikipedia.org/wiki/DJ_Shadow
to a TimeGate at Wikipedia; via that TimeGate the client
successfully retrieves a Memento that meets its datetime
preferences (only headers crucial to convey an
understanding of datetime conneg are shown). We should point out
that Wikipedia has not (yet) implemented such Memento
HTTP ows, but a MediaWiki plug-in that adds Memento
support is available10.
6http://www.mementoweb.org/guide/http/
7This may occur as HTTP only supports second-level time
granularity
8See Agenda of First Memento Implementation Meeting at
http://mementoweb.org/events/IA201002/
9http://wiki.2010.dev8d.org/w/Talk_6
10Memento MediaWiki plug-in http://www.mediawiki.org/
In Figure 3, note the use of the HTTP Link header to
express the very rst and most recent Mementos available from
Wikipedia (rel=\ rst-memento" and rel=\last-memento",
respectively) as well as the Mementos that are closest in time
(rel=\prev-memento" and rel=\next-memento") to the one
that is returned. Note also the use of a HTTP Link header
to point back to the Original Resource (rel=\original").
4.</p>
      <p>MEMENTO RESOURCE VERSIONING
The Memento framework suggests a versioning
mechanism that is fully based on HTTP (see Figure 4). These
are its core characteristics:</p>
      <p>Identi cation: HTTP URIs are used to identify
versions of resources.</p>
      <p>
        Versioning Strategy : The top of Figure 4 shows URI-R
as the resource from which at any point in time the
current representation is served, and URI-Mi as resources
that provide access to representations that were
previously available from URI-R. In terms of [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and its
associated ontology11, URI-R is a time-generic resource,
whereas all URI-Mi are time-speci c resources. This
strategy is di erent than the one shown in Figure 1, yet
aligned with the stable URI principle of Cool URIs [
        <xref ref-type="bibr" rid="ref18 ref3">3,
18</xref>
        ]: instead of minting a new URI for every new
version, keep the URI stable and mint new URIs for old
versions. This approach has become rather widespread;
for example, http://cnn.com and http://en.wikipedia.
org/wiki/DJ_Shadow are such URI-R, whereas http:
//web.archive.org/web/20010911203610/http://www.
cnn.com and http://en.wikipedia.org/w/index.php?
title=DJ_Shadow&amp;oldid=337446696 are examples of
respective URI-Mi.
      </p>
      <p>Version Relationships: A timegate HTTP Link header
provided in response to GET/HEAD requests issued
against the stable URI-R points at a TimeGate. And,
an original HTTP Link header provided in response
to GET/HEAD requests issued at Mementos URI-Mi
points at URI-R of the Original Resource. As
described, a TimeGate supports datetime conneg based
on the content of the Accept-Datetime header. It is
a time-travel resource that acts as a gateway between
the time-generic URI-R and its associated time-speci c
Mementos URI-Mi. The result of the datetime conneg
is a Memento that meets the expressed datetime
preference. Also, the prev-memento and next-memento
relationships may be used in the HTTP Link header to
point at Mementos that are adjacent in time to the
returned one.</p>
      <p>Version Timestamping : Versioning of URI-R is not
required as it always is the current version. Mementos
URI-Mi are timestamped by means of the
ContentDatetime response header.</p>
      <p>The technology substrate used by the Memento versioning
approach is fully centered on HTTP: URI, HTTP, HTTP
Link with to-be-registered link relationships, HTTP
datetime conneg. The challenges formulated in the Introduction
can be addressed as follows (bottom of Figure 4):
wiki/Extension:Memento
11http://www.w3.org/2006/gen/ont
1. Given the current version of a resource, how can
\follow your nose" style navigation to prior versions of
the resource be achieved? The current version is the
stable URI-R. A client application can follow its nose
to a TimeGate for URI-R by using the URI that is
expressed in the timegate HTTP Link header returned
by URI-R. The TimeGate supports datetime conneg
allowing the client to obtain various versions
(Mementos) by varying the content of its Accept-Datetime
request header. In addition, in cases where the
prevmemento and next-memento relationships are
available in the Alternates header provided in TimeGate
responses, a client can engage in version-to-version
navigation with a certainty that the version-relationships
are time-based.
2. Given any version of a resource and a particular
timestamp, how can \follow your nose" style navigation
towards another version that matches the timestamp be
achieved? A version URI-Mi provides an original HTTP
Link header pointing at the stable URI-R. From thereon,
this scenario is the same as described in the
previous point; the timestamp is used as the content of
the Accept-Datetime request header. The
ContentDatetime provides the earliest datetime at which the
returned version became available; that version was
still the then-current one at the datetime that was
expressed in the Accept-Datetime header.</p>
      <p>MEMENTO RESOURCE VERSIONING
AND LINKED DATA</p>
      <p>
        Figure 5 shows how Memento integrates in the Linked
Data environment. In this case, URI-R is a cool URI for a
non-information resource [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], and the current description
of URI-R is available at URI-S. A TimeGate URI-G is
introduced for URI-R, and to support its discovery a timegate
HTTP Link header is provided in responses to GET/HEAD
requests to URI-R. When a Linked Data client is in need
of prior descriptions of URI-R, it follows its nose to URI-G,
where it can use datetime conneg to arrive at a description
of URI-R as it existed at some time in the past. Note that
the conneg with URI-G can include dimensions other than
datetime. The media-type dimension that is commonly used
in Linked Data to allow a choice of descriptions expressed in
RDF serializations or HTML can also be supported.
Similarly, negotiation on language can be supported.
      </p>
    </sec>
    <sec id="sec-6">
      <title>THE DBPEDIA DEMONSTRATOR</title>
    </sec>
    <sec id="sec-7">
      <title>Demonstrator Set-Up</title>
      <p>We have implemented the architecture depicted in Figure
5 in the DBpedia context. We rst downloaded the ve prior
English-language versions of DBpedia (2.0 through 3.3)12
in NT format. Using a python script, the approximately
600 Million triples were loaded into a MySQL table (Table
1). Loading took approximately 15 hours, and resulted in a
MyISAM table of 81 GB.</p>
      <p>For each DBpedia subject URI-R, we exposed a TimeGate
to support content negotiation in the datetime and
mediatype dimensions. For example, our TimeGate for DBpedia's
France resource http://dbpedia.org/resource/France is
http://mementoarchive.lanl.gov/dbpedia/timegate/http:
//dbpedia.org/resource/France. The datetime
functionality was implemented by retrieving all distinct start/end
12http://wiki.dbpedia.org/Downloads34
combinations for the requested subject URI-R. This
approach readily supports providing the rst-memento,
lastmemento, next-memento and prev-memento relationships in
the HTTP Link header provided in responses. The returned
Memento is the one with the start/end interval that
covers the datetime requested via conneg. For conneg requests
with a datetime value that is in the range of the current
DBpedia version, the TimeGate issues an HTTP 302
redirect to the Original Resource URI-R at dbpedia.org.
Mementos are available both in HTML and RDF/XML. For
example, the Memento for DBpedia 3.3's France resource
in HTML is http://mementoarchive.lanl.gov/dbpedia/
memento/20090701/http://dbpedia.org/page/France.</p>
      <p>Colleagues at DBpedia kindly implemented the timegate
HTTP Link header pointing at our TimeGates. This
required approximately one hour and consisted of adding a
stored procedure in the OpenLink Virtuoso engine to add
the appropriate HTTP Link header.</p>
      <p>Figure 6 shows a Memento HTTP ow whereby a client
requests the description of France that was available from
DBpedia on March 20, 2008. Only headers crucial to convey
an understanding of the conneg are shown.</p>
      <p>To illustrate full Memento compliance, we also
implemented TimeBundle/TimeGate support for our DBpedia
version archive. This functionality was not used to achieve
the time-series analysis described below. The Appendix
shows our TimeMap for the DBpedia resource http://dbpedia.
org/resource/France; the content should be self-explanatory.</p>
      <p>Although DBpedia currently operates under a regime of
recurrent discreet updates, both the proposed Memento
approach and our speci c database design support a possible
future regime in which DBpedia is updated on an ongoing
basis. In this case, an archiving mechanism would need to
be added to ensure that versions of distinct DBpedia
descriptions are pushed/pulled into the version archive as they
change.
6.2</p>
      <p>Time-Series Analysis using Memento
Resource Versioning</p>
      <p>To illustrate the power of the proposed approach, we
implemented a simple time-series analysis using both past and
current DBpedia data. We set out to trace the evolution over
time of the Gross Domestic Product Per Capita for various
countries, leveraging the http://dbpedia.org/property/
gdpPppPerCapita property.</p>
      <p>The straightforward data-time-traveling algorithm used to
construct the time-series data-set is described by the below
pseudo code. It must be noted that the actual script must
rely on some ad-hoc heuristics to deal with diverging data
formats used for GDP values.
resources := [list of country description TimeGate URIs]
times := [list of date times, one per version including current]
prop := "http://dbpedia.org/property/gdpPppPerCapita"
values := {}
foreach r in resources:
values[r] := []
foreach t in times:</p>
      <p>data := fetch(URI-TG/r, Accept-Datetime: t, Accept:
"application/rdf+xml")
graph := parse(data)
value := graph.sparql(SELECT val WHERE { r prop ?val . })
value := normalize(value)
values[r].push(value)</p>
      <p>The collected data were then turned into a chart (Figure
7) using the Google Chart API13.</p>
    </sec>
    <sec id="sec-8">
      <title>RELATED WORK</title>
      <p>
        Little research has explored a protocol-based solution to
augment the Web with time travel capabilities. TTApache
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] introduced an ad-hoc RPC-style mechanism to access
archived representations given the URI of their original, e.g.
\page.html?02-Nov-2009". This approach reveals the local
scope of the problem addressed by TTApache, as opposed
to the global perspective taken by the Memento datetime
conneg framework. Indeed, the query components are
issued against a speci c server, and are not maintained when
a client moves to another server as is the case with the
Accept-Datetime header of datetime conneg. TTApache
also allowed addressing archived representations using
version numbers in query components rather than datetimes.
This capability is similar to the deprecated \Content-Version"
header eld from RFC 2068 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and other, similar expired
proposals (e.g., [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]). Such versioning features have not
found wide-spread adoption, presumably because their
address space is tied to a speci c resource or server, and not
universal like datetime. TTApache also provided support for
reserved terms as query components such as \page.html?now".
13http://code.google.com/apis/charttools/index.html
This capability is similar to link relationship types such as
\latest-version", \predecessor-version", \successor-version",
and \working-copy-of" proposed in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] to allow simple
version navigation between Web resources. The focus of this
proposal that emerged from the AtomPub [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] context,
however, is clearly on editorial version control (cf. WebDav,
Java Content Repository). Also, it provides no means to
navigate versions based on datetime information.
      </p>
      <p>
        There is a relationship between the described work and
e orts that research the problem of provenance of Linked
Data, speci cally those provenance aspects concerned with
the time intervals in which speci c data is valid. For
example, [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], is concerned with provenance graphs that allow
expressing such validity information, whereas [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] focuses on
applications to support preserving link integrity over time.
Our proposal introduces a native HTTP approach that
allows leveraging the results of these e orts at Web scale.
8.
      </p>
    </sec>
    <sec id="sec-9">
      <title>CONCLUSIONS</title>
      <p>
        URIs like http://weather.example.com/oaxaca used in
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] have gained signi cant functionality in the Linked Data
context as they start providing access not only to HTML
intended for human consumption, but also to data expressed
in some RDF serialization intended for machine processing.
When publishing data in accordance to Memento's
HTTPbased versioning mechanism proposed in this paper, their
value further increases as they become entry points to both
current and past versions of data. The time-series analysis
described in Section 6.2 is an admittedly simple
demonstration of a subtle and powerful change in the utility of Linked
Data URIs.
      </p>
      <p>
        The URI http://weather.example.com/oaxaca can now
be leveraged to obtain an overview of Oaxaca's weather in
the past months, merely by issuing HTTP GET requests
with varying datetime preferences. Similarly, time-traveling
a Dow Jones data URI can result in an overview of the
stock market's evolution at any desired granularity.
Tracing the evolving state of tra c congestions, implemented in
Zoetrope [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] by high-frequency crawls and scraping of a
trafc web site could be achieved by dereferencing a single data
URI with varying timestamps instead.
      </p>
      <p>While this paper has focused on Linked Data, it should
be clear that the proposed versioning mechanism can be
applied to Web resources in general. It could, for example, be
leveraged to facilitate navigating across issues of Web-based
newspapers and magazines, and it can play an important
role in better integrating the data-intensive eScience and
eHumanities e orts into the Web. Hence, the addition of a
time dimension to the Web is not something only digital
archaeologists should care about. It is an enabler for a global
HTTP-based versioning mechanism that can support a new
range of temporal applications for both the document and
the data Web. This paper has merely scratched the surface
of a new world of possibilities.</p>
    </sec>
    <sec id="sec-10">
      <title>ACKNOWLEDGMENTS</title>
      <p>The Memento research is partly funded by the Library
of Congress. Many thanks to Chris Bizer, Kinsley Idehen,
and Mitko Iliev for implementing the timegate HTTP Link
header in DBpedia.
10.</p>
    </sec>
    <sec id="sec-11">
      <title>APPENDIX A.</title>
    </sec>
    <sec id="sec-12">
      <title>AN RDF/XML TIMEMAP</title>
      <p>The following is an RDF/XML TimeMap for http://
dbpedia.org/resource/France.
&lt;?xml version="1.0" encoding="utf-8"?&gt;
&lt;rdf:RDF
xmlns:foaf='http://xmlns.com/foaf/0.1/'
xmlns:dcterms='http://purl.org/dc/terms/'
xmlns:mem='http://www.mementoweb.org/terms/tb/'
xmlns:dc='http://purl.org/dc/elements/1.1/'
xmlns:rdf='http://www.w3.org/1999/02/22-rdf-syntax-ns#'
xmlns:ore='http://www.openarchives.org/ore/terms/'
xmlns:rdfs1='http://www.w3.org/2001/01/rdf-schema#'&gt;
&lt;ore:ResourceMap rdf:about="http://mementoarchive.lanl.gov/dbpedia/timemap/rdf/http://dbpedia.org/resource/France"&gt;
&lt;rdf:type rdf:resource="http://www.mementoweb.org/terms/tb/TimeMap"/&gt;
&lt;dcterms:modified&gt;2010-02-17T05:26:27Z&lt;/dcterms:modified&gt;
&lt;dcterms:created&gt;2010-02-17T05:26:27Z&lt;/dcterms:created&gt;
&lt;dc:format&gt;application/rdf+xml&lt;/dc:format&gt;
&lt;dcterms:creator&gt;
&lt;rdf:Description rdf:about="http://foresite-toolkit.googlecode.com/#pythonAgent"&gt;
&lt;foaf:mbox&gt;foresite@googlegroups.com&lt;/foaf:mbox&gt;
&lt;foaf:name&gt;Foresite Toolkit (Python)&lt;/foaf:name&gt;
&lt;/rdf:Description&gt;
&lt;/dcterms:creator&gt;
&lt;ore:describes&gt;
&lt;ore:Aggregation rdf:about="http://mementoarchive.lanl.gov/dbpedia/timebundle/http://dbpedia.org/resource/France"&gt;
&lt;ore:aggregates rdf:resource="http://mementoarchive.lanl.gov/dbpedia/memento/20070901/http://dbpedia.org/data/France"/&gt;
&lt;ore:aggregates rdf:resource="http://mementoarchive.lanl.gov/dbpedia/memento/20080201/http://dbpedia.org/data/France"/&gt;
&lt;ore:aggregates rdf:resource="http://mementoarchive.lanl.gov/dbpedia/memento/20080801/http://dbpedia.org/data/France"/&gt;
&lt;ore:aggregates rdf:resource="http://mementoarchive.lanl.gov/dbpedia/memento/20081101/http://dbpedia.org/data/France"/&gt;
&lt;ore:aggregates rdf:resource="http://mementoarchive.lanl.gov/dbpedia/memento/20090701/http://dbpedia.org/data/France"/&gt;
&lt;ore:aggregates rdf:resource="http://mementoarchive.lanl.gov/dbpedia/timegate/http://dbpedia.org/resource/France"/&gt;
&lt;ore:aggregates rdf:resource="http://dbpedia.org/resource/France"/&gt;
&lt;dc:title&gt;Memento Time Bundle for http://dbpedia.org/resource/France&lt;/dc:title&gt;
&lt;rdf:type rdf:resource="http://www.mementoweb.org/terms/tb/TimeBundle"/&gt;
&lt;/ore:Aggregation&gt;
&lt;/ore:describes&gt;
&lt;/ore:ResourceMap&gt;
&lt;rdf:Description rdf:about="http://www.openarchives.org/ore/terms/Aggregation"&gt;
&lt;rdfs1:label&gt;Aggregation&lt;/rdfs1:label&gt;
&lt;rdfs1:isDefinedBy rdf:resource="http://www.openarchives.org/ore/terms/"/&gt;
&lt;/rdf:Description&gt;
&lt;rdf:Description rdf:about="http://www.openarchives.org/ore/terms/ResourceMap"&gt;
&lt;rdfs1:label&gt;ResourceMap&lt;/rdfs1:label&gt;
&lt;rdfs1:isDefinedBy rdf:resource="http://www.openarchives.org/ore/terms/"/&gt;
&lt;/rdf:Description&gt;
&lt;mem:TimeGate rdf:about="http://mementoarchive.lanl.gov/dbpedia/timegate/http://dbpedia.org/resource/France"&gt;
&lt;mem:timeGateFor rdf:resource="http://dbpedia.org/resource/France"/&gt;
&lt;mem:covers rdf:nodeID="gtKXRtug21"/&gt;
&lt;/mem:TimeGate&gt;
&lt;mem:Period rdf:nodeID="gtKXRtug21"&gt;
&lt;mem:end rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2009-11-01T00:00:00+00:00&lt;/mem:end&gt;
&lt;mem:start rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2007-09-01T00:00:00+00:00&lt;/mem:start&gt;
&lt;/mem:Period&gt;
&lt;mem:Memento rdf:about="http://mementoarchive.lanl.gov/dbpedia/memento/20070901/http://dbpedia.org/data/France"&gt;
&lt;mem:validOver&gt;
&lt;mem:Period&gt;
&lt;mem:start rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2007-09-01T00:00:00+00:00&lt;/mem:start&gt;
&lt;mem:end rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2008-02-01T00:00:00+00:00&lt;/mem:end&gt;
&lt;/mem:Period&gt;
&lt;/mem:validOver&gt;
&lt;mem:mementoFor rdf:resource="http://dbpedia.org/resource/France"/&gt;
&lt;/mem:Memento&gt;
&lt;mem:Memento rdf:about="http://mementoarchive.lanl.gov/dbpedia/memento/20080201/http://dbpedia.org/data/France"&gt;
&lt;mem:validOver&gt;
&lt;mem:Period&gt;
&lt;mem:start rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2008-02-01T00:00:00+00:00&lt;/mem:start&gt;
&lt;mem:end rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2008-08-01T00:00:00+00:00&lt;/mem:end&gt;
&lt;/mem:Period&gt;
&lt;/mem:validOver&gt;
&lt;mem:mementoFor rdf:resource="http://dbpedia.org/resource/France"/&gt;
&lt;/mem:Memento&gt;
&lt;mem:Memento rdf:about="http://mementoarchive.lanl.gov/dbpedia/memento/20080801/http://dbpedia.org/data/France"&gt;
&lt;mem:validOver rdf:nodeID="gtKXRtug42"/&gt;
&lt;mem:mementoFor rdf:resource="http://dbpedia.org/resource/France"/&gt;
&lt;/mem:Memento&gt;
&lt;mem:Period rdf:nodeID="gtKXRtug42"&gt;
&lt;mem:end rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2008-08-01T00:00:00+00:00&lt;/mem:end&gt;
&lt;mem:start rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2009-11-01T00:00:00+00:00&lt;/mem:start&gt;
&lt;/mem:Period&gt;
&lt;mem:Memento rdf:about="http://mementoarchive.lanl.gov/dbpedia/memento/20081101/http://dbpedia.org/data/France"&gt;
&lt;mem:validOver rdf:nodeID="gtKXRtug49"/&gt;
&lt;mem:mementoFor&gt;</p>
      <p>&lt;mem:OriginalResource rdf:about="http://dbpedia.org/resource/France"/&gt;
&lt;/mem:mementoFor&gt;
&lt;/mem:Memento&gt;
&lt;mem:Period rdf:nodeID="gtKXRtug49"&gt;
&lt;mem:end rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2008-11-01T00:00:00+00:00&lt;/mem:end&gt;
&lt;mem:start rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2009-07-01T00:00:00+00:00&lt;/mem:start&gt;
&lt;/mem:Period&gt;
&lt;mem:Memento rdf:about="http://mementoarchive.lanl.gov/dbpedia/memento/20090701/http://dbpedia.org/data/France"&gt;
&lt;mem:validOver rdf:nodeID="gtKXRtug56"/&gt;
&lt;mem:mementoFor rdf:resource="http://dbpedia.org/resource/France"/&gt;
&lt;/mem:Memento&gt;
&lt;mem:Period rdf:nodeID="gtKXRtug56"&gt;
&lt;mem:end rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2009-07-01T00:00:00+00:00&lt;/mem:end&gt;
&lt;mem:start rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime"&gt;2009-11-01T00:00:00+00:00&lt;/mem:start&gt;
&lt;/mem:Period&gt;
&lt;/rdf:RDF&gt;</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>E.</given-names>
            <surname>Adar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dontcheva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fogarty</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Weld</surname>
          </string-name>
          .
          <article-title>Zoetrope: interacting with the ephemeral web</article-title>
          .
          <source>In UIST '08: Proceedings of the 21st annual ACM symposium on User interface software and technology</source>
          , pages
          <volume>239</volume>
          {
          <fpage>248</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T.</given-names>
            <surname>Berners-Lee</surname>
          </string-name>
          .
          <article-title>Web architecture: Generic resources</article-title>
          . http://www.w3.org/DesignIssues/Generic.html,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>T.</given-names>
            <surname>Berners-Lee</surname>
          </string-name>
          .
          <article-title>Cool URIs don't change</article-title>
          .
          <year>1998</year>
          . http://www.w3.org/Provider/Style/URI.html.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Brown</surname>
          </string-name>
          , G. Clemm, and
          <string-name>
            <given-names>J.</given-names>
            <surname>Reschke</surname>
          </string-name>
          .
          <article-title>Link relation types for simple version navigation between web resources</article-title>
          ,
          <source>Internet Draft</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C. E.</given-names>
            <surname>Dyreson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lin</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Managing versions of web documents in a transaction-time web server</article-title>
          .
          <source>In WWW '04: Proceedings of the 13th international conference on World Wide Web</source>
          , pages
          <volume>422</volume>
          {
          <fpage>432</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Fielding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gettys</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mogul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Frystyk</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Berners-Lee</surname>
          </string-name>
          .
          <source>Hypertex Transfer Protocol { HTTP/1</source>
          .1,
          <string-name>
            <surname>Internet</surname>
            <given-names>RFC</given-names>
          </string-name>
          -
          <year>2068</year>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Gregorio</surname>
          </string-name>
          and B. de hOra.
          <source>The Atom publishing protocol</source>
          ,
          <source>Internet RFC-5023</source>
          ,
          <year>December 2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>O.</given-names>
            <surname>Hartig</surname>
          </string-name>
          .
          <article-title>Provenance information in the web of data</article-title>
          .
          <source>In Proceedings of the 2nd Workshop on Linked Data on the Web (LDOW2009)</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>B.</given-names>
            <surname>Haslhofer</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Popitsch</surname>
          </string-name>
          .
          <article-title>DSNotify{Detecting and Fixing Broken Links in Linked Data Sets</article-title>
          .
          <source>In Proceedings of 8th International Workshop on Web Semantics</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>K.</given-names>
            <surname>Holtman</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Mutz</surname>
          </string-name>
          . Transparent Content Negotiation in
          <string-name>
            <given-names>HTTP</given-names>
            ,
            <surname>Internet</surname>
          </string-name>
          <string-name>
            <surname>RFC</surname>
          </string-name>
          -
          <volume>2295</volume>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>I.</given-names>
            <surname>Jacobs</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Walsh</surname>
          </string-name>
          .
          <article-title>Architecture of the world wide web, volume one</article-title>
          .
          <source>Technical Report W3C</source>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>C.</given-names>
            <surname>Lagoze</surname>
          </string-name>
          , H. Van de Sompel, P. Johnston,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Nelson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sanderson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Warner</surname>
          </string-name>
          .
          <article-title>Adding eScience Assets to the Data Web</article-title>
          .
          <source>In Proceedings of the Linked Data on the Web Workshop (LDOW</source>
          <year>2009</year>
          ),
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>N.</given-names>
            <surname>Mendelsohn</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Williams</surname>
          </string-name>
          .
          <article-title>The use of Metadata in URIs</article-title>
          ,
          <source>TAG Finding 2 January</source>
          <year>2007</year>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nottingham</surname>
          </string-name>
          . Web linking,
          <source>Internet Draft</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nottingham</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Sayre</surname>
          </string-name>
          . The Atom Syndication Format,
          <source>Internet RFC-4287</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>K.</given-names>
            <surname>Ota</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Takahashi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Sekiya</surname>
          </string-name>
          .
          <article-title>Version management with meta-level links via</article-title>
          <source>HTTP/1</source>
          .1,
          <string-name>
            <given-names>Internet</given-names>
            <surname>Draft</surname>
          </string-name>
          draft
          <article-title>-ntt-http-</article-title>
          <source>version-00</source>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>D.</given-names>
            <surname>Raggett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Hors</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. Jacobs.</surname>
          </string-name>
          <article-title>HTML 4.01 Speci cation</article-title>
          .
          <source>Technical Report W3C Recommendation 24 December</source>
          <year>1999</year>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>L.</given-names>
            <surname>Sauermann</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Cyganiak</surname>
          </string-name>
          .
          <article-title>Cool URIs for the semantic web</article-title>
          .
          <source>Technical Report W3C Interest Group Note 31 March</source>
          <year>2008</year>
          , W3C,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>H. Van de Sompel</surname>
            ,
            <given-names>M. L.</given-names>
          </string-name>
          <string-name>
            <surname>Nelson</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Sanderson</surname>
            ,
            <given-names>L. L.</given-names>
          </string-name>
          <string-name>
            <surname>Balakireva</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Ainsworth</surname>
            , and
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Shankar</surname>
          </string-name>
          .
          <article-title>Memento: Time Travel for the Web</article-title>
          .
          <source>Technical Report arXiv:0911.1112</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>H. Van de Sompel</surname>
            ,
            <given-names>M. L.</given-names>
          </string-name>
          <string-name>
            <surname>Nelson</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Sanderson</surname>
            ,
            <given-names>L. L.</given-names>
          </string-name>
          <string-name>
            <surname>Balakireva</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Ainsworth</surname>
            , and
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Shankar</surname>
          </string-name>
          .
          <source>Memento: Updated Technical Details (February</source>
          <year>2010</year>
          ). http://www.slideshare.net/hvdsomp/mementoupdated-technical
          <source>-details-february-2010</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>