This paper investigates ultrafilters in the context of connectivity systems, defined as pairs
$(X, f) $ where $ X $ is a finite set and $ f $ is a symmetric submodular function. Ultrafilters …

Finding patterns in graphs is a fundamental problem in databases and data mining. In many
applications, graphs are temporal and evolve over time, so we are interested in finding …

We study synthetic data release for answering multiple linear queries over a set of database
tables in a differentially private way. Two special cases have been considered in the …

We investigate how to efficiently compute the difference result of two (or multiple)
conjunctive queries, which is the last operator in relational algebra to be unraveled. The …

Temporal databases has been an active research area since many decades, ranging from
research work on query processing, most dominantly on selection and join queries, to new …

Recent research in tabular data synthesis has focused on single tables, whereas real-world
applications often involve complex data with tens or hundreds of interconnected tables …

We study the problem of temporal database indexing, ie, indexing versions of a database
table in an evolving database. With the larger and cheaper memory chips nowadays, we can …

Efficient and scalable processing of temporal anti-joins remains a significant research
challenge in temporal databases. To address this issue, this paper introduces a novel …

The management of intervals has been an active research area since databases were
invented. A popular direction of research is the indexing and retrieval of intervals, finding a …

Intersection joins over interval data are relevant in spatial and temporal data settings. A set
of intervals join if their intersection is non-empty. In case of point intervals, the intersection …