<!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>owner(s).
LODWS April</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>The OAI2LOD Server: Exposing OAI-PMH Metadata as Linked Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bernhard Haslhofer</string-name>
          <email>bernhard.haslhofer@univie.ac.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bernhard Schandl</string-name>
          <email>bernhard.schandl@univie.ac.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Vienna, Dept. of Distributed and Multimedia Systems</institution>
          ,
          <addr-line>Vienna</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2008</year>
      </pub-date>
      <volume>22</volume>
      <issue>2008</issue>
      <abstract>
        <p>Many institutions grant access to their metadata repositories via the Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH). However, this protocol has two signi cant drawbacks: it does not make its resources accessible via dereferencable URIs, and it provides only restricted means of selective access to metadata. The OAI2LOD Server handles these shortcomings by republishing metadata originating from an OAI-PMH endpoint according to the principles of Linked Data. As the ongoing OAI-ORE speci cation process shows, these principles are gaining growing importance also in the digital libraries domain.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        The Open Archives Initiative Protocol for Metadata
Harvesting (OAI-PMH) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] is utilised for the exchange and
sharing of metadata for digital and non-digital items and enjoys
growing popularity in the domain of digital libraries and
archives. Currently we know of more than 1700 OAI-PMH
compliant repositories exposing metadata descriptions for
several millions items.
      </p>
      <p>
        The design of OAI-PMH is based on the Web
Architecture [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], but it does not treat its conceptual entities as
dereferencable resources. Also selective access to metadata is still
out of its scope. One can, for instance, retrieve metadata for
a certain digital item, but cannot retrieve all digital items
that have been created by a certain author.
      </p>
      <p>
        With the OAI2LOD Server we provide a possible
solution for these shortcomings by following the Linked Data
design principles [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and by providing SPARQL access to
metadata. The ongoing Object Reuse and Exchange
(OAIORE) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] standardisation indicates that the idea of Linked
Data will play a substantial role in the context of digital
libraries and archives. Thereby, our OAI2LOD Server could
serve as bridging component between the worlds of
OAIPMH and Linked Data.
      </p>
    </sec>
    <sec id="sec-2">
      <title>WHAT IS OAI-PMH?</title>
      <p>Client applications can use the OAI-PMH protocol to
harvest metadata from Data Providers using open standards
such as URI, HTTP, and XML. Institutions taking the role
of data providers can easily expose their metadata via
OAIPMH by implementing light-weight wrapper components on
top of their existing metadata repositories.
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>Technical Details</title>
      <p>
        The main conceptual entities in the OAI-PMH speci
cation are Item, Record, and MetadataFormat. An item
represents a digital or non-digital resource and is uniquely
identi ed by a URI. It can be described by an arbitrary number
of metadata records, each of which is bound to a certain
metadata format, which can freely be chosen by the data
provider. To guarantee a basic level of interoperability, all
data providers must support the unquali ed Dublin Core [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]
format. Further, OAI-PMH provides the concept of a Set
for grouping related items and their associated metadata.
      </p>
      <p>OAI-PMH is implemented on top of HTTP and de nes a
set of verbs to request di erent information types: an
Identify request retrieves administrative metadata (e.g., name,
owner) about a repository as a whole. GetRecord is used
to fetch an individual record for a certain item in a given
format, whereas the request ListRecords harvests all
metadata for all available items in a certain metadata format.
ListIdentifiers returns the identi ers (URIs) of all
available items, ListMetadataFormats the formats in which the
data provider exposes metadata, and ListSets returns the
available sets in an OAI-PMH repository.</p>
      <p>Figure 1 shows a sample GetRecord request for a Dublin
Core metadata record available in the Library of Congress
and the corresponding response. The request URI contains
the address of the repository, the verbs, and required
parameters like the item URI. The response consists of a &lt;header&gt;
section, which contains the item's URI, and a &lt;metadata&gt;
section encapsulating the metadata record.
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>Spreading and Future of OAI-PMH</title>
      <p>There exist a number of OAI Data Provider Registries12,
from which we know that currently 1765 institutions
worldwide maintain OAI-PMH repositories. Regarding their
application domain, we can observe that the protocol has been
implemented in a variety of institutions, ranging from small
research facilities to national libraries that have integrated
this protocol with their catalogue systems. Examples are
the Institute of Biology of the Southern Seas, exposing 403
records, and the U.S. National Library of Medicine's digital
archive, exposing 1,272,585 records.</p>
      <p>In order to estimate the amount and the characteristics
of metadata one can retrieve via OAI-PMH, we have
carried out an analysis on the 915 registered repositories that
delivered valid responses. Figure 2 illustrates the size of
these repositories using a logarithmic scale on the Y-axis.
1http://www.openarchives.org/Register/BrowseSites
2http://gita.grainger.uiuc.edu/registry/
3Further information about these standards: http://www.
loc.gov/standards and http://rfc.net/rfc1807.html
4http://www.theeuropeanlibrary.org
Frequency
not consider them in our analysis.</p>
      <p>Another reason why we expect the number of OAI-PMH
endpoints to grow is that popular open source digital library
systems, such as Fedora5, DSpace6, and EPrints7, provide
an OAI-PMH endpoint by deTfoapul1t.0 TMheetsaedsaytastSemtasndcuarrrdesntly
nd a widespread adoption in various small and medium
instUintquutaiolifniesd (Deu.bgl.in, Cuonreiversities or museums) and will fost9e0r0
the global distrRiFbCu1t8io07n of open and Web accessible metadata
even more. 110</p>
      <p>OAI MARC</p>
      <p>Shortcomings1o08f OAI-PMH
2.3</p>
      <p>The OAIM-PAMRCH21pSrloimtoco9l4has been designed for transferring
large amounts ofMmETeStadata from a server to a client over
69
the Web. From that perspective, it provides a reasonable
solution for clienEtTsDtMhSat 5n2eed to aggregate or index metadata.
However, it has two signi cant drawbacks:</p>
      <p>UK ETD DC 45
Non-dereferencable identities : although OAI-PMH is</p>
      <p>MPEG-21 DIDL
90b0uilt on the Web 4in1frastructure, we believe that it does
11n0ot yet make u?se39of its full potential. To retrieve
in10f8ormation from a repository, a client must execute an
HTTP GET reque0st on an OA3I0-0PMH spec6i00c URI (see900
96F49igure 1). This prevents Web clients that are unaware
5o2f the protocol speci cs from accessing the repository.
4R5estricted selective access to metadata : the record
se4l1ection criteria in the OAI-PMH harvesting process are
3r9estricted to item identi ers, metadata formats, sets,
3a1nd record creation date intervals. However, some
clients might only be interested in records matching
certain criteria (e.g., \all records describing items
created by X") or even just a subset of the available
metadata values (e.g., \all authors of all books in a library").</p>
      <p>One could argue that these features are out of the scope
of OAI-PMH and already implemented by other digital
library protocols such as Z.39.598 or SRU9. However, because
of the popularity and widespread adoption of OAI-PMH in
contrast to other protocols, we believe that it should be
enhanced in order to solve the above mentioned drawbacks.
5http://www.fedora.info
6http://www.dspace.org
7http://www.eprints.org
8http://www.loc.gov/z3950/agency/Z39-50-2003.pdf
9http://www.loc.gov/standards/sru/specs/
Institutions, which employ the OAI-PMH, could then
provide powerful metadata access functionality by
implementing just a single protocol.</p>
    </sec>
    <sec id="sec-5">
      <title>THE OAI2LOD SERVER</title>
      <p>
        At a rst glance, the OAI2LOD server is a wrapper that
exposes metadata of OAI-PMH compliant data sources as
Linked Data on the Web and provides a SPARQL query
interface to these metadata. During design time we have
noticed that it also covers large parts of the OAI-PMH features
by simply following the Linked Data rules [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and provides
solutions for the shortcomings mentioned in the previous
section.
3.1
      </p>
    </sec>
    <sec id="sec-6">
      <title>Exposing OAI-PMH Metadata as Linked</title>
    </sec>
    <sec id="sec-7">
      <title>Data</title>
      <p>The rst Linked Data rule says that things should have
URIs. In the context of OAI-PMH, items and sets are such
things. By de nition, items already ful l that rule because,
according to the OAI-PMH speci cation, each item must
be identi ed by a URI (e.g., oai:lcoa1.loc.gov:loc.gdc/
gcfr.0018_0163). This not the case for sets as they are
identi ed by arbitrary strings consisting of any valid URI
unreserved characters (e.g. ascfrbib). However, such strings are
no valid URIs.</p>
      <p>According to the second rule, URIs that identify resources
should be resolvable HTTP URIs. In OAI-PMH it is
common to use non-resolvable URNs to identify items. The
OAI2LOD server bridges this gap by wrapping item URNs
and set identi ers with resolvable HTTP URLs. Continuing
the above example, the item's URI becomes http://example
.com/resources/item/oai:lcoa1.loc.gov:loc.gdc/gcfr.
0018_0163, and the the set's identi er becomes http://
example.com/resources/set/ascfrbib.</p>
      <p>The third Linked Data rule proposes to deliver useful
information whenever a URI is dereferenced. The OAI-PMH
protocol delivers useful information for harvesting clients
that can parse and process OAI-PMH responses. We
believe that this information might also be valuable for other
human and non-human Web agents. For humans we should
provide the possibility to browse, display, and search
metadata using an ordinary Web browser. Other (non-human)
Web agents such as Web crawlers should be able to access
OAI-PMH metadata without knowing the protocol details.
We ful l this requirement (i) by assuring that the responses
delivered to a client contain only resolvable HTTP URIs,
and (ii) by exposing data in various representations.</p>
      <p>When delivering metadata records to the client, we must
assure that each eld (e.g., creator) within a record has
assigned a resolvable URI. For some formats (e.g., Dublin
Core) this is the case by de nition (e.g., http://purl.org/
dc/elements/1.1/creator), for others we must publish a
machine-readable representation (e.g., in RDF/S or OWL)
on the Web. Further, we have de ned a machine-processable
vocabulary10 de ning OAI-PMH speci c concepts such as
Item and Set.</p>
      <p>
        XHTML and RDF serialisation formats, i.e. RDF/XML
and N3, are the data representations the OAI2LOD Server
currently supports. While Web browsers can process the
former and display the returned information to humans, the
latter can be processed by machines. The server uses content
negotiation, as explained in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], to decide which
representation to deliver.
      </p>
      <p>In the context of OAI-PMH, the forth Linked Data rule
recommends that metadata records should contain links to
other related resources. One kind of link that should be
included in a record delivered to a client is a reference to its
origin, i.e., the OAI-PMH endpoint and all relevant protocol
parameters required to retrieve the corresponding XML
representation of an item and its records. We express this
information using the OAI2LOD speci c oai2lod:origin
property, which is de ned as a sub-property of rdfs:seeAlso.</p>
      <p>
        Searching other OAI2LOD Server instances for equivalent
or similar metadata records, is another strategy for adding
links. If we refer to the example presented in Figure 1, it is
quite likely that other institutions also have a copy of this
book. This fact can be captured by adding an owl:sameAs
property to the metadata record. Currently we do this by
regarding metadata records originating from distinct server
instances and comparing the values of a set of manually
selected attributes according to their lexical similarity using
the Levensthein string distance [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. If the similarity of two
entries is above a certain threshold, two records are linked.
In the current implementation we ask the server
administrator to specify (i) target OAI2LOD Servers for linking, (ii)
pairs of source and target elds to be analysed, and (iii) a
similarity threshold for each pair.
      </p>
      <p>Figure 3 shows the RDF/XML representation of our
example metadata record as it is returned by the OAI2LOD
Server. It contains the same metadata as the record in
Figure 1 but represents them according to the Linked Data
principles. We can see that by following the Linked Data
rules, we have bridged the problem of non-dereferencable
identities and support access to metadata repositories for
a variety of Web agents. The other shortcoming is solved
by SPARQL endpoint which allows selective record retrieval
oai2lod_response.txt
fPrroimntetdh:eWdedanteasdsatyo,reFdebirnuatrhye27O,A2I020L8O2:D13:s2e5rvPeMr.
&lt;rdf:RDF
...
xmlns:oai2lod="http://www.mediaspaces.info/vocab/oai-pmh.rdf#"&gt;
Printed For: Bern
&lt;rdf:Description
rdf:about="http://www.mediaspaces.info:2020/resource/item/
oai:lcoa1.loc.gov:loc.gdc/gcfr.0018_0163"&gt;
&lt;rdf:type rdf:resource=
"http://www.mediaspaces.info/vocab/oai-pmh.rdf#Item"/&gt;
&lt;oai2lod:setSpec rdf:resource=
"http://www.mediaspaces.info:2020/resource/set/ascfrbib"/&gt;
&lt;oai2lod:origin rdf:resource= "http://memory.loc.gov/cgi-bin/
oai2_0?verb=GetRecord&amp;identifier=oai:lcoa1.loc.gov:loc.gdc/
gcfr.0018_0163&amp;metadataPrefix=oai_dc"/&gt;
&lt;owl:sameAs rdf:resource=
"http://example.com/resource/item/oai:example.com/itemX"/&gt;
&lt;dc:title&gt;Don Christopher Columbus to his friend, Don Louis
de Santangel, on his arrival from his first voyage.</p>
      <p>At the Azores, Feb. 15, 1493.
&lt;/dc:title&gt;
&lt;dc:creator&gt;Columbus, Christopher.&lt;/dc:creator&gt;
&lt;dc:subject&gt;America--Discovery and
exploration--Spanish-Early works to 1800.
&lt;/dc:subject&gt;
&lt;dc:identifier rdf:resource=
"http://hdl.loc.gov/loc.gdc/gcfr.0018_0163"/&gt;
&lt;dc:coverage&gt;America&lt;/dc:coverage&gt;
&lt;/rdf:Description&gt;
&lt;/rdf:RDF&gt;
10http://www.mediaspaces.info/vocab/oai-pmh.rdf</p>
      <p>
        The OAI2LOD Server, as illustrated in Figure 4, is a
stand-alone server implemented in Java and based on the
architecture of the D2RQ Server [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. It can be con gured to
expose all metadata records from a speci c OAI-PMH
endpoint in a certain metadata format according to the
principles described above. A scheduled process regularly harvests
metadata from the given endpoint, transforms them into
RDF/XML using a format-speci c XSL style-sheet, stores
the transformed metadata in a built-in triple store, and
exposes the metadata to various kinds of clients. The
builtin Request Handler/Dispatcher analyses the Accept
property in the HTTP headers and delivers metadata either in
RDF/XML (Accept: application/rdf+xml) or in XHTML
(Accept: application/xhtml+xml). It directs client
requests to the OAI2LOD Server's entry point that provides
metadata in the appropriate representation using the HTTP
303 See Other response.
      </p>
      <p>HTML
Browser
HTTP</p>
      <p>SPARQL
Clients</p>
      <p>Linked
Data
Clients
OAI2LOD Server
HTTP</p>
      <p>Request Handler / Dispatcher</p>
      <p>Triple Store
OAI-PMH
Harvester
OAI-PMH</p>
      <p>Data
Provider</p>
      <p>Config
&amp;
XSL</p>
      <p>URI paths are used to expose di erent types of
information in di erent representations. The /resource path holds
the URIs of all items and sets exposed by the server. When a
client requests such a URI, the OAI2LOD Server examines
the Accept property and points to the URI path that
delivers information in a representation suitable for the client:
the /data path provides access to all machine-readable RDF
descriptions for a certain resource; the /page path returns
the same information in XHTML. Further, the /directory
path lists what types of resources (e.g., items, sets) are
available in an XHTML representation. Analogously, the /all
path delivers that information in a machine readable RDF
representation. Figure 5 shows example OAI2LOD Server
requests and the corresponding OAI-PMH requests that
return the same information.</p>
      <p>OAI2LOD Request</p>
      <p>OAI-PMH Request</p>
      <p>N/A
/oai?verb=ListIdentifiers&amp;
metadataPrefix=oai_dc
All available
resource types</p>
      <p>All item
identifiers
/ (in HTML)
/all (in RDF)
/directory/Item (in HTML)</p>
      <p>/all/Item (in RDF)
/resource/item/oai:lcoa1.loc.g
ov:loc.gdc/gcfr.0018_0163</p>
      <p>-/data/item/oai:lcoa1.loc.gov:lo
c.gdc/gcfr.0018_0163</p>
      <p>(RDF)
The metadata /page/item/oai:lcoa1.loc.gov:l identifier=oai:lcoa1.loc.gov:loc.gdc/
/oai?verb=GetRecord&amp;
dceesrrtcearciinobirindtegma oc.gdc/(gXcHfrT.0M0L1)8_0163 megtacdfra.0ta0P1r8e_fi0x1=6o3a&amp;i_dc</p>
      <p>Currently the OAI2LOD Server exposes metadata records
only in a single pre-de ned format. When setting up a server
instance for a speci c OAI-PMH repository, the
administrator decides in which format the metadata records are
harvested. Since this approach contradicts a central idea of
OAI-PMH we will further investigate how the OAI2LOD
Server could serve metadata in multiple formats. One
potential solution is to de ne mappings between formats.</p>
      <p>Another important OAI-PMH feature is batch retrieval of
metadata records. Using the ListRecords request, a client
can iteratively retrieve a chunk of records. The OAI2LOD
Server currently supports these features through SPARQL
and its LIMIT and OFFSET clauses. However, we believe that
alternatively we could o er that feature via a dereferencable
URI.</p>
      <p>The OAI2LOD Server's capabilities of linking items with
other resources on the Web are limited and still rely on
human intervention. We need to experiment with further
duplicate detection algorithms and similarity metrics, in order
to achieve better and scalable results.
4.</p>
      <p>OAI-ORE</p>
      <p>
        The Open Archives Initiative Object Reuse and Exchange
(OAI-ORE) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] speci cation is the latest standardisation
effort driven by the designers of the OAI-PMH protocol.
Although the standards are still in an alpha release status,
we can already notice strong similarities with the ideas of
11http://www.mediaspaces.info:3030/
Linked Data and the OAI2LOD Server respectively.
      </p>
      <p>OAI-ORE is a set of standards for the description and
exchange of aggregations of Web resources. A resource can
be anything that is identi ed with a URI such as Web sites,
online multimedia content, or items stored in institutional
digital library systems. In the ORE data model an
aggregation is an instance of the conceptual entity Resource Map
and is identi ed by a URI. A resource map describes the
encapsulated resources as a set of machine readable RDF
statements, which makes them readable for a variety of Web
agents. Clients can retrieve aggregations by executing an
HTTP GET request on a resource map's URI. The ATOM
Syndication Format12 is speci ed as the primary
serialisation format for delivering resource maps to clients. However,
since the ORE data model is de ned in RDF, resources can
not only be mapped to the ATOM format but also serialised
in other RDF exchange formats such as RDF/XML or N3.</p>
      <p>Regarding the OAI-ORE speci cation from the
perspective of Linked Data, we can observe that the rst two Linked
Data rules are fundamental building blocks of the standard:
all things, i.e., resource maps and the aggregated resources,
are identi ed by dereferencable URIs. Further, all terms
used for describing aggregations have a well-de ned
semantics, published in terms of a Web accessible vocabulary de
nition. It also considers the third rule because resolving the
URIs returns useful |i.e., processable and interpretable|
information for both human and machines. Finally,
OAIORE also follows the fourth rule by providing several
possibilities to link resources: rst, an aggregation of resources
is by de nition a collection of linked (ore:aggregates)
resources; second, the ORE model uses the owl:sameAs
property to denote that two identi ers refer to the same
information object; third, it supports the concepts of nested
aggregations.</p>
      <p>OAI-PMH and OAI-ORE overlap in the fact that
Resource Maps can be included as metadata records in
OAIPMH responses, which allows batch retrieval and
harvesting of aggregation information. We believe that there lies
a great potential in a tighter integration of these two
standards: if OAI-PMH metadata repositories expose their items
as Web resources by assigning them HTTP-dereferencable
URIs, these items could take part in OAI-ORE
aggregations. One possible strategy could be to de ne a common
core data model that links these two standards so that the
ORE speci cation builds on top of the OAI-PMH protocol.
Meanwhile, the OAI2LOD Server can serve as a bridge
between these two standards.</p>
    </sec>
    <sec id="sec-8">
      <title>CONCLUSION</title>
      <p>In this paper we have presented the OAI2LOD Server, a
software component that republishes metadata from
OAIPMH compliant repositories according to the Linked Data
principles. It ful ls two major purposes: rst it exposes the
conceptual OAI-PMH entities (item, set) as dereferencable
Web resources, and second, it provides selective access to
metadata via a SPARQL endpoint. These features make
OAI-PMH metadata accessible also for Web clients not
being aware of the OAI-PMH protocol speci cs.</p>
      <p>Since the alpha version of the OAI-ORE speci cation has
been released, we can observe that also in the digital libraries
domain the Linked Data principles will play an important
role. Also for the already established OAI-PMH protocol,
it would make sense to treat its conceptual entities (items,
sets) as resources that can be dereferenced via URIs. In
that way, they could take part in OAI-ORE aggregations.
Meanwhile, the OAI2LOD Server can be used for bridging
the conceptual gap between these standards.</p>
      <p>Our work on the OAI2LOD Server will continue: rst
we will deal with the open issues mentioned in Section 3.4.
Second, we will investigate techniques for linking metadata
and third, we also plan to implement OAI-ORE support for
aggregating items.
6.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Berners-Lee</surname>
          </string-name>
          .
          <article-title>Linked data</article-title>
          ,
          <year>July 2006</year>
          . Available at: http://www.w3.org/DesignIssues/LinkedData.html.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cyganiak</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Heath</surname>
          </string-name>
          .
          <article-title>How to publish data on the web</article-title>
          ,
          <year>July 2007</year>
          . Available at: http://www4.wiwiss.fu-berlin.de/bizer/pub/ LinkedDataTutorial/.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Seaborne. D2RQ - Treating</surname>
          </string-name>
          non
          <article-title>-RDF databases as virtual RDF graphs</article-title>
          ,
          <year>2004</year>
          . Available at: http://www.wiwiss.fu-berlin.de/suhl/bizer/D2RQ/.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <source>[4] DC. Dublin Core Metadata Element Set, Version</source>
          <volume>1</volume>
          .1. Dublin Core Metadata Initiative,
          <year>December 2006</year>
          . Available at: http://dublincore.org/documents/dces/.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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</article-title>
          , volume one,
          <year>December 2004</year>
          . Available at: http://www.w3.org/TR/webarch/.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C.</given-names>
            <surname>Lagoze</surname>
          </string-name>
          and H. V. de Sompel.
          <article-title>The open archives initiative protocol for metadata harvesting | version 2</article-title>
          .0,
          <year>2002</year>
          . Available at: http://www.openarchives. org/OAI/openarchivesprotocol.html.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <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>Open Archives Initative Object Reuse and Exchange (OAI-ORE)</article-title>
          .
          <source>Technical report</source>
          , Open Archives Initative,
          <year>December 2007</year>
          . Available at: http://www.openarchives.
          <source>org/ore/0</source>
          .1/toc.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>V. I.</given-names>
            <surname>Levenshtein</surname>
          </string-name>
          .
          <article-title>Binary Codes Capable of Correcting Deletions, Insertions and Reversals</article-title>
          .
          <source>Soviet Physics Doklady</source>
          ,
          <volume>10</volume>
          ,
          <string-name>
            <surname>Feb</surname>
          </string-name>
          .
          <year>1966</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>