0% found this document useful (0 votes)
39 views69 pages

BigData Tutorial Part1

Big Data

Uploaded by

srk_uk
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
0% found this document useful (0 votes)
39 views69 pages

BigData Tutorial Part1

Big Data

Uploaded by

srk_uk
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 69

Introduction to Linked Data

Marko Grobelnik, Andreas Harth, Dumitru Roman


Big Linked Data Tutorial Semantic Days 2012

Tutorial Agenda
Introduction to Linked Data (45 m 60 m) Andreas
Consuming Norwegian Linked Data (30 m) Titi
Large Scale Linked Data Management (30 m) Andreas
Big Data Intro and Analytics (60 m 90 m) Marko
Questions & Answers Session (30 m) all

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Introduction to Linked Data (Andreas)


Motivation
Linked Data
Principles (Web Architecture and RDF, Resource Description
Framework)
SPARQL RDF Query Language

Ontology Languages
RDF Vocabulary Description Language (RDFS)
Web Ontology Language (OWL)

Application Architectures
Summary

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

MOTIVATION

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Motivation
With increased use of computers more and more data is
being stored
Organisations rely on data for business decisions
Data drives policy decisions in government
Individuals rely on data from the Web for information and
communication

Data volumes explode


More and more data available on the Web is represented in
Semantic Web standards
Linking Open Data (LOD) initiative

Semantic Web technologies facilitate the integration of data


from multiple sources
Combining data from multiple sources enables insights
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data on the Web

2007-10
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data on the Web

2007-11
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data on the Web

2008-02
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data on the Web

2008-03
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data on the Web

2008-09
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data on the Web

2009-03
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data on the Web

2009-07
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data on the Web

2010-09
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data on the Web

2011-09
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Types of Data in the Linking Open Data Cloud

http://www4.wiwiss.fu-berlin.de/lodcloud/state/ (Sept 2010)


Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Scenario Overview
Semantic Technologies facilitate access to data
1. Query

2. Answer

Q: data about Berlin?


Q: famous people that died in Berlin?
Q: data about Hegel?
Q: Hegels publications?
Q: data about Marlene Dietrich?
Q: Dietrichs songs?
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

DBpedia
Linked Data version of Wikipedia
Scripts that extract data (text, links, infoboxes) from
Wikipedia
Published as Linked Data
Interlinking hub in the Linked Data web
Berlin
http://dbpedia.org/resource/Berlin

Hegel
http://dbpedia.org/resource/Georg_Wilhelm_Friedrich_Hegel

Marlene Dietrich
http://dbpedia.org/resource/Marlene_Dietrich
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

BBC Music
Data about BBC (radio) programmes, artists, songs
Combination of BBC-internal data (playlists), MusicBrainz
(artists, albums), Wikipedia (artists)
Underpinning the BBC Music website
Data published according to Linked Data principles
Marlene Dietrich
http://www.bbc.co.uk/music/artists/191cba6a-b83f-49ca-883c02b20c7a9dd5.rdf#artist

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Virtual International Authority File (VIAF)


Joint project of national libraries and related organisations
21 institutions, among them the Library of Congress, Deutsche
Nationalbibliothek, Bibliothque nationale de France

Provide access to authority files


Matching and interlinking collections from participating
institutions
Hegel
http://viaf.org/viaf/89774942/

Marlene Dietrich
http://viaf.org/viaf/97773925/

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

LINKED DATA PRINCIPLES

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Semantic Technologies
Semantic Web technologies,
standardised by the W3C, are
mature:
RDF recommendation in 1999,
update in 2004
RDFa (RDF in HTML) note in 2008
RDFS recommendation in 2004
SPARQL recommendation in 2008
OWL recommendation in 2004,
update in 2009

Linked Data is a subset of the


Semantic Web stack, including web
architecture:
IRI (IETF RFC 3987, 2005)
HTTP (IETF RFC 2616, 1999)
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data Principles


1.
2.
3.

4.

Use URIs as names for things


Use HTTP URIs so that people can look up those names.
When someone looks up a URI, provide useful
information, using the standards (RDF*, SPARQL)
Include links to other URIs. so that they can discover more
things.

http://www.w3.org/DesignIssues/LinkedData
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

1. Use URIs as Names for Things


Use a unique identifier to denote things
URIs are defined in RFC 2396
Hegel, Georg Wilhelm Friedrich
http://dbpedia.org/resource/Georg_Wilhelm_Friedrich_Hegel
http://viaf.org/viaf/89774942/

Hegel, Georg Wilhelm Friedrich: Gesammelte Werke /


Vorlesungen ber die Logik
urn:isbn:978-3-7873-1964-0

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Names for Things

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

2. Use HTTP URIs


Enables lookup of URIs
Via Hypertext Transfer Protocol (HTTP)
Piggy-backs on hierarchical Domain Name System to
guarantee uniqueness of identifiers
Uses established HTTP infrastructure
Connects logical level (thing) with physical level (source)
Important: distinction between thing URI and source
URI (other resource vs. information resource)

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Information Resources vs. Other Resources

Marlene Dietrich, the person

File containing data about


Marlene Dietrich

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Name?
Creator?
Birth date?
Last change date?
License?
Copyright?

Correspondence between thing-URI and source-URI


(hash URIs)

User Agent

http://www.bbc.co.uk/music/artists/191cba6
a-b83f-49ca-883c-02b20c7a9dd5.rdf#artist
HTTP
GET

RDF

Web Server

http://www.bbc.co.uk/music/artists/191cba6
a-b83f-49ca-883c-02b20c7a9dd5.rdf
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

RESPONSE

REQUEST

Hypertext Transfer Protocol (HTTP)


$ curl -H "Accept: application/rdf+xml" -v
http://www.bbc.co.uk/music/artists/191cba6a-b83f-49ca-883c02b20c7a9dd5.rdf#artist
> GET /music/artists/191cba6a-b83f-49ca-883c-02b20c7a9dd5.rdf
HTTP/1.1
> User-Agent: curl/7.25.0
> Host: bbc.co.uk
> Accept: application/rdf+xml
<
<
<
<
<
<
{

HTTP/1.1 200 OK
Date: Tue, 08 May 2012 07:12:19 GMT
Server: Apache/2.2.3 (Red Hat)
Content-Type: application/rdf+xml
Content-Length: 1956
[data not shown]
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Correspondence between thing-URI and source-URI


(slash URIs)

User Agent

http://dbpedia.org/resource/Marlene_Dietrich
HTTP
GET

303 HTTP
GET

Web Server

RDF

http://dbpedia.org/data/Marlene_Dietrich

http://dbpedia.org/page/Marlene_Dietrich

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

3. Provide Useful Information


When somebody looks up a URI, return data using the
standards (RDF*, SPARQL)
Resource Description Framework, a format for encoding
graph-structured data (with URIs to identify nodes/vertices
and links/edges)

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Resource Description Framework


Directed, labeled graph
triple(subject, predicate, object)
subject: URI (or blank node)
predicate: URI
object: URI (or blank node) or RDF literal (string, integer, date)

RDF/XML is the most widely deployed serialisation


Other serialisations possible (N-Triples, Turtle, Notation3)
Quadruples (or quads) used as internal representation when
integrating data
quad(subject, predicate, object, context)
context: URI (used to store origin of triple)

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

RDF Example
dbpedia:Georg_Wilhelm_Friedrich_Hegel rdf:type
foaf:Person .
dbpedia:Georg_Wilhelm_Friedrich_Hegel rdf:type
yago:PoliticalPhilosophers .
dbpedia:Georg_Wilhelm_Friedrich_Hegel
rdfs:comment "Georg Wilhelm Friedrich Hegel var
en tysk filosof."@no .
dbpedia:Georg_Wilhelm_Friedrich_Hegel dbpediaowl:influenced dbpedia:Francis_Fukuyama .
dbpedia:Georg_Wilhelm_Friedrich_Hegel dbpediaowl:influenced dbpedia:Friedrich_Nietzsche .

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Merging Data with RDF

+
=

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

4. Link to Other URIs


Enable people (and machines) to jump from server to
server
External links vs. internal links (for any predicate)
Special owl:sameAs links to denote equivalence of
identifiers (useful for data merging)

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Equivalences via owl:sameAs


http://viaf.org/viaf/89774942/
http://dbpedia.org/resource/Georg_Wilhelm_Friedrich_Hegel
http://www.idref.fr/026917467/id
http://libris.kb.se/resource/auth/190350
http://d-nb.info/gnd/118547739

http://www.bbc.co.uk/music/artists/191cba6a-b83f-49ca-883c-02b20c7a9dd5#artist
http://dbpedia.org/resource/Marlene_Dietrich

http://viaf.org/viaf/97773925/
http://dbpedia.org/resource/Marlene_Dietrich .
http://d-nb.info/gnd/118525565
http://libris.kb.se/resource/auth/238817
http://www.idref.fr/027561844/id

http://dbpedia.org/resource/Berlin
http://mpii.de/yago/resource/Berlin
http://data.nytimes.com/N50987186835223032381 - Berlin (Germany)
http://www4.wiwiss.fu-berlin.de/flickrwrappr/photos/Berlin
http://data.nytimes.com/16057429728088573361 - Gaspe Peninsula (Quebec) (?)
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

SPARQL RDF PROTOCOL AND


QUERY LANGUAGE
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

SPARQL
SPARQL Protocol and RDF Query Language
Query language for RDF graphs
SQL for RDF
SPARQL specification consists of
Query language
Result formats (representation of results in RDF and XML)
Query protocol (mechanisms to pose queries and retrieve results)

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Simple Query Example


PREFIX dct: <http://purl.org/dc/terms/>
PREFIX rdfs: <http://www.w3.org/2000/01/rdf-schema#>
SELECT *
WHERE {
?s dct:subject
<http://dbpedia.org/resource/Category:People_from_Stavanger> .
?s rdfs:label ?name.
}

Main part is query pattern (WHERE clause)


Using Turtle syntax for RDF
Query patterns may contain variables (?s, ?name)

Shortcuts for URIs (PREFIX)


Query results via selection of variables (SELECT)
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Query Results
Table with one row per result
?s

?name

http://dbpedia.org/resource/Erik_Nevland

"Erik Nevland"@no

http://dbpedia.org/resource/Jan_Simonsen

"Jan Simonsen"@no

http://dbpedia.org/resource/Laila_Goody

"Laila Goody"@no

http://dbpedia.org/resource/Henriette_Henriksen

"Henriette Henriksen"@no

http://dbpedia.org/resource/Guri_Hjeltnes

"Guri Hjeltnes"@no

http://dbpedia.org/resource/Johan_E._Holand

"Johan E. Holand"@no

http://dbpedia.org/resource/Kristian_Valen

"Kristian Valen"@no

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Further Functionality
Optional triple patterns (e.g., return name and optionally
birthdate if available)
Unions (e.g., return material scientists and also physicists)
Filter (e.g., only return scientists born before 1970)
Result formats (e.g., return RDF triples instead of results
table)
Modificators (e.g., sort results, only return unique results)

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Benefits of Linked Data


Explicit, simple data representation
Common data representation (Resource Description Framework, RDF)
hides underlying technologies and systems

Distributed System
Decentralised distributed ownership and control facilitates adoption and
scalability

Cross-referencing
Allows for linking and referencing of existing data, via reuse of URIs

Loose coupling with common language layer


Large scale systems require loose coupling, via HTTP as common access
protocol

Ease of publishing and consumption


Simple and easy-to-use systems and technologies to facilitate uptake

Incremental data integration


Start with merged RDF graphs and provide mappings as you go
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Challenges (I)
Ramp-up cost for data conversion
May be alleviated by semi-automatic mappings and adequate tool
support for manual conversion

Integrated data may be messy at first


But can be refined as need arises

Distributed creation and loose coordination may result in


inconsistencies
Can be detected, diagnosed, and fixed with appropriate tools

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

The Pedantic Web Group

Get the community to contact publishers about errors/issues as they


arise
Get involved: http://pedantic-web.org/
137 members!
Acknowledgements to: Aidan Hogan, Alex Passant, Me, Antoine Zimmermann,
Axel Polleres, Michael Hausenblas, Richard Cyganiak, Stphane Corlosquet
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Challenges (II)
Often very much oriented towards individuals
Little possibilities for expressing schema knowledge
Different data sources have different ways of representing the same
facts
Ontology languages (RDFS, OWL) solve that drawback
RDFS and OWL are layered on top of RDF

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

ONTOLOGY LANGUAGES

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Ontology in Philosophy
Term exists only in singular (there are no
ontologies)
Ontology is concerned with the study of the
nature of being, existence or reality as such
Discussed by Aristoteles (Sokrates), Thomas
von Aquin, Descartes, Kant, Hegel,
Wittgenstein, Heidegger, Quine, ...

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Ontology in Informatics

An Ontology is a
formal specification
> interpretable by machines
of a shared
> based on consensus
conceptualisation
> describes terminology
of a domain of interest > covers a specific topic

Studer, Benjamins and Fensel (1998) based on Gruber


(1993) and Borst (1997)

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Schema Knowledge
RDF provides universal mechanism for the representation
of facts using triples
Possible to describe individuals and their relations
Required: describe generic sets of individuals (classes),
e.g., people, chemical compounds, organisations
Required: specification of logical connections between
individuals, classes and properties to describe their
meaning, e.g., researchers write papers, materials are
chemical compounds
In database-speak: schema knowledge

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Schema Knowledge with RDFS


RDF Vocabulary Description Language (RDFS)
Allows for specification of schema (also: terminological)
knowledge
RDFS is a special RDF vocabulary (every RDFS document
is an RDF document)
RDFS vocabulary is generic: allows to specify the
semantics of other vocabularies (and as such is a kind of
metavocabulary)
Thus, RDFS is an ontology language (but a lightweight
ontology language)
A little semantics goes a long way (Hendler, 1997)

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Classes and Instances


Property rdf:type defines the subject of a triple as of type of the
object
Object of the triple is interpreted as identifier for the class, which
contains the resources denoted via subject of the triple
Example:
The individual Hegel is of type Person
dbpedia:Georg_Wilhelm_Friedrich_Hegel rdf:type
foaf:Person .
Class membership is not exclusive:
Example:
dbpedia:Georg_Wilhelm_Friedrich_Hegel rdf:type
yago:PoliticalPhilosophers .
Instances and classes both use same syntax for URIs, so no
syntactical distinction

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Subclasses - Motivation
Given triple
dbpedia:Georg_Wilhelm_Friedrich_Hegel rdf:type
yago:PoliticalPhilosophers .
and a query for all foaf:Person instances
we do not get any results

We could add the triple


dbpedia:Georg_Wilhelm_Friedrich_Hegel rdf:type
foaf:Person .
but would solve the problem only for one instance

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Subclasses
Solution:
Make one statement which says that every scientist is a person
Which means every instance of class
yago:PoliticalPhilosophers is also an instance of class
foaf:Person

Realised via rdfs:subClass property


Example:
The class of political philosophers is a subclass of the
class of persons
yago:PoliticalPhilosophers rdfs:subClassOf
foaf:Person .
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Subclasses
rdfs:subClassOf is reflexive, that is, every class is a
subclass of itself
Example:
yago:PoliticalPhilosophers rdfs:subClassOf
yago:PoliticalPhilosophers .
Possible to equate two classes via reciprocal subclass
relations:
Example:
dbpedia:Person rdfs:subClassOf foaf:Person .
foaf:Person rdfs:subClassOf dbpedia:Person .

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Class Hierarchies
Typically, ontologies contain not only single subclass relations, but class
hierarchies
Example:
yago:PoliticalPhilosophers rdfs:subClassOf
yago:Philosophers .
yago:Philopsophers rdfs:subClassOf dbpedia:Person .
dbpedia:Person rdfs:subClassOf dbpedia:Mammal .
Transitivity of rdfs:subClassOf is part of the RDFS semantics, which
means e.g., the following holds:
Example:
dbpedia:Philopsophers rdfs:subClassOf dbpedia:Mammal .

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Further RDFS Primitives


Property hierarchies via rdfs:subPropertyOf
Restrictions on properties via rdfs:domain and
rdfs:range
Lists and collections
Reification (statements about statements)
Annotations via rdfs:label or rdfs:comment

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

RDFS Summary
RDFS can be used to describe semantic aspects of
specific domains
On the basis of RDFS it is possible to infer implicit
knowledge
However, the primitives of RDFS have limited expressivity

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Web Ontology Language OWL


Fragment of first-order logics
Five variants: OWL EL, OWL RL, OWL QL, OWL DL, OWL Full
OWL DL is decidable and has a corresponding description logics
SROIQ (D)
OWL documents are RDF documents
Three building blocks are
Classes (comparable to classes in RDFS)
Individuals (comparable to instances in RDFS)
Roles (comparable to properties in RDFS)

OWL contains primitives to specify elaborate expressions,


e.g. two classes are disjoint
OWL allows for complex reasoning tasks such as consistency check,
but may be computationally expensive

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Equivalence
OWL allows for specification of equivalence; needed in data integration
scenarios
Between individuals: owl:sameAs
Example:
<http://viaf.org/viaf/97773925/> owl:sameAs
<http://dbpedia.org/resource/Marlene_Dietrich> .
Between properties: owl:equivalentProperty
Between classes: owl:equivalentClass
Example:
dbpedia:Person owl:equivalentClass foaf:Person .
However, equivalences are often implicitly stated in the data

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Inverse Functional Properties


Possible to define uniquely identifying properties useful for object
consolidation
E.g. (hypothetical) from
ex:passportNo rdf:type owl:inverseFunctionalProperty .
and
dbpedia:Marlene_Dietrich ex:passportNo 12033-89-5 .
freebase:en.marlene_dietrich ex:passportNo 12033-89-5 .
follows:
dbpedia:Marlene_Dietrich owl:sameAs
freebase:en.marlene_dietrich .

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Further OWL Primitives


Property characteristics: inverse properties, symmetric
properties
Property cardinality: minimum cardinality, maximum
cardinality
Class restrictions
Property chains

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

LINKED DATA APPLICATION


ARCHITECTURES
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Data Integration System Architecture

? !
Integration

Wrapper
Wrapper11

Wrapper 2

Wrapper n

Source 1

Source 2

Source n

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Semantic Web Components

( )
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Linked Data: Minimal Components

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

2. Answer

( )

1. Query

Architecture Styles
Warehousing/
Crawl-Index-Serve

2. Answer

!
1. Query

Virtual Integration/
Distributed Querying

0. CrawlIndex
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Basic Application: Entity Browsing


Warehousing/
Crawl-Index-Serve

SWSE, Falcons, Sindice, Watson,


FactForge

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Virtual Integration/
Distributed Querying

Tabulator, Disco, Zitgist

SUMMARY

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Summary
The Linked Data Web is a large, decentralised, complex system built
on simple principles
identify resource via HTTP URIs
provide RDF that links to other URIs upon lookup

Current trend around Linked Data allows for a re-think of components


in Semantic Web Layer Cake
Data publishers and consumers coordinate little
Web of Data grows rapidly and covers a large variety of domains
Algorithms operating over a common access protocol and data model
Ontology languages provide integration and mapping between
disparate sources
First commercial applications emerging

Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

Attribution
Slides from my SWT-2 lectures and WWW 2010 SILD tutorial
Slides about RDFS and OWL adapted from SWT-1 lecture (Rudolph,
Kroetzsch, Harth)
Linking Open Data cloud diagrams, by Richard Cyganiak and Anja
Jentzsch. http://lod-cloud.net/
Images of Berlin, Hegel and Dietrich via Wikipedia
Hendler 97: http://www.cs.rpi.edu/~hendler/LittleSemanticsWeb.html
Borst 97: Construction of Engineering Ontologies, Ph.D. Thesis,
University of Twente 1997.
Studer, Benjamins, Fensel 98: Knowledge Engineering: Principles and
Methods, DKE 25(1-2):161-198.
Gruber 93: Towards principles for the design of ontologies used for
knowledge sharing, Formal Ontology in Conceptual Analysis and
Knowledge Representation, Kluwer.
Marko Grobelnik, Andreas Harth, Dumitru Roman, Big Linked Data

You might also like