Access path support for referential integrity

Abstract The relational model of data incorporates fundamental assertions for entity integrity and referential integrity. Recently, these so-called relational invariants were more precisely specified by the new SQL2 standard. Accordingly, they have to be guaranteed by a relational DBMS to its users and, therefore, all issues of semantics and implementation became very important. The specification of referential integrity embodies quite a number of complications including the MATCH clause and a collection of referential actions. In particular, MATCH PARTIAL turns out to be hard to understand and, if applied, difficult and expensive to maintain. In this paper, we identify the functional requirements for preserving referential integrity. At a level free of implementational considerations, the number and kinds of searches necessary for referential integrity maintenance are derived. Based on these findings, our investigation is focussed on the question of how the functional requirements can be supported by implementation concepts in an efficient way. We determine the search cost for referential integrity maintenance (in terms of page references) for various possible access path structures. Our main result is that a combined access path structure is the most appropriate for checking the regular MATCH option whereas MATCH PARTIAL requires very expensive and complicated check procedures. If it cannot be avoided at all, the best support is achieved by a combination of multiple B*-trees

Objective Response to Radiation Therapy and Long-Term Survival of Patients with WHO Grade II Astrocytic Gliomas with Known LOH 1p/19q Status

Background:: WHO grade II gliomas are often approached by radiation therapy (RT). However, little is known about tumor response and its potential impact on long-term survival. Patients and Methods:: Patients subjected to RT were selected from the own database of WHO grade II gliomas diagnosed between 1991 and 2000. The volumetric tumor response after RT was assessed based on magnetic resonance imaging and graded according to standard criteria as complete, partial (PR, ≥ 50%), or minor (MR, 25% to < 50%). Results:: There were 24 astrocytomas and three oligoastrocytomas. 21 patients (78%) were dead at follow-up (mean survival 74 months). None of the patients had chemotherapy. Objective response occurred in 14 patients (52%, five PR and nine MR) but was not associated with overall survival. The vast majority of the tumors had no loss of heterozygosity (LOH) 1p and/or 19q (86%). Conclusion:: Approximately 50% of patients with astrocytic WHO grade II gliomas respond to RT despite the absence of LOH for 1p/19q. The potential predictive factors for response and the impact of response on overall survival remain unclea

Pasteurella multocida Toxin Activates Various Heterotrimeric G Proteins by Deamidation

Pasteurella multocida produces a 146-kDa protein toxin (Pasteurella multocida toxin, PMT), which stimulates diverse cellular signal transduction pathways by activating heterotrimeric G proteins. PMT deamidates a conserved glutamine residue of the α-subunit of heterotrimeric G proteins that is essential for GTP-hydrolysis, thereby arresting the G protein in the active state. The toxin substrates are Gαq Gα13 and the Gαi-family proteins. Activation of these α-subunits causes stimulation of phospholipase Cβ, Rho-guanine nucleotide exchange factors or inhibition of adenylyl cyclase. This article provides the current knowledge on PMT concerning the structure-function analysis based on the crystal structure and recently elucidated molecular mode of action. Furthermore, the impact of PMT on cellular signaling is discussed

Statistical quality assessment and outlier detection for liquid chromatography-mass spectrometry experiments

<p>Abstract</p> <p>Background</p> <p>Quality assessment methods, that are common place in engineering and industrial production, are not widely spread in large-scale proteomics experiments. But modern technologies such as Multi-Dimensional Liquid Chromatography coupled to Mass Spectrometry (LC-MS) produce large quantities of proteomic data. These data are prone to measurement errors and reproducibility problems such that an automatic quality assessment and control become increasingly important.</p> <p>Results</p> <p>We propose a methodology to assess the quality and reproducibility of data generated in quantitative LC-MS experiments. We introduce quality descriptors that capture different aspects of the quality and reproducibility of LC-MS data sets. Our method is based on the Mahalanobis distance and a robust Principal Component Analysis.</p> <p>Conclusion</p> <p>We evaluate our approach on several data sets of different complexities and show that we are able to precisely detect LC-MS runs of poor signal quality in large-scale studies.</p

Access path support for referential integrity in SQL2

The relational model of data incorporates fundamental assertions for entity integrity and referential integrity. Recently, these so-called relational invariants were more precisely specified by the new SQL2 standard. Accordingly, they have to be guaranteed by a relational DBMS to its users and, therefore, all issues of semantics and implementation became very important. The specification of referential integrity embodies quite a number of complications including the MATCH clause and a collection of referential actions. In particular, MATCH PARTIAL turns out to be hard to understand and, if applied, difficult and expensive to maintain. In this paper, we identify the functional requirements for preserving referential integrity. At a level free of implementational considerations, the number and kinds of searches necessary for referential integrity maintenance are derived. Based on these findings, our investigation is focused on the question of how the..

Towards a logical semantics for referential actions in SQL

We investigate a logical semantics which unambiguously specifies the meaning of SQL-like referential actions of the form ON DELETE CASCADE and ON DELETE RESTRICT. The semantics is given by a translation of referential actions into logical rules. The proposed semantics is less restrictive than the standard SQL semantics, yet preserves all referential integrity constraints. First, a preliminary set of rules is introduced which rejects a set of user requests if a single request is rejected. Subsequently, a refined translation is presented using Statelog [LHL95], a state-oriented Datalog extension which allows to define active anddeductive rules within a uni ed framework. We show that our semantics yields the maximal admissible subset of a given set of user requests. Apart from the Statelog formalization, a three-valued formalization based on the well-founded semantics and an equivalent game-theoretic specification are presented, which give further insight into the problem of ambiguity of triggers