<html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body>
<p>-------- Forwarded Message --------</p>
<div class="moz-forward-container">
<table class="moz-email-headers-table" cellspacing="0" cellpadding="0" border="0">
<tbody>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Subject:
</th>
<td>[DMANET] Postdoc position on "Efficient queries in
compressed temporal graph databases" at Ca' Foscari
University of Venice, Italy</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Wed, 7 Dec 2022 11:36:22 +0100</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Nicola Prezza <a class="moz-txt-link-rfc2396E" href="mailto:nicola.prezza@unive.it"><nicola.prezza@unive.it></a></td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">To: </th>
<td><a class="moz-txt-link-abbreviated" href="mailto:dmanet@zpr.uni-koeln.de">dmanet@zpr.uni-koeln.de</a></td>
</tr>
</tbody>
</table>
<br>
<br>
At Ca' Foscari Univeristy of Venice, Italy, we offer a postdoc
position on<br>
"Efficient queries in compressed temporal graph databases" under
the<br>
supervision of Claudio Silvestri, Nicola Prezza, and Giulio
Ermanno Pibiri.<br>
The project is partially funded by the ERC project REGINDEX (<br>
<a class="moz-txt-link-freetext" href="https://pric.unive.it/projects/regindex/home">https://pric.unive.it/projects/regindex/home</a>><br>
Skills: candidates with skills in any subset of the following
research<br>
topics are welcome: Algorithms and data structures, graph
algorithms,<br>
databases, C++/rust programming.<br>
<br>
Description: One of the most adopted data models in graph
databases is the<br>
property graph data model, in which both edges and nodes are
labeled with<br>
multiple key-value pairs. Since time is a relevant dimension in
most<br>
real-world problems, recent research works started considering
time a<br>
first-class citizen in the property graph model, proposing the
Temporal<br>
Property Graph model and a corresponding language, T-GQL, that can<br>
represent the graph’s structure and label evolution along time and
express<br>
temporal queries. For example, we may be interested in matching
patterns<br>
or, more in general, regular expressions along the time dimension<br>
considering different parts of the history of the graph, that
could<br>
represent a starting point for evaluating the reachability of
nodes along<br>
temporal paths in which edges intervals of existence are
consecutive. This<br>
research aims to improve the efficiency of property graph
databases and<br>
temporal property graph databases using compressed graph
representations<br>
and graph pattern matching/regular path query algorithms for the<br>
computation of T-GQL queries along graph paths defined by patterns
and<br>
regular expressions.<br>
<br>
Duration of contract: 12 months, approximately starting: February
2023<br>
<br>
Location: the research will take place at the scientific campus of
Ca'<br>
Foscari University of Venice, Italy<br>
<br>
Application link: <a class="moz-txt-link-freetext" href="https://www.unive.it/data/28825/">https://www.unive.it/data/28825/</a> (search for
"Efficient<br>
queries in compressed temporal graph databases"). Deadline:
December 27th<br>
2022 at 12:00 Italian time.<br>
<br>
Contacts: For more information, contact Claudio Silvestri at<br>
<a class="moz-txt-link-abbreviated" href="mailto:silvestri@unive.it">silvestri@unive.it</a><br>
<br>
<br>
<pre class="moz-signature">--
Nicola Prezza
Associate Professor
Dipartimento di Scienze Ambientali, Informatica e Statistica
Università Ca' Foscari
Via Torino, 155 - 30170 Mestre, Venezia (VE), Italia
<a class="moz-txt-link-abbreviated" href="mailto:nicola.prezza@unive.it">nicola.prezza@unive.it</a>
</pre>
</div>
</body>
</html>