Results 1 to 10 of about 34,346 (118)
It is well known that the growth in demands from end users for new applications is outstripping the capability of data processing departments to implement the corresponding application programs. There are two complementary approaches to attacking this problem (and both approaches are needed): one is to put end users into direct touch with the ...
E F Codd
exaly +3 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 ...
Abdelsalam M. Maatuk +2 more
openaire +1 more source
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 ...
Dávid Tengeri, Ferenc Havasi
openaire +1 more source
Mining Relational Databases [PDF]
In this paper, we propose a classification system to induce an intentional definition of a relation from examples, when background knowledge is stored in a relational database composed of several tables and views. Refinement operators have been defined to integrate in a uniform way different induction tools learning numeric and symbolic constraints ...
Frédéric Moal +2 more
openaire +1 more source
Beyond relational databases [PDF]
There is more to data access than SQL.
openaire +1 more source
On Embeddings in Relational Databases
We address the problem of learning a distributed representation of entities in a relational database using a low-dimensional embedding. Low-dimensional embeddings aim to encapsulate a concise vector representation for an underlying dataset with minimum loss of information.
Siddhant Arora, Srikanta Bedathur
openaire +2 more sources
RELATIONAL ASPECTS OF RELATIONAL DATABASE DEPENDENCIES [PDF]
Summary: This paper presents a relational treatment of inference rules for functional and multivalued dependencies in relational databases, to show the soundness and the completeness of the inference rules in Dedekind categories, which also cover the fuzzy case.
Okuma, Hitomi, Kawahara, Yasuo
openaire +2 more sources
Index selection in relational databases [PDF]
Intending to develop a tool which aims to support the physical design of relational databases can not be done without considering the problem of index selection. Generally the problem is split into a primary and secondary index selection problem and the selection is done per table.
Choenni, R.S. +2 more
openaire +1 more source
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 ...
openaire +2 more sources
Factorisation in relational databases
We study representation systems for relational data based on relational algebra expressions with unions, products, and singleton relations. Algebraic factorisation using the distributivity of product over union allows succinct representation of many-to-many relationships; further succinctness is brought by sharing repeated subexpressions.
openaire +2 more sources

