Understanding Cryptic Schemata In Large Extract Transform Load Systems
DOWNLOAD
Download Understanding Cryptic Schemata In Large Extract Transform Load Systems PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Understanding Cryptic Schemata In Large Extract Transform Load Systems book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page
Understanding Cryptic Schemata In Large Extract Transform Load Systems
DOWNLOAD
Author : Alexander Albrecht
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2013
Understanding Cryptic Schemata In Large Extract Transform Load Systems written by Alexander Albrecht and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2013 with Computers categories.
Extract-Transform-Load (ETL) tools are used for the creation, maintenance, and evolution of data warehouses, data marts, and operational data stores. ETL workflows populate those systems with data from various data sources by specifying and executing a DAG of transformations. Over time, hundreds of individual workflows evolve as new sources and new requirements are integrated into the system. The maintenance and evolution of large-scale ETL systems requires much time and manual effort. A key problem is to understand the meaning of unfamiliar attribute labels in source and target databases and ETL transformations. Hard-to-understand attribute labels lead to frustration and time spent to develop and understand ETL workflows. We present a schema decryption technique to support ETL developers in understanding cryptic schemata of sources, targets, and ETL transformations. For a given ETL system, our recommender-like approach leverages the large number of mapped attribute labels in existing ETL workflows to produce good and meaningful decryptions. In this way we are able to decrypt attribute labels consisting of a number of unfamiliar few-letter abbreviations, such as UNP_PEN_INT, which we can decrypt to UNPAID_PENALTY_INTEREST. We evaluate our schema decryption approach on three real-world repositories of ETL workflows and show that our approach is able to suggest high-quality decryptions for cryptic attribute labels in a given schema.
Conceptual Modeling
DOWNLOAD
Author : Paolo Atzeni
language : en
Publisher: Springer
Release Date : 2012-10-14
Conceptual Modeling written by Paolo Atzeni and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2012-10-14 with Computers categories.
This book constitutes the refereed proceedings of the 31st International Conference on Conceptual Modeling, ER 2012, held in Florence, Italy, in October 2012. The 24 regular papers presented together with 13 short papers, 6 poster papers and 3 keynotes were carefully reviewed and selected from 141 submissions. The papers are organized in topical sections on understandability and cognitive approaches; conceptual modeling for datawarehousing and business intelligence; extraction, discovery and clustering; search and documents; data and process modeling; ontology based approaches; variability and evolution; adaptation, preferences and query refinement; queries, matching and topic search; and conceptual modeling in action.
Modeling And Enacting Complex Data Dependencies In Business Processes
DOWNLOAD
Author : Meyer, Andreas
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2013
Modeling And Enacting Complex Data Dependencies In Business Processes written by Meyer, Andreas and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2013 with Computers categories.
Enacting business processes in process engines requires the coverage of control flow, resource assignments, and process data. While the first two aspects are well supported in current process engines, data dependencies need to be added and maintained manually by a process engineer. Thus, this task is error-prone and time-consuming. In this report, we address the problem of modeling processes with complex data dependencies, e.g., m:n relationships, and their automatic enactment from process models. First, we extend BPMN data objects with few annotations to allow data dependency handling as well as data instance differentiation. Second, we introduce a pattern-based approach to derive SQL queries from process models utilizing the above mentioned extensions. Therewith, we allow automatic enactment of data-aware BPMN process models. We implemented our approach for the Activiti process engine to show applicability.
Covering Or Complete
DOWNLOAD
Author : Jana Bauckmann
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2012
Covering Or Complete written by Jana Bauckmann and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2012 with Computers categories.
Data dependencies, or integrity constraints, are used to improve the quality of a database schema, to optimize queries, and to ensure consistency in a database. In the last years conditional dependencies have been introduced to analyze and improve data quality. In short, a conditional dependency is a dependency with a limited scope defined by conditions over one or more attributes. Only the matching part of the instance must adhere to the dependency. In this paper we focus on conditional inclusion dependencies (CINDs). We generalize the definition of CINDs, distinguishing covering and completeness conditions. We present a new use case for such CINDs showing their value for solving complex data quality tasks. Further, we define quality measures for conditions inspired by precision and recall. We propose efficient algorithms that identify covering and completeness conditions conforming to given quality thresholds. Our algorithms choose not only the condition values but also the condition attributes automatically. Finally, we show that our approach efficiently provides meaningful and helpful results for our use case.
Hpi Future Soc Lab Proceedings 2011
DOWNLOAD
Author : Meinel, Christoph
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2013
Hpi Future Soc Lab Proceedings 2011 written by Meinel, Christoph and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2013 with Computers categories.
Together with industrial partners Hasso-Plattner-Institut (HPI) is currently establishing a “HPI Future SOC Lab,” which will provide a complete infrastructure for research on on-demand systems. The lab utilizes the latest, multi/many-core hardware and its practical implementation and testing as well as further development. The necessary components for such a highly ambitious project are provided by renowned companies: Fujitsu and Hewlett Packard provide their latest 4 and 8-way servers with 1-2 TB RAM, SAP will make available its latest Business byDesign (ByD) system in its most complete version. EMC² provides high performance storage systems and VMware offers virtualization solutions. The lab will operate on the basis of real data from large enterprises. The HPI Future SOC Lab, which will be open for use by interested researchers also from other universities, will provide an opportunity to study real-life complex systems and follow new ideas all the way to their practical implementation and testing. This technical report presents results of research projects executed in 2011. Selected projects have presented their results on June 15th and October 26th 2011 at the Future SOC Lab Day events.
Proceedings Of The 6th Ph D Retreat Of The Hpi Research School On Service Oriented Systems Engineering
DOWNLOAD
Author : Meinel, Christoph
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2013
Proceedings Of The 6th Ph D Retreat Of The Hpi Research School On Service Oriented Systems Engineering written by Meinel, Christoph and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2013 with categories.
Model Driven Engineering Of Adaptation Engines For Self Adaptive Software
DOWNLOAD
Author : Thomas Vogel
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2013
Model Driven Engineering Of Adaptation Engines For Self Adaptive Software written by Thomas Vogel and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2013 with Computers categories.
The development of self-adaptive software requires the engineering of an adaptation engine that controls and adapts the underlying adaptable software by means of feedback loops. The adaptation engine often describes the adaptation by using runtime models representing relevant aspects of the adaptable software and particular activities such as analysis and planning that operate on these runtime models. To systematically address the interplay between runtime models and adaptation activities in adaptation engines, runtime megamodels have been proposed for self-adaptive software. A runtime megamodel is a specific runtime model whose elements are runtime models and adaptation activities. Thus, a megamodel captures the interplay between multiple models and between models and activities as well as the activation of the activities. In this article, we go one step further and present a modeling language for ExecUtable RuntimE MegAmodels (EUREMA) that considerably eases the development of adaptation engines by following a model-driven engineering approach. We provide a domain-specific modeling language and a runtime interpreter for adaptation engines, in particular for feedback loops. Megamodels are kept explicit and alive at runtime and by interpreting them, they are directly executed to run feedback loops. Additionally, they can be dynamically adjusted to adapt feedback loops. Thus, EUREMA supports development by making feedback loops, their runtime models, and adaptation activities explicit at a higher level of abstraction. Moreover, it enables complex solutions where multiple feedback loops interact or even operate on top of each other. Finally, it leverages the co-existence of self-adaptation and off-line adaptation for evolution.
Cyber Physical Systems With Dynamic Structure
DOWNLOAD
Author : Basil Becker
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2012
Cyber Physical Systems With Dynamic Structure written by Basil Becker and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2012 with Computers categories.
Cyber-physical systems achieve sophisticated system behavior exploring the tight interconnection of physical coupling present in classical engineering systems and information technology based coupling. A particular challenging case are systems where these cyber-physical systems are formed ad hoc according to the specific local topology, the available networking capabilities, and the goals and constraints of the subsystems captured by the information processing part. In this paper we present a formalism that permits to model the sketched class of cyber-physical systems. The ad hoc formation of tightly coupled subsystems of arbitrary size are specified using a UML-based graph transformation system approach. Differential equations are employed to define the resulting tightly coupled behavior. Together, both form hybrid graph transformation systems where the graph transformation rules define the discrete steps where the topology or modes may change, while the differential equations capture the continuous behavior in between such discrete changes. In addition, we demonstrate that automated analysis techniques known for timed graph transformation systems for inductive invariants can be extended to also cover the hybrid case for an expressive case of hybrid models where the formed tightly coupled subsystems are restricted to smaller local networks.
Theories And Intricacies Of Information Security Problems
DOWNLOAD
Author : Anne V. D. M. Kayem
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2013
Theories And Intricacies Of Information Security Problems written by Anne V. D. M. Kayem and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2013 with Computers categories.
Keine Angaben
Scalable Compatibility For Embedded Real Time Components Via Language Progressive Timed Automata
DOWNLOAD
Author : Stefan Neumann
language : en
Publisher: Universitätsverlag Potsdam
Release Date : 2013
Scalable Compatibility For Embedded Real Time Components Via Language Progressive Timed Automata written by Stefan Neumann and has been published by Universitätsverlag Potsdam this book supported file pdf, txt, epub, kindle and other format this book has been release on 2013 with Computers categories.
The proper composition of independently developed components of an embedded real- time system is complicated due to the fact that besides the functional behavior also the non-functional properties and in particular the timing have to be compatible. Nowadays related compatibility problems have to be addressed in a cumbersome integration and configuration phase at the end of the development process, that in the worst case may fail. Therefore, a number of formal approaches have been developed, which try to guide the upfront decomposition of the embedded real-time system into components such that integration problems related to timing properties can be excluded and that suitable configurations can be found. However, the proposed solutions require a number of strong assumptions that can be hardly fulfilled or the required analysis does not scale well. In this paper, we present an approach based on timed automata that can provide the required guarantees for the later integration without strong assumptions, which are difficult to match in practice. The approach provides a modular reasoning scheme that permits to establish the required guarantees for the integration employing only local checks, which therefore also scales. It is also possible to determine potential configuration settings by means of timed game synthesis.