GEDLIBGEDLIB is an easily extensible C++ library for (suboptimally) computing the graph edit distance (GED) between two labeled graphs. GED is defined as the minimum cost of a sequence of elementary edit operations that transforms one graph into another. There are six elementary edit operations: changing the label of an existing node, inserting an isolated node, deleting an isolated node, changing the label of an existing edge, inserting an an edge between two existing nodes, and deleting an edge. GEDLIB implements several state of the art methods for computing GED and comes with predefined edit costs for some benchmark datasets. Further methods and edit costs can easily be implemented by the user. [more]
Temporal Relational Database Management SystemsAims at extending RDBMs with support for querying interval-timestamped data under sequenced semantics. The basic idea is to reduce the temporal operators to the non-temporal counterparts. Our solution is implemented in the kernel of PostgreSQL. [more]
Temporal Data AnalyticsAims at developing solutions for analyzing temporal data. Specific adressed research problems include the development of algorithms for efficient computation of aggregation operators, the computation of approximation of aggregation result sets, support for visual data analysis. [more]
DASAAims at developing solutions for managing/analyzing time series data coming from weather stations in agriculture. Specific research problems include the imputation of missing values and the search for similar time series or episodes, e.g., seek the most similar summer. [more]
IsochronesAims at studying isochrones as a tool for reachability and catchment analysis in spatial network databases. [more]
Paper accepted in The VLDB Journal
Our paper "Finding k-Shortest Paths with Limited Overlap" has been accepted for publication in The VLDB Journal.
PhD defense of David B. Blumenthal
David B. Blumenthal successfully defended his PhD thesis entitled "New Techniques for Graph Edit Distance Computation".
Paper accepted at SSTD 2019
Our research paper "Period Index: A Learned 2D Hash Index for Range and Duration Queries" has been accepted for publication at SSTD 2019 in Vienna, Austria.
Demo accepted at SSTD 2019
Our demo paper "HOTPERIODS: Visual Correlation Analysis of Interval Data" has been accepted for publication at SSTD 2019 in Vienna, Austria.
Paper accepted in The VLDB Journal
Our paper "Comparing heuristics for graph edit distance computation" has been accepted for publication in The VLDB Journal.
Fabio Persia appointed PC Co-Chair of IEEE HCC 2019
Fabio Persia has been appointed Program Co-Chair of IEEE HCC 2019 at Laguna Hills, California, USA.
Fabio Persia appointed PC Co-Chair of IEEE ISM 2019
Fabio Persia has been appointed Program Co-Chair of IEEE ISM 2019 in San Diego, California, USA.
Paper accepted at GbRPR 2019
Our paper "GEDLIB: A C++ Library for Graph Edit Distance Computation" has been accepted for publication at GbRPR 2019 in Tours, France. Check out the code here.
Paper accepted at VLDB 2019
Our paper "Snapshot semantics for temporal mutliset relations" has been accepted for publication at VLDB 2019 in Los Angeles, USA.
Johann Gamper nominated Vice-Rector of unibz
We congratulate Johann Gamper for being appointed vice-rector for research and innovation at unibz. [more]
SSDBM 2018 in Bozen-Bolzano
We successfully concluded the SSDBM in Bozen-Bolzano. Pictures of the conference and mountain tour are available here.