Classical DB Questions on New Kinds of Data
|
|
- Francine Jackson
- 5 years ago
- Views:
Transcription
1 1 Classical DB Questions on New Kinds of Data Marcelo Arenas & Pablo Barceló, Center for Semantic Web Research PUC Chile Universidad de Chile
2 Evolution of data models 80s early 90s Overcome expressiveness limitations of the relational model
3 Evolution of data models 80s early 90s Overcome expressiveness limitations of the relational model Logical data model OODB Active databases Disjunctive databases Temporal databases Constraint databases...
4 Evolution of data models The 90s on: Flexibility, easy integration, topology (sometimes)
5 Evolution of data models The 90s on: Flexibility, easy integration, topology (sometimes) Graphs XML RDF JSON CSV...
6 Classical DB questions on new kind of data
7 Classical DB questions on new kind of data Data design Languages (markup, querying) Optimization Updates
8 Classical questions that gain renewed interest
9 Classical questions that gain renewed interest Uncertainty Distribution Ranking Query workloads
10 New questions on new kind of data
11 New questions on new kind of data Access Schema extraction Trust Variety
12 7 In this talk We talk about Graph DBs, RDF and tabular data (CSV)
13 7 In this talk We talk about Graph DBs, RDF and tabular data (CSV) Bottomline: Despite similarities with old DB problems, new applications require: understanding the nature of their problems refining old/developing new techniques
14 Graph Databases 8
15 9 The need for a standard graph QL in practice Recognized by major graph DB engines
16 9 The need for a standard graph QL in practice Recognized by major graph DB engines Neo4J Cypher
17 9 The need for a standard graph QL in practice Recognized by major graph DB engines Neo4J Cypher Sparksee Graph algebra
18 9 The need for a standard graph QL in practice Recognized by major graph DB engines Neo4J Cypher Sparksee Graph algebra Oracle PGQL
19 9 The need for a standard graph QL in practice Recognized by major graph DB engines Neo4J Cypher Sparksee Graph algebra Oracle PGQL Apache Tinkerpop Gremlin
20 9 The need for a standard graph QL in practice Recognized by major graph DB engines Neo4J Cypher Sparksee Graph algebra Oracle PGQL Apache Tinkerpop Gremlin Not all of them are declarative
21 10 LDBC GraphQL task force Formed by researchers/practitioners (Neo4J, Sparksee, IBM, Oracle, SAP, HP)
22 10 LDBC GraphQL task force Formed by researchers/practitioners (Neo4J, Sparksee, IBM, Oracle, SAP, HP) Objectives:
23 10 LDBC GraphQL task force Formed by researchers/practitioners (Neo4J, Sparksee, IBM, Oracle, SAP, HP) Objectives: 1. Define a graph data model: Property graphs (July 2015)
24 10 LDBC GraphQL task force Formed by researchers/practitioners (Neo4J, Sparksee, IBM, Oracle, SAP, HP) Objectives: 1. Define a graph data model: Property graphs (July 2015) 2. Identify features/limitations of existing QLs (December 2015)
25 10 LDBC GraphQL task force Formed by researchers/practitioners (Neo4J, Sparksee, IBM, Oracle, SAP, HP) Objectives: 1. Define a graph data model: Property graphs (July 2015) 2. Identify features/limitations of existing QLs (December 2015) 3. Identify features needed in a graph QL (ongoing)
26 10 LDBC GraphQL task force Formed by researchers/practitioners (Neo4J, Sparksee, IBM, Oracle, SAP, HP) Objectives: 1. Define a graph data model: Property graphs (July 2015) 2. Identify features/limitations of existing QLs (December 2015) 3. Identify features needed in a graph QL (ongoing) 4. Design a standard declarative graph QL (2017?)
27 11 A property graph by example e 1 : acts in role = R. Kincaid ref = IMDb n 1 : Person name = C. Eastwood gender = male n 2 : Movie title = The bridges of Madison County e 5 : acts in role = H. Callahan ref = IMDb n 5 : Movie title = Dirty Harry e 2 : directs e 6 : acts in n 6 : Person name = A. Robinson gender = male
28 The property graph data model Definition (Property graph) A property graph G is a tuple (V, E, ρ, λ, σ), where:
29 The property graph data model Definition (Property graph) A property graph G is a tuple (V, E, ρ, λ, σ), where: 1. V is a finite set of nodes
30 The property graph data model Definition (Property graph) A property graph G is a tuple (V, E, ρ, λ, σ), where: 1. V is a finite set of nodes 2. E is a finite set of edges
31 The property graph data model Definition (Property graph) A property graph G is a tuple (V, E, ρ, λ, σ), where: 1. V is a finite set of nodes 2. E is a finite set of edges 3. ρ : E (V V ) is a total function ρ(e) = (v 1, v 2 ) means that e is of the form v 1 v 2
32 The property graph data model Definition (Property graph) A property graph G is a tuple (V, E, ρ, λ, σ), where: 1. V is a finite set of nodes 2. E is a finite set of edges 3. ρ : E (V V ) is a total function ρ(e) = (v 1, v 2 ) means that e is of the form v 1 v 2 4. λ : (V E) Lab is a total function with Lab a set of labels ρ(v) = l means that l is the label of node v in G
33 The property graph data model Definition (Property graph) A property graph G is a tuple (V, E, ρ, λ, σ), where: 1. V is a finite set of nodes 2. E is a finite set of edges 3. ρ : E (V V ) is a total function ρ(e) = (v 1, v 2 ) means that e is of the form v 1 v 2 4. λ : (V E) Lab is a total function with Lab a set of labels ρ(v) = l means that l is the label of node v in G 5. σ : (V E) Prop Val is a partial function with Prop a finite set of properties and Val a set of values σ(v, p) = s means that s is the value of property p for v in G
34 In existing query languages Basic unit for querying the structure: Graph patterns, a.k.a. conjunctive queries
35 13 In existing query languages Basic unit for querying the structure: Graph patterns, a.k.a. conjunctive queries Interpretation: Match a small graph pattern into a large property graph
36 13 In existing query languages Basic unit for querying the structure: Graph patterns, a.k.a. conjunctive queries Interpretation: Match a small graph pattern into a large property graph Semantics: homomorphism, isomorphism, edge-injective homomorphism
37 13 In existing query languages Basic unit for querying the structure: Graph patterns, a.k.a. conjunctive queries Interpretation: Match a small graph pattern into a large property graph Semantics: homomorphism, isomorphism, edge-injective homomorphism Property graph Relational table
38 In existing query languages Basic unit for querying the structure: Graph patterns, a.k.a. conjunctive queries Interpretation: Match a small graph pattern into a large property graph Semantics: homomorphism, isomorphism, edge-injective homomorphism Property graph Relational table Example: y (x, directs, y) (x, acts in, y)
39 In existing query languages Basic unit for querying the structure: Graph patterns, a.k.a. conjunctive queries Interpretation: Match a small graph pattern into a large property graph Semantics: homomorphism, isomorphism, edge-injective homomorphism Property graph Relational table Example: y (x, directs, y) (x, acts in, y) MATCH (x) -[directs]-> (y) <-[acts in]- (x) RETURN (x)
40 Dealing with paths is fundamental Queries of the form x a y allowed in Cypher Retrieve pairs of nodes linked by a path of a s
41 Dealing with paths is fundamental Queries of the form x a y allowed in Cypher Retrieve pairs of nodes linked by a path of a s Example: Friend-of-a-friend relationship
42 Dealing with paths is fundamental Queries of the form x a y allowed in Cypher Retrieve pairs of nodes linked by a path of a s Example: Friend-of-a-friend relationship Combined with patterns: patterns with reachability
43 Dealing with paths is fundamental Queries of the form x a y allowed in Cypher Retrieve pairs of nodes linked by a path of a s Example: Friend-of-a-friend relationship Combined with patterns: patterns with reachability Reasonable data complexity so far: NLogspace
44 RPQs not implemented yet... but considered to be desirable
45 15 RPQs not implemented yet... but considered to be desirable Regular Path Query (RPQ): x L y, for L a regex Retrieve pairs of nodes linked by a path in L
46 15 RPQs not implemented yet... but considered to be desirable Regular Path Query (RPQ): x L y, for L a regex Retrieve pairs of nodes linked by a path in L Example: ( acts in acts in ) +
47 15 RPQs not implemented yet... but considered to be desirable Regular Path Query (RPQ): x L y, for L a regex Retrieve pairs of nodes linked by a path in L Example: ( acts in acts in ) + Data complexity still reasonable: NLogspace
48 15 RPQs not implemented yet... but considered to be desirable Regular Path Query (RPQ): x L y, for L a regex Retrieve pairs of nodes linked by a path in L Example: ( acts in acts in ) + Data complexity still reasonable: NLogspace For a semantics based on arbitrary paths
49 Systems tend to favour a simple paths semantics 16
50 16 Systems tend to favour a simple paths semantics Is there a simple path from x to y labeled in (aa)? NP-complete [Lapaugh & Papadimitriou, 1984]
51 Systems tend to favour a simple paths semantics Is there a simple path from x to y labeled in (aa)? NP-complete [Lapaugh & Papadimitriou, 1984] A simple path semantics already tried/discarded in SPARQL 1.1 [Losseman & Martens, 2012; Arenas, Conca & Pérez, 2012]
52 They also return paths...
53 They also return paths... Example MATCH p = (x) -[acts in*0..5]-> (y) RETURN p, length(p)
54 They also return paths... Example MATCH p = (x) -[acts in*0..5]-> (y) RETURN p, length(p) A single path, a simple path, all paths, all simple paths?
55 18 Just imagine this combined with RPQs......an exponential explosion in the size of the output
56 18 Just imagine this combined with RPQs......an exponential explosion in the size of the output What are the use cases for these functionalities?
57 18 Just imagine this combined with RPQs......an exponential explosion in the size of the output What are the use cases for these functionalities? Which paths users are looking for?
58 18 Just imagine this combined with RPQs......an exponential explosion in the size of the output What are the use cases for these functionalities? Which paths users are looking for? Can they be represented compactly?
59 18 Just imagine this combined with RPQs......an exponential explosion in the size of the output What are the use cases for these functionalities? Which paths users are looking for? Can they be represented compactly? Can they be enumerated with reasonable delay?
60 18 Just imagine this combined with RPQs......an exponential explosion in the size of the output What are the use cases for these functionalities? Which paths users are looking for? Can they be represented compactly? Can they be enumerated with reasonable delay? From a theoretical point of view: Return a single shortest path (complexity in NLogspace)
61 18 Just imagine this combined with RPQs......an exponential explosion in the size of the output What are the use cases for these functionalities? Which paths users are looking for? Can they be represented compactly? Can they be enumerated with reasonable delay? From a theoretical point of view: Return a single shortest path (complexity in NLogspace) Return others, one by one, if needed
62 A representation problem How paths should be represented?
63 A representation problem How paths should be represented? As a tuple in a table?
64 A representation problem How paths should be represented? As a tuple in a table? As a graph?
65 A representation problem How paths should be represented? As a tuple in a table? As a graph? As a new path data type?
66 20 To complicate things more Existing QLs have an ungrouping operator: List set (bag) of nodes that belong to a path
67 20 To complicate things more Existing QLs have an ungrouping operator: List set (bag) of nodes that belong to a path Path Relational table
68 To complicate things more Existing QLs have an ungrouping operator: List set (bag) of nodes that belong to a path Path Relational table The power of ungrouping: 1. Find a path that visits each node exactly once 2. Find a path that does not repeat values for a given property 3. Find paths that intersect in a node
69 To complicate things more Existing QLs have an ungrouping operator: List set (bag) of nodes that belong to a path Path Relational table The power of ungrouping: 1. Find a path that visits each node exactly once 2. Find a path that does not repeat values for a given property 3. Find paths that intersect in a node Theory: Graph QLs for data Complexity is astronomical [Barceló, Fontaine & Lin, 2013] Tractability conditions are delicate [Libkin & Vrgoč, 2012]
70 21 Type transformations TABLES Patterns GRAPHS GRAPHS Path queries PATHS
71 21 Type transformations TABLES Patterns GRAPHS Ungrouping GRAPHS Path queries PATHS
72 21 Type transformations TABLES Patterns Construct GRAPHS Ungrouping GRAPHS Path queries PATHS
73 What have we learned? Real need from graph DBs to have a standard declarative QL
74 What have we learned? Real need from graph DBs to have a standard declarative QL Design is non-trivial due to efficiency/expressiveness trade-off
75 What have we learned? Real need from graph DBs to have a standard declarative QL Design is non-trivial due to efficiency/expressiveness trade-off Theory is not so much far away from practice
76 What have we learned? Real need from graph DBs to have a standard declarative QL Design is non-trivial due to efficiency/expressiveness trade-off Theory is not so much far away from practice It requires a political effort to close the gap
77 Semantic Web 23
78 24 Semantic Web The Semantic Web is an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation. [Tim Berners-Lee et al ]
79 24 Semantic Web The Semantic Web is an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation. [Tim Berners-Lee et al ] Specific goals:
80 24 Semantic Web The Semantic Web is an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation. [Tim Berners-Lee et al ] Specific goals: Build a description language with standard semantics
81 24 Semantic Web The Semantic Web is an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation. [Tim Berners-Lee et al ] Specific goals: Build a description language with standard semantics Make semantics machine-processable and understandable
82 24 Semantic Web The Semantic Web is an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation. [Tim Berners-Lee et al ] Specific goals: Build a description language with standard semantics Make semantics machine-processable and understandable Incorporate logical infrastructure to reason about resources
83 24 Semantic Web The Semantic Web is an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation. [Tim Berners-Lee et al ] Specific goals: Build a description language with standard semantics Make semantics machine-processable and understandable Incorporate logical infrastructure to reason about resources W3C proposals: Resource Description Framework (RDF) and SPARQL
84 25 RDF in a nutshell RDF is the W3C proposal framework for representing information in the Web Abstract syntax based on directed labeled graph Extensible URI-based vocabulary
85 26 An RDF graph starring The Bridges of Madison County Clint Eastwood starring directs Meryl Streep
86 An RDF graph in real life: DBpedia
87 Prefixes simplify the notation Prefixes can be defined in an RDF graph to simplify notation They are defined also using triples
88 Prefixes simplify the notation Prefixes can be defined in an RDF graph to simplify notation They are defined also using triples We can include in an RDF graph the following owl: rdf: <
89 Prefixes simplify the notation Prefixes can be defined in an RDF graph to simplify notation They are defined also using triples We can include in an RDF graph the following owl: rdf: < Then < can be replaced by rdf:type
90 How are URIs created and assigned? 29
91 29 How are URIs created and assigned? There is no centralized mechanism
92 29 How are URIs created and assigned? There is no centralized mechanism A key component to deal with this issue: owl:sameas Streep owl:sameas Streepová. Streep owl:sameas Streep. Streep owl:sameas
93 29 How are URIs created and assigned? There is no centralized mechanism A key component to deal with this issue: owl:sameas Streep owl:sameas Streepová. Streep owl:sameas Streep. Streep owl:sameas Reasoning capabilities are needed to deal with owl:sameas
94 Querying RDF: SPARQL SPARQL is the W3C recommendation query language for RDF (January 2008) Originally it was a graph-matching query language SPARQL 1.1 is the new version of this language, its was released in March 2013
95 An example of a SPARQL query Retrieve all the movies in DBpedia
96 An example of a SPARQL query Retrieve all the movies in DBpedia?movie rdf:type <
97 An example of a SPARQL query Retrieve all the movies in DBpedia WHERE {?movie rdf:type < }
98 An example of a SPARQL query Retrieve all the movies in DBpedia SELECT?movie WHERE {?movie rdf:type < }
99 Important problems when querying RDF
100 Important problems when querying RDF Returning as much information as possible
101 Important problems when querying RDF Returning as much information as possible Reasoning with ontologies
102 Important problems when querying RDF Returning as much information as possible Reasoning with ontologies Dealing with incomplete information
103 Important problems when querying RDF Returning as much information as possible Reasoning with ontologies Dealing with incomplete information Exploiting the graph structure of RDF
104 Important problems when querying RDF Returning as much information as possible Reasoning with ontologies Dealing with incomplete information Exploiting the graph structure of RDF Working with highly distributed data
105 Returning as much information as possible RDF follows an open world assumption Users may be unaware of the structure of the data
106 Returning as much information as possible RDF follows an open world assumption Users may be unaware of the structure of the data Thus, the possibility of obtaining additional information if possible is important in this scenario In fact, this feature was present from the very beginning in SPARQL
107 34 An optional operator Retrieve each movie in DBpedia and its gross if this information is available SELECT?movie?gross WHERE {?movie rdf:type < OPTIONAL {?movie < } }
108 35 Part of the answer to the query?movie (2013 film) Souls?gross "1.274E9"
109 What is new? The OPTIONAL operator essentially corresponds to a left-outer join in relational algebra But...
110 What is new? The OPTIONAL operator essentially corresponds to a left-outer join in relational algebra But... The fragments of SPARQL that are natural to study are different than for the case of relational algebra The complexity of evaluating these fragments was not known [Pérez, A. & Gutierrez 2009; Schmidt, Meier & Lausen 2010] New notions of safeness are needed to avoid a counterintuitive behavior [Pérez, A. & Gutierrez 2009] New optimization techniques are needed [Pérez, A. & Gutierrez 2009; Letelier, Pérez, Pichler & Skritek 2013; Pichler & Skritek 2014]
111 37 Openness influences other operators SELECT?voice_actor?film_actor WHERE { {?voice_actor rdf:type } < } UNION {?film_actor rdf:type < }
112 38 The answer to the query?voice actor resource/alec Baldwin?film actor resource/meryl Streep
113 39 Reasoning with ontologies Reasoning capabilities are needed
114 39 Reasoning with ontologies Reasoning capabilities are needed We already mentioned owl:sameas
115 39 Reasoning with ontologies Reasoning capabilities are needed We already mentioned owl:sameas An RDF graph can use RDF Schema (RDFS) to establish hierarchies of classes and properties
116 39 Reasoning with ontologies Reasoning capabilities are needed We already mentioned owl:sameas An RDF graph can use RDF Schema (RDFS) to establish hierarchies of classes and properties The Web Ontology Language (OWL) can be used to define more complex relations between classes and properties
117 The use of RDFS vocabulary The following triples are included in DBpedia:
118 40 The use of RDFS vocabulary The following triples are included in DBpedia: rdfs:subclassof rdfs:subclassof rdfs:subpropertyof rdfs:subpropertyof
119 41 The use of RDFS vocabulary Some numbers in DBpedia: triples with rdfs:subclassof as predicate are at least 450K triples with rdfs:subpropertyof as predicate are at least 1K
120 41 The use of RDFS vocabulary Some numbers in DBpedia: triples with rdfs:subclassof as predicate are at least 450K triples with rdfs:subpropertyof as predicate are at least 1K We need reasoning capabilities to deal with: rdfs:subclassof, rdfs:subpropertyof
121 41 The use of RDFS vocabulary Some numbers in DBpedia: triples with rdfs:subclassof as predicate are at least 450K triples with rdfs:subpropertyof as predicate are at least 1K We need reasoning capabilities to deal with: rdfs:subclassof, rdfs:subpropertyof and other elements of RDFS such as rdfs:domain and rdfs:range
122 42 Answering a query with RDFS vocabulary Retrieve all the educators in DBpedia SELECT?educator WHERE {?educator rdf:type < }
123 43 Answering a query with RDFS vocabulary The answer to the previous query should be the same as for the following query: SELECT?educator WHERE { {?educator rdf:type. } UNION {?educator rdf:type < } }
124 Open issues about reasoning with ontologies Two important problems: Development of efficient query answering algorithms over large RDF graphs with RDFS vocabulary Identification of fragments of OWL that have good expressive power and can be efficiently evaluated
125 Exploiting the graph structure of RDF The structure of an RDF graph stores information It is important to have operators that can deal with this structure In particular, navigating an RDF graph is an important functionality
126 Exploiting the graph structure of RDF The structure of an RDF graph stores information It is important to have operators that can deal with this structure In particular, navigating an RDF graph is an important functionality Properties paths in SPARQL allow to express reachability queries
127 46 Navigating RDF graphs Get starring actors in the same movie: SELECT?actor1?actor2 WHERE {?movie < < }
128 47 Navigating RDF graphs Previous query can be rewritten by using navigation patterns:
129 47 Navigating RDF graphs Previous query can be rewritten by using navigation patterns: SELECT?actor1?actor2 WHERE {?actor1 ^< < }
130 47 Navigating RDF graphs Previous query can be rewritten by using navigation patterns: SELECT?actor1?actor2 WHERE {?actor1 ^< }?actor2.
131 47 Navigating RDF graphs Previous query can be rewritten by using navigation patterns: SELECT?actor1?actor2 WHERE {?actor1 ^< }?actor2. The expression in red is called a property path
132 Navigating RDF graphs Get starring actors that are connected: SELECT?actor1?actor2 WHERE {?actor1 (^< < }
133 Navigating RDF graphs Get starring actors that are connected: SELECT?actor1?actor2 WHERE {?actor1 (^< < } Can this query be answered? Can it be answered starting from a specific node?
134 Open issues in exploiting the graph structure of RDF Some important problems: Development of efficient evaluation algorithms for reachability queries over large RDF graphs Standardization of a query language where paths are first-class citizens
135 50 Web data is highly distributed Data can be stored in different repositories Different pieces of data have to be collected to answer a query
136 50 Web data is highly distributed Data can be stored in different repositories Different pieces of data have to be collected to answer a query An important notion to deal with this issue: SPARQL endpoint A Web service that accepts a SPARQL query as input, and returns (part of) the result to the query
137 Web data is highly distributed Data can be stored in different repositories Different pieces of data have to be collected to answer a query An important notion to deal with this issue: SPARQL endpoint A Web service that accepts a SPARQL query as input, and returns (part of) the result to the query SPARQL has an operator SERVICE to query an endpoint
138 The SPARQL endpoint of DBpedia 51
139 Querying DBpedia We want to retrieve the list of American actors in DBpedia
140 Querying DBpedia We want to retrieve the list of American actors in DBpedia
141 53 The answer to the query...
142 The SPARQL endpoint of DBLP We want to retrieve the list of authors in DBLP
143 The SPARQL endpoint of DBLP We want to retrieve the list of authors in DBLP
144 55 The answer to the query...
145 We would like to combine the previous results... SELECT?name WHERE {?actor rdf:type < foaf:name?name. SERVICE < { SELECT?name WHERE {?paper dc:creator?author.?author foaf:name?name. } } }
146 57 Open issues when dealing with distribution Some important problems: The notion of SPARQL endpoint needs to be formalized What queries are accepted? How is the time distributed between them? Should a pricing model be used? What is the protocol to return the answer to a query? A more general notion of endpoint should be formalized and studied
147 Open issues when dealing with distribution (cont d) Usability needs to be hugely improved schema/structure extraction and visualization play a fundamental role here Approaches for discovering relevant data should be studied Operators to distribute the execution of queries should be studied in more depth
148 A first issue about the SERVICE operator SERVICE operators can be nested SELECT... WHERE {... SERVICE <uri1> {... SERVICE <uri2> } }
149 A second issue about the SERVICE operator SERVICE can be used not only with a URI but also with a variable
150 60 A second issue about the SERVICE operator SERVICE can be used not only with a URI but also with a variable SELECT... WHERE {...?address rdf:type < SERVICE?address {... } }
151 A second issue about the SERVICE operator SERVICE can be used not only with a URI but also with a variable SELECT... WHERE {... SERVICE?address {...?uri rdf:type < example.org/sparqlendpoint>. } SERVICE?uri {... } }
152 A second issue about the SERVICE operator SERVICE can be used not only with a URI but also with a variable Several specific issues have to be addressed [Buil-Aranda, A. & Corcho 2011]: If?var does not have a value, how SERVICE?var should be evaluated? A notion of safeness is needed The situation gets more involved if we also have nested SERVICE operators The syntax of SPARQL 1.1 allows SERVICE?var, but its semantics is not defined
153 What have we learned? There are many interesting and challenging questions to be answered
154 What have we learned? There are many interesting and challenging questions to be answered Most of these questions can be considered as classical DB questions
155 What have we learned? There are many interesting and challenging questions to be answered Most of these questions can be considered as classical DB questions But answering them require of a combination of classical and new techniques
156 What have we learned? There are many interesting and challenging questions to be answered Most of these questions can be considered as classical DB questions But answering them require of a combination of classical and new techniques The Semantic Web community has been receptive to our ideas
157 Tabular Data (CSV) 62
158 Comma-separated values (CSV) documents 63
159 63 Comma-separated values (CSV) documents The IBM Fortran compiler supported CSV documents in 1972
160 63 Comma-separated values (CSV) documents The IBM Fortran compiler supported CSV documents in 1972 The W3C recommendation for CSV documents (tabular data) was released on December 2015
161 63 Comma-separated values (CSV) documents The IBM Fortran compiler supported CSV documents in 1972 The W3C recommendation for CSV documents (tabular data) was released on December 2015 Why such a recommendation is needed? This is just tabular data, what is new?
162 The main goals of the W3C recommendation Define a schema language for CSV For example, it can be used to specify the name and the type of the elements of each column in a CSV document Develop a metadata vocabulary for CSV It describes how the data should be interpreted Define mechanisms for transforming CSV into RDF, JSON and XML
163 65 CSV documents can be messy A use case from The US National Institute of Standards and Technology has run various conferences on extracting information from text. The extracted information is submitted in a tab-separated format.
164 65 CSV documents can be messy A use case from The US National Institute of Standards and Technology has run various conferences on extracting information from text. The extracted information is submitted in a tab-separated format. An example document:... :e4 type PER :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D :e4 per:age "10" D
165 66 A schema language for CSV We describe an approach proposed by [Martens, Neven & Vansummeren 2015]
166 66 A schema language for CSV We describe an approach proposed by [Martens, Neven & Vansummeren 2015] The model for a CSV document: :e4 type PER 2 :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D
167 66 A schema language for CSV We describe an approach proposed by [Martens, Neven & Vansummeren 2015] The model for a CSV document: :e4 type PER 2 :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D Every cell has a coordinate (i, j) The cell with content "Bart" has coordinate (2, 3)
168 67 Checking conditions on regions :e4 type PER 2 :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D
169 67 Checking conditions on regions :e4 type PER 2 :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D [root]
170 67 Checking conditions on regions :e4 type PER 2 :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D [root] right
171 67 Checking conditions on regions :e4 type PER 2 :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D [root] right right
172 67 Checking conditions on regions :e4 type PER 2 :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D [root] right right right
173 67 Checking conditions on regions :e4 type PER 2 :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D [root] right right right right
174 67 Checking conditions on regions :e4 type PER 2 :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D [root] right right right right down
175 67 Checking conditions on regions :e4 type PER 2 :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D [root] right right right right down R
176 68 An annotation language We describe our proposal in [A., Maturana, Riveros & Vrgoč 2016]
177 68 An annotation language We describe our proposal in [A., Maturana, Riveros & Vrgoč 2016] A CSV document is represented as a string
178 An annotation language We describe our proposal in [A., Maturana, Riveros & Vrgoč 2016] A CSV document is represented as a string :e4 type PER :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D :e4 per:age "10" D is represented as: : e 4 \t t y p e \t P E R \n : e 4 \t m e n t i o n \t...
179 69 Annotation of regions Let w be the string representing a CSV document The main ingredients of our approach:
180 69 Annotation of regions Let w be the string representing a CSV document The main ingredients of our approach: A region of w is a span (i, j) [Fagin, Kimelfeld, Reiss & Vansummeren 2013]
181 69 Annotation of regions Let w be the string representing a CSV document The main ingredients of our approach: A region of w is a span (i, j) [Fagin, Kimelfeld, Reiss & Vansummeren 2013] Regular expression with variables are used to extract spans from w Fragments that can be evaluated very efficiently have been identified
182 69 Annotation of regions Let w be the string representing a CSV document The main ingredients of our approach: A region of w is a span (i, j) [Fagin, Kimelfeld, Reiss & Vansummeren 2013] Regular expression with variables are used to extract spans from w Fragments that can be evaluated very efficiently have been identified Datalog programs are used to combine the results of the extraction process and annotate spans [Shen, Doan, Naughton & Ramakrishnan 2007]
183 Annotation of regions Recall that w is the string representation of: :e4 type PER :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D :e4 per:age "10" D Assume that the alphabet of w is Σ and = (Σ {\t, \n})
184 Annotation of regions Recall that w is the string representation of: :e4 type PER :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D :e4 per:age "10" D Assume that the alphabet of w is Σ and = (Σ {\t, \n}) The following Datalog program extracts and annotates all spans in the first column of w:
185 Annotation of regions Recall that w is the string representation of: :e4 type PER :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D :e4 per:age "10" D Assume that the alphabet of w is Σ and = (Σ {\t, \n}) The following Datalog program extracts and annotates all spans in the first column of w: w.x\tσ x. FC(x)
186 Annotation of regions Recall that w is the string representation of: :e4 type PER :e4 mention "Bart" D :e4 mention "JoJo" D :e4 per:siblings :e7 D :e4 per:age "10" D Assume that the alphabet of w is Σ and = (Σ {\t, \n}) The following Datalog program extracts and annotates all spans in the first column of w: w.x\tσ x. FC(x) w.σ \nx\tσ x. FC(x)
187 Open issues in the area Many questions need to be answered: What is a good schema language for CSV? What is a good annotation language for CSV? How metadata should be specified for a CSV document? What is a good mapping language to specify the transformation of a CSV document to an RDF graph? The same question needs to be answered for JSON and XML
188 72 Final remarks Do not underestimate the theoretical interest behind new apps: Classical DB questions gain new flavors over new data models It might involve developing techniques of independent interest Some areas are in need of theoretical help It requires an effort to understand problems and transfer tools
189 72 Final remarks Do not underestimate the theoretical interest behind new apps: Classical DB questions gain new flavors over new data models It might involve developing techniques of independent interest Some areas are in need of theoretical help It requires an effort to understand problems and transfer tools Many problems are still in need of formalization structure extraction, access, trust,...
190 Thank you! 73
Center for Semantic Web Research.
Center for Semantic Web Research www.ciws.cl, @ciwschile Three institutions PUC, Chile Marcelo Arenas (Boss) SW, data exchange, semistrucured data Juan Reutter SW, graph DBs, DLs Cristian Riveros data
More informationOn the Hardness of Counting the Solutions of SPARQL Queries
On the Hardness of Counting the Solutions of SPARQL Queries Reinhard Pichler and Sebastian Skritek Vienna University of Technology, Faculty of Informatics {pichler,skritek}@dbai.tuwien.ac.at 1 Introduction
More informationA Foundations of Modern Query Languages for Graph Databases 1
A Foundations of Modern Query Languages for Graph Databases 1 RENZO ANGLES, Universidad de Talca & Center for Semantic Web Research MARCELO ARENAS, Pontificia Universidad Católica de Chile & Center for
More informationA General Approach to Query the Web of Data
A General Approach to Query the Web of Data Xin Liu 1 Department of Information Science and Engineering, University of Trento, Trento, Italy liu@disi.unitn.it Abstract. With the development of the Semantic
More informationFoundations of SPARQL Query Optimization
Foundations of SPARQL Query Optimization Michael Schmidt, Michael Meier, Georg Lausen Albert-Ludwigs-Universität Freiburg Database and Information Systems Group 13 th International Conference on Database
More informationThe Logic of the Semantic Web. Enrico Franconi Free University of Bozen-Bolzano, Italy
The Logic of the Semantic Web Enrico Franconi Free University of Bozen-Bolzano, Italy What is this talk about 2 What is this talk about A sort of tutorial of RDF, the core semantic web knowledge representation
More informationData Exchange in the Relational and RDF Worlds
Data Exchange in the Relational and RDF Worlds Marcelo Arenas Department of Computer Science Pontificia Universidad Católica de Chile This is joint work with Jorge Pérez, Juan Reutter, Cristian Riveros
More informationSemantic Web Fundamentals
Semantic Web Fundamentals Web Technologies (706.704) 3SSt VU WS 2017/18 Vedran Sabol with acknowledgements to P. Höfler, V. Pammer, W. Kienreich ISDS, TU Graz December 11 th 2017 Overview What is Semantic
More informationSemantic Web Fundamentals
Semantic Web Fundamentals Web Technologies (706.704) 3SSt VU WS 2018/19 with acknowledgements to P. Höfler, V. Pammer, W. Kienreich ISDS, TU Graz January 7 th 2019 Overview What is Semantic Web? Technology
More informationOntological Modeling: Part 2
Ontological Modeling: Part 2 Terry Halpin LogicBlox This is the second in a series of articles on ontology-based approaches to modeling. The main focus is on popular ontology languages proposed for the
More informationarxiv: v3 [cs.db] 15 Jun 2017
A Foundations of Modern Query Languages for Graph Databases 1 RENZO ANGLES, Universidad de Talca & Center for Semantic Web Research MARCELO ARENAS, Pontificia Universidad Católica de Chile & Center for
More informationSemantic Web Information Management
Semantic Web Information Management Norberto Fernández ndez Telematics Engineering Department berto@ it.uc3m.es.es 1 Motivation n Module 1: An ontology models a domain of knowledge n Module 2: using the
More informationQuerying Semantic Web Data with SPARQL (and SPARQL 1.1)
Querying Semantic Web Data with SPARQL (and SPARQL 1.1) Marcelo Arenas PUC Chile & University of Oxford M. Arenas Querying Semantic Web Data with SPARQL (and SPARQL 1.1) - BNCOD 13 1 / 61 Semantic Web
More informationGraph Databases. Advanced Topics in Foundations of Databases, University of Edinburgh, 2017/18
Graph Databases Advanced Topics in Foundations of Databases, University of Edinburgh, 2017/18 Graph Databases and Applications Graph databases are crucial when topology is as important as the data Several
More informationSemantic Web. MPRI : Web Data Management. Antoine Amarilli Friday, January 11th 1/29
Semantic Web MPRI 2.26.2: Web Data Management Antoine Amarilli Friday, January 11th 1/29 Motivation Information on the Web is not structured 2/29 Motivation Information on the Web is not structured This
More informationA TriAL: A navigational algebra for RDF triplestores
A TriAL: A navigational algebra for RDF triplestores Navigational queries over RDF data are viewed as one of the main applications of graph query languages, and yet the standard model of graph databases
More informationLinked Data and RDF. COMP60421 Sean Bechhofer
Linked Data and RDF COMP60421 Sean Bechhofer sean.bechhofer@manchester.ac.uk Building a Semantic Web Annotation Associating metadata with resources Integration Integrating information sources Inference
More informationG-CORE: A Core for Future Graph Query Languages
G-CORE: A Core for Future Graph Query Languages Designed by the LDBC Graph Query Language Task Force Hannes Voigt hannes.voigt@tu-dresden.de http://bit.ly/gcorelanguage @LDBCouncil FOSDEM Graph Feb 3rd,
More informationDay 2. RISIS Linked Data Course
Day 2 RISIS Linked Data Course Overview of the Course: Friday 9:00-9:15 Coffee 9:15-9:45 Introduction & Reflection 10:30-11:30 SPARQL Query Language 11:30-11:45 Coffee 11:45-12:30 SPARQL Hands-on 12:30-13:30
More informationUsing RDF to Model the Structure and Process of Systems
Using RDF to Model the Structure and Process of Systems Marko A. Rodriguez Jennifer H. Watkins Johan Bollen Los Alamos National Laboratory {marko,jhw,jbollen}@lanl.gov Carlos Gershenson New England Complex
More informationPGQL: a Property Graph Query Language
PGQL: a Property Graph Query Language Oskar van Rest Sungpack Hong Jinha Kim Xuming Meng Hassan Chafi Oracle Labs June 24, 2016 Safe Harbor Statement The following is intended to outline our general product
More informationa paradigm for the Introduction to Semantic Web Semantic Web Angelica Lo Duca IIT-CNR Linked Open Data:
Introduction to Semantic Web Angelica Lo Duca IIT-CNR angelica.loduca@iit.cnr.it Linked Open Data: a paradigm for the Semantic Web Course Outline Introduction to SW Give a structure to data (RDF Data Model)
More informationGraph Databases. Graph Databases. May 2015 Alberto Abelló & Oscar Romero
Graph Databases 1 Knowledge Objectives 1. Describe what a graph database is 2. Explain the basics of the graph data model 3. Enumerate the best use cases for graph databases 4. Name two pros and cons of
More informationThe Semantic Web Revisited. Nigel Shadbolt Tim Berners-Lee Wendy Hall
The Semantic Web Revisited Nigel Shadbolt Tim Berners-Lee Wendy Hall Today sweb It is designed for human consumption Information retrieval is mainly supported by keyword-based search engines Some problems
More informationLinked Data and RDF. COMP60421 Sean Bechhofer
Linked Data and RDF COMP60421 Sean Bechhofer sean.bechhofer@manchester.ac.uk Building a Semantic Web Annotation Associating metadata with resources Integration Integrating information sources Inference
More informationISWC 2017 Tutorial: Semantic Data Management in Practice
ISWC 2017 Tutorial: Semantic Data Management in Practice Part 1: Introduction Olaf Hartig Linköping University olaf.hartig@liu.se @olafhartig Olivier Curé University of Paris-Est Marne la Vallée olivier.cure@u-pem.fr
More informationThe Semantic Web. What is the Semantic Web?
The Semantic Web Alun Preece Computing Science, University of Aberdeen (from autumn 2007: School of Computer Science, Cardiff University) What is the Semantic Web, and why do we need it now? How does the
More informationSemantic Web and Linked Data
Semantic Web and Linked Data Petr Křemen December 2012 Contents Semantic Web Technologies Overview Linked Data Semantic Web Technologies Overview Semantic Web Technology Stack from Wikipedia. http://wikipedia.org/wiki/semantic_web,
More informationH1 Spring B. Programmers need to learn the SOAP schema so as to offer and use Web services.
1. (24 points) Identify all of the following statements that are true about the basics of services. A. If you know that two parties implement SOAP, then you can safely conclude they will interoperate at
More informationMaking BioPAX SPARQL
Making BioPAX SPARQL hands on... start a terminal create a directory jena_workspace, move into that directory download jena.jar (http://tinyurl.com/3vlp7rw) download biopax data (http://www.biopax.org/junk/homosapiens.nt
More informationProperty Path Query in SPARQL 1.1
Property Path Query in SPARQL 1.1 Worarat Krathu Guohui Xiao Institute of Information Systems, Vienna University of Technology July 2012 Property Path Query in SPARQL 1.1 0/27 Overview Introduction Limitation
More informationFormalising the Semantic Web. (These slides have been written by Axel Polleres, WU Vienna)
Formalising the Semantic Web (These slides have been written by Axel Polleres, WU Vienna) The Semantics of RDF graphs Consider the following RDF data (written in Turtle): @prefix rdfs: .
More informationSemantic Information Retrieval: An Ontology and RDFbased
Semantic Information Retrieval: An Ontology and RDFbased Model S. Mahaboob Hussain Assistant Professor, CSE Prathyusha Kanakam Assistant Professor, CSE D. Suryanarayana Professor, CSE Swathi Gunnam PG
More informationSCULPT. A Schema Language for Tabular Data on the Web. WWW 2015 Florence. Wim Martens Bayreuth. Stijn Vansummeren Brussels. Frank Neven Hasselt
SCULPT A Schema Language for Tabular Data on the Web Wim Martens Bayreuth Frank Neven Hasselt Stijn Vansummeren Brussels this one is me WWW 2015 Florence Tabular Data is... Tabular Data is...,entebbe AIR,
More informationinfoh509 xml & web technologies lecture 9: sparql Stijn Vansummeren February 14, 2017
infoh509 xml & web technologies lecture 9: sparql Stijn Vansummeren February 14, 2017 what have we gained? Current no structure Future structured by RDF (subject, predicate, object) b:genome b:field b:molecular-bio
More informationSemantic Technologies and CDISC Standards. Frederik Malfait, Information Architect, IMOS Consulting Scott Bahlavooni, Independent
Semantic Technologies and CDISC Standards Frederik Malfait, Information Architect, IMOS Consulting Scott Bahlavooni, Independent Part I Introduction to Semantic Technology Resource Description Framework
More informationSemantic Web Systems Introduction Jacques Fleuriot School of Informatics
Semantic Web Systems Introduction Jacques Fleuriot School of Informatics 11 th January 2015 Semantic Web Systems: Introduction The World Wide Web 2 Requirements of the WWW l The internet already there
More informationTemporality in Semantic Web
Temporality in Semantic Web Ph.D student: Di Wu, Graduate Center, CUNY Mentor: Abdullah Uz Tansel, Baruch College, CUNY Committee: Sarah Zelikovitz, CIS, CUNY Susan P. Imberman, CIS, CUNY Abstract Semantic
More informationDeveloping markup metaschemas to support interoperation among resources with different markup schemas
Developing markup metaschemas to support interoperation among resources with different markup schemas Gary Simons SIL International ACH/ALLC Joint Conference 29 May to 2 June 2003, Athens, GA The Context
More informationContents. G52IWS: The Semantic Web. The Semantic Web. Semantic web elements. Semantic Web technologies. Semantic Web Services
Contents G52IWS: The Semantic Web Chris Greenhalgh 2007-11-10 Introduction to the Semantic Web Semantic Web technologies Overview RDF OWL Semantic Web Services Concluding comments 1 See Developing Semantic
More informationGraph Data Management & The Semantic Web
Graph Data Management & The Semantic Web Prof. Dr. Philippe Cudré-Mauroux Director, exascale Infolab University of Fribourg, Switzerland GDM Workshop, Washington DC, April 5, 2012 The Semantic Web Vision
More informationSemantic Web Test
Semantic Web Test 24.01.2017 Group 1 No. A B C D 1 X X X 2 X X 3 X X 4 X X 5 X X 6 X X X X 7 X X 8 X X 9 X X X 10 X X X 11 X 12 X X X 13 X X 14 X X 15 X X 16 X X 17 X 18 X X 19 X 20 X X 1. Which statements
More informationSchema-Agnostic Query Rewriting in SPARQL 1.1
Fakultät Informatik, Institut Künstliche Intelligenz, Professur Computational Logic Schema-Agnostic Query Rewriting in SPARQL 1.1 Stefan Bischof, Markus Krötzsch, Axel Polleres and Sebastian Rudolph Plain
More informationSPARQL Protocol And RDF Query Language
SPARQL Protocol And RDF Query Language WS 2011/12: XML Technologies John Julian Carstens Department of Computer Science Communication Systems Group Christian-Albrechts-Universität zu Kiel March 1, 2012
More informationSemantics in RDF and SPARQL Some Considerations
Semantics in RDF and SPARQL Some Considerations Dept. Computer Science, Universidad de Chile Center for Semantic Web Research http://ciws.cl Dagstuhl, June 2017 Semantics RDF and SPARQL 1 / 7 Semantics
More informationThe P2 Registry
The P2 Registry -------------------------------------- Where the Semantic Web and Web 2.0 meet Digital Preservation David Tarrant, Steve Hitchcock & Les Carr davetaz / sh94r / lac @ecs.soton.ac.uk School
More informationTowards the Semantic Desktop. Dr. Øyvind Hanssen University Library of Tromsø
Towards the Semantic Desktop Dr. Øyvind Hanssen University Library of Tromsø Agenda Background Enabling trends and technologies Desktop computing and The Semantic Web Online Social Networking and P2P Computing
More informationCOMP718: Ontologies and Knowledge Bases
1/35 COMP718: Ontologies and Knowledge Bases Lecture 9: Ontology/Conceptual Model based Data Access Maria Keet email: keet@ukzn.ac.za home: http://www.meteck.org School of Mathematics, Statistics, and
More informationFrom the Web to the Semantic Web: RDF and RDF Schema
From the Web to the Semantic Web: RDF and RDF Schema Languages for web Master s Degree Course in Computer Engineering - (A.Y. 2016/2017) The Semantic Web [Berners-Lee et al., Scientific American, 2001]
More informationKeyword Search over RDF Graphs. Elisa Menendez
Elisa Menendez emenendez@inf.puc-rio.br Summary Motivation Keyword Search over RDF Process Challenges Example QUIOW System Next Steps Motivation Motivation Keyword search is an easy way to retrieve information
More informationSPARQL QUERY LANGUAGE WEB:
SPARQL QUERY LANGUAGE JELENA JOVANOVIC EMAIL: JELJOV@GMAIL.COM WEB: HTTP://JELENAJOVANOVIC.NET SPARQL query language W3C standard for querying RDF graphs Can be used to query not only native RDF data,
More informationIntroducing Linked Data
Introducing Linked Data (Part of this work was funded by PlanetData NoE FP7/2007-2013) Irini Fundulaki 1 1 Institute of Computer Science FORTH & W3C Greece Office Manager EICOS : 4th Meeting, Athens, Greece
More information2. RDF Semantic Web Basics Semantic Web
2. RDF Semantic Web Basics Semantic Web Prof. Dr. Bernhard Humm Faculty of Computer Science Hochschule Darmstadt University of Applied Sciences Summer semester 2011 1 Agenda Semantic Web Basics Literature
More informationFOUNDATIONS OF DATABASES AND QUERY LANGUAGES
FOUNDATIONS OF DATABASES AND QUERY LANGUAGES Lecture 14: Database Theory in Practice Markus Krötzsch TU Dresden, 20 July 2015 Overview 1. Introduction Relational data model 2. First-order queries 3. Complexity
More informationBUILDING THE SEMANTIC WEB
BUILDING THE SEMANTIC WEB You might have come across the term Semantic Web Applications often, during talks about the future of Web apps. Check out what this is all about There are two aspects to the possible
More informationFedX: Optimization Techniques for Federated Query Processing on Linked Data. ISWC 2011 October 26 th. Presented by: Ziv Dayan
FedX: Optimization Techniques for Federated Query Processing on Linked Data ISWC 2011 October 26 th Presented by: Ziv Dayan Andreas Schwarte 1, Peter Haase 1, Katja Hose 2, Ralf Schenkel 2, and Michael
More informationXML Perspectives on RDF Querying: Towards integrated Access to Data and Metadata on the Web
XML Perspectives on RDF Querying: Towards integrated Access to Data and Metadata on the Web Tim Furche, François Bry, Oliver Bolzer Institute for Informatics, University of Munich http://www.pms.ifi.lmu.de
More informationA Formal Framework for Comparing Linked Data Fragments
A Formal Framework for Comparing Linked Data Fragments Olaf Hartig 1, Ian Letter 2, and Jorge Pérez 3 1 Dept. of Computer and Information Science (IDA), Linköping University, Sweden olaf.hartig@liu.se
More informationTowards Equivalences for Federated SPARQL Queries
Towards Equivalences for Federated SPARQL Queries Carlos Buil-Aranda 1? and Axel Polleres 2?? 1 Department of Computer Science, Pontificia Universidad Católica, Chile cbuil@ing.puc.cl 2 Vienna University
More informationOrchestrating Music Queries via the Semantic Web
Orchestrating Music Queries via the Semantic Web Milos Vukicevic, John Galletly American University in Bulgaria Blagoevgrad 2700 Bulgaria +359 73 888 466 milossmi@gmail.com, jgalletly@aubg.bg Abstract
More informationDomain Specific Semantic Web Search Engine
Domain Specific Semantic Web Search Engine KONIDENA KRUPA MANI BALA 1, MADDUKURI SUSMITHA 2, GARRE SOWMYA 3, GARIKIPATI SIRISHA 4, PUPPALA POTHU RAJU 5 1,2,3,4 B.Tech, Computer Science, Vasireddy Venkatadri
More informationProposal for Implementing Linked Open Data on Libraries Catalogue
Submitted on: 16.07.2018 Proposal for Implementing Linked Open Data on Libraries Catalogue Esraa Elsayed Abdelaziz Computer Science, Arab Academy for Science and Technology, Alexandria, Egypt. E-mail address:
More informationKnowledge Representation RDF Turtle Namespace
Knowledge Representation RDF Turtle Namespace Jan Pettersen Nytun, UiA 1 URIs Identify Web Resources Web addresses are the most common URIs, i.e., uniform Resource Locators (URLs). RDF resources are usually
More informationLogical reconstruction of RDF and ontology languages
Logical reconstruction of RDF and ontology languages Jos de Bruijn 1, Enrico Franconi 2, and Sergio Tessaris 2 1 Digital Enterprise Research Institute, University of Innsbruck, Austria jos.debruijn@deri.org
More informationAn Introduction to the Semantic Web. Jeff Heflin Lehigh University
An Introduction to the Semantic Web Jeff Heflin Lehigh University The Semantic Web Definition The Semantic Web is not a separate Web but an extension of the current one, in which information is given well-defined
More informationStructural characterizations of schema mapping languages
Structural characterizations of schema mapping languages Balder ten Cate INRIA and ENS Cachan (research done while visiting IBM Almaden and UC Santa Cruz) Joint work with Phokion Kolaitis (ICDT 09) Schema
More informationDatabase Theory VU , SS Introduction: Relational Query Languages. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2018 1. Introduction: Relational Query Languages Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 6 March,
More informationSemantic Web Systems Querying Jacques Fleuriot School of Informatics
Semantic Web Systems Querying Jacques Fleuriot School of Informatics 5 th February 2015 In the previous lecture l Serialising RDF in XML RDF Triples with literal Object edstaff:9888 foaf:name Ewan Klein.
More informationToward Analytics for RDF Graphs
Toward Analytics for RDF Graphs Ioana Manolescu INRIA and Ecole Polytechnique, France ioana.manolescu@inria.fr http://pages.saclay.inria.fr/ioana.manolescu Joint work with D. Bursztyn, S. Cebiric (Inria),
More informationLOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
More informationThe Semantic Web. Mansooreh Jalalyazdi
1 هو العليم 2 The Semantic Web Mansooreh Jalalyazdi 3 Content Syntactic web XML Add semantics Representation Language RDF, RDFS OWL Query languages 4 History of the Semantic Web Tim Berners-Lee vision
More informationSemantics. Matthew J. Graham CACR. Methods of Computational Science Caltech, 2011 May 10. matthew graham
Semantics Matthew J. Graham CACR Methods of Computational Science Caltech, 2011 May 10 semantic web The future of the Internet (Web 3.0) Decentralized platform for distributed knowledge A web of databases
More informationState of the Art of Semantic Web
State of the Art of Semantic Web Ali Alqazzaz Computer Science and Engineering Department Oakland University Rochester Hills, MI 48307, USA gazzaz86@gmail.com Abstract Semantic web is an attempt to provide
More informationThe Data Web and Linked Data.
Mustafa Jarrar Lecture Notes, Knowledge Engineering (SCOM7348) University of Birzeit 1 st Semester, 2011 Knowledge Engineering (SCOM7348) The Data Web and Linked Data. Dr. Mustafa Jarrar University of
More informationSEMANTIC WEB AN INTRODUCTION. Luigi De https://elite.polito.it
SEMANTIC WEB AN INTRODUCTION Luigi De Russis @luigidr https://elite.polito.it THE WEB IS A WEB OF DOCUMENT FOR PEOPLE, NOT FOR MACHINES 2 THE WEB IS A WEB OF DOCUMENT 3 THE SEMANTIC WEB IS A WEB OF DATA
More informationXML Data Exchange. Marcelo Arenas P. Universidad Católica de Chile. Joint work with Leonid Libkin (U. of Toronto)
XML Data Exchange Marcelo Arenas P. Universidad Católica de Chile Joint work with Leonid Libkin (U. of Toronto) Data Exchange in Relational Databases Data exchange has been extensively studied in the relational
More informationE6885 Network Science Lecture 10: Graph Database (II)
E 6885 Topics in Signal Processing -- Network Science E6885 Network Science Lecture 10: Graph Database (II) Ching-Yung Lin, Dept. of Electrical Engineering, Columbia University November 18th, 2013 Course
More informationRevisiting Blank Nodes in RDF to Avoid the Semantic Mismatch with SPARQL
Revisiting Blank Nodes in RDF to Avoid the Semantic Mismatch with SPARQL Marcelo Arenas 1, Mariano Consens 2, and Alejandro Mallea 1,3 1 Pontificia Universidad Católica de Chile 2 University of Toronto
More informationDeep integration of Python with Semantic Web technologies
Deep integration of Python with Semantic Web technologies Marian Babik, Ladislav Hluchy Intelligent and Knowledge Technologies Group Institute of Informatics, SAS Goals of the presentation Brief introduction
More informationForward Chaining Reasoning Tool for Rya
Forward Chaining Reasoning Tool for Rya Rya Working Group, 6/29/2016 Forward Chaining Reasoning Tool for Rya 6/29/2016 1 / 11 OWL Reasoning OWL (the Web Ontology Language) facilitates rich ontology definition
More informationSemantic Web. Tahani Aljehani
Semantic Web Tahani Aljehani Motivation: Example 1 You are interested in SOAP Web architecture Use your favorite search engine to find the articles about SOAP Keywords-based search You'll get lots of information,
More informationLinked Open Data: a short introduction
International Workshop Linked Open Data & the Jewish Cultural Heritage Rome, 20 th January 2015 Linked Open Data: a short introduction Oreste Signore (W3C Italy) Slides at: http://www.w3c.it/talks/2015/lodjch/
More informationMulti-agent Semantic Web Systems: RDF Models
... Multi-agent Semantic Web Systems: RDF Models Ewan Klein School of Informatics January 30, 2012 Ewan Klein (School of Informatics) Multi-agent Semantic Web Systems: RDF Models January 30, 2012 1 / 33
More informationSPARQL with Property Paths
SPARQL with Property Paths Egor V. Kostylev 1, Juan L. Reutter 2, Miguel Romero 3, and Domagoj Vrgoč 2 1 University of Oxford 2 PUC Chile and Center for Semantic Web Research 3 University of Chile and
More informationAn FCA Framework for Knowledge Discovery in SPARQL Query Answers
An FCA Framework for Knowledge Discovery in SPARQL Query Answers Melisachew Wudage Chekol, Amedeo Napoli To cite this version: Melisachew Wudage Chekol, Amedeo Napoli. An FCA Framework for Knowledge Discovery
More informationRuleML and SWRL, Proof and Trust
RuleML and SWRL, Proof and Trust Semantic Web F. Abel and D. Krause IVS Semantic Web Group January 17, 2008 1 Solution 1: RuleML Express the following RuleML code as a human-readable First Order Logic
More informationLinked data and its role in the semantic web. Dave Reynolds, Epimorphics
Linked data and its role in the semantic web Dave Reynolds, Epimorphics Ltd @der42 Roadmap What is linked data? Modelling Strengths and weaknesses Examples Access other topics image: Leo Oosterloo @ flickr.com
More informationGraph Databases. Guilherme Fetter Damasio. University of Ontario Institute of Technology and IBM Centre for Advanced Studies IBM Corporation
Graph Databases Guilherme Fetter Damasio University of Ontario Institute of Technology and IBM Centre for Advanced Studies Outline Introduction Relational Database Graph Database Our Research 2 Introduction
More informationXML and Semantic Web Technologies. III. Semantic Web / 1. Ressource Description Framework (RDF)
XML and Semantic Web Technologies XML and Semantic Web Technologies III. Semantic Web / 1. Ressource Description Framework (RDF) Prof. Dr. Dr. Lars Schmidt-Thieme Information Systems and Machine Learning
More informationFOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES
FOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES Semantics of RDF(S) Sebastian Rudolph Dresden, 25 April 2014 Content Overview & XML Introduction into RDF RDFS Syntax & Intuition Tutorial 1 RDFS Semantics RDFS
More informationINF3580/4580 Semantic Technologies Spring 2017
INF3580/4580 Semantic Technologies Spring 2017 Lecture 9: Model Semantics & Reasoning Martin Giese 13th March 2017 Department of Informatics University of Oslo Today s Plan 1 Repetition: RDF semantics
More informationQuerying the Semantic Web
Querying the Semantic Web CSE 595 Semantic Web Instructor: Dr. Paul Fodor Stony Brook University http://www3.cs.stonybrook.edu/~pfodor/courses/cse595.html Lecture Outline SPARQL Infrastructure Basics:
More informationOSM Lecture (14:45-16:15) Takahira Yamaguchi. OSM Exercise (16:30-18:00) Susumu Tamagawa
OSM Lecture (14:45-16:15) Takahira Yamaguchi OSM Exercise (16:30-18:00) Susumu Tamagawa TBL 1 st Proposal Information Management: A Proposal (1989) Links have the following types: depends on is part of
More informationSemantic Integration with Apache Jena and Apache Stanbol
Semantic Integration with Apache Jena and Apache Stanbol All Things Open Raleigh, NC Oct. 22, 2014 Overview Theory (~10 mins) Application Examples (~10 mins) Technical Details (~25 mins) What do we mean
More informationDatabase Theory VU , SS Introduction: Relational Query Languages. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2011 1. Introduction: Relational Query Languages Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 8 March,
More informationChapter 13: Advanced topic 3 Web 3.0
Chapter 13: Advanced topic 3 Web 3.0 Contents Web 3.0 Metadata RDF SPARQL OWL Web 3.0 Web 1.0 Website publish information, user read it Ex: Web 2.0 User create content: post information, modify, delete
More informationLinked Data: Standard s convergence
Linked Data: Standard s convergence Enhancing the convergence between reporting standards Maria Mora Technical Manager maria.mora@cdp.net 1 Lets talk about a problem Lack of a perfect convergence between
More informationRDF /RDF-S Providing Framework Support to OWL Ontologies
RDF /RDF-S Providing Framework Support to OWL Ontologies Rajiv Pandey #, Dr.Sanjay Dwivedi * # Amity Institute of information Technology, Amity University Lucknow,India * Dept.Of Computer Science,BBA University
More informationTHE GETTY VOCABULARIES TECHNICAL UPDATE
AAT TGN ULAN CONA THE GETTY VOCABULARIES TECHNICAL UPDATE International Working Group Meetings January 7-10, 2013 Joan Cobb Gregg Garcia Information Technology Services J. Paul Getty Trust International
More informationUnit 2 RDF Formal Semantics in Detail
Unit 2 RDF Formal Semantics in Detail Axel Polleres Siemens AG Österreich VU 184.729 Semantic Web Technologies A. Polleres VU 184.729 1/41 Where are we? Last time we learnt: Basic ideas about RDF and how
More information