Stefanie Scherzinger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Stefanie Scherzinger has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Giorgio Ghelli
University of Pisa
7 shared publications - Mohamed-Amine Baazizi
Sorbonne University
7 shared publications - Carlo Sartiani
Università degli Studi della Basilicata
5 shared publications - Dario Colazzo
Université Paris Dauphine
5 shared publications - Lyes Attouche
Universite Paris Dauphine - PSL
4 shared publications - Michael Fruth
University of Passau, Passau, Germany
4 shared publications
Latest Publications
- Open Access
- 22 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
Classical and Modern JSON Schema: A Tutorial
The last few years have seen the ubiquitous diffusion of JSON as one of the most widely used formats for publishing and interchanging data, as it combines the flexibility of semistructured data models with well-known data structures such as objects and arrays. While various schema languages for describing JSON data have been proposed in the past (e.g., JSound and Joi), JSON Schema established itself as de-facto standard schema language for JSON data. The main aim of this tutorial is to provide the reader with the basic notions about JSON Schema. This tutorial focuses on four main aspects: (1) we first describe Classical JSON Schema and introduce the features that are shared with the latest versions of the specification; (2) we introduce, then, Modern JSON Schema, explain why it differs from Classical JSON Schema, and discuss its novel evaluation model; (3) we analyze tools that support or exploit JSON Schema, like, for example, validators and data generators; and (4) we highlight open research challenges and opportunities related to JSON Schema.
- 22 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
Open AccessClassical and Modern JSON Schema: A Tutorial
The last few years have seen the ubiquitous diffusion of JSON as one of the most widely used formats for publishing and interchanging data, as it combines the flexibility of semistructured data models with well-known data structures such as objects and arrays. While various schema languages for describing JSON data have been proposed in the past (e.g., JSound and Joi), JSON Schema established itself as de-facto standard schema language for JSON data. The main aim of this tutorial is to provide the reader with the basic notions about JSON Schema. This tutorial focuses on four main aspects: (1) we first describe Classical JSON Schema and introduce the features that are shared with the latest versions of the specification; (2) we introduce, then, Modern JSON Schema, explain why it differs from Classical JSON Schema, and discuss its novel evaluation model; (3) we analyze tools that support or exploit JSON Schema, like, for example, validators and data generators; and (4) we highlight open research challenges and opportunities related to JSON Schema.
- Open Access
- 17 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 51 (4) , 1-45
Witness Generation for Classical JSON Schema
JSON Schema is an important, evolving standard schema language for families of JSON documents. It is based on a complex combination of structural and Boolean operators, including negation, as well as mutually recursive variables. The static analysis of JSON Schema documents comprises practically relevant problems, including schema satisfiability, inclusion, and equivalence. These three can be reduced to witness generation: given a schema, generate an element of the schema — if it exists — otherwise report unsatisfiability. Schema satisfiability, inclusion, and equivalence have been shown to be decidable, by reduction to reachability in alternating tree automata. However, no witness generation algorithm has yet been formally described. We contribute a first, direct algorithm for JSON Schema witness generation. We study its effectiveness and efficiency, in experiments over several schema collections, including thousands of real-world schemas. Our focus is on the completeness of the language (where we only exclude the "uniqueItems" operator), on the ability of the algorithm to run in reasonable time on a large set of real-world examples, despite the exponential complexity of the problem, and on proving its correctness and completeness.
- 17 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 51 (4) , 1-45
Open AccessWitness Generation for Classical JSON Schema
JSON Schema is an important, evolving standard schema language for families of JSON documents. It is based on a complex combination of structural and Boolean operators, including negation, as well as mutually recursive variables. The static analysis of JSON Schema documents comprises practically relevant problems, including schema satisfiability, inclusion, and equivalence. These three can be reduced to witness generation: given a schema, generate an element of the schema — if it exists — otherwise report unsatisfiability. Schema satisfiability, inclusion, and equivalence have been shown to be decidable, by reduction to reachability in alternating tree automata. However, no witness generation algorithm has yet been formally described. We contribute a first, direct algorithm for JSON Schema witness generation. We study its effectiveness and efficiency, in experiments over several schema collections, including thousands of real-world schemas. Our focus is on the completeness of the language (where we only exclude the "uniqueItems" operator), on the ability of the algorithm to run in reasonable time on a large set of real-world examples, despite the exponential complexity of the problem, and on proving its correctness and completeness.
- Open Access
- 28 November 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1063
Elimination of annotation dependencies in validation for Modern JSON Schema
- 28 November 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1063
Open AccessElimination of annotation dependencies in validation for Modern JSON Schema
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 139-142
Reproducibility Report for ACM SIGMOD 2025 Paper: 'Live Patching for Distributed In-Memory Key-Value Stores'
This paper proposes a new solution to handle the service downtime and performance degradation issues posed by traditional rolling updates when maintaining distributed in-memory key-value stores (IMKVS). The authors propose a live patching system for Redis Cluster which proactively manages software updates by modifying process memory directly without restarting nodes, while leveraging the cluster-internal gossip protocol for automatic patch distribution. The authors present a set of experiments comparing the efficacy of live patching (LP) to state-of-the-art rolling updates (CP) on a range of cluster sizes and memory states up to 200~GiB. We find that on the hardware specified (including Intel Xeon and AMD EPYC configurations) we were able to reproduce the key results and plots shown in the paper, illustrating the robust nature of these experiments and confirming that live patching achieves constant-time updates regardless of data size. Furthermore, the authors provided well-written shell scripts and easy-to-follow instructions within a QEMU virtual machine environment to reproduce this material.
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 139-142
Open AccessReproducibility Report for ACM SIGMOD 2025 Paper: 'Live Patching for Distributed In-Memory Key-Value Stores'
This paper proposes a new solution to handle the service downtime and performance degradation issues posed by traditional rolling updates when maintaining distributed in-memory key-value stores (IMKVS). The authors propose a live patching system for Redis Cluster which proactively manages software updates by modifying process memory directly without restarting nodes, while leveraging the cluster-internal gossip protocol for automatic patch distribution. The authors present a set of experiments comparing the efficacy of live patching (LP) to state-of-the-art rolling updates (CP) on a range of cluster sizes and memory states up to 200~GiB. We find that on the hardware specified (including Intel Xeon and AMD EPYC configurations) we were able to reproduce the key results and plots shown in the paper, illustrating the robust nature of these experiments and confirming that live patching achieves constant-time updates regardless of data size. Furthermore, the authors provided well-written shell scripts and easy-to-follow instructions within a QEMU virtual machine environment to reproduce this material.
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 11-16
Making a Case for Visual Feedback in Teaching Database Schema Normalization
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 11-16
Open AccessMaking a Case for Visual Feedback in Teaching Database Schema Normalization
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-6
JTutor: JSON Schema Validation Explained
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessJTutor: JSON Schema Validation Explained
- Open Access
- 9 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (2) , 1-24
A Quantum-Leap into Schema Matching: Beyond 1-to-1 Matchings
Schema matching refers to the task of identifying corresponding attributes of different database relation schemas to enable the efficient integration of the associated datasets. We model the task of finding suitable 1:N/N:1 global matchings in relational schemas as an optimization problem. We show that this optimization problem is NP-hard. We then translate the optimization problem into the problem of minimizing a particular rational-valued function on binary variables. The latter enables us to utilize modern quantum algorithms for solving the global matching problem, a crucial stage in schema matching. We also report on preliminary experimental results that serve as a proof-of-concept for our approach.
- 9 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (2) , 1-24
Open AccessA Quantum-Leap into Schema Matching: Beyond 1-to-1 Matchings
Schema matching refers to the task of identifying corresponding attributes of different database relation schemas to enable the efficient integration of the associated datasets. We model the task of finding suitable 1:N/N:1 global matchings in relational schemas as an optimization problem. We show that this optimization problem is NP-hard. We then translate the optimization problem into the problem of minimizing a particular rational-valued function on binary variables. The latter enables us to utilize modern quantum algorithms for solving the global matching problem, a crucial stage in schema matching. We also report on preliminary experimental results that serve as a proof-of-concept for our approach.
- Open Access
Elimination of annotation dependencies in validation for Modern JSON Schema
JSON Schema is a logical language used to define the structure of JSON values. JSON Schema syntax is based on nested schema objects. In all versions of JSON Schema until Draft-07, collectively known as Classical JSON Schema, the semantics of a schema was entirely described by the set of JSON values that it validates. This semantics was the basis for a thorough theoretical study and for the development of tools to decide satisfiability and equivalence of schemas. Unfortunately, Classical JSON Schema suffered a severe limitation in its ability to express extensions of object schemas, which caused the introduction, with Draft 2019-09, of two disruptive features: annotation dependency and dynamic references. These new features undermine the previously developed semantic theory, and the algorithms used to decide satisfiability for Classical JSON Schema are not easy to extend. One possible solution is rewriting a schema written in Modern JSON Schema into an equivalent schema in Classical JSON Schema. In this paper we prove that the elimination of annotation dependent keywords cannot, in general, avoid an exponential increase of the schema dimension. We provide an algorithm to eliminate these keywords that, despite the theoretical lower bound, behaves quite well in practice, as we verify with an extensive set of experiments.
Open AccessElimination of annotation dependencies in validation for Modern JSON Schema
JSON Schema is a logical language used to define the structure of JSON values. JSON Schema syntax is based on nested schema objects. In all versions of JSON Schema until Draft-07, collectively known as Classical JSON Schema, the semantics of a schema was entirely described by the set of JSON values that it validates. This semantics was the basis for a thorough theoretical study and for the development of tools to decide satisfiability and equivalence of schemas. Unfortunately, Classical JSON Schema suffered a severe limitation in its ability to express extensions of object schemas, which caused the introduction, with Draft 2019-09, of two disruptive features: annotation dependency and dynamic references. These new features undermine the previously developed semantic theory, and the algorithms used to decide satisfiability for Classical JSON Schema are not easy to extend. One possible solution is rewriting a schema written in Modern JSON Schema into an equivalent schema in Classical JSON Schema. In this paper we prove that the elimination of annotation dependent keywords cannot, in general, avoid an exponential increase of the schema dimension. We provide an algorithm to eliminate these keywords that, despite the theoretical lower bound, behaves quite well in practice, as we verify with an extensive set of experiments.
- Open Access
- 18 December 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 2 (6) , 1-26
Live Patching for Distributed In-Memory Key-Value Stores
Providers of high-availability data stores need to roll out software updates without causing noticeable downtimes. For distributed data stores like Redis Cluster, the state-of-the-art is a rolling update, where the nodes are restarted in sequence. This requires preserving, restoring, and resynchronizing the database state, which can significantly prolong updates for larger memory states, and thus delay critical security fixes. In this article, we propose applying software updates directly in memory without restarting any nodes. We present the first fully operational live patching solution for Redis Cluster on Linux. We support both push- and pull-based distribution of patches, trading dissemination speed against cluster elasticity, the ability to allow nodes to dynamically join or leave the cluster. Our integration is very lightweight, as it piggybacks on the cluster-internal gossip protocol. Our experiments benchmark live patching against state-of-the-art rolling updates. In one scenario, live patching updates the entire cluster orders of magnitude faster, without unfavorable trade-offs regarding throughput, tail latencies, or network consumption. To showcase generalizability, we provide general guidelines on integrating live patching for distributed database systems and successfully apply them to a primary-replica PostgreSQL setup. Given our overall promising results, we discuss the opportunities of live patching in database DevOps.
- 18 December 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 2 (6) , 1-26
Open AccessLive Patching for Distributed In-Memory Key-Value Stores
Providers of high-availability data stores need to roll out software updates without causing noticeable downtimes. For distributed data stores like Redis Cluster, the state-of-the-art is a rolling update, where the nodes are restarted in sequence. This requires preserving, restoring, and resynchronizing the database state, which can significantly prolong updates for larger memory states, and thus delay critical security fixes. In this article, we propose applying software updates directly in memory without restarting any nodes. We present the first fully operational live patching solution for Redis Cluster on Linux. We support both push- and pull-based distribution of patches, trading dissemination speed against cluster elasticity, the ability to allow nodes to dynamically join or leave the cluster. Our integration is very lightweight, as it piggybacks on the cluster-internal gossip protocol. Our experiments benchmark live patching against state-of-the-art rolling updates. In one scenario, live patching updates the entire cluster orders of magnitude faster, without unfavorable trade-offs regarding throughput, tail latencies, or network consumption. To showcase generalizability, we provide general guidelines on integrating live patching for distributed database systems and successfully apply them to a primary-replica PostgreSQL setup. Given our overall promising results, we discuss the opportunities of live patching in database DevOps.
- Open Access
The Case for DBMS Live Patching [Extended Version]
Traditionally, when the code of a database management system (DBMS) needs to be updated, the system is restarted and database clients suffer downtime, or the provider instantiates hot-standby instances and rolls over the workload. We investigate a third option, live patching of the DBMS binary. For certain code changes, live patching allows to modify the application code in memory, without restart. The memory state and all client connections can be maintained. Although live patching has been explored in the operating systems research community, it remains a blind spot in DBMS research. In this Experiment, Analysis & Benchmark article, we systematically explore this field from the DBMS perspective. We discuss what distinguishes database management systems from generic multi-threaded applications when it comes to live patching. We then propose domain-specific strategies for injecting quiescence points into the DBMS source code, so that threads can safely migrate to the patched process version. We experimentally investigate the interplay between the query workload and different quiescence methods, monitoring both transaction throughput and tail latencies. We show that live patching can be a viable option for updating database management systems, since database providers can make informed decisions w.r.t. the latency overhead on the client side.
Open AccessThe Case for DBMS Live Patching [Extended Version]
Traditionally, when the code of a database management system (DBMS) needs to be updated, the system is restarted and database clients suffer downtime, or the provider instantiates hot-standby instances and rolls over the workload. We investigate a third option, live patching of the DBMS binary. For certain code changes, live patching allows to modify the application code in memory, without restart. The memory state and all client connections can be maintained. Although live patching has been explored in the operating systems research community, it remains a blind spot in DBMS research. In this Experiment, Analysis & Benchmark article, we systematically explore this field from the DBMS perspective. We discuss what distinguishes database management systems from generic multi-threaded applications when it comes to live patching. We then propose domain-specific strategies for injecting quiescence points into the DBMS source code, so that threads can safely migrate to the patched process version. We experimentally investigate the interplay between the query workload and different quiescence methods, monitoring both transaction throughput and tail latencies. We show that live patching can be a viable option for updating database management systems, since database providers can make informed decisions w.r.t. the latency overhead on the client side.