Join operators are particularly important in SPARQL query engines that collect RDF data using Web access interfaces. State-of-the-art SPARQL query engines rely on binary join operators tailored for merging results from SPARQL queries over Web access interfaces. However, in queries with a large number of triple patterns, binary joins constitute a significant burden on the query performance. Multi-way joins that handle more than two inputs are able to reduce the complexity of pre-processing stages and reduce the execution time. Whereas in the relational databases field multi-way joins have already received some attention, the applicability of multi-way joins in SPARQL query processing remains unexplored. We devise SMJoin, a multi-way non-bloc...
Linked Data Fragments (LDFs) refer to interfaces that allow for publishing and querying Knowledge Gr...
In SPARQL, conjunctive queries are expressed by using shared variables across sets of triple pattern...
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many m...
The join ordering problem is a fundamental challenge that has to be solved by any query optimizer. S...
The goal of query optimization in query federation over linked data is to minimize the response time...
Understanding how users tailor their SPARQL queries is cru-cial when designing query evaluation engi...
Existing solutions for answering SPARQL queries in a shared-nothing environment using MapReduce fail...
textabstractWe describe a system that incrementally translates SPARQL queries to Pig Latin and execu...
Abstract. We describe a system that incrementally translates SPARQL queries to Pig Latin and execute...
ABSTRACT Understanding how users tailor their SPARQL queries is crucial when designing query evaluat...
Social network data analysis becomes increasingly important today. In order to improve the integrati...
We describe a system that incrementally translates SPARQL queries to Pig Latin and executes them on ...
SQL is not appropriate for casual users as it requires un-derstanding relational schemas and how to ...
Abstract. Top-k queries, i.e. queries returning the top k results ordered by a user-defined scoring ...
Join query is one of the most expressive and expensive data analytic tools in traditional database s...
Linked Data Fragments (LDFs) refer to interfaces that allow for publishing and querying Knowledge Gr...
In SPARQL, conjunctive queries are expressed by using shared variables across sets of triple pattern...
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many m...
The join ordering problem is a fundamental challenge that has to be solved by any query optimizer. S...
The goal of query optimization in query federation over linked data is to minimize the response time...
Understanding how users tailor their SPARQL queries is cru-cial when designing query evaluation engi...
Existing solutions for answering SPARQL queries in a shared-nothing environment using MapReduce fail...
textabstractWe describe a system that incrementally translates SPARQL queries to Pig Latin and execu...
Abstract. We describe a system that incrementally translates SPARQL queries to Pig Latin and execute...
ABSTRACT Understanding how users tailor their SPARQL queries is crucial when designing query evaluat...
Social network data analysis becomes increasingly important today. In order to improve the integrati...
We describe a system that incrementally translates SPARQL queries to Pig Latin and executes them on ...
SQL is not appropriate for casual users as it requires un-derstanding relational schemas and how to ...
Abstract. Top-k queries, i.e. queries returning the top k results ordered by a user-defined scoring ...
Join query is one of the most expressive and expensive data analytic tools in traditional database s...
Linked Data Fragments (LDFs) refer to interfaces that allow for publishing and querying Knowledge Gr...
In SPARQL, conjunctive queries are expressed by using shared variables across sets of triple pattern...
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many m...