64 citations · 362 across the 43 of their papers we have counts for
45 papers
Measuring Learned Equivariance: An Information Theoretic Approach
Claire Schlesinger, Wolfgang Gatterbauer, Robin Walters
Learning symmetries through data augmentation offers an alternative to architectural equivariance, but does not guarantee that a network respects those symmetries. Measuring learne…
Resilience for Regular Path Queries: Towards a Complexity Classification
Antoine Amarilli, Wolfgang Gatterbauer, Neha Makhija +2
The resilience problem for a query and an input set or bag database is to compute the minimum number of facts to remove from the database to make the query false. In this paper, we…
Towards Agentic Schema Refinement
Agapi Rissaki, Ilias Fountalis, Nikolaos Vasiloglou +1
Large enterprise databases can be complex and messy, obscuring the data semantics needed for analytical tasks. We propose a semantic layer in-between the database and the user as a…
Is Integer Linear Programming All You Need for Deletion Propagation? A Unified and Practical Approach for Generalized Deletion Propagation
Neha Makhija, Wolfgang Gatterbauer
Deletion Propagation (DP) refers to a family of database problems rooted in the classical view-update problem: how to propagate intended deletions in a view (query output) back to…
Ranked Enumeration for Database Queries
Nikolaos Tziavelis, Wolfgang Gatterbauer, Mirek Riedewald
Ranked enumeration is a query-answering paradigm where the query answers are returned incrementally in order of importance (instead of returning all answers at once). Importance is…
A Comprehensive Tutorial on over 100 Years of Diagrammatic Representations of Logical Statements and Relational Queries
Wolfgang Gatterbauer
Query formulation is increasingly performed by systems that need to guess a user's intent (e.g. via spoken word interfaces). But how can a user know that the computational agent is…
On The Reasonable Effectiveness of Relational Diagrams: Explaining Relational Query Patterns and the Pattern Expressiveness of Relational Languages
Wolfgang Gatterbauer, Cody Dunne
Comparing relational languages by their logical expressiveness is well understood. Less well understood is how to compare relational languages by their ability to represent relatio…
HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property
Zixuan Chen, Subhodeep Mitra, R Ravi +1
We analyze a general problem in a crowd-sourced setting where one user asks a question (also called item) and other users return answers (also called labels) for this question. Dif…
A Tutorial on Visual Representations of Relational Queries
Wolfgang Gatterbauer
Query formulation is increasingly performed by systems that need to guess a user's intent (e.g. via spoken word interfaces). But how can a user know that the computational agent is…
Towards Unbiased Exploration in Partial Label Learning
Zsolt Zombori, Agapi Rissaki, Kristóf Szabó +2
We consider learning a probabilistic classifier from partially-labelled supervision (inputs denoted with multiple possibilities) using standard neural architectures with a softmax…
Efficient Computation of Quantiles over Joins
Nikolaos Tziavelis, Nofar Carmeli, Wolfgang Gatterbauer +2
We present efficient algorithms for Quantile Join Queries, abbreviated as %JQ. A %JQ asks for the answer at a specified relative position (e.g., 50% for the median) under some orde…
A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations
Neha Makhija, Wolfgang Gatterbauer
Resilience is one of the key algorithmic problems underlying various forms of reverse data management (such as view maintenance, deletion propagation, and various interventions for…
SANTOS: Relationship-based Semantic Table Union Search
Aamod Khatiwada, Grace Fan, Roee Shraga +4
Existing techniques for unionable table search define unionability using metadata (tables must have the same or similar schemas) or column-based metrics (for example, the values in…
Principles of Query Visualization
Wolfgang Gatterbauer, Cody Dunne, H. V. Jagadish +1
Query Visualization (QV) is the problem of transforming a given query into a graphical representation that helps humans understand its meaning. This task is notably different from…
Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries
Nikolaos Tziavelis, Wolfgang Gatterbauer, Mirek Riedewald
We study ranked enumeration for Conjunctive Queries (CQs) where the answers are ordered by a given ranking function (e.g., an ORDER BY clause in SQL). We develop "any-k" algorithms…
Relational Diagrams: a pattern-preserving diagrammatic representation of non-disjunctive Relational Queries
Wolfgang Gatterbauer, Cody Dunne, Mirek Riedewald
Analyzing relational languages by their logical expressiveness is well understood. Something not well understood or even formalized is the vague concept of relational query pattern…
Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries
Neha Makhija, Wolfgang Gatterbauer
We consider the problem of finding the minimal-size factorization of the provenance of self-join-free conjunctive queries, i.e., we want to find a formula that minimizes the number…
DomainNet: Homograph Detection for Data Lake Disambiguation
Aristotelis Leventidis, Laura Di Rocco, Wolfgang Gatterbauer +2
Modern data lakes are deeply heterogeneous in the vocabulary that is used to describe data. We study a problem of disambiguation in data lakes: how can we determine if a data value…
Beyond Equi-joins: Ranking, Enumeration and Factorization
Nikolaos Tziavelis, Wolfgang Gatterbauer, Mirek Riedewald
We study theta-joins in general and join predicates with conjunctions and disjunctions of inequalities in particular, focusing on ranked enumeration where the answers are returned…
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries
Nofar Carmeli, Nikolaos Tziavelis, Wolfgang Gatterbauer +2
We study the question of when we can provide direct access to the k-th answer to a Conjunctive Query (CQ) according to a specified order over the answers in time logarithmic in the…
Optimal Join Algorithms Meet Top-k
Nikolaos Tziavelis, Wolfgang Gatterbauer, Mirek Riedewald
Top-k queries have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results are ne…
QueryVis: Logic-based diagrams help users understand complicated SQL queries faster
Aristotelis Leventidis, Jiahui Zhang, Cody Dunne +3
Understanding the meaning of existing SQL queries is critical for code maintenance and reuse. Yet SQL can be hard to read, even for expert users or the original creator of a query.…
Near-Optimal Distributed Band-Joins through Recursive Partitioning
Rundong Li, Wolfgang Gatterbauer, Mirek Riedewald
We consider running-time optimization for band-joins in a distributed system, e.g., the cloud. To balance load across worker machines, input has to be partitioned, which causes dup…
Factorized Graph Representations for Semi-Supervised Learning from Sparse Data
Krishna Kumar P., Paul Langton, Wolfgang Gatterbauer
The paper introduces a scalable method that estimates class compatibility matrices directly from extremely sparsely labeled graphs using factorized graph representations, enabling…