From the 1 of 18 linked papers with an AI index.
64 citations · 134 across the 10 of their papers we have counts for
16 papers · 1 filter
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…
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…
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…