Ankesh Sep11
From Semantic Portal Wiki
CSCI 6966 Advanced Semantic Web (Fall 2008)
- syllabus, announcements, presentations
- Lesson 1, Lesson 2, Lesson 3, Lesson 4, Lesson 5, Lesson 6,
- Lesson 7, Lesson 8, Lesson 9, Lesson 10, Lesson 11, Lesson 12, Lesson 13
- Presentation Given at: CSCI 6966 Advanced Semantic Web (Fall 2008) - Lesson 3
- Speaker: Ankesh Khandelwal
- Title: Querying Distributed RDF Data Sources with SPARQL
- Authors: Bastian Quilitz, Ulf Leser
- Conference: ESWC 2008
- URL: http://www.eswc2008.org/final-pdfs-for-web-site/qpII-2.pdf
- Date of Presentation: 2008/09/11
Questions
| ID | Question | Name |
|---|---|---|
| Ankesh Sep11 Jesse Weaver | The paper mentions that variables are replaced by constants from filter expressions, but depending on the system, the two forms of the query may mean different things. As an example, consider:
SELECT ?s WHERE {
?s <test:p> ?o .
FILTER(?o = "true"^^xsd:boolean)
}
According to SPARQL, the '=' operator here checks for _boolean_ equality if ?o is bound to an xsd:boolean literal. Therefore, if ?o binds to "1"^^xsd:boolean (non-canonical but valid lexical representation), FILTER "passes". However, with variable replacement, the query would become: SELECT ?s WHERE {
?s <test:p> "true"^^xsd:boolean .
}
Depending on the system, this may not be equivalent (although it could be). Does DARQ account for this? |
Jesse Weaver |
| AnkeshSep11GregoryToddWilliams1 | Does the cost estimate for bind joins accurately reflect the actual cost of such a join? The presented formula 3.3 seems to ignore the repeated transfer cost of R(q'2), yet no details are given about the choice of join algorithms in the benchmark executions | Gregory Todd Williams |
| AnkeshSep11JoshuaShinavier1 | What is the reason for basing "capabilities" on predicates (exclusively)? Ignoring the details of the implementation, there are other ways in which we might want to partition a distributed data set (e.g. by assigning quads to data sources based on their named graph component. In this case, a capability might consist of a number of named graphs in which the query planner can expect to find statements). | Joshua Shinavier |
| AnkeshSep11JoshuaTaylor1 | One of the motivations for distributed queries was that it is impractical to download a remote site's dataset. However, it seems that downloading numerous service descriptions would seem to cause some of the same problems, particularly since some of the service descriptions would change very often, e.g., statistical descriptions which carry the number of triples in the dataset. (Would this even be realistic for systems that don't store triples, but provide a SPARQL endpoint on top of other systems?). | Joshua A. Taylor |
| AnkeshSep11JoshuaTaylor2 | The evaluation section makes no use of systems that provide dynamic information. How would creation of service descriptions for such systems affect performance? E.g., statistical service descriptions include the number of triples in the datatset---how does computing this affect performance? | Joshua A. Taylor |
| AnkeshSep11JoshuaTaylor3 | Are some of the partitions of datasets realistic? E.g., one of the example service descriptions mentions the ability to search for names beginning with letters from A-R. Do real systems actually do things like this, and if they are, they must have some way of dealing with needing to query different data sources for similar information---how do those handle these issues? | Joshua A. Taylor |
| Author | Text | |
|---|---|---|
| Quilitz2008querying question 1 by lebo | Tim Lebo | The authors state, "There is no other need for cooperation except of the support of the SPARQL protocol." Yet later, "To find the relevant information sources for the different triples in a query and to decompose the query into sub-queries the query engine needs information about the data sources." DARQ relies on the service descriptions to determine how to decompose the query.
|
| Quilitz2008querying question 2 by lebo | Tim Lebo |
|
| Quilitz2008querying question 3 by lebo | Tim Lebo |
|
| Quilitz2008querying question 4 by lebo | Tim Lebo |
|
| Quilitz2008querying question 5 by lebo | Tim Lebo | It is not clear how the dbpedia data were split across the two servers.
|
| Quilitz2008querying question 6 by lebo | Tim Lebo |
|
| Quilitz2008querying question 7 by lebo | Tim Lebo |
|
Absentees
Facts about Ankesh Sep11RDF feed
| A | Presentation +, and Presentation not attended by Tim Lebo + |
| Conference | ESWC_2008 + |
| Date | 11 September 2008 + |
| Given at | CSCI 6966 Advanced Semantic Web (Fall 2008) - Lesson 3 + |
| Paper has author | Bastian Quilitz +, and Ulf Leser + |
| Speaker | Ankesh Khandelwal + |
| Title of paper | Querying_Distributed_RDF_Data_Sources_with_SPARQL + |
| Url | http://www.eswc2008.org/final-pdfs-for-web-site/qpII-2.pdf + |

