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 - TY - CHAP A1 - Cerqueus, Thomas A1 - Cunha de Almeida, Eduardo A1 - Scherzinger, Stefanie T1 - Safely Managing Data Variety in Big Data Software Development T2 - 2015 IEEE/ACM 1st International Workshop on Big Data Software Engineering, 23-23 May 2015, Florence, Italy N2 - We consider the task of building Big Data software systems, offered as software-as-a-service. These applications are commonly backed by NoSQL data stores that address the proverbial Vs of Big Data processing: NoSQL data stores can handle large volumes of data and many systems do not enforce a global schema, to account for structural variety in data. Thus, software engineers can design the data model on the go, a flexibility that is particularly crucial in agile software development. However, NoSQL data stores commonly do not yet account for the veracity of changes when it comes to changes in the structure of persisted data. Yet this is an inevitable consequence of agile software development. In most NoSQL-based application stacks, schema evolution is completely handled within the application code, usually involving object mapper libraries. Yet simple code refactorings, such as renaming a class attribute at the source code level, can cause data loss or runtime errors once the application has been deployed to production. We address this pain point by contributing type checking rules that we have implemented within an IDE plug in. Our plug in ControVol statically type checks the object mapper class declarations against the code release history. ControVol is thus capable of detecting common yet risky cases of mismatched data and schema, and can even suggest automatic fixes. KW - Big data KW - history KW - Java KW - Loading KW - NoSQL data stores KW - object mapping KW - Production KW - Runtime KW - schema evolution KW - Software KW - type checking Y1 - 2015 U6 - https://doi.org/10.1109/BIGDSE.2015.9 SP - 4 EP - 10 PB - IEEE ER - TY - CHAP A1 - Heckner, Markus A1 - Bazo, Alexander A1 - Wolff, Christian A1 - Scherzinger, Stefanie T1 - Karel relearns c: teaching good software engineering practices in cs1 with karel the robot T2 - 2018 IEEE Global Engineering Education Conference (EDUCON), 17-20 April 2018, Santa Cruz de Tenerife, Spain N2 - This paper describes our implementation, teaching philosophy, and experiences with our C-based version of the widely known Karel the Robot introductory programming micro-language. Karel enables students to programmatically solve problems, using the C language, in a graphical two-dimensional world by moving the robot around while checking and manipulating its surroundings. We use Karel to solve the dilemma of either demanding too much or not enough from students during the first weeks of an introductory CS course, as interesting problems can be solved with limited input from lectures. Karel enables problem solving from day one of CS1, and encourages good software engineering practices such as top-down design from the beginning. We outline typical problems in the first weeks of CS1. We present a short overview of existing Karel implementations in various programming languages and our rationale for re-implementing Karel. We present our teaching philosophy and use of Karel in the classroom. We demonstrate how Karel is being used from a student perspective, along with a typical programming task. We discuss preliminary results of a survey and interviews with students from a first course in which Karel was used. KW - Computer languages KW - Education KW - Problem-solving KW - Programming profession KW - Robots KW - Writing Y1 - 2018 U6 - https://doi.org/10.1109/EDUCON.2018.8363402 SP - 1447 EP - 1454 PB - IEEE ER - TY - CHAP A1 - Scherzinger, Stefanie A1 - Cerqueus, Thomas A1 - Cunha de Almeida, Eduardo T1 - ControVol: A framework for controlled schema evolution in NoSQL application development T2 - 2015 IEEE 31st International Conference on Data Engineering, 13-17 April 2015, Seoul, Korea (South) N2 - Building scalable web applications on top of NoSQL data stores is becoming common practice. Many of these data stores can easily be accessed programmatically, and do not enforce a schema. Software engineers can design the data model on the go, a flexibility that is crucial in agile software development. The typical tasks of database schema management are now handled within the application code, usually involving object mapper libraries. However, today’s Integrated Development Environments (IDEs) lack the proper tool support when it comes to managing the combined evolution of the application code and of the schema. Yet simple refactorings such as renaming an attribute at the source code level can cause irretrievable data loss or runtime errors once the application is serving in production. In this demo, we present ControVol, a framework for controlled schema evolution in application development against NoSQL data stores. ControVol is integrated into the IDE and statically type checks object mapper class declarations against the schema evolution history, as recorded by the code repository. ControVol is capable of warning of common yet risky cases of mismatched data and schema. ControVol is further able to suggest quick fixes by which developers can have these issues automatically resolved. KW - Databases KW - Google KW - history KW - Java KW - Production KW - Runtime KW - Software Y1 - 2015 SN - 978-1-4799-7964-6 U6 - https://doi.org/10.1109/ICDE.2015.7113402 SP - 1464 EP - 1467 PB - IEEE ER - TY - CHAP A1 - Seifert, Christin A1 - Scherzinger, Stefanie A1 - Wiese, Lena T1 - Towards Generating Consumer Labels for Machine Learning Models T2 - 2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI), 12-14 Dec. 2019, Dallas, TX, USA N2 - Machine learning (ML) based decision making is becoming commonplace. For persons affected by ML-based decisions, a certain level of transparency regarding the properties of the underlying ML model can be fundamental. In this vision paper, we propose to issue consumer labels for trained and published ML models. These labels primarily target machine learning lay persons, such as the operators of an ML system, the executors of decisions, and the decision subjects themselves. Provided that consumer labels comprehensively capture the characteristics of the trained ML model, consumers are enabled to recognize when human intelligence should supersede artificial intelligence. In the long run, we envision a service that generates these consumer labels (semi-)automatically. In this paper, we survey the requirements that an ML system should meet, and correspondingly, the properties that an ML consumer label could capture. We further discuss the feasibility of operationalizing and benchmarking these requirements in the automated generation of ML consumer labels. KW - Artificial-intelligence-machine-learning-consumer-labels-transparency-x-AI KW - Biological system modeling KW - Data models KW - Machine learning KW - Measurement KW - Predictive models KW - Robustness KW - Training Y1 - 2019 U6 - https://doi.org/10.1109/CogMI48466.2019.00033 SP - 173 EP - 179 PB - IEEE ER - TY - CHAP A1 - Holubová, Irena A1 - Scherzinger, Stefanie ED - Groppe, Sven ED - Gruenwald, Le T1 - Unlocking the potential of nextGen multi-model databases for semantic big data projects T2 - Proceedings of the International Workshop on Semantic Big Data - (SBD '19) 05.07.2019 - 05.07.2019, Amsterdam, Netherlands N2 - A new vision in semantic big data processing is to create enterprise data hubs, with a 360° view on all data that matters to a corporation. As we discuss in this paper, a new generation of multi-model database systems seems a promising architectural choice for building such scalable, non-native triple stores. In this paper, we first characterize this new generation of multi-model databases. Then, discussing an example scenario, we show how they allow for agile and flexible schema management, spanning a large design space for creative and incremental data modelling. We identify the challenge of generating sound triple-views from data stored in several, interlinked models, for SPARQL querying. We regard this as one of several appealing research challenges where the semantic big data and the database architecture community may join forces. Y1 - 2019 SN - 9781450367660 U6 - https://doi.org/10.1145/3323878.3325807 SP - 1 EP - 6 PB - ACM Press CY - New York ER - TY - CHAP A1 - Pilven, Matthieu A1 - Scherzinger, Stefanie A1 - d’Orazio, Laurent ED - Guizzardi, Giancarlo ED - Gailly, Frederik ED - Suzana Pitangueira Maciel, Rita T1 - On Complex Value Relations in Hive T2 - Advances in Conceptual Modeling, ER 2020 workshops CMAI, CMLS, CMOMM4FAIR, CoMoNoS, EmpER, Vienna, Austria, November 3-6, 2020, Proceedings N2 - In this paper, we raise the question how data architects model their data for processing in Apache Hive. This well-known SQL-on-Hadoop engine supports complex value relations, where attribute types need not be atomic. In fact, this feature seems to be one of the prominent selling points, e.g., in Hive reference books. In an empirical study, we analyze Hive schemas in open source repositories. We examine to which extent practitioners make use of complex value relations and accordingly, whether they write queries over complex types. Understanding which features are actively used will help make the right decisions in setting up benchmarks for SQL-on-Hadoop engines, as well as in choosing which query operators to optimize for. KW - Complex value relations KW - Empirical study KW - Hive Y1 - 2019 SN - 978-3-030-34145-9 U6 - https://doi.org/10.1007/978-3-030-34146-6_13 SP - 146 EP - 156 PB - Springer International Publishing CY - Cham ER - TY - CHAP A1 - Maiwald, Benjamin A1 - Riedle, Benjamin A1 - Scherzinger, Stefanie ED - Guizzardi, Giancarlo ED - Gailly, Frederik ED - Suzana Pitangueira Maciel, Rita T1 - What Are Real JSON Schemas Like? T2 - Advances in Conceptual Modeling N2 - Recently, the semantics of the JSON Schema format, a de-facto standard for JSON schema declarations, has been formalized. It turns out that JSON Schema is a surprisingly complex schema language based on an open document semantics. In this paper, we present a first empirical analysis of a curated collection of real-world JSON Schemas. Knowing what real JSON Schemas are like (to borrow from a title of a related study on DTDs) helps practitioners and researchers in making realistic assumptions when building tools for JSON Schema processing. Y1 - 2019 SN - 978-3-030-34145-9 U6 - https://doi.org/10.1007/978-3-030-34146-6_9 VL - 11787 SP - 95 EP - 105 PB - Springer International Publishing CY - Cham ER - TY - CHAP A1 - Filho, Edson Ramiro Lucas A1 - de Almeida, Eduardo Cunha A1 - Scherzinger, Stefanie T1 - Don’t Tune Twice: Reusing Tuning Setups for SQL-on-Hadoop Queries T2 - Conceptual Modeling : 38th International Conference, ER 2019, Salvador, Brazil, November 4-7, 2019, Proceedings N2 - SQL-on-Hadoop processing engines have become state-of-the-art in data lake analysis. However, the skills required to tune such systems are rare. This has inspired automated tuning advisors which profile the query workload and produce tuning setups for the low-level MapReduce jobs. Yet with highly dynamic query workloads, repeated re-tuning costs time and money in IaaS environments. In this paper, we focus on reducing the costs for up-front tuning. At the heart of our approach is the observation that a SQL query is compiled into a query plan of MapReduce jobs. While the plans differ from query to query, single jobs tend to be similar between queries. We introduce the notion of the code signature of a MapReduce job and, based on this, our concept of job similarity. We show that we can effectively recycle tuning setups from similar MapReduce jobs already profiled. In doing so, we can leverage any third-party tuning adviser for MapReduce engines. We are able to show that by recycling tuning setups, we can reduce the time spent on profiling by 50% in the TPC-H benchmark. Y1 - 2019 U6 - https://doi.org/10.1007/978-3-030-33223-5_9 SP - 93 EP - 107 PB - Springer CY - Cham ER - TY - CHAP A1 - Scherzinger, Stefanie A1 - de Almeida, Eduardo Cunha A1 - Ickert, Felipe A1 - Del Fabro, Marcos Didonet T1 - On the necessity of model checking NoSQL database schemas when building SaaS applications T2 - Proceedings of the 2013 International Workshop on Testing the Cloud - TTC 2013 N2 - The design of the NoSQL schema has a direct impact on the scalability of web applications. Especially for developers with little experience in NoSQL stores, the risks inherent in poor schema design can be incalculable. Worse yet, the issues will only manifest once the application has been deployed, and the growing user base causes highly concurrent writes. In this paper, we present a model checking approach to reveal scalability bottlenecks in NoSQL schemas. Our approach draws on formal methods from tree automata theory to perform a conservative static analysis on both the schema and the expected write-behavior of users. We demonstrate the impact of schema-inherent bottlenecks for a popular NoSQL store, and show how concurrent writes can ultimately lead to a considerable share of failed transactions. Y1 - 2013 U6 - https://doi.org/10.1145/2489295.2489297 SP - 1 EP - 6 PB - ACM CY - New York, NY ER - TY - CHAP A1 - Mauerer, Wolfgang A1 - Klessinger, Stefan A1 - Scherzinger, Stefanie T1 - Beyond the badge: reproducibility engineering as a lifetime skill T2 - Proceedings 4th International Workshop on Software Engineering Education for the Next Generation SEENG 2022, 17 May 2022, Pittsburgh, PA, USA N2 - Ascertaining reproducibility of scientific experiments is receiving increased attention across disciplines. We argue that the necessary skills are important beyond pure scientific utility, and that they should be taught as part of software engineering (SWE) education. They serve a dual purpose: Apart from acquiring the coveted badges assigned to reproducible research, reproducibility engineering is a lifetime skill for a professional industrial career in computer science. SWE curricula seem an ideal fit for conveying such capabilities, yet they require some extensions, especially given that even at flagship conferences like ICSE, only slightly more than one-third of the technical papers (at the 2021 edition) receive recognition for artefact reusability. Knowledge and capabilities in setting up engineering environments that allow for reproducing artefacts and results over decades (a standard requirement in many traditional engineering disciplines), writing semi-literate commit messages that document crucial steps of a decision-making process and that are tightly coupled with code, or sustainably taming dynamic, quickly changing software dependencies, to name a few: They all contribute to solving the scientific reproducibility crisis, and enable software engineers to build sustainable, long-term maintainable, software-intensive, industrial systems. We propose to teach these skills at the undergraduate level, on par with traditional SWE topics. KW - reproducibility engineering KW - teaching software engineering Y1 - 2022 SN - 9781450393362 U6 - https://doi.org/10.1145/3528231.3528359 N1 - Preprint unter: https://doi.org/10.48550/arXiv.2203.05283 SP - 1 EP - 4 PB - ACM CY - New York, NY, USA ER - TY - JOUR A1 - Scharfenberg, Georg A1 - Mottok, Jürgen A1 - Artmann, Christina A1 - Hobelsberger, Martin A1 - Paric, Ivan A1 - Großmann, Benjamin A1 - Pohlt, Clemens A1 - Wackerbarth, Alena A1 - Pausch, Uli A1 - Heidrich, Christiane A1 - Fadanelli, Martin A1 - Elsner, Michael A1 - Pöcher, Daniel A1 - Pittroff, Lenz A1 - Beer, Stefan A1 - Brückl, Oliver A1 - Haslbeck, Matthias A1 - Sterner, Michael A1 - Thema, Martin A1 - Muggenthaler, Nicole A1 - Lenck, Thorsten A1 - Götz, Philipp A1 - Eckert, Fabian A1 - Deubzer, Michael A1 - Stingl, Armin A1 - Simsek, Erol A1 - Krämer, Stefan A1 - Großmann, Benjamin A1 - Schlegl, Thomas A1 - Niedersteiner, Sascha A1 - Berlehner, Thomas A1 - Joblin, Mitchell A1 - Mauerer, Wolfgang A1 - Apel, Sven A1 - Siegmund, Janet A1 - Riehle, Dirk A1 - Weber, Joachim A1 - Palm, Christoph A1 - Zobel, Martin A1 - Al-Falouji, Ghassan A1 - Prestel, Dietmar A1 - Scharfenberg, Georg A1 - Mandl, Roland A1 - Deinzer, Arnulf A1 - Halang, W. A1 - Margraf-Stiksrud, Jutta A1 - Sick, Bernhard A1 - Deinzer, Renate A1 - Scherzinger, Stefanie A1 - Klettke, Meike A1 - Störl, Uta A1 - Wiech, Katharina A1 - Kubata, Christoph A1 - Sindersberger, Dirk A1 - Monkman, Gareth J. A1 - Dollinger, Markus A1 - Dembianny, Sven A1 - Kölbl, Andreas A1 - Welker, Franz A1 - Meier, Matthias A1 - Thumann, Philipp A1 - Swidergal, Krzysztof A1 - Wagner, Marcus A1 - Haug, Sonja A1 - Vernim, Matthias A1 - Seidenstücker, Barbara A1 - Weber, Karsten A1 - Arsan, Christian A1 - Schone, Reinhold A1 - Münder, Johannes A1 - Schroll-Decker, Irmgard A1 - Dillinger, Andrea Elisabeth A1 - Fuchshofer, Rudolf A1 - Monkman, Gareth J. A1 - Shamonin (Chamonine), Mikhail A1 - Geith, Markus A. A1 - Koch, Fabian A1 - Ühlin, Christian A1 - Schratzenstaller, Thomas A1 - Saßmannshausen, Sean Patrick A1 - Auchter, Eberhard A1 - Kriz, Willy A1 - Springer, Othmar A1 - Thumann, Maria A1 - Kusterle, Wolfgang A1 - Obermeier, Andreas A1 - Udalzow, Anton A1 - Schmailzl, Anton A1 - Hierl, Stefan A1 - Langer, Christoph A1 - Schreiner, Rupert ED - Baier, Wolfgang T1 - Forschungsbericht 2015 T3 - Forschungsberichte der OTH Regensburg - 2015 Y1 - 2015 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-13867 SN - 978-3-00-048589-3 CY - Regensburg ER - TY - JOUR A1 - Beimler, Josef A1 - Leißl, Caroline A1 - Ebner, Lena A1 - Elsner, Michael A1 - Mühlbauer, Gerhard A1 - Kohlert, Dieter A1 - Schubert, Martin J. W. A1 - Weiß, Andreas P. A1 - Sterner, Michael A1 - Raith, Thomas A1 - Afranseder, Martin A1 - Krapf, Tobias A1 - Mottok, Jürgen A1 - Siemers, Christian A1 - Großmann, Benjamin A1 - Höcherl, Johannes A1 - Schlegl, Thomas A1 - Schneider, Ralph A1 - Milaev, Johannes A1 - Rampelt, Christina A1 - Roduner, Christian A1 - Glowa, Christoph A1 - Bachl, Christoph A1 - Schliekmann, Claus A1 - Gnan, Alfons A1 - Grill, Martin A1 - Ruhland, Karl A1 - Piehler, Thomas A1 - Friers, Daniel A1 - Wels, Harald A1 - Pflug, Kenny A1 - Kucera, Markus A1 - Waas, Thomas A1 - Schlachetzki, Felix A1 - Boy, Sandra A1 - Pemmerl, Josef A1 - Leis, Alexander A1 - Welsch, Andreas F.X. A1 - Graf, Franz A1 - Zenger, Gerhard A1 - Volbert, Klaus A1 - Waas, Thomas A1 - Scherzinger, Stefanie A1 - Klettke, Meike A1 - Störl, Uta A1 - Heyl, C. A1 - Boldenko, A. A1 - Monkman, Gareth J. A1 - Kujat, Richard A1 - Briem, Ulrich A1 - Hierl, Stefan A1 - Talbot, Sebastian A1 - Schmailzl, Anton A1 - Ławrowski, Robert Damian A1 - Prommesberger, Christian A1 - Langer, Christoph A1 - Dams, Florian A1 - Schreiner, Rupert A1 - Valentino, Piergiorgio A1 - Romano, Marco A1 - Ehrlich, Ingo A1 - Furgiuele, Franco A1 - Gebbeken, Norbert A1 - Eisenried, Michael A1 - Jungbauer, Bastian A1 - Hutterer, Albert A1 - Bauhuber, Michael A1 - Mikrievskij, Andreas A1 - Argauer, Monika A1 - Hummel, Helmut A1 - Lechner, Alfred A1 - Liebetruth, Thomas A1 - Schumm, Michael A1 - Joseph, Saskia A1 - Reschke, Michael A1 - Soska, Alexander A1 - Schroll-Decker, Irmgard A1 - Putzer, Michael A1 - Rasmussen, John A1 - Dendorfer, Sebastian A1 - Weber, Tim A1 - Al-Munajjed, Amir Andreas A1 - Verkerke, Gijsbertus Jacob A1 - Renkawitz, Tobias A1 - Haug, Sonja A1 - Rudolph, Clarissa A1 - Zeitler, Annika A1 - Schaubeck, Simon A1 - Steffens, Oliver A1 - Rechenauer, Christian A1 - Schulz-Brize, Thekla A1 - Fleischmann, Florian A1 - Kusterle, Wolfgang A1 - Beer, Anne A1 - Wagner, Bernd A1 - Neidhart, Thomas ED - Baier, Wolfgang T1 - Forschungsbericht 2013 T3 - Forschungsberichte der OTH Regensburg - 2013 Y1 - 2014 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-7990 CY - Regensburg ER - TY - JOUR A1 - Weber, Karsten A1 - Dendorfer, Sebastian A1 - Süß, Franz A1 - Kubowitsch, Simone A1 - Schratzenstaller, Thomas A1 - Haug, Sonja A1 - Mohr, Christa A1 - Kiesl, Hans A1 - Drechsler, Jörg A1 - Westner, Markus A1 - Kobus, Jörn A1 - Schubert, Martin J. W. A1 - Zenger, Stefan A1 - Pietsch, Alexander A1 - Weiß, Josef A1 - Hinterseer, Sebastian A1 - Schieck, Roland A1 - Scherzinger, Stefanie A1 - Klettke, Meike A1 - Ringlstetter, Andreas A1 - Störl, Uta A1 - Bissyandé, Tegawendé F. A1 - Seeburger, Achim A1 - Schindler, Timo A1 - Ramsauer, Ralf A1 - Kiszka, Jan A1 - Kölbl, Andreas A1 - Lohmann, Daniel A1 - Mauerer, Wolfgang A1 - Maier, Johannes A1 - Scorna, Ulrike A1 - Palm, Christoph A1 - Soska, Alexander A1 - Mottok, Jürgen A1 - Ellermeier, Andreas A1 - Vögele, Daniel A1 - Hierl, Stefan A1 - Briem, Ulrich A1 - Buschmann, Knut A1 - Ehrlich, Ingo A1 - Pongratz, Christian A1 - Pielmeier, Benjamin A1 - Tyroller, Quirin A1 - Monkman, Gareth J. A1 - Gut, Franz A1 - Roth, Carina A1 - Hausler, Peter A1 - Bierl, Rudolf A1 - Prommesberger, Christian A1 - Ławrowski, Robert Damian A1 - Langer, Christoph A1 - Schreiner, Rupert A1 - Huang, Yifeng A1 - She, Juncong A1 - Ottl, Andreas A1 - Rieger, Walter A1 - Kraml, Agnes A1 - Poxleitner, Thomas A1 - Hofer, Simon A1 - Heisterkamp, Benjamin A1 - Lerch, Maximilian A1 - Sammer, Nike A1 - Golde, Olivia A1 - Wellnitz, Felix A1 - Schmid, Sandra A1 - Muntschick, Claudia A1 - Kusterle, Wolfgang A1 - Paric, Ivan A1 - Brückl, Oliver A1 - Haslbeck, Matthias A1 - Schmidt, Ottfried A1 - Schwanzer, Peter A1 - Rabl, Hans-Peter A1 - Sterner, Michael A1 - Bauer, Franz A1 - Steinmann, Sven A1 - Eckert, Fabian A1 - Hofrichter, Andreas ED - Baier, Wolfgang T1 - Forschungsbericht 2017 T3 - Forschungsberichte der OTH Regensburg - 2017 KW - Forschung KW - Forschungsbericht Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-13835 SN - 978-3-9818209-3-5 CY - Regensburg ER - TY - JOUR A1 - Broser, Christian A1 - Falter, Thomas A1 - Ławrowski, Robert Damian A1 - Altenbuchner, Amelie A1 - Vögele, Daniel A1 - Koss, Claus A1 - Schlamp, Matthias A1 - Dunnweber, Jan A1 - Steffens, Oliver A1 - Heckner, Markus A1 - Jaritz, Sabine A1 - Schiegl, Thomas A1 - Corsten, Sabine A1 - Lauer, Norina A1 - Guertler, Katherine A1 - Koenig, Eric A1 - Haug, Sonja A1 - Huber, Dominik A1 - Birkenmaier, Clemens A1 - Krenkel, Lars A1 - Wagner, Thomas A1 - Justus, Xenia A1 - Saßmannshausen, Sean Patrick A1 - Kleine, Nadine A1 - Weber, Karsten A1 - Braun, Carina N. A1 - Giacoppo, Giuliano A1 - Heinrich, Michael A1 - Just, Tobias A1 - Schreck, Thomas A1 - Schnabl, Andreas A1 - Gilmore, Amador Téran A1 - Roeslin, Samuel A1 - Schmid, Sandra A1 - Wellnitz, Felix A1 - Malz, Sebastian A1 - Maurial, Andreas A1 - Hauser, Florian A1 - Mottok, Jürgen A1 - Klettke, Meike A1 - Scherzinger, Stefanie A1 - Störl, Uta A1 - Heckner, Markus A1 - Bazo, Alexander A1 - Wolff, Christian A1 - Kopper, Andreas A1 - Westner, Markus A1 - Pongratz, Christian A1 - Ehrlich, Ingo A1 - Briem, Ulrich A1 - Hederer, Sebastian A1 - Wagner, Marcus A1 - Schillinger, Moritz A1 - Görlach, Julien A1 - Hierl, Stefan A1 - Siegl, Marco A1 - Langer, Christoph A1 - Hausladen, Matthias A1 - Schreiner, Rupert A1 - Haslbeck, Matthias A1 - Kreuzer, Reinhard A1 - Brückl, Oliver A1 - Dawoud, Belal A1 - Rabl, Hans-Peter A1 - Gamisch, Bernd A1 - Schmidt, Ottfried A1 - Heberl, Michael A1 - Gänsbauer, Bianca A1 - Bick, Werner A1 - Ellermeier, Andreas A1 - Monkman, Gareth J. A1 - Prem, Nina A1 - Sindersberger, Dirk A1 - Tschurtschenthaler, Karl A1 - Aurbach, Maximilian A1 - Dendorfer, Sebastian A1 - Betz, Michael A. A1 - Szecsey, Tamara A1 - Mauerer, Wolfgang A1 - Murr, Florian ED - Baier, Wolfgang T1 - Forschung 2018 T3 - Forschungsberichte der OTH Regensburg - 2018 KW - Forschung KW - Forschungsbericht Y1 - 2018 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:898-opus4-13826 SN - 978-3-9818209-5-9 CY - Regensburg ER - TY - GEN A1 - Schönberger, Manuel A1 - Scherzinger, Stefanie A1 - Mauerer, Wolfgang T1 - Quantum Computing for DB - Applicability on Multi Query Optimization and Join Order Optimization T2 - Frühjahrstreffen Fachgruppe Datenbanken in Potsdam, 2022 Y1 - UR - https://www.lfdr.de/Publications/2022/FGDB_Poster_Schoenberger.pdf ER - TY - CHAP A1 - Schönberger, Manuel A1 - Franz, Maja A1 - Scherzinger, Stefanie A1 - Mauerer, Wolfgang T1 - Peel | Pile? Cross-Framework Portability of Quantum Software T2 - 2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C), 12-15 March 2022, Honolulu, HI, USA N2 - In recent years, various vendors have made quantum software frameworks available. Yet with vendor-specific frameworks, code portability seems at risk, especially in a field where hardware and software libraries have not yet reached a consolidated state, and even foundational aspects of the technologies are still in flux. Accordingly, the development of vendor-independent quantum programming languages and frameworks is often suggested. This follows the established architectural pattern of introducing additional levels of abstraction into software stacks, thereby piling on layers of abstraction. Yet software architecture also provides seemingly less abstract alternatives, namely to focus on hardware-specific formulations of problems that peel off unnecessary layers. In this article, we quantitatively and experimentally explore these strategic alternatives, and compare popular quantum frameworks from the software implementation perspective. We find that for several specific, yet generalisable problems, the mathematical formulation of the problem to be solved is not just sufficiently abstract and serves as precise description, but is likewise concrete enough to allow for deriving framework-specific implementations with little effort. Additionally, we argue, based on analysing dozens of existing quantum codes, that porting between frameworks is actually low-effort, since the quantum- and framework-specific portions are very manageable in terms of size, commonly in the order of mere hundreds of lines of code. Given the current state-of-the-art in quantum programming practice, this leads us to argue in favour of peeling off unnecessary abstraction levels. KW - Computer Science KW - Quantum Physics KW - Software Engineering Y1 - 2022 U6 - https://doi.org/10.1109/ICSA-C54293.2022.00039 N1 - Preprint unter: https://arxiv.org/abs/2203.06289 PB - IEEE ER - TY - GEN A1 - Schönberger, Manuel A1 - Scherzinger, Stefanie A1 - Mauerer, Wolfgang T1 - Applicability of Quantum Computing on Database Query Optimization T2 - Frühjahrstreffen Fachgruppe Datenbanken in Potsdam (Poster Presentation) Y1 - 2022 ER - TY - GEN A1 - Mauerer, Wolfgang A1 - Scherzinger, Stefanie T1 - Nullius in Verba - Reproducibility Tutorial [Data set] N2 - Reproduction package (docker image) for the ICDE 2021 tutorial "Nullius in Verba". Y1 - 2021 U6 - https://doi.org/10.5281/zenodo.4730023 N1 - In Verbindung mit dem Konferenzbeitrag: Nullius in Verba: Reproducibility for Database Systems Research, Revisited - https://doi.org/10.1109/ICDE51399.2021.00270 ER -