HELIOS - Execution Optimization for Link Discovery
published: Dec. 19, 2014, recorded: October 2014, views: 42
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Links between knowledge bases build the backbone of the Linked Data Web. In previous works, the combination of the results of time-efficient algorithms through set-theoretical operators has been shown to be very time-efficient for Link Discovery. However, the further optimization of such link specifications has not been paid much attention to. We address the issue of further optimizing the runtime of link specifications by presenting Helios, a runtime optimizer for Link Discovery. Helios comprises both a rewriter and an execution planner for link specifications. The rewriter is a sequence of fixed-point iterators for algebraic rules. The planner relies on time-efficient evaluation functions to generate execution plans for link specifications. We evaluate Helios on 17 specifications created by human experts and 2180 specifications generated automatically. Our evaluation shows that Helios is up to 300 times faster than a canonical planner. Moreover, Helios’ improvements are statistically significant.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !