TU Wien CAIML

Relational Diagrams and the Pattern Expressiveness of Relational Languages

CAIML Colloquium with Wolfgang Gatterbauer.

wolfgang-gatterbauer.jpg

August 22nd 2024

  • 12:00 – 14:00 CEST
  • TU Wien, Faculty of Informatics, Seminarraum Gödel
  • 1040 Vienna, Favoritenstraße 9-11
    Ground Floor, Room HB EG 10

On August 22, 2024, CAIML Colloquium with Wolfgang Gatterbauer from the Northeastern University, Boston, US will take place.

Abstract

Comparing relational languages by their logical expressiveness is well understood. Less well understood is how to compare relational languages by their ability to represent relational query patterns. Indeed, what are query patterns other than “a certain way of writing a query?” And how can query patterns be defined across procedural and declarative languages, irrespective of their syntax? To the best of our knowledge, we provide the first semantic definition of relational query patterns by using a variant of structure-preserving mappings between the relational tables of queries. This formalism allows us to analyze the relative pattern expressiveness of relational language fragments and create a hierarchy of languages with equal logical expressiveness yet different pattern expressiveness. Our language-independent definition of query patterns opens novel paths for assisting database users. For example, these patterns could be leveraged to create visual query representations that faithfully represent query patterns, speed up interpretation, and provide visual feedback during query editing. As a concrete example, we propose Relational Diagrams, a complete and sound diagrammatic representation of safe relational calculus that is provably (𝑖) unambiguous, (𝑖𝑖) relationally complete, and (𝑖𝑖𝑖) able to represent all query patterns for unions of non-disjunctive queries. Among all diagrammatic representations for relational queries that we are aware of, ours is the only one with these three properties. Furthermore, our anonymously preregistered user study shows that Relational Diagrams allow users to recognize patterns meaningfully faster and more accurately than SQL.

Speaker

  • Wolfgang Gatterbauer (Northeastern University, Boston, US)

Related Work

  • SIGMOD 2024: “On the Reasonable Effectiveness of Relational Diagrams: Explaining Relational Query Patterns and the Pattern Expressiveness of Relational Languages”
    joint work with Cody Dunne
    Paper
    Full Version
    Project Page
  • ICDE'24: “A Comprehensive Tutorial on over 100 years of Diagrammatic Representations of Logical Statements and Relational Queries”
    Tutorial Proposal
    Tutorial Slides