TY - CHAP A1 - Mauerer, Wolfgang A1 - Scherzinger, Stefanie ED - Krusche, Stephan ED - Wagner, Stefan T1 - Educating Future Software Architects in the Art and Science of Analysing Software Data. T2 - SEUH 2020: Software Engineering im Unterricht der Hochschulen, Tagungsband des 17. Workshops "Software Engineering im Unterricht der Hochschulen", Innsbruck, Österreich, 26. - 27.02.2020 N2 - We report the design and teaching experience of a Master-level seminar course on quantitative and empirical software engineering. The course combines elements of traditional literature seminars with active learning by scientific project work, in particular quantitative mixed-method analyses of open source systems. It also provides short introductions and refreshers to data mining and statistical analysis, and discusses the nature and practice of scientific knowledge inference. Student presentations of published research, augmented by summary reports, bridge to standard seminars. We discuss our educational goals and the course structure derived from them. We review research questions addressed by students in mini research reports, and analyse them as tokens on how junior-level software engineers perceive the potential of empirical software engineering research. We assess challenges faced, and discuss possible solutions. Y1 - 2020 UR - http://ceur-ws.org/Vol-2531/paper10.pdf SP - 56 EP - 60 PB - RWTH Aachen ER - TY - JOUR A1 - Scherzinger, Stefanie A1 - Thor, Andreas T1 - Cloud-Technologien in der Hochschullehre – Pflicht oder Kür? JF - Datenbank-Spektrum N2 - Ein eigenes Themenheft zum Datenmanagement in der Cloud dient uns als Anlass, die Präsenz von Cloud-Themen in der akademischen Datenbanklehre zu erfassen. In diesem Artikel geben wir die Ergebnisse einer Umfrage innerhalb der Fachgruppe Datenbanksysteme durch den Arbeitskreis Datenmanagement in der Cloud wieder. Dozentinnen und Dozenten von über zwanzig Hochschulen nahmen an der Umfrage teil. Es zeigt sich deutlich, dass sich das Thema „Cloud“ in der Hochschullehre zunehmend etabliert, jedoch überwiegend als ergänzendes Angebot, und seltener in der grundständigen Lehre verankert. Wir fassen die Ergebnisse unserer Umfrage zusammen und wagen Deutungsversuche. KW - Cloud Computing KW - Hochschullehre Y1 - 2014 U6 - https://doi.org/10.1007/s13222-014-0161-2 VL - 14 IS - 2 SP - 131 EP - 134 PB - Springer Nature ER - TY - JOUR A1 - Scherzinger, Stefanie T1 - Build your own SQL-on-Hadoop Query Engine A Report on a Term Project in a Master-level Database Course JF - ACM SIGMOD Record N2 - This is a report on a course taught at OTH Regensburg in the summer term of 2018. The students in this course built their own SQL-on-Hadoop engine as a term project in just 8 weeks. miniHive is written in Python and compiles SQL queries into MapReduce workflows. These are then executed on Hadoop. miniHive performs generic query optimizations (selection and projection pushdown, or cost-based join reordering), as well as MapReduce-specific optimizations. The course was taught in English, using a flipped classroom model. The course material was mainly compiled from third-party teaching videos. This report describes the course setup, the miniHive milestones, and gives a short review of the most successful student projects. Y1 - 2019 U6 - https://doi.org/10.1145/3377330.3377336 VL - 48 IS - 2 SP - 33 EP - 38 PB - ACM ER - TY - CHAP A1 - Scherzinger, Stefanie A1 - Seifert, Christin A1 - Wiese, Lena T1 - The Best of Both Worlds: Challenges in Linking Provenance and Explainability in Distributed Machine Learning T2 - 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), 7-10 July 2019, Dallas, TX, USA N2 - Machine learning experts prefer to think of their input as a single, homogeneous, and consistent data set. However, when analyzing large volumes of data, the entire data set may not be manageable on a single server, but must be stored on a distributed file system instead. Moreover, with the pressing demand to deliver explainable models, the experts may no longer focus on the machine learning algorithms in isolation, but must take into account the distributed nature of the data stored, as well as the impact of any data pre-processing steps upstream in their data analysis pipeline. In this paper, we make the point that even basic transformations during data preparation can impact the model learned, and that this is exacerbated in a distributed setting. We then sketch our vision of end-to-end explainability of the model learned, taking the pre-processing into account. In particular, we point out the potentials of linking the contributions of research on data provenance with the efforts on explainability in machine learning. In doing so, we highlight pitfalls we may experience in a distributed system on the way to generating more holistic explanations for our machine learning models. KW - Computational modeling KW - Data models KW - Decision trees KW - distributed computing KW - Distributed databases KW - explainable machine learning KW - Machine learning Y1 - 2019 U6 - https://doi.org/10.1109/ICDCS.2019.00161 SP - 1620 EP - 1629 PB - IEEE ER - TY - CHAP A1 - Scherzinger, Stefanie A1 - Mauerer, Wolfgang A1 - Kondylakis, Haridimos ED - Ailamaki, Anastasia T1 - DeBinelle: Semantic Patches for Coupled Database-Application Evolution T2 - 2021 IEEE 37th International Conference on Data Engineering (ICDE 2021): 19-22 April 2021, Chania, Greece N2 - Databases are at the core of virtually any software product. Changes to database schemas cannot be made in isolation, as they are intricately coupled with application code. Such couplings enforce collateral evolution, which is a recognised, important research problem. In this demonstration, we show a new dimension to this problem, in software that supports alternative database backends: vendor-specific SQL dialects necessitate a simultaneous evolution of both, database schema and program code, for all supported DB variants. These near-same changes impose substantial manual effort for software developers. We introduce DeBinelle, a novel framework and domain-specific language for semantic patches that abstracts DB-variant schema changes and coupled program code into a single, unified representation. DeBinelle further offers a novel alternative to manually evolving coupled schemas and code. DeBinelle considerably extends established, seminal results in software engineering research, supporting several programming languages, and the many dialects of SQL. It effectively eliminates the need to perform vendor-specific changes, replacing them with intuitive semantic patches. Our demo of DeBinelle is based on real-world use cases from reference systems for schema evolution. KW - database management systems KW - databases KW - evolution KW - programming language semantics KW - semantic patches KW - software product lines KW - specification languages KW - SQL Y1 - 2021 SN - 978-1-7281-9184-3 U6 - https://doi.org/10.1109/ICDE51399.2021.00307 SP - 2697 EP - 2700 PB - IEEE CY - Piscataway, NJ ER - TY - CHAP A1 - Fruth, Michael A1 - Scherzinger, Stefanie A1 - Mauerer, Wolfgang A1 - Ramsauer, Ralf ED - Nambiar, Raghunath ED - Poess, Meikel T1 - Tell-Tale Tail Latencies: Pitfalls and Perils in Database Benchmarking T2 - Performance evaluation and benchmarking, 13th TPC Technology Conference (TPCTC 2021): Copenhagen, Denmark, August 20, 2021, Revised Selected Papers N2 - The performance of database systems is usually characterised by their average-case (i.e., throughput) behaviour in standardised or de-facto standard benchmarks like TPC-X or YCSB. While tails of the latency (i.e., response time) distribution receive considerably less attention, they have been identified as a threat to the overall system performance: In large-scale systems, even a fraction of requests delayed can build up into delays perceivable by end users. To eradicate large tail latencies from database systems, the ability to faithfully record them, and likewise pinpoint them to the root causes, is imminently required. In this paper, we address the challenge of measuring tail latencies using standard benchmarks, and identify subtle perils and pitfalls. In particular, we demonstrate how Java-based benchmarking approaches can substantially distort tail latency observations, and discuss how the discovery of such problems is inhibited by the common focus on throughput performance. We make a case for purposefully re-designing database benchmarking harnesses based on these observations to arrive at faithful characterisations of database performance from multiple important angles. KW - Benchmark harness KW - Database benchmarks KW - Tail latencies Y1 - 2022 SN - 9783030944377 U6 - https://doi.org/10.1007/978-3-030-94437-7_8 SP - 119 EP - 134 PB - Springer CY - Cham, Switzerland ER - TY - CHAP A1 - Mauerer, Wolfgang A1 - Scherzinger, Stefanie T1 - 1-2-3 Reproducibility for Quantum Software Experiments T2 - 2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), Honolulu, HI, USA, 15-18 March 2022 N2 - Various fields of science face a reproducibility crisis. For quantum software engineering as an emerging field, it is therefore imminent to focus on proper reproducibility engineering from the start. Yet the provision of reproduction packages is almost universally lacking. Actionable advice on how to build such packages is rare, particularly unfortunate in a field with many contributions from researchers with backgrounds outside computer science. In this article, we argue how to rectify this deficiency by proposing a 1-2-3~approach to reproducibility engineering for quantum software experiments: Using a meta-generation mechanism, we generate DOI-safe, long-term functioning and dependency-free reproduction packages. They are designed to satisfy the requirements of professional and learned societies solely on the basis of project-specific research artefacts (source code, measurement and configuration data), and require little temporal investment by researchers. Our scheme ascertains long-term traceability even when the quantum processor itself is no longer accessible. By drastically lowering the technical bar, we foster the proliferation of reproduction packages in quantum software experiments and ease the inclusion of non-CS researchers entering the field. KW - Computer Science KW - Quantum Physics KW - Software Engineering Y1 - 2022 U6 - https://doi.org/10.1109/SANER53432.2022.00148 SP - 1247 EP - 1248 PB - IEEE ER - TY - CHAP A1 - Braininger, Dimitri A1 - Mauerer, Wolfgang A1 - Scherzinger, Stefanie ED - Grossmann, Georg ED - Ram, Sudha T1 - Replicability and Reproducibility of a Schema Evolution Study in Embedded Databases T2 - Advances in conceptual modeling: ER 2020 Workshops CMAI, CMLS, CMOMM4FAIR, CoMoNoS, EmpER, Vienna, Austria, November 3-6, 2020, Proceedings N2 - Ascertaining the feasibility of independent falsification or repetition of published results is vital to the scientific process, and replication or reproduction experiments are routinely performed in many disciplines. Unfortunately, such studies are only scarcely available in database research, with few papers dedicated to re-evaluating published results. In this paper, we conduct a case study on replicating and reproducing a study on schema evolution in embedded databases. We can exactly repeat the outcome for one out of four database applications studied, and come close in two further cases. By reporting results, efforts, and obstacles encountered, we hope to increase appreciation for the substantial efforts required to ensure reproducibility. By discussing minutiae details required to ascertain reproducible work, we argue that such important, but often ignored aspects of scientific work should receive more credit in the evaluation of future research. KW - replicability KW - reproducibility KW - schema evolution Y1 - 2020 SN - 978-3-030-65846-5 U6 - https://doi.org/10.1007/978-3-030-65847-2_19 VL - 12584 SP - 210 EP - 219 PB - Springer CY - Cham ER - TY - JOUR A1 - Mauerer, Wolfgang A1 - Scherzinger, Stefanie T1 - Digitale Forschungswerkzeuge : Nachhaltigkeit für Software und Daten JF - Forschung & Lehre (Forschung und Lehre) N2 - Die wissenschaftliche Reproduktionskrise hat den Blick auf digitale Forschungswerkzeuge intensiviert. Auch wenn der Mehraufwand für Reproduzierbarkeit und Zugänglichkeit zunehmend anerkannt wird, existieren noch Defizite in der Umsetzung, wenn es darum geht, die Datenbasis und Forschungswerkzeuge verfügbar zu machen Y1 - 2021 UR - https://www.wissenschaftsmanagement-online.de/system/files/downloads-wimoarticle/2021-10_WIMO_Digitale_Forschungswerkzeuge_Mauerer_Scherzinger.pdf VL - 28 IS - 10 SP - 816 EP - 817 PB - Zentrum für Wissenschaftsmanagement e.V. (ZWM)
 ER - TY - CHAP A1 - Ringlstetter, Andreas A1 - Scherzinger, Stefanie A1 - Bissyandé, Tegawendé F. T1 - Data Model Evolution Using Object-NoSQL Mappers: Folklore or State-of-the-Art? T2 - 2016 IEEE/ACM 2nd International Workshop on Big Data Software Engineering (BIGDSE), 16 May 2016, Austin, TX, USA N2 - In big data software engineering, the schema flexibility of NoSQL document stores is a major selling point: When the document store itself does not actively manage a schema, the data model is maintained within the application. Just like object-relational mappers for relational databases, object-NoSQL mappers are part of professional software development with NoSQL document stores. Some mappers go beyond merely loading and storing Java objects: Using dedicated evolution annotations, developers may conveniently add, remove, or rename attributes from stored objects, and also conduct more complex transformations. In this paper, we analyze the dissemination of this technology in Java open source projects. While we find evidence on GitHub that evolution annotations are indeed being used, developers do not employ them so much for evolving the data model, but to solve different tasks instead. Our observations trigger interesting questions for further research. KW - Big data KW - data model evolution KW - Data models KW - Java KW - Loading KW - Object-NoSQL mappers KW - Software KW - Software engineering KW - Transient analysis Y1 - 2016 U6 - https://doi.org/10.1145/2896825.2896827 SP - 33 EP - 36 PB - ACM ER - TY - CHAP A1 - Cerqueus, Thomas A1 - de Almeida, Eduardo Cunha A1 - Scherzinger, Stefanie ED - Gangemi, Aldo ED - Leonardi, Stefano ED - Panconesi, Alessandro T1 - ControVol: Let Yesterday's Data Catch Up with Today's Application Code T2 - Proceedings of the 24th International Conference on World Wide Web (WWW '15) ; Florence Italy, 18.05.2015 - 22.0.2015 N2 - In building software-as-a-service applications, a flexible development environment is key to shipping early and often. Therefore, schema-flexible data stores are becoming more and more popular. They can store data with heterogeneous structure, allowing for new releases to be pushed frequently, without having to migrate legacy data first. However, the current application code must continue to work with any legacy data that has already been persisted in production. To let legacy data structurally "catch up" with the latest application code, developers commonly employ object mapper libraries with life-cycle annotations. Yet when used without caution, they can cause runtime errors and even data loss. We present ControVol, an IDE plugin that detects evolutionary changes to the application code that are incompatible with legacy data. ControVol warns developers already at development time, and even suggests automatic fixes for lazily migrating legacy data when it is loaded into the application. Thus, ControVol ensures that the structure of legacy data can catch up with the structure expected by the latest software release. Y1 - 2015 SN - 9781450334730 U6 - https://doi.org/10.1145/2740908.2742719 SP - 15 EP - 16 PB - ACM CY - New York, NY, USA ER -