Wolfgang Gatterbauer

research

∙ 08/20/2023

A Tutorial on Visual Representations of Relational Queries

Query formulation is increasingly performed by systems that need to gues...

0 Wolfgang Gatterbauer, et al. ∙

research

∙ 07/02/2023

Towards Unbiased Exploration in Partial Label Learning

We consider learning a probabilistic classifier from partially-labelled ...

0 Zsolt Zombori, et al. ∙

research

∙ 05/25/2023

Efficient Computation of Quantiles over Joins

We present efficient algorithms for Quantile Join Queries, abbreviated a...

0 Nikolaos Tziavelis, et al. ∙

research

∙ 12/17/2022

A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations

Resilience is one of the key algorithmic problems underlying various for...

0 Neha Makhija, et al. ∙

research

∙ 09/27/2022

SANTOS: Relationship-based Semantic Table Union Search

Existing techniques for unionable table search define unionability using...

0 Aamod Khatiwada, et al. ∙

research

∙ 08/02/2022

Principles of Query Visualization

Query Visualization (QV) is the problem of transforming a given query in...

0 Wolfgang Gatterbauer, et al. ∙

research

∙ 05/11/2022

Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries

We study ranked enumeration for Conjunctive Queries (CQs) where the answ...

0 Nikolaos Tziavelis, et al. ∙

research

∙ 03/14/2022

Relational Diagrams: a pattern-preserving diagrammatic representation of non-disjunctive Relational Queries

Analyzing relational languages by their logical expressiveness is well u...

0 Wolfgang Gatterbauer, et al. ∙

research

∙ 05/29/2021

Towards a Dichotomy for Minimally Factorizing the Provenance of Self-Join Free Conjunctive Queries

We consider the problem of finding the minimal-size factorization of the...

0 Neha Makhija, et al. ∙

research

∙ 03/17/2021

DomainNet: Homograph Detection for Data Lake Disambiguation

Modern data lakes are deeply heterogeneous in the vocabulary that is use...

0 Aristotelis Leventidis, et al. ∙

research

∙ 01/28/2021

Beyond Equi-joins: Ranking, Enumeration and Factorization

We study full acyclic join queries with general join predicates that inv...

0 Nikolaos Tziavelis, et al. ∙

research

∙ 12/22/2020

Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries

We study the question of when we can provide logarithmic-time direct acc...

0 Nofar Carmeli, et al. ∙

research

∙ 05/01/2020

Optimal Join Algorithms Meet Top-k

Top-k queries have been studied intensively in the database community an...

0 Nikolaos Tziavelis, et al. ∙

research

∙ 04/23/2020

QueryVis: Logic-based diagrams help users understand complicated SQL queries faster

Understanding the meaning of existing SQL queries is critical for code m...

0 Aristotelis Leventidis, et al. ∙

research

∙ 04/13/2020

Near-Optimal Distributed Band-Joins through Recursive Partitioning

We consider running-time optimization for band-joins in a distributed sy...

0 Rundong Li, et al. ∙

research

∙ 03/05/2020

Factorized Graph Representations for Semi-Supervised Learning from Sparse Data

Node classification is an important problem in graph data management. It...

0 Krishna Kumar P., et al. ∙

research

∙ 11/13/2019

Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries

We study ranked enumeration of the results to a join query in order of d...

0 Nikolaos Tziavelis, et al. ∙

research

∙ 07/02/2019

New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins

The resilience of a Boolean query is the minimum number of tuples that n...

0 Cibele Freire, et al. ∙

research

∙ 06/26/2018

A General Framework for Anytime Approximation in Probabilistic Databases

Anytime approximation algorithms for computing query probabilities over ...

0 Maarten Van den Heuvel, et al. ∙

research

∙ 02/16/2018

Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs

Many problems in areas as diverse as recommendation systems, social netw...

0 Xiaofeng Yang, et al. ∙

research

∙ 02/17/2015

The Linearization of Belief Propagation on Pairwise Markov Networks

Belief Propagation (BP) is a widely used approximation for exact probabi...

0 Wolfgang Gatterbauer, et al. ∙

research

∙ 12/02/2014

Approximate Lifted Inference with Probabilistic Databases

This paper proposes a new approach for approximate evaluation of #P-hard...

0 Wolfgang Gatterbauer, et al. ∙

research

∙ 09/21/2014

Oblivious Bounds on the Probability of Boolean Functions

This paper develops upper and lower bounds for the probability of Boolea...

0 Wolfgang Gatterbauer, et al. ∙

research

∙ 06/27/2014

Linearized and Single-Pass Belief Propagation

How can we tell when accounts are fake or real in a social network? And ...

0 Wolfgang Gatterbauer, et al. ∙

research

∙ 05/13/2011

Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation

This paper develops upper and lower bounds for the probability of Boolea...

0 Wolfgang Gatterbauer, et al. ∙

research

∙ 12/15/2010

Data Conflict Resolution Using Trust Mappings

In massively collaborative projects such as scientific or community data...

0 Wolfgang Gatterbauer, et al. ∙

research

∙ 09/10/2010

The Complexity of Causality and Responsibility for Query Answers and non-Answers

An answer to a query has a well-defined lineage expression (alternativel...

0 Alexandra Meliou, et al. ∙

research

∙ 12/30/2009

Believe It or Not: Adding Belief Annotations to Databases

We propose a database model that allows users to annotate data with beli...

0 Wolfgang Gatterbauer, et al. ∙

research

∙ 12/29/2009

Why so? or Why no? Functional Causality for Explaining Query Answers

In this paper, we propose causality as a unified framework to explain qu...

0 Alexandra Meliou, et al. ∙

Wolfgang Gatterbauer

Featured Co-authors