Results 161 to 170 of about 3,444 (218)

Data‐Driven SuStaIn Model of Disability Progression in Amyotrophic Lateral Sclerosis

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To determine whether ordinal Subtype and Stage Inference (SuStaIn) applied to routine ALSFRS‐R item scores can identify reproducible disability progression patterns in amyotrophic lateral sclerosis (ALS) and provide clinically meaningful staging.
Giammarco Milella   +5 more
wiley   +1 more source

Retractions in Rheumatology: Trends, Causes, and Implications for Research Integrity

open access: yesArthritis Care &Research, EarlyView.
Objective We aimed to describe the trends and main reasons for study retraction in rheumatology literature. Methods We reviewed the Retraction Watch database to identify retracted articles in rheumatology. We recorded the main study characteristics, authors’ countries, reasons for retraction, time from publication to retraction, and trends over time ...
Anna Maria Vettori, Michele Iudici
wiley   +1 more source

A Method for Rough Relational Database Transformed into Relational Database

2009 IITA International Conference on Services Science, Management and Engineering, 2009
It is decomposed the data of rough relational database and transformed into relational database according to the characteristic of rough relational database and relational database and in virtue of multiplication principle and Descartes of basic operation of relational algebra. Then deleted redundant data and optimized RDB.
Ling-ling Wei, Wei Zhang
openaire   +2 more sources

Physical database design for relational databases

ACM Transactions on Database Systems, 1988
This paper describes the concepts used in the implementation of DBDSGN, an experimental physical design tool for relational databases developed at the IBM San Jose Research Laboratory. Given a workload for System R (consisting of a set of SQL statements and their execution frequencies), DBDSGN suggests physical configurations for efficient performance.
Sheldon J. Finkelstein   +2 more
openaire   +1 more source

Formal Concept Analysis in Relational Database and Rough Relational Database

Fundamenta Informaticae, 2007
Since its foundation in the early 1980's, Formal ConceptAnalysis (FCA) has been used in many applications in data analysis, information retrieval, and knowledge discovery. In this paper, we suggest to exploit the framework of relational database model (RDM) and rough relational database model (RRDM) for Formal Concept Analysis.
Feng Jiang, Yuefei Sui, Cungen Cao
openaire   +3 more sources

Composition of database relations

[1989] Proceedings. Fifth International Conference on Data Engineering, 2003
The authors argue for implementing composition as a primitive operation and present a single-sided composition algorithm that performs join protection and duplicate elimination as one unified operation. They report experimental results that show an operating region in which this algorithm outperforms composition by the standard method.
Rakesh Agrawal 0001   +2 more
openaire   +2 more sources

Independence in Database Relations

2013
We investigate the implication problem for independence atoms X⊥Y of disjoint attribute sets X and Y on database schemata. A relation satisfies X⊥Y if for every X-value and every Y-value that occurs in the relation there is some tuple in the relation in which the X-value occurs together with the Y-value.
Juha Kontinen   +2 more
openaire   +2 more sources

On Normalization of Relations in Relational Databases

Programming and Computer Software, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Relational Databases with Ordered Relations

Logic Journal of the IGPL, 2005
Summary: The paper deals with expressing preferences in the framework of the relational data model. Preferences have usually a form of a partial ordering. Therefore the question arises how to provide the relational data model with such an ordering.
openaire   +2 more sources

Construction of relations in relational databases

ACM Transactions on Database Systems, 1980
Using a nonprocedural language for query formulation requires certain automatization of a query answering process. Given a query for creation of a new relation, the problem is to find an efficient procedure which produces this relation from a given relational database. We concentrate upon sequences of join operations which losslessly produce a relation
openaire   +1 more source

Home - About - Disclaimer - Privacy