<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Novel Techniques in Datalog Optimization (Abstract)</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Reinhard</forename><surname>Pichler</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Institut für Logic and Computation</orgName>
								<orgName type="institution">TU Wien</orgName>
								<address>
									<addrLine>Favoritenstraße 9</addrLine>
									<postCode>A-1040</postCode>
									<settlement>Wien</settlement>
									<country key="AT">Austria</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Novel Techniques in Datalog Optimization (Abstract)</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">A37D3DFB31D6EF16D3F8B0C9420CB907</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T18:31+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Datalog has been specifically designed for processing recursive queries. As such it seems the perfect fit for today's data analytics applications, which typically require some kind of iteration or recursion. However, basic analytical tasks such as computing shortest paths, betweenness centrality, or connected components in a graph as well as solving optimization problems by gradient descent or other methods crucially depend on aggregation. For Datalog, this poses new challenges due to the loss of the usual monotonicity properties in case of aggregation.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>In this talk, I will present recent work in which</p><p>• we have studied a generalization of Datalog that allows for recursive computations over general semirings (with classical Datalog corresponding to the special case of the Boolean semiring),</p><p>• we have analyzed the convergence of this generalization of Datalog, and</p><p>• we have introduced a powerful new optimization technique that covers known optimizations such as magic-set rewriting as well as new ones.</p><p>This talk is mainly based on the following papers:</p></div><figure xmlns="http://www.tei-c.org/ns/1.0"><head></head><label></label><figDesc></figDesc><graphic coords="1,0.00,190.95,595.28,459.99" type="bitmap" /></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Convergence of Datalog over (Pre-) Semirings</title>
		<author>
			<persName><forename type="first">Mahmoud</forename><surname>Abo Khamis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Hung</forename><forename type="middle">Q</forename><surname>Ngo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Reinhard</forename><surname>Pichler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Dan</forename><surname>Suciu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Remy</forename><surname>Yisu</surname></persName>
		</author>
		<author>
			<persName><surname>Wang</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2022">2022</date>
			<pubPlace>PODS</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Optimizing Recursive Queries with Progam Synthesis</title>
		<author>
			<persName><forename type="first">Remy</forename><surname>Yisu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Mahmoud</forename><forename type="middle">Abo</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Hung</forename><forename type="middle">Q</forename><surname>Khamis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Reinhard</forename><surname>Ngo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Dan</forename><surname>Pichler</surname></persName>
		</author>
		<author>
			<persName><surname>Suciu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">SIGMOD Conference</title>
				<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<ptr target="0002-1760-122X" />
	</analytic>
	<monogr>
		<title level="m">4th International Workshop on the Resurgence of Datalog in Academia and Industry</title>
				<editor>
			<persName><forename type="first">R</forename><surname>Pichler</surname></persName>
		</editor>
		<meeting><address><addrLine>Genova -Nervi, Italy pichler</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022-09-00">0 2022. September 05, 2022. 0000-</date>
			<biblScope unit="volume">2</biblScope>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
