<!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 />
    <article-meta>
      <title-group>
        <article-title>Describing a network of live datasets with the SDS vocabulary</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Arthur Vercruysse</string-name>
          <email>arthur.vercruysse@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sitt Min Oo</string-name>
          <email>x.sittminoo@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pieter Colpaert</string-name>
          <email>pieter.colpaert@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>LDES, Linked Data, Provenance, Dataset selection</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>9052 Ghent</institution>
          ,
          <country country="BE">Belgium</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>IDLab, Department of Electronics and Information Systems, Ghent University - imec</institution>
          ,
          <addr-line>Technologiepark-Zwijnaarde 122</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <abstract>
        <p>Data publishers can provide multiple interfaces per dataset. Each interface has its own merits and drawbacks, SPARQL endpoints are expensive to host and clients find it dificult to work with static data dumps. Furthermore, query agents can only select the most fitting interface and dataset if provenance information is provided. In this paper, we introduce the Smart Data Specification for Semantically Describing Streams (SDS) to annotate dataset interfaces with provenance information, describing the consumed stream and the applied transformations on that stream. We focus on Linked Data Event Streams that can publish the same dataset with diferent fragmentations and demonstrate a pipeline that transforms a LDES and publishes the data with a diferent fragmentation as described in the accompanying provenance information. The SDS vocabulary is built upon the DCAT-AP, LDES and P-Plan vocabularies. In future work, we will create a source selection strategy for federated query processors that take into account this provenance information when selecting a dataset and interface to query the dataset.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The world is ever-changing, so data portals publish live datasets derived from streams of data
(events, deltas, etc.). Streams are often related to other streams by transforming their data. This
leads to problems when datasets and streams are not accompanied by provenance information.
Query agents often use this information to query each dataset only once, while no or inadequate
provenance information forces the query agents to query the same underlying data multiple
times. Once a required dataset is found the query agent can go further and discover the most
iftting interface. Diferent interfaces determine how data is accessed.</p>
      <p>
        For example in a route planning application that notifies the user about changes in routes due
to construction sites, multiple interfaces can be used. A time-based interface makes it easy to
track the latest changes, whereas a geospatial-based interface makes it easy to calculate whether
or not a construction site will be encountered on a particular route. A SPARQL endpoint can
fulfil both interfaces, but SPARQL carries high operation costs and may leave the users with
LGOBE
(P. Colpaert)
low availability [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Constantly updating a data dump is also an option, but leaves the client
with high operation and bandwidth costs [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Linked Data Event Streams (LDES) alleviate these
high costs by fragmenting the data in diferent web resources and linking these resources with
semantic links in multiple dimensions[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], focussing on easy replication and synchronization.
Each stream can be fragmented in a diferent way to accommodate to the needs of the users.
      </p>
      <p>We set up a new interface for the Belgian street name registry and demonstrate that a query
agent can find the optimal interface to execute particular queries.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related work</title>
      <p>
        DCTerms, DCAT and VoID: Exposing metadata about datasets is long established. Dublin
Core Terms (DCTerms) can be used to provide basic information about resources, providing
terms like title, author, description and subject[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Data Catalog Vocabulary (DCAT) is designed
to facilitate interoperability between data catalogs published on the web[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. DCAT also provides
terms like license, which makes it possible to define a new license for an interface. The Vocabulary
of Interlinked Datasets (VoID) focuses on explicitly linking datasets together on some predicate
and defining subset datasets[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        LDES: Linked Data Event Streams is a way of exposing an evergrowing set of immutable
objects. These objects can be divided into fragments as HTTP resources that are linked together
with the TREE specification. Fragmentations are used to provide semantic meaning to links
between HTTP resources. Each HTTP resource can, for example, hold all items that start with
a particular letter. A view description is used to define the meaning of the fragments and their
links[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        VoCaLS: Vocabulary for Cataloging and Linking Streams and streaming services on the web
extends the ideas of DCAT with more information about streaming data[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The work defines a
stream slightly diferently than in this paper. VoCaLS focuses on streams that generate high
throughput updates, this requires processors to use a windowing mechanism. In this paper, a
stream is seen more broadly as a growing collection of objects, updates or otherwise.
      </p>
      <p>
        P-Plan and PROV-O: The Ontology for Provenance and Plans (P-Plan) is an extension of
the PROV-O ontology [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] created to represent the plans that guide the execution of scientific
processes. P-Plan describes how plans are composed. This information can be used to keep
track of provenance tree[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. The Smart Data Specification for Semantically Describing</title>
    </sec>
    <sec id="sec-4">
      <title>Streams (SDS)</title>
      <p>A stream in the context of the Smart Data Specification for Semantically Describing Streams
(SDS) is a physical live channel that carries updates or items. A dataset can be derived from a
stream as the collection of all updates or items. A physical channel can be any medium such
as a Kafka stream, a WebSocket stream or even a file where updates are appended. A stream
can carry any kind of data: CSV rows, mutable or immutable linked data objects, video stream
chunks, etc.</p>
      <p>A stream can be derived from a transformation applied to items of a diferent stream. This
transformation is described with p - p l a n and resides in the SDS description of the resulting
stream. The stream and the transformation correspond with p : p l a n : E n t i t y and p - p l a n : A c t i v i t y
respectively. This is shown as the pink part of Figure 1. The transformation links to the previous
stream with the p r o v : u s e d predicate. With the power of the p - p l a n , query agents can understand
how datasets are linked and what interface fits a specific query the best.</p>
      <p>The SDS description also links to metadata about the resulting dataset with the s d s : d a t a s e t
predicate. This makes modifying the datasets’ metadata possible after a transformation. This is
represented as the green part in Figure 1.</p>
      <p>A s d s : S t r e a m should describe the type of objects it is carrying. First, the stream can use the
s d s : c a r r i e s predicate that points to the type of the s d s : R e c o r d s it is carrying(see below). Next,
the stream can describe the shacl shape with s d s : s h a p e that these members adhere to, which
can only be used if the stream carries linked data objects.</p>
      <p>Linking specific items to the correct stream is done with s d s : R e c o r d objects. An s d s : R e c o r d
points to the data (s d s : p a y l o a d ) and the corresponding stream (s d s : s t r e a m ). These small objects
make it possible for multiple streams to use the same channel. Each transformation can thus
push s d s : R e c o r d objects and leave the original stream intact. A stream of immutable objects
can still be transformed, for example, to calculate a hash or add a fragment id to the s d s : R e c o r d
object. The yellow part of Figure 1 gives a visual overview of s d s : R e c o r d .</p>
    </sec>
    <sec id="sec-5">
      <title>4. Demo</title>
      <p>
        Data published with Linked Data Event Streams can be partitioned or fragmented in a multitude
of ways. This helps query agents resolve their queries as fast as possible whilst ingesting as
little data as possible. A default fragmentation constitutes a timestamp fragmentation, this
allows clients to replicate and synchronize the dataset eficiently. A substring fragmentation,
on the other hand, makes autocompletion more eficient[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>In this demo, we set up a pipeline starting from an existing LDES that exposes the registry of
street names with a timestamp fragmentation. The pipeline calculates a substring fragmentation
based on the name of the street and exposes a new LDES with the corresponding SDS Description
and substring fragmentation. The published V i e w s can then be associated with their respective
v i e w D e s c r i p t i o n as described in Listing 1.</p>
      <p>When asking a query agent “What are the 10 latest updated street names?” starting from
the newly created LDES, the query agent can derive from the SDS description that the current
LDES is not suitable for this query. This query would require the query agent to request the
entire LDES tree and manually find the 10 latest updates, whereas following the links from the
SDS description back to the original LDES, this query would only require a few HTTP requests.
One HTTP request gets the SDS description and another request gets the latest updates due to
the timestamp-based fragmentation.</p>
    </sec>
    <sec id="sec-6">
      <title>5. Conclusion</title>
      <p>The SDS ontology makes it possible to add a description to a stream and the resulting dataset,
this adds provenance information. The provenance links streams together and transformations
applied to the streams. The SDS ontology aligns well with long-established ontologies like
DCAT and P-Plan to maximize interoperability.</p>
      <p>With the SDS description, a query agent can now automatically select the right dataset and
interface based on a given query. This can make a LDES more like a querylike interface because
the best fragmentation for a particular problem can be found.</p>
      <p>SDS descriptions also make it possible to track applied transformations down to the source.
This enables the user that normally only extracts data from an interface to request changes at
the data source. These changes will then be propagated through the streams and result in the
intended change over all interfaces.</p>
      <p>Federated query processors, that utilize source selection based on this provenance information
when selecting a dataset and interface to query the dataset, are still future work.</p>
    </sec>
    <sec id="sec-7">
      <title>6. Acknowledgments</title>
      <p>Funded by the Flemish government’s recovery fund VSDS project: the “Vlaamse Smart Data
Space”.
@ p r e f i x e x : &lt; h t t p : / / e x a m p l e . o r g / n s # &gt; .
@ p r e f i x r d f s : &lt; h t t p : / / w w w . w 3 . o r g / 2 0 0 0 / 0 1 / r d f - s c h e m a # &gt; .
@ p r e f i x l d e s : &lt; h t t p s : / / w 3 i d . o r g / l d e s # &gt; .
@ p r e f i x p - p l a n : &lt; h t t p : / / p u r l . o r g / n e t / p - p l a n # &gt; .
@ p r e f i x p r o v : &lt; h t t p : / / w w w . w 3 . o r g / n s / p r o v # &gt; .
@ p r e f i x s d s : &lt; h t t p s : / / w 3 i d . o r g / s d s # &gt; .
e x : M y L D E S a l d e s : E v e n t S t r e a m ;</p>
      <p>d c a t : t i t l e ” A n e x a m p l e L D E S ” .
# O n e f r a g m e n t a t i o n i s b a s e d o n a n e x i s t i n g L D E S
e x : B a s i c F r a g m e n t a t i o n a t r e e : V i e w D e s c r i p t i o n ;
d c a t : e n d p o i n t U R L &lt; / b a s i c &gt; ; # A r o o t n o t e f r o m w h i c h y o u c a n a c c e s s a l l m e m b e r s
d c a t : s e r v e s D a t a s e t e x : M y L D E S ; # t h e L D E S
# T h i s v i e w D e s c r i p t i o n w a s c r e a t e d b y i m p o r t i n g t h i s s t r e a m
l d e s : m a n a g e d B y s d s : L D E S S t r e a m .
# T h e o t h e r f r a g m e n t a t i o n b u c k e t i z e s t h e m e m b e r s b e f o r e p u b l i s h i n g
e x : S u b s t r i n g F r a g m e n t a t i o n a t r e e : V i e w D e s c r i p t i o n ;
d c a t : e n d p o i n t U R L &lt; / s u b s t r i n g &gt; ; # A r o o t n o t e f r o m w h i c h y o u c a n a c c e s s a l l m e m b e r s
d c a t : s e r v e s D a t a s e t e x : M y L D E S ; # t h e L D E S
# T h i s v i e w D e s c r i p t i o n w a s c r e a t e d b y i m p o r t i n g t h i s s t r e a m
l d e s : m a n a g e d B y s d s : B u c k e t i z e d S t r e a m .
e x : I m p o r t L D E S a p - p l a n : A c t i v i t y ;
r d f s : c o m m e n t ” R e a d s c s v f i l e a n d c o n v e r t s t o r d f m e m b e r s ” ;
p r o v : u s e d &lt; h t t p s : / / s m a r t d a t a . d e v - v l a a n d e r e n . b e / b a s e / g e m e e n t e &gt; .
e x : L D E S S t r e a m a s d s : S t r e a m ;
p - p l a n : w a s G e n e r a t e d B y e x : I m p o r t L D E S ;
s d s : c a r r i e s s d s : M e m b e r .
e x : B u c k e t i z e S t r a t e g y a l d e s : B u c k e t i z e S t r a t e g y ;
l d e s : b u c k e t T y p e l d e s : S u b s t r i n g F r a g m e n t a t i o n ; # z e g t a a n d e c l i e n t d a t i k e e n t i m e s t a m p f r a g m e n t a t i o n
t r e e : p a t h r d f s : l a b e l ;
l d e s : p a g e S i z e 5 0 .
e x : B u c k e t i z e S t r e a m a p - p l a n : A c t i v i y ;
r d f s : c o m m e n t ” E x e c u t e a s u b s t r i n g b u c k e t i z a t i o n o n t h e i n c o m i n g s t r e a m ” ;
p r o v : u s e d e x : L D E S S t r e a m , e x : B u c k e t i z e S t r a t e g y .
e x : B u c k e t i z e d S t r e a m a s d s : S t r e a m ;
p - p l a n : w a s G e n e r a t e d B y e x : B u c k e t i z e S t r e a m ;
s d s : c a r r i e s s d s : M e m b e r .</p>
      <p>Listing 1: RDF sample creating two LDES Views from diferent Streams</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Buil-Aranda</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hogan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Umbrich</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vandenbussche</surname>
          </string-name>
          , P.-Y.:
          <article-title>SPARQL web-querying infrastructure: Ready for action</article-title>
          ? In: Alani,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Kagal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Fokoue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Groth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Biemann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Parreira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.X.</given-names>
            ,
            <surname>Aroyo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Noy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Welty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            , and
            <surname>Janowicz</surname>
          </string-name>
          , K. (eds.) The semantic web - iswc
          <year>2013</year>
          . pp.
          <fpage>277</fpage>
          -
          <lpage>293</lpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Verborgh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Vander</given-names>
            <surname>Sande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Colpaert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Coppens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Mannens</surname>
          </string-name>
          , E., Van de Walle, R.:
          <article-title>Web-scale querying through Linked Data Fragments</article-title>
          . In: Bizer,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Heath</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Auer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            , and
            <surname>Berners-Lee</surname>
          </string-name>
          ,
          <string-name>
            <surname>T</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 7th workshop on linked data on the web</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Van</given-names>
            <surname>Lancker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Colpaert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Delva</surname>
          </string-name>
          , H., Van de Vyvere,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Meléndez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.R.</given-names>
            ,
            <surname>Dedecker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Michiels</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Buyle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>De Craene</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Verborgh</surname>
          </string-name>
          , R.:
          <article-title>Publishing base registries as linked data event streams</article-title>
          . In: Brambilla,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Chbeir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Frasincar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            , and
            <surname>Manolescu</surname>
          </string-name>
          , I. (eds.)
          <article-title>Web engineering</article-title>
          . pp.
          <fpage>28</fpage>
          -
          <lpage>36</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Ben</given-names>
            <surname>Ellefi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Bellahsene</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Breslin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.G.</given-names>
            ,
            <surname>Demidova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Dietze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Szymański</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Todorov</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          :
          <article-title>RDF dataset profiling - a survey of features, methods, vocabularies and applications</article-title>
          .
          <source>Semantic Web</source>
          .
          <volume>9</volume>
          ,
          <fpage>677</fpage>
          -
          <lpage>705</lpage>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Michel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Faron-Zucker</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corby</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Enabling automatic discovery and querying of web apis at web scale using linked data standards</article-title>
          .
          <source>Companion proceedings of the 2019 world wide web conference</source>
          . pp.
          <fpage>883</fpage>
          -
          <lpage>892</lpage>
          . Association for Computing Machinery, New York, NY, USA (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Baker</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Libraries, languages of description, and linked data: A dublin core perspective</article-title>
          .
          <source>Library Hi Tech</source>
          .
          <volume>30</volume>
          ,
          <fpage>116</fpage>
          -
          <lpage>133</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Beltran</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cox</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Browning</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perego</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Albertoni</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Winstanley</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Data catalog vocabulary (DCAT) - version 2</article-title>
          .
          <source>W3C</source>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Alexander</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cyganiak</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hausenblas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Describing linked datasets</article-title>
          .
          <source>LDOW</source>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Tommasini</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sedira</surname>
            ,
            <given-names>Y.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dell'Aglio</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balduini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ali</surname>
            ,
            <given-names>M.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le Phuoc</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Della</given-names>
            <surname>Valle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Calbimonte</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.-P.:</surname>
          </string-name>
          <article-title>VoCaLS: Vocabulary and catalog of linked streams</article-title>
          . In: Vrandečić,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Bontcheva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Suárez-Figueroa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.C.</given-names>
            ,
            <surname>Presutti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Celino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Sabou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Kafee</surname>
          </string-name>
          , L.-A., and
          <string-name>
            <surname>Simperl</surname>
          </string-name>
          , E. (eds.) The semantic web - iswc
          <year>2018</year>
          . pp.
          <fpage>256</fpage>
          -
          <lpage>272</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Lebo</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sahoo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>PROV-o: The PROV ontology</article-title>
          .
          <source>W3C</source>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Garijo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gil</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <string-name>
            <surname>The P-Plan</surname>
            <given-names>ontology.</given-names>
          </string-name>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Van de Vyvere</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>D'Huynslager</surname>
            ,
            <given-names>O.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Atauil</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Segers</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Van Campe</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vandekeybus</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Teugels</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pauwels</surname>
          </string-name>
          , P.-J.,
          <string-name>
            <surname>Colpaert</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Publishing cultural heritage collections of ghent with linked data event streams</article-title>
          . In: Garoufallou,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Ovalle-Perandones</surname>
          </string-name>
          , M.-A., and
          <string-name>
            <surname>Vlachidis</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . (eds.) Metadata and semantic research. pp.
          <fpage>357</fpage>
          -
          <lpage>369</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>