Results 1 to 10 of about 663,961 (238)
A relation merging technique for relational databases [PDF]
A merging technique for relational schemas consisting of relation-schemes, key dependencies, referential integrity constraints, and null constraints is presented. The author examines the conditions required for using this technique with relational database management systems that provide different mechanisms for maintaining null and referential ...
Victor Markowitz
openaire +4 more sources
Converting Relational Databases into Object-relational Databases. [PDF]
This paper proposes an approach for migrating existing Relational DataBases (RDBs) into Object-Relational DataBases (ORDBs). The approach is superior to existing proposals as it can generate not only the target schema but also the data instances. The solution takes an existing RDB as input, enriches its metadata representation with required semantics ...
M. Akhtar Ali+2 more
openaire +1 more source
Visualization of Relational Databases
The purpose of the article is to demonstrate the relational databases visualization algorithm using MS Power BI software products in MS Excel. The research methodology is cloud information processing technologies. The novelty of the study is the implementation of the relational database visualization algorithm using MS Power BI software products in MS ...
Bulyha Kostiantin+2 more
openaire +1 more source
Recommendations for Evolving Relational Databases [PDF]
Relational databases play a central role in many information systems. Their schemas contain structural and behavioral entity descriptions. Databases must continuously be adapted to new requirements of a world in constant change while: (1) relational database management systems (RDBMS) do not allow inconsistencies in the schema; (2) stored procedure ...
Delplanque, Julien+3 more
openaire +5 more sources
Database Slicing on Relational Databases
Many software systems today use databases to permanently store their data. Testing, bug finding and migration are complex problems in the case of databases that contain many records. Here, our method can speed up these processes if we can select a smaller piece of the database (called a slice) that contains all of the records belonging to the slicing ...
David Tengeri, Ferenc Havasi
openaire +2 more sources
Getting Along with Relational Databases
Both relational databases and XML have strengths and weaknesses as data storage and modelling systems. Most researchers working with Humanities historical and literary data would argue for the superiority of XML, since it allows unlimited nesting, linking, and complexity.
openaire +4 more sources
The relational database system of KM3NeT [PDF]
The KM3NeT Collaboration is building a new generation of neutrino telescopes in the Mediterranean Sea. For these telescopes, a relational database is designed and implemented for several purposes, such as the centralised management of accounts, the storage of all documentation about components and the status of the detector and information about slow ...
Arnauld Albert, BOZZA, Cristiano
openaire +5 more sources
A Comparison between Relational Databases and NoSQL Databases [PDF]
Databases are used for storing and managing large amounts of data. Relational model is useful when it comes to reliability but when it comes to the modern applications dealing with large amounts of data and the data is unstructured non relational models are usable. NoSQL databases are used to store large amounts of data.
openaire +2 more sources
Relational database and graph database: A comparative analysis [PDF]
Since 1970, relational database models have been in use for storing, manipulating and retrieving data. The importance of relational databases is going to decrease due to the exponential growth of data as it is difficult to work with large number of joining tables.
Surajit Medhi, Hemanta K. Baruah
openaire +3 more sources
Adequacy of Decompositions of Relational Databases
AbstractWe consider conditions that have appeared in the literature with the purpose of defining a “good” decomposition of a relation scheme. We show that these notions are equivalent in the case that all constraints in the database are functional dependencies. This result solves an open problem of Rissanen.
Fereidoon Sadri+3 more
openaire +2 more sources