Results 241 to 250 of about 4,750,073 (297)
Some of the next articles are maybe not open access.
A Method for Rough Relational Database Transformed into Relational Database
2009 IITA International Conference on Services Science, Management and Engineering, 2009It 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, 1988This 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, 2007Since 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, 2003The 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
2013We 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, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Relational Databases with Ordered Relations
Logic Journal of the IGPL, 2005Summary: 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