Gallery — Recent

A&A LaTeX macro package v9.1 downloaded from http://ftp.edpsciences.org/pub/aa/readme.html

The template for NeurIPS 2021 AI for Science Workshop submission.

Taller álgebra lineal

1 year experience resume

Template for thesis done with Normandy University and ESIGELEC Lab. The Classic Thesis style by André Miede & Ivo Pletikosić With the COMUE page by Antoine Caillot Please, check the compliance with the Unviersty

CVPR 2022 author kit, including a paper template and a rebuttal template. Downloaded from https://cvpr2022.thecvf.com/author-guidelines (updated 08/23/2021).

Template Latex para a revista Sobraep versão em Português

Computer Science MSc Thesis (Brock University) Template

The Web has evolved from a system of internet servers supporting formatted documents into a web of linked data. In the last years, the Web of Data is constantly growing. Consequently, it has developed a large collection of interlinked data sets from multiple domains. To exploit the diversity of all available data, federated queries are needed. However, many problems such as processing power, query response time, high workload or outdated information are hindering the query processing. In this paper, I am aiming to explain various optimization techniques which have the potential to lead a significant improvement on the final query runtime. I will start by briefly introducing recent approaches of federation and show why SPARQL federation endpoints are mostly in my focus. Specifically, I will compare state-of-the-art SPARQL query federation engines and analyze respective optimization approaches. The main federation engines I will analyze in terms of query optimization are FedX, DARQ and SPLENDID. As the result I provide concrete examples and conclude which of the engines has the best performance based on the query execution time as key criterion.