Results 41 to 50 of about 302,941 (218)
User Defined Types and Nested Tables in Object Relational Databases [PDF]
, 2006 Bernadette Byrne, Mary Garvey, ‘User Defined Types and Nested Tables in Object Relational Databases’, paper presented at the United Kingdom Academy for Information Systems 2006: Putting Theory into Practice, Cheltenham, UK, 5-7 June, 2006.There has been ...
Byrne, Bernadette, Garvey, Mary
core
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries [PDF]
, 2015 Conjunctive queries are basic and heavily studied database queries; in relational algebra, they are the select-project-join queries. In this article, we study the fundamental problem of counting, given a conjunctive query and a relational database, the ...
Chen, Hubie, Mengel, Stefan
core +3 more sources
Adequacy of Decompositions of Relational Databases
Journal of Computer and System Sciences, 1980 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
A comparative analysis of data redundancy and execution time between relational and object oriented schema table [PDF]
, 2014 The design of database is one of the important parts in building software, because database is the data storage inside the system. There are some techniques that allow the programmer to improve design of the database.
Alakari, Salim Tahir
core
Journal of Advanced Research in Natural and Applied Sciences, 2022 Relational database management systems have been used for storing data for a long time.However, these systems are insufficient to analyze the large and complex structure of the data.
Ramazan Altın, A. Cumhur Kınacı
doaj +1 more source
Database relations with null values [PDF]
Journal of Computer and System Sciences, 1982 AbstractA new formal approach is proposed for modeling incomplete database information by means of null values. The basis of our approach is an interpretation of nulls which obviates the need for more than one type of null. The conceptual soundness of this approach is demonstrated by generalizing the formal framework of the relational data model to ...
openaire +2 more sources
Probabilistic Relational Model Benchmark Generation [PDF]
, 2016 The validation of any database mining methodology goes through an evaluation process where benchmarks availability is essential. In this paper, we aim to randomly generate relational database benchmarks that allow to check probabilistic dependencies ...
Chulyadyo, Rajani +2 more
core +2 more sources
Journal of Computer Sciences InstituteThe article focuses on comparing relational and non-relational databases using applications written in C#. The aim of the study is to understand in which cases relational databases are preferred and when it is worth considering the use of non-relational
Patryk Baliński +2 more
doaj +1 more source
Juggling Functions Inside a Database
, 2017 We define and study the Functional Aggregate Query (FAQ) problem, which captures common computational tasks across a very wide range of domains including relational databases, logic, matrix and tensor computation, probabilistic graphical models ...
Khamis, Mahmoud Abo +2 more
core +1 more source
Journal of Cheminformatics, 2023 Current biological and chemical research is increasingly dependent on the reusability of previously acquired data, which typically come from various sources.
Jakub Galgonek, Jiří Vondrášek
doaj +1 more source