Results 51 to 60 of about 1,589 (91)
UniqueNOSD: a novel framework for NoSQL over SQL databases
To date, most large corporations still have their core solutions on relational databases but only use non-relational (i.e. NoSQL) database management systems (DBMS) for their non-core systems that favour availability and scalability through partitioning ...
Abdulrauf A. Gidado, C. I. Ezeife
doaj +1 more source
USING OBJECT-RELATIONAL DATABASE TECHNOLOGY TO SOLVE PROBLEMS IN DATABASE DEVELOPMENT [PDF]
Ming Wang
doaj
A COMPARISON OF THE RELATIONAL DATABASE MODEL AND THE ASSOCIATIVE DATABASE MODEL [PDF]
Joseph Homan, Paul Kovacs
doaj
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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.
Jiang, Feng, Sui, Yuefei, Cao, Cungen
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.
Kontinen, J., Link, S., Väänänen, J.
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 +1 more source
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 +1 more source
2013
In mathematics a binary relation between two sets \(A\) and \(B\) is a collection of ordered pairs \((a,b)\) belonging to the cartesian product \(A\,\times \,B\). In this chapter we present some of the general properties of relations and their operations, as well some special types of relations defined over the same set.
openaire +1 more source
In mathematics a binary relation between two sets \(A\) and \(B\) is a collection of ordered pairs \((a,b)\) belonging to the cartesian product \(A\,\times \,B\). In this chapter we present some of the general properties of relations and their operations, as well some special types of relations defined over the same set.
openaire +1 more source
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 +1 more source

