<!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>Towards VoIS: a Vocabulary of Interlinked Streams</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yehia Abo Sedira</string-name>
          <email>yehiamohamed.abosedera@mail.polimi.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Riccardo Tommasini</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Emanuele Della Valle</string-name>
          <email>emanuele.dellavalle@polimi.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Politecnico di Milano, DEIB</institution>
          ,
          <addr-line>Milan</addr-line>
          ,
          <country>Italy riccardo.tommasini</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Since the mid 2000s', the Linked Data principles, and the tools they inspired, became a solid foundation for a decentralized yet connected Web of Data where static (or slowly evolving) data can be shared and traversed. However, the growing popularity of (fast) streaming data is now calling for an extension of Linked Data towards a Web of Data Streams. In this paper, we identify several challenges to solve towards this vision. Moreover, we present VoIS, a Vocabulary of Interlinked Streams, and we show how it contributes in addressing such challenges.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Like static data, streams are referenced using URIs. Cross Links, i.e. the
navigation from one data source to another, is possible from data items owing
in the streams to Linked Data, but it is unclear how the opposite can work in
the general case, due to the volatile nature of those owing data items.</p>
      <p>Stream representation is an open problem. While many vocabulary are
available to describe datasets, e.g. VoID, Dcat, DC terms, none of them is suitable
to represent a data stream. Listing 1.1 clearly shows that some information is
missing when we deal with streaming data. See for instance Line 9, how can
we expect to dump a potentially in nite data stream? Moreover, the dump will
be continuously updated, but how can we describe this phenomena? One may
argue that Partition (see Lines 10-16) can solve the issue, but still metadata
to describe the Window (e.g., length, starting time, or periodicity) are missing.</p>
      <p>Last but not, streams are not generally served via HTTP.
1 : M i l a n T r a f f i c D S a v o i d : Dataset ; # No datastream c o n c e p t
2 dcterms : s u b j e c t dbc : T r a f f i c ;
3 dcterms : s u b j e c t dbc : Milan ;
4 dcterms : t i t l e " Milan t r a f f i c stream " ;
5 dcterms : d e s c r i p t i o n " Streaming t r a f f i c a s p e c t o f milan
a r e a s " ;
6 terms : l i c e n s e &lt;h t t p s : / / creativecommons . org / l i c e n s e s /by nc
/4.0/ &gt; ;
7 f o a f : homepage &lt;http : / /www. example . com/ &gt;;
8 v o i d : v o c a b u l a r y &lt;http : / / dbpedia . org/&gt; ;
9 v o i d : dataDump &lt;http : / /www. example . com/dump . t t l &gt; ;
10 v o i d : c l a s s P a r t i t i o n [ v o i d : c l a s s f o a f : O r g a n i z a t i o n ; ] ;
11 v o i d : p r o p e r t y P a r t i t i o n [ v o i d : p r o p e r t y f o a f : name ; ] ;
12 v o i d : s u b s e t : Window 1 .
13 : Window 1 a v o i d : Dataset ;
14 dcterms : t i t l e "Window o f Milan t r a f f i c stream " ;
15 dcterms : d e s c r i p t i o n "Window o f Milan t r a f f i c stream " ;
16 v o i d : dataDump &lt;http : / /www. example . com/dump . t t l &gt; .</p>
      <p>Listing 1.1. VoID limits for stream representation</p>
      <p>
        Linked Data Noti cation (LDN) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] is a recent approach that enables
asynchronous communications between decentralized actors. Although LDN captures
the idea of a dynamic environment and focuses on the transmission of linked
data (not necessarily bounded to the HTTP protocol), it does o er a solution
for decentralized data streams.
      </p>
      <p>
        Velocity in Linked Data [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] was always seen as changes/updates and
handled by means of versioning systems capable of answering comparative SPARQL
queries across historical instances. Unfortunately, this mechanisms does not scale
to scenarios where changes happens extremely frequently like in data streams.
Indeed, the Stream Reasoning community de ned SPARQL extensions that can
speci cally target streaming data by means of the continuous semantics,
however, much as LDN, they focus on the description and the processing of the
owing data items without paying much attention to describe the data stream.
      </p>
      <p>In this paper, we investigate the following research question: Can we
represent and publish data stream on the Web as Linked Data? In order to answer
such a research question, we designed VoIS1, i.e. a Vocabulary of Interlinked
Datastreams (VoIS), which is the main contribute of this paper.</p>
      <p>The remainder of the paper is organized as follows. Section 2 reports on the
requirement analysis we conducted starting from the challenge we perceive in
Web of Data Streams. Section 3 illustrates the overall solution we propose with
our Vocabulary of Interlinked Datastreams (VoIS). Section 4 explains how VoIS
can be used to address the challenges introduced in Section 2. In Section 5, we
position VoIS w.r.t. the state of the art. Finally, in Section 6, we draw some
conclusions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>From Challenges to a Requirement Analysis</title>
      <p>In this section, we present the challenges that we perceive in the Web of Data
Streams. By discussing them, we elicit the requirements for a vocabulary able
to positively answer our research question. Table 2 summarizes our requirement
analysis.</p>
      <p>Challenges Requirememnts
Stream Discovery Metadata are required to enable lookup, selection, linking, and
licensing of streaming data sources in a decentralized way.</p>
      <p>Stream Access Applications must be able to negotiate access to data via streaming
protocols and standards.</p>
      <p>Stream Recall At least the most recent part of a data stream must be accessed via</p>
      <p>Linked Data standards and protocols.</p>
      <p>Provenance The provenance of operations that can generate, manipulate or
delete a stream must be tracked.</p>
      <p>
        Table 2. Challenges and requirements in the Web of Data Streams
Stream Discovery. For a Linked Data application, discovery is the process of
nding available datasets that are relevant to a certain task [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. The process
is based on the dataset metadata (i.e. void:DatasetDescription) and available
endpoints ( e.g. void:sparqlEndpoint).
      </p>
      <p>A vocabulary must enable the discovery process by specifying which
annotations are relevant for a data stream, e.g. stream rate, source and content
information. Moreover, it is worth to mention that licensing plays a crucial role
in a decentralized Web environment where actors can exchange data for goods.
Stream Access. In Linked Data, access usually refers to the problems of
fetching a data dump or delegating the SPARQL query execution to some endpoint.</p>
      <p>Generally, streaming data are not served using HTTP nor queried using
Linked Data standards (RDF/SPARQL). It is rather provisioned via streaming
APIs or queried by means of systems that support continuous queries.</p>
      <sec id="sec-2-1">
        <title>1 https://github.com/streamreasoning/vois</title>
        <p>
          A vocabulary is needed to de ne how to access streams, what are the available
options and who can access them. Moreover, it must describe, if the access
requires any extensions beyond HTTP-based content negotiation mechanisms.
Stream Recall. Changes in Linked Data are usually handled by versioning
system and data dumps; this allows to query the previous version of a dataset
by means of specialized endpoints and SPARQL extensions [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
        </p>
        <p>Unfortunately, a general assumption for stream processing is that streams
are theoretically unbounded and it is not possible (or meaningful) to store them
entirely. This practically means that any attempt to access streaming data with
one-time queries hardly ends up with the same result twice.</p>
        <p>A vocabulary must explain how to access past data when possible and how we
can possibly do it using one-time access to data issued via traditional protocols
(i.e. HTTP) and standards (RDF/SPARQL).</p>
        <p>Provenance. A nal challenge regards tracking the provenance of those
processes that generate or manipulate a data stream. Indeed, discovery, processing
and recall need to trust the data provisioner and they have to be able to evaluate
the semantics of the data stream. A vocabulary must capture the
transformations that might in uence both the provenance of a stream as a whole and the
one of the various time-varying data items that ow in the data stream.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Vocabulary of Interlinked Datastreams (VoIS)</title>
      <p>In this section, we introduce the rst version of the Vocabulary of Interlinked
Datastreams (VoIS) which extends VoID to represent streams as Linked Data.</p>
      <p>
        As depicted in Figure 1, the following abstractions regulate
the de nition of a stream and, thus, the access to its content: a
(i) vois:InstantaneousStremElement is unit of content at a given time
instant. (ii) a vois:DataStream { which is usually served though a streaming
API [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] { is an unbounded sequences of vois:InstantaneousStremElement.
Streams metadata are available within a (iii) vois:DataStreamDescription,
which is a Web resource that can be accessed through HTTP. Finally a
recent portion of the time-varying data items that owed on the stream, i.e.
(iv) vois:FiniteStreamPartition, are made available via HTTP to enable
consuming part of the stream with standard SPARQL (one-time) queries.
      </p>
      <p>
        VoIS design takes inspiration from the -architecture [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] { an architectural
pattern typical of Big Data applications. In order to deal with data velocity
without turning down accuracy, a pipeline that computes the results on-the- y
is places side-by-side to the one that performs batch computations with a coarser
time granularity. Figure 2 shows how VoIS abstractions allows representing
timevarying data items in the streaming side of this architecture. Note that FSP
stays for Finite Stream Portion and the leftmost FSP is not linked because old
enough FSP can be forgotten from the streaming{side of the -architecture,
since they are now available from the the batch{side. The batch side, which is
not illustrated, can be implemented with Linked Data.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Addressing Challenges with VoIS</title>
      <p>In this section, we show how VoIS solves the challenges we presented in Section 2.
Table 3 summarizes how each requirement is satis ed in VoIS.</p>
      <p>Challenges Vois
Stream Discovery DataStream, SourceDescription and StreamDescription.
Stream Access StreamEndpoint(ws), RSPEndpoint, SPARQLendpoint.
Stream Recall FiniteStreamPartition, Windowing
Provenance (S) StreamToRelation (R), R2R, R2S, S2S operators with PROV-O.</p>
      <p>Table 3. Challenges and VoIS solutions for a Web of Data Streams.</p>
      <p>Stream Discovery. As mentioned in Section 2, traditional data discovery is
based on the dataset and endpoint metadata. Similarly, we identi ed di erent
set of metadata to enable discovery of data streams:
{ stream metadata, i.e. time-varying metadata that refers to the stream
content (e.g. rate),
{ source metadata, i.e. metadata that refer to the source of the stream (e.g.</p>
      <p>sensor capabilities),
{ publication metadata, that connects sources, streams and possible samples
and makes the stream actually ndable by means of registry or repositories.</p>
      <p>VoIS allows to capture all these levels of metadata by means of
three classes, i.e., vois:DataStream, vois:StreamSourceDescription, and
vois:StreamDescription. Figure 3 depicts the structure of the representation,
while Listing 1.2 shows an example that uses Dublin Core2 and VoID
vocabularies for stream metadata about subject and licensing. SSN is used to describe
the source, which is a sensor. The vois:StreamDescription is the le itself.
Stream Access. In a Web of Data Streams, data are processed as soon as
they arrive by systems capable to deal with information ows. Streaming data
access relies either on protocols speci cally designed to reduce the overhead of the
request or registering a continuous query to a Stream Processor that is exposed as
an endpoint. Either ways require to extend the Linked Data content negotiation
protocol to enable direct access and continuous querying, since streaming data
are neither generally served using HTTP nor querable by with SPARQL engines.</p>
      <sec id="sec-4-1">
        <title>2 http://dublincore.org/documents/dcmi-terms/</title>
        <p>
          VoIS captures this extension
by means of vois:Endpoint, that
describes the available endpoints
to access a data stream. Currently,
we de ned two types of endpoints
widely used in stream processing:
vois:StreamEndpoint that
represents streaming API (e.g. Web
Socket) [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] and vois:RSPEndpoint
that refers to endpoints that ex- Fig. 4. Using VoIS for discovery
pose methods to register continuous
queries [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
        </p>
        <p>Stream Recall. Versioning is not a traditional stream processing use-case,
however, in a Web of Data Streams providing Liked Data compliant access to, at
least, a recent part of past information serves the purposes of many applications.</p>
        <p>In VoIS, we introduced two classes vois:InstantaneousStreamElement
and vois:FiniteStreamPartition for this reason. As the name suggests, the
former represents a single data item in the stream with temporal metadata, while
the latter is a sample that contains stream elements. More precisely, we de ned
vois:Window as a partition that is generated according to certain criteria and
correspond to a time interval that contains some stream elements.</p>
        <p>An crucial point is maintaining the order between stream elements. Indeed,
anyvois:InstantaneousStreamElement are is linked with its predecessor by
means of the property vois:previousElement. Similarly, any vois:Window is
part of a list linked through the property vois:previousWindow.</p>
        <p>Figure 5 illustrates the relation between window and stream elements.
Thanks to these abstractions it is possible to locate and access stream data
items in the past exploiting the temporal metadata as shown in Listing 1.3.
2 WHERE f ?w a v o i s : Window ; v o i s : s t a r t e d A t ? i n s t a n t .
3 ? i n s t a n t time : inXSDDateTime ? s .
4 FILTER( ? s &gt; "2017 06 05T00 : 3 8 : 0 0 . 0 0 0 " ^^ xsd : dateTime . ) g
Listing 1.3. SPARQL query retrieving window overlapping with speci c time instance
Provenance. As mentioned in Section 2, two are the types of transformation
that can in uence the provenance of a stream.</p>
        <p>Figure 6 shows how the windowing mechanism is modeled in VoIS by means
of PROV-O ontology. We used the Agent-Activity-Entity design pattern to
represent the windowing action on a stream.</p>
        <p>Figure 7 illustrates how to model Stream-level transformations in VoIS. A
new relation vois:hasAffluent between streams was introduced to model
the fact that a stream { namely a swollen one { is derived from others
{ namely a uent ones. Accordingly, two subtypes of streams are modeled:
vois:SwollenStream to refer to a stream derived from other streams, and
vois:AffluentStream to refer to stream contributing to a swollen stream.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Related Work</title>
      <p>In this section, we discuss the related work with regard to the challenges we
presented in Section 2. Table 4 summarizes the discussion.</p>
      <p>
        DCterms, DCAT and VoID. Several vocabularies exist to describe
dataset by means of metadata. Dublin Core Terms 3 is the rst one made to
describe both physical and Web resources. It provides fteen generic terms (eg.
Title, Creator, Subject and Description). Data Catalog Vocabulary (DCAT) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
is an RDF vocabulary designed to facilitate interoperability between data
catalogs published on the Web. It focuses on describing how static data catalogs
and datasets are accessible and distributed. Vocabulary of Interlinked Datasets
(VoID) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] aims at describing RDF datasets and cross dataset links. VoID's
use-cases comprise dataset discovery, selection and query optimization.
      </p>
      <p>None of these vocabularies fully solves the challenges we identi ed for a Web
of Data Streams. They neither capture the dynamic nature of data stream nor to
represent time-varying data elements. Although discovery is still possible relying
on source metadata, streaming data access is never taken into account. Recall
can be partially achieved by periodically creating dumps of the stream data.
However, this approach does not scale well with streaming data. Provenance
tracking is possible, but limited to stream data sources only.</p>
      <p>
        Linked Stream Data [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Sequeda and Corcho proposed a URI based
mechanism to identify and access stream data coming from sensor networks. This
proposal takes into account temporal and spatial aspects that are relevant from
a query perspective. LSD enables discovery by referencing streams. However,
authors neither proposed any protocol extensions that would support streaming
access, nor discussed the problem of recalling old portions of the stream.
Provenance tracking is possible by means of data source descriptions (Sensors), but
not in terms of stream transformations.
      </p>
      <p>
        Streaming Linked Data [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Barbieri et al. proposed to publish data
streams as Linked Data by means of an RSP engine. To this extent they
introduced the concepts of Stream Graph (or s-graph) and Instantaneous Graph
(or igraph). This makes possible fully solves the problem of discovery and we can
partially track the provenance of the RSP engine activity. However, they did not
consider any protocol extension nor described the problem of recall. VoIS build
on SLD introducing a better description of data stream access and provenance.
      </p>
      <sec id="sec-5-1">
        <title>3 http://dublincore.org/documents/dcmi-terms/</title>
        <p>
          Linked Data Noti cation (LDN) [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Capadisli et al. proposed a protocol
{ now o cially a W3C recommendation4 { that aims at making Web Noti
cations de-referenceable, persistent and reusable, i.e. compliant to Linked Data
principles. Such a protocol orchestrates the communication between senders,
receives and consumers. Stream Access might be possible using LDN since they
are not bounded to any speci c transmission protocols, although the
communication methods between consumer and receives are RESTful. We can track
the provenance of the involved actors, but not speci cally stream
transformations. Finally, neither Stream Discovery nor Recall challenges are in the scope
of the work, which targets communication/sharing between actors rather than
exploration and querying.
6
        </p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion and Future Work</title>
      <p>In this paper, we advocated Data Streams as part of the Linked Data ecosystem.
To this extent, we presented four challenges that we perceived in the Web of Data
Streams. We elicit the requirements for a vocabulary able to support machines
in automatically addressing those challenges in a decentralized environment and
we contribute Vocabulary of Interlinked Datastreams (VoIS) as a solution.</p>
      <p>VoIS has the potential to enable:
{ Stream Discovery { it allows identifying streams that are relevant to one
task according to the metadata the publishers used to describe the nature
of their streams, the endpoints where they can be accessed and any other
relevant information (encoded with a specialized vocabulary).
{ Stream Access { it describes the information necessary to extend the Linked
Data content negotiation approach in order to allow accessing data streams
by the means of streaming APIs and consuming on the y the time-varying
data that ows on them.
{ Stream Recall { it o ers a way for a stream publisher to exposed as Linked
Data a recent portion of the (naturally unbounded) data streams and, thus,
permits to issue one-time SPARQL query to recall recent time-varying data.
{ Provenance { it enables provenance tracking in terms of stream source and
transformations both at the level of the entire data stream and at the level
of the time-varying data elements that ow on it.</p>
      <p>As for future works, evaluating the vocabulary both functionally and
statistically is our current priority. We plan to do the former by asking for reviews
to Semantic Web / Stream Reasoning experts, Linked Data practitioners and
students. We plan to do the latter following ontology evaluation best practices.</p>
      <p>
        Moreover, we are working on the implementations of a machinery (based
on [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]) that practically demonstrates the advantages of using VoIS.
      </p>
      <sec id="sec-6-1">
        <title>4 https://linkedresearch.org/ldn/</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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>In: Proceedings of the WWW2009 Workshop on Linked Data on the Web, LDOW</source>
          <year>2009</year>
          , Madrid, Spain, April
          <volume>20</volume>
          ,
          <year>2009</year>
          . (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Babcock</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Babu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Datar</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Motwani</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Widom</surname>
          </string-name>
          , J.:
          <article-title>Models and issues in data stream systems</article-title>
          .
          <source>In: Proceedings of the Twenty- rst ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems</source>
          , June 3-5, Madison, Wisconsin, USA. pp.
          <volume>1</volume>
          {
          <issue>16</issue>
          (
          <year>2002</year>
          ), http://doi.acm.
          <source>org/10</source>
          .1145/543613.543615
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Balduini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Della</given-names>
            <surname>Valle</surname>
          </string-name>
          , E.:
          <article-title>A restful interface for RDF stream processors</article-title>
          .
          <source>In: International Semantic Web Conference (Posters &amp; Demos)</source>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>1035</volume>
          , pp.
          <volume>209</volume>
          {
          <fpage>212</fpage>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Balduini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Della</given-names>
            <surname>Valle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Dell'Aglio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Tsytsarau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Palpanas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Confalonieri</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          :
          <article-title>Social listening of city scale events using the streaming linked data framework</article-title>
          .
          <source>In: International Semantic Web Conference (2). Lecture Notes in Computer Science</source>
          , vol.
          <volume>8219</volume>
          , pp.
          <volume>1</volume>
          {
          <fpage>16</fpage>
          . Springer (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Barbieri</surname>
            ,
            <given-names>D.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Della Valle</surname>
          </string-name>
          , E.:
          <article-title>A proposal for publishing data streams as linked data - A position paper</article-title>
          .
          <source>In: Proceedings of the WWW2010 Workshop on Linked Data on the Web, LDOW</source>
          <year>2010</year>
          ,
          <article-title>Raleigh</article-title>
          , USA, April
          <volume>27</volume>
          ,
          <year>2010</year>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Capadisli</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guy</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lange</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sambra</surname>
            ,
            <given-names>A.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Linked data noti cations: A resource-centric communication protocol</article-title>
          .
          <source>In: ESWC (1). Lecture Notes in Computer Science</source>
          , vol.
          <volume>10249</volume>
          , pp.
          <volume>537</volume>
          {
          <issue>553</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>DellAglio</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Della</given-names>
            <surname>Valle</surname>
          </string-name>
          , E.,
          <string-name>
            <surname>van Harmelen</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernstein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Stream reasoning: A survey and outlook</article-title>
          .
          <source>Data Science (Preprint)</source>
          ,
          <volume>1</volume>
          {
          <fpage>24</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. Kafer, T.,
          <string-name>
            <surname>Abdelrahman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Umbrich</surname>
            , J.,
            <given-names>O</given-names>
          </string-name>
          <string-name>
            <surname>'Byrne</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hogan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Observing linked data dynamics</article-title>
          .
          <source>In: ESWC. Lecture Notes in Computer Science</source>
          , vol.
          <volume>7882</volume>
          , pp.
          <volume>213</volume>
          {
          <fpage>227</fpage>
          . Springer (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Maali</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cyganiak</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peristeras</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Enabling interoperability of government data catalogues</article-title>
          .
          <source>In: Electronic Government, 9th IFIP WG 8</source>
          .5 International Conference, EGOV 2010, Lausanne, Switzerland,
          <source>August 29 - September 2</source>
          ,
          <year>2010</year>
          . Proceedings. pp.
          <volume>339</volume>
          {
          <issue>350</issue>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Marz</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Warren</surname>
          </string-name>
          , J.:
          <article-title>Big Data: Principles and Best Practices of Scalable Real-time Data Systems</article-title>
          . Manning (
          <year>2015</year>
          ), https://books.google.it/books?id=HWkMQEACAAJ
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Mauri</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calbimonte</surname>
            ,
            <given-names>J.</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>Brambilla</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Della</given-names>
            <surname>Valle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Aberer</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          :
          <article-title>Triplewave: Spreading RDF streams on the web</article-title>
          .
          <source>In: The Semantic Web - ISWC 2016 - 15th International Semantic Web Conference</source>
          , Kobe, Japan,
          <source>October 17-21</source>
          ,
          <year>2016</year>
          , Proceedings, Part II. pp.
          <volume>140</volume>
          {
          <issue>149</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Nikolov</surname>
          </string-name>
          , A.,
          <string-name>
            <surname>d'Aquin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Identifying relevant sources for data linking using a semantic web index</article-title>
          .
          <source>In: WWW2011 Workshop on Linked Data on the Web, Hyderabad, India, March</source>
          <volume>29</volume>
          ,
          <year>2011</year>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Sequeda</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corcho</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Linked stream data: A position paper</article-title>
          .
          <source>In: Proceedings of the 2nd International Workshop on Semantic Sensor Networks ( SSN09 )</source>
          ,
          <article-title>collocated with the 8th International Semantic Web Conference ( ISWC-</article-title>
          <year>2009</year>
          ), Washington DC, USA, October
          <volume>26</volume>
          ,
          <year>2009</year>
          . pp.
          <volume>148</volume>
          {
          <issue>157</issue>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Tappolet</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernstein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Applied temporal RDF: e cient temporal querying of RDF data with SPARQL</article-title>
          .
          <source>In: The Semantic Web: Research and Applications, 6th European Semantic Web Conference, ESWC</source>
          <year>2009</year>
          , Heraklion, Crete, Greece, May 31-June 4,
          <year>2009</year>
          , Proceedings. pp.
          <volume>308</volume>
          {
          <issue>322</issue>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>