Referential Integrity Research Articles

Minimal coverage of generalized typed inclusion dependencies in databases

The paper discusses the theory and algorithms necessary to construct a minimal covering of generalized typed inclusion dependencies. Traditionally, the construction of minimal covering is used for all types of dependencies in order to obtain a non-redundant and consistent database design. Generalized inclusion dependencies correspond to referential integrity constraints, when several main and several external relations are involved in one constraint, which corresponds to an ultragraph edge. In previous work, based on a study of the properties of dependencies, a system of axioms was presented with proof of consistency and completeness. In this work, the closures were studied for generalized typed inclusion dependencies. An algorithm for constructing closures has been developed and its correctness has been proven. The results obtained are further used to develop an algorithm for constructing a minimal covering. At the end of the article, examples are presented that demonstrate the operation of the algorithms.

Generalization of typed include dependencies with null values in databases

The paper discusses a new type of dependency in databases, which is a generalization of inclusion dependencies. Traditionally, such dependencies are used in practice to ensure referential integrity. In this case, the restriction is established only between a pair of relations, the first of which is called the main, the second is external. In practice, referential integrity often needs to be established for a larger number of relations, where several main and several external relations participate in the same constraint. Such a structure corresponds to an ultragraph. The paper provides a rationale for generalized inclusion dependencies that take into account the presence of null values in external relations. Based on the study of the properties of typed dependencies, a system of axioms is obtained, for which consistency (soundness) and completeness are proved.

EXTRACTION, TRANSFORMATION AND LOADING PROCESS IN THE CLOUD COMPUTING SCENARIO

-Business Intelligence strategies often need real-time BI and analytics. For this purpose, BI systems focus on data management as a whole and good data and information quality in particular to achieve data consistency and referential integrity across distributed systems. Generating key performance indicators (KPI) of business intelligence might require incorporating the semantic approach of data integration to achieve the consistent and sustainable semantic decisions. So this paper deals with how to improve data and information quality by adopting Extraction-Transformation-Loading (ETL) and Extraction-Loading-Transformation processes towards generating structured data and semantic data with quality towards improving inference capabilities and generating semantic knowledge base for the business domain ontology. However this research did not consider dealing with dynamic or real-time data quality and their role towards producing better business intelligence

A SERM based framework to optimize the identification of mandatory relationships

The SERM (Structured Entity Relationship Diagram) data model is an extension of the classic ER (Entity Relationship) model. Its transparent, hierarchical structure allows you to control and analyze the order in which information resources are entered into the database. Assuming attention to referential integrity, it has a significant impact on the verification of relationship complexity. Uncertainty in the identification of obligatory relations, confirmed by numerous corrections, demonstrates the need to develop an approach to support this task. The aim of this article is to present a solution in the form of a framework based on the SERM model. Its main aspects are optimization of the identification of obligatory relations and automatic handling of their protections. The proposed solution supports intelligent design of relational databases beyond conceptual design. It extends the scope to the design of database programming objects, such as procedures that generate triggers to handle obligatory relationships. This is an important aspect for securing database integrity.

On Appropriate Evaluation Methodologies in the Context of Using Both Accident and Health Record Data.

Accident and emergency informatics has become a new approach to accident research in the era of digitization, where it has become realistic to integrate data recorded at accident sites with data in electronic health records of patients. This chapter deals with the question on whether the existing and well-established evaluation methodologies used in accident-centered research as well as in patient-centered research within clinical medicine are sufficient and should also be used for such integrated data or whether they have to be modified or extended. Based on the Gaus-Muche-Nomenclature on studies in clinical medicine, it will be outlined which types of studies are appropriate here. In addition to observational studies and registers, controlled trials using randomization are also be regarded as an important approach for gaining new knowledge. In order to appropriately access data from health records and from accidents, standards for representing and communicating data for such studies will be of importance. Another criterion is referential integrity. Here and with respect to accidents the International Standard Accident Number (ISAN) may be of importance.

Разработка и реализация специализированной нормативно-справочной базы данных (БД) «Посевная техника для пропашных и овощных культур»

This paper discusses the procedure for the develop-ment and operation algorithm of the specialized regulatory and reference database “Sowing equipment for tilled and vegetable crops” which contains a description and tech-nical characteristics of domestic and foreign precision seeders (their units and assemblies) for tilled and vegeta-ble crops in the system precision and zero agriculture. The main function of the program is the accumulation and sys-tematization of information on sowing equipment for tilled and vegetable crops with the possibility of interactive search, filtering and comparison of results. The structure of the database being developed has been determined; it includes 4 blocks: a graphical interface; control algorithms; data management; control components and general pur-pose components. Taking into account this structure, the stages of creating a database are determined: analysis of real world objects for the implementation of the modeling process, selection of tables and fields that are capable of identifying each object, designing relationships between tables and setting referential integrity rules. The developed software solves the following tasks: searches according to the main characteristics of sowing equipment for tilled and vegetable crops; forms an initial set of characteristics and their limit values; implements sorting and filtering of search results; provides the ability to select from the table-list a specific instance of equipment with the output of detailed information; provides the ability to select from the table-list of several copies of equipment for their detailed compari-son; provides personalized access to entering and modify-ing information in the database. The advantage of using the developed database is its regular replenishment; at the moment the information volume (content) is: for mechanical seeders -23 items; pneumatic seeders -78 items; “direct sowing” (“zero” farming) equipment -10 items.

Enhancing virtual ontology based access over tabular data with Morph-CSV

Ontology-Based Data Access (OBDA) has traditionally focused on providing a unified view of heterogeneous datasets (e.g., relational databases, CSV and JSON files), either by materializing integrated data into RDF or by performing on-the-fly querying via SPARQL query translation. In the specific case of tabular datasets represented as several CSV or Excel files, query translation approaches have been applied by considering each source as a single table that can be loaded into a relational database management system (RDBMS). Nevertheless, constraints over these tables are not represented (e.g., referential integrity among sources, datatypes, or data integrity); thus, neither consistency among attributes nor indexes over tables are enforced. As a consequence, efficiency of the SPARQL-to-SQL translation process may be affected, as well as the completeness of the answers produced during the evaluation of the generated SQL query. Our work is focused on applying implicit constraints on the OBDA query translation process over tabular data. We propose Morph-CSV, a framework for querying tabular data that exploits information from typical OBDA inputs (e.g., mappings, queries) to enforce constraints that can be used together with any SPARQL-to-SQL OBDA engine. Morph-CSV relies on both a constraint component and a set of constraint operators. For a given set of constraints, the operators are applied to each type of constraint with the aim of enhancing query completeness and performance. We evaluate Morph-CSV in several domains: e-commerce with the BSBM benchmark; transportation with the GTFS-Madrid benchmark; and biology with a use case extracted from the Bio2RDF project. We compare and report the performance of two SPARQL-to-SQL OBDA engines, without and with the incorporation of Morph-CSV. The observed results suggest that Morph-CSV is able to speed up the total query execution time by up to two orders of magnitude, while it is able to produce all the query answers.

Research Goal-Driven Data Model and Harmonization for De-Identifying Patient Data in Radiomics.

There are various efforts in de-identifying patient's radiation oncology data for their uses in the advancement of research in medicine. Though the task of de-identification needs to be defined in the context of research goals and objectives, existing systems lack the flexibility of modeling data and normalization of names of attributes for accomplishing them. In this work, we describe a de-identification process of radiation and clinical oncology data, which is guided by a data model and a schema of dynamically capturing domain ontology and normalization of terminologies, defined in tune with the research goals in this area. The radiological images are obtained in DICOM format. It consists of diagnostic, radiation therapy (RT) treatment planning, RT verification, and RT response images. During the DICOM de-identification, a few crucial pieces of information are taken about the dataset. The proposed model is generic in organizing information modeling in sync with the de-identification of a patient's clinical information. The treatment and clinical data are provided in the comma-separated values (CSV) format, which follows a predefined data structure. The de-identified data is harmonized throughout the entire process. We have presented four specific case studies on four different types of cancers, namely glioblastoma multiforme, head-neck, breast, and lung. We also present experimental validation on a few patients' data in these four areas. A few aspects are taken care of during de-identification, such as preservation of longitudinal date changes (LDC), incremental de-identification, referential data integrity between the clinical and image data, de-identified data harmonization, and transformation of the data to an underlined database schema.

Impact of the Coronavirus Disease 2019 Pandemic on Gastrointestinal Procedures and Cancers in the United States: A Multicenter Research Network Study

Impact of the Coronavirus Disease 2019 Pandemic on Gastrointestinal Procedures and Cancers in the United States: A Multicenter Research Network Study

High density genotype storage for plant breeding in the Chado schema of Breedbase.

Modern breeding programs routinely use genome-wide information for selecting individuals to advance. The large volumes of genotypic information required present a challenge for data storage and query efficiency. Major use cases require genotyping data to be linked with trait phenotyping data. In contrast to phenotyping data that are often stored in relational database schemas, next-generation genotyping data are traditionally stored in non-relational storage systems due to their extremely large scope. This study presents a novel data model implemented in Breedbase (https://breedbase.org/) for uniting relational phenotyping data and non-relational genotyping data within the open-source PostgreSQL database engine. Breedbase is an open-source, web-database designed to manage all of a breeder’s informatics needs: management of field experiments, phenotypic and genotypic data collection and storage, and statistical analyses. The genotyping data is stored in a PostgreSQL data-type known as binary JavaScript Object Notation (JSONb), where the JSON structures closely follow the Variant Call Format (VCF) data model. The Breedbase genotyping data model can handle different ploidy levels, structural variants, and any genotype encoded in VCF. JSONb is both compressed and indexed, resulting in a space and time efficient system. Furthermore, file caching maximizes data retrieval performance. Integration of all breeding data within the Chado database schema retains referential integrity that may be lost when genotyping and phenotyping data are stored in separate systems. Benchmarking demonstrates that the system is fast enough for computation of a genomic relationship matrix (GRM) and genome wide association study (GWAS) for datasets involving 1,325 diploid Zea mays, 314 triploid Musa acuminata, and 924 diploid Manihot esculenta samples genotyped with 955,690, 142,119, and 287,952 genotype-by-sequencing (GBS) markers, respectively.

Oil storages and main oil pipelines pumps database development

The object of research is a data model that characterizes the pumping units of main oil pipelines. The paper considers the creation of pumps database and their characteristics as a component of software systems designed to search for sources of energy saving in pipeline transportation of oil and oil products. An overview of existing programs for calculating the joint operation of an oil pumping station and a pipeline is given. It is shown that most programs are inaccessible for analyzing the applied data storage technologies, or involve manual input of entry data without using databases. Comparative analysis of spreadsheets and relational databases is performed. It is shown that relational databases better meet the requirements of data convenience, availability, scalability, and performance. A physical model of a relational database is presented. The parent and child entities have been established, which make it possible to fully reflect all information about the pumping unit, namely: – coefficients of hydraulic characteristics depending on the diameter of the impeller rotor; – characteristics depending only on the pump make; – classification of the pump by design or purpose. Relationship types and referential integrity rules are defined between entities when deleting or updating data. For data management, the SQLite system is proposed, which provides data manipulation in the SQL query language and does not require the development of additional software. The analysis of possible ways of organizing multilingualism using a database is carried out. The text of the SQL query is proposed, which allows to select the pump with its characteristics by the pump make and impeller diameter. A database structure is proposed that allows storing information about equipment for oil pipelines for various purposes, which makes it possible for automated calculations of complex technological processes. The pumping unit database is an open source project that is posted on the public web service GitHub.

Enabling Reference Verifiability for the World Wide Web with Webchain

As online sources are becoming more prevalent in journalism and scientific literature, the ephemeral nature of the World Wide Web is becoming an increasingly serious issue for their verifiability, replicability, and reproducibility. The architecture of Webchain, a new system enabling source and reference verifiability on the Web, is combining distributed ledger technologies with secure timestamping to ensure the history of creation, ownership, and referential integrity of online resources. We present the architecture and system extensions, conduct a security analysis, and evaluate the Webchain system based on a comprehensive prototype implementation. The results confirm the feasibility and robustness of our approach.

Impact of Obesity on Outcomes of Patients With Coronavirus Disease 2019 in the United States: A Multicenter Electronic Health Records Network Study

Impact of Obesity on Outcomes of Patients With Coronavirus Disease 2019 in the United States: A Multicenter Electronic Health Records Network Study

Moving Beyond Nursing Standardized Language for Substance Use Problems

Nursing knowledge has been accompanied by the evolution of nursing standardized language systems (SLS) that can help nurses to systematize nursing care. We analyzed referential integrity (diagnosis, results, interventions) of substance related problems in Nursing SLS through documentary analysis: ICNP®, NANDA-I, Nursing Intervention Classification (NIC), Nursing Outcome Classification (NOC), NANDA NIC NOC (NNN). ICNP® has a definition of "substance abuse" but there are no clinical indicators or related factors to help formulate a diagnosis. NANDA-I does not define any related diagnosis, although it appears as related to or as a risk factor in 36 diagnoses. In NIC and NOC there are interventions and outcomes related. The phenomenon is omitted in NANDA-I and treated in a stigmatized manner by ICNP. Clear clinical indicators may be needed to help nursing diagnosis and to lead clinical reasoning.

Risk of Severe Coronavirus Disease 2019 in Patients With Inflammatory Bowel Disease in the United States: A Multicenter Research Network Study

This is a PDF file of an article that has undergone enhancements after acceptance, such as the addition of a cover page and metadata, and formatting for readability, but it is not yet the definitive version of record. This version will undergo additional copyediting, typesetting and review before it is published in its final form, but we are providing this version to give early visibility of the article. Please note that, during the production process, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.

Real-Time Implementation of Self-Adaptive Salp Swarm Optimization-Based Microgrid Droop Control

This article presents a new version of the salp swarm inspired algorithm (SSIA) for the optimal design of the microgrid droop controller. The new version of SSIA is originated from the hybridizing of SSIA with the updating features of the particle swarm optimization (PSO). The development of SSIA is achieved by applying referential integrity between leaders and followers' candidates via employing both position and velocity update property of PSO. The hybrid SSIA-PSO also has a self-adaptive mechanism to avoid the necessity of refining the algorithm parameters for each optimization problem. Twenty-three benchmark test systems are tested to validate the superiority of the improved SSIA over the original PSO and SSIA. The proposed SSIA-PSO based control strategy is experimentally tested in a real-time environment. The control platform's performance is experimentally tested by using the Texas Instruments Launchpad TMS320F28379D. The developed real-time hardware-in-the-loop setup is a real investigation for implementing the suggested SSIA-PSO based control strategy with a low-cost control platform. The attained results prove the efficacy of the hybrid SSIA-PSO algorithm over the presented techniques. The introduced hybrid SSIA-PSO is employed to tackle the real microgrid droop control uncertainties such as inaccuracy in controller gains, deterioration of system parameters, multi-sources energy sharing challenge and system dynamics.

A solution for synchronous incremental maintenance of materialized views based on SQL recursive query

Materialized views are excessively stored query execution results in the database. They can be used to partially or completely answer queries which will be further appeared instead of re-executing query from the scratch. There is a large number of published works that address the maintenance, especially incremental update, of materialized views and query rewriting for using those ones. Some of them support materialized views based on recursive query in datalog language. Although most of datalog queries can be transferred into SQL queries and vise versa but it is not the case for recursive queries. Recursive queries in the data log try to find all possible transitive closures. Recursive queries in SQL (Common Table Expression – CTE) return direct links but not transitive closures. In this paper, we propose efficient methods for incremental update of materialized views based on CTE; and then propose an algorithm for generating source codes in C language for any input SQL recursive queries. The synthesized source codes implement our proposed incremental update algorithms according to inserted/deleted/updated record set in the base tables. This paper focuses mainly on the recursive queries whose execution results are directed tree-structured data. The two cases of tree node are considered. In the first case, a child node has only one parent node and in the second case, a child node can have many parent nodes. Those two cases represent the two types of relationships between entities in real world, that are one–to–many and many–to–many, respectively. For the one–to–many relationships, the relationship data is accompanied with the records describing the child using some fields. Those fields are set as null in deleting a concrete relationship. For the many–to–many relationships, it is stored in a separate table and the concrete relationships are removed by deleting describing records from that table. Considering of enforcing referential integrity may help to reduce the searching space and therefore, help to improve the performance. However, the set of tree nodes or tree edges can be manipulated. All those combinations lead to different algorithms. The experimental results are provided and discussed to confirm the effectiveness of our proposed methods

HQR-Scheme: A High Quality and resilient virtual primary key generation approach for watermarking relational data

Most of the watermarking techniques designed to protect relational data often use the Primary Key (PK) of relations to perform the watermark synchronization. Despite offering high confidence to the watermark detection, these approaches become useless if the PK can be erased or updated. A typical example is when an attacker wishes to use a stolen relation, unlinked to the rest of the database. In that case, the original values of the PK lose relevance, since they are not employed to check the referential integrity. Then, it is possible to erase or replace the PK, compromising the watermark detection with no need to perform the slightest modification on the rest of the data. To avoid the problems caused by the PK-dependency some schemes have been proposed to generate Virtual Primary Keys (VPK) used instead. Nevertheless, the quality of the watermark synchronized using VPKs is compromised due to the presence of duplicate values in the set of VPKs and the fragility of the VPK schemes against the elimination of attributes. In this paper, we introduce the metrics to allow precise measuring of the quality of the VPKs generated by any scheme without requiring to perform the watermark embedding. This way, time waste can be avoided in case of low-quality detection. We also analyze the main aspects to design the ideal VPK scheme, seeking the generation of high-quality VPK sets adding robustness to the process. Finally, a new scheme is presented along with the experiments carried out to validate and compare the results with the rest of the schemes proposed in the literature.

Robust non‐fragile approach to resilient design of PID‐based blade pitch control for wind energy conversion system

AbstractThe design of a blade pitch controller (BPC) for wind energy conversion system (WECS) applications is load‐dependent and has to be adjusted for each operating condition. Thus, BPC robustness is important for coping with the endless variations in operating conditions. The boundaries of a robust stability region are determined in regards to the controller parameters plane using their relevant set of polynomial inequalities via Referential Integrity between Routh‐Hurwitz criterion and Root‐Locus (RI‐RH/RL) approach. Constrained and unconstrained stability regions respectively are defined through a novel hybrid control technique based on the combination of both RI‐RH/RL and Kharitonov (Kh) theorem. The hybrid RI‐Kh method is used for globally analyzing all vertex plants to ensure the proposed controller robustness, non‐fragility, and resilience by selecting its parameters at the center of the robust stability region. The optimal BPC‐PID parameters estimated using different optimization techniques are always located within the specified stability region. Thus, the capability of the RI‐Kh approach in determining the most robust, non‐fragile and resilient controller is verified. Through simulation results, the effectiveness of the proposed approach and its applicability to WECS' global stabilization are validated.

Beyond validation: Using programmed diagnostics to learn about, monitor, and successfully complete your DH project

Abstract Digital humanities projects have long relied on various schema languages—chiefly, RELAX NG and Schematron—for validating the XML documents in their data collections; however, these languages are limited in their ability to check for consistency, coherence, and completeness across the entire project. In our work as part of “Endings”, an umbrella project that comprises four diverse digital edition projects from different fields, we have developed a methodology for checking and enforcing correctness, completeness, and coherence across the entire document set. The following article describes the various stages (what we term “levels”) of our diagnostics process, all of which are driven by XSLT (Extensible Stylesheet Language Transformations) stylesheets, and produce a human readable report. These levels include checks for referential integrity, correct entity tagging, and potential duplicates in the data set. Using examples from the Endings projects, we show how diagnostic processes not only ensure correctness in the data set, but can also aid in determining project milestones and completion dates. Diagnostics, we argue, are thus a crucial extension to schema-based validation for complex digital projects and can provide concrete ways for digital humanities projects to enforce coherence and consistency and track their progress toward completion.