09: SPARQL Advanced Flashcards

1
Q

XML schema are ____ format, whereas DF, RDFS, and OWL are about ____ ____.

A

XML schema are message** format, whereas DF, RDFS, and OWL are about **knowledge** **representation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Many RDF ____ ____ hold multiple ____ ____ and record information about each ____, allowing an application to make ____ that involve information from more than one ____.

A

Many RDF data stores** hold multiple **RDF** **graphs and record information about each graph, allowing an application to make queries that involve information from more than one graph.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

A SPARQL query is executed against an ____ ____ which represents a ____ ____ ____.

A

A SPARQL query is executed against an RDF** **dataset** which represents a **collection** **of graphs.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

A constraint, expressed by the keyword FILTER, is a ____ ____ ____ over the whole group in which the filter appears.

A

A constraint, expressed by the keyword FILTER, is a restriction** **on** **solutions over the whole group in which the filter appears.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Group Graph Patterns

A
  • a group graph pattern is delimited with braces {}
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Multiple Optional Patterns

A
  • graph patterns are defined recursively
  • a graph pattern may have zero or more optional graph patterns, and any part of a query pattern may have an optional part
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Query patterns can involve both the ____ ____ and the ____ ____.

A

Query patterns can involve both the default graph and the named graphs.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the query to list the name of all graphs?

A

SELECT DISTINCT ?g {graph ?g {[] [] [].}}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Change the following SELECT command so that as well as writing the name of graphs (datasets), it writes the number of triplets in each graph as well.

SELECT ?g count(?g)

{graph ?g {[] [] [].}}

A

SELECT ?g count(?g)

{graph ?g {[] [] [].}}

GROUP BY ?g

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

When working with subqueries in SPARQL, in nested queries there is a scheme called ____ ____ ____ ____.

A

When working with subqueries in SPARQL, in nested queries there is a scheme called innermost** **first** **processing** **scheme.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the output of the following?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Federated Query

A
  • the ability to take a query and provide solutions based on information from many different sources
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Top-to-Bottom Order Approach

(Federated Queries)

A
  • if a variable is bound above the invocation of the remote source then it is passed as a parameter
    • would instead be better if the federated subquery would leave all latitude to the implementation to decide join order and would thus be more in the non-procedural spirit of SPARQL
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Ideally, federating queries should be ____.

(And what is the drawback of this?)

A

Ideally, federating queries should be transparent.

  • comes at a cost with SPARQL: multiple end points in principle can match any of the triple patterns in a query
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

SERVICE keyword

A
  • instructs a federated query processor to invoke a portion of a SPARQL query against a remote SPARQL endpoint
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

DL (Descriptive Logic)

A
  • family of knowledge representation languages on which OWL is based
  • allows humans and computers to exchange well-structured ontologies
  • facilitates logical deduction to infer additional knowledge, a process referred to as reasoning
  • balances expressivity vs complexity of reasoning
17
Q

What two important issues can DL reasoners help reveal?

A
  • inconsistencies & misclassifications
  • hidden dependencies
18
Q

Main Characteristics of DL

A
  • modes the binary relationships among the entities of certain domains
  • can use knowledge in ontology to infer further facts about individuals
  • can form statements linking concepts and roles (by existential and universal restrictions)
19
Q

What 3 elements is DL involved with?

A
  • individuals/constants (e.g. David)
  • concepts/unary relations (e.g. Person)
  • roles/binary relations (e.g. isMarried)
20
Q

TBox

A
  • defines the ontology that serves as conceptual view over the data in the ABox terminology
21
Q

ABox

A
  • set of assertions that
    • state membership of individuals to concepts
      • C(a)
    • and role membership for pairs
      • R(a,b)
22
Q

State the following statement in DL as well as in Protege:

Assume that for a person to be called a student, he/she needs to attend at least 4 courses.

A