Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
: Nowadays, a central topic in database science is the need of an integrated access to large amounts of data provided by various information sources whose contents are strictly rel...
The automatic extraction of information from unstructured sources has opened up new avenues for querying, organizing, and analyzing data by drawing upon the clean semantics of str...
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
Alexandra Rostin, Oliver Albrecht, Jana Bauckmann,...