<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM17Reichenbach</id>
	<title>WG211/M17Reichenbach - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM17Reichenbach"/>
	<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M17Reichenbach&amp;action=history"/>
	<updated>2026-04-05T20:55:48Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>http://mw.hh.se/wg211/index.php?title=WG211/M17Reichenbach&amp;diff=1666&amp;oldid=prev</id>
		<title>Creichen: Created page with &quot;In many data processing tasks, declarative query programming offers substantial benefit over manual data analysis: the query processors found in declarative systems can use po...&quot;</title>
		<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M17Reichenbach&amp;diff=1666&amp;oldid=prev"/>
		<updated>2017-07-01T16:19:15Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;In many data processing tasks, declarative query programming offers substantial benefit over manual data analysis: the query processors found in declarative systems can use po...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In many data processing tasks, declarative query programming offers substantial benefit over manual data analysis: the query processors found in declarative systems can use powerful algorithms such as query planning to choose high-level execution strategies during compilation.&lt;br /&gt;
However, the principal downside of such languages is that their primitives must be carefully curated, to allow the query planner to correctly estimate their overhead. In this talk I explore this challenge in our PQL/Java system.&lt;br /&gt;
PQL/Java adds a powerful declarative query language to Java to enable and automatically parallelise queries over the Java heap. In the past, the language has not provided any sup- port for custom user-designed datatypes, as such support requires complex interactions with its query planner and backend.&lt;br /&gt;
We examine PQL/Java and its intermediate language in detail and describe a new system that simplifies PQL/Java extensions. This system provides a DSL that permits users to add new primitives with arbitrary Java computations, and new rewriting rules for optimisation.&lt;br /&gt;
Our system automatically stages compilation and exploits constant information for dead code elimination and type specialisation. We have re-written our PQL/Java backend in our extension language, enabling dynamic and staged compilation.&lt;br /&gt;
We demonstrate the effectiveness of our extension language in several case studies, including the efficient integration of SQL queries, and by analysing the run-time performance of the rewritten prototype backend.&lt;/div&gt;</summary>
		<author><name>Creichen</name></author>
	</entry>
</feed>