Theory of random observables in relational data bases
Information SystemsPublished 1 January 1983
Francesco M. Malvestuto
Citations10
SJR quartileQ1
SJR score0.89
SNIP1.96
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A statistical data-base model, based on the representation of the attributes by random observables, is introduced and it is shown that such a language has the same deductive power as the formal theories of functional dependencies and of multivalued dependencies.
Abstract
We introduce a statistical data-base model, based on the representation of the attributes by random observables. This is shown to form a conceptual framework for the description both of the data-base contents and of the data-base dependencies. Besides, the application of the information theory to our model allows a high-level data language, suitable for a statistical data analysis, to be developed. Finally, it is shown that such a language has the same deductive power as the formal theories of functional dependencies and of multivalued dependencies.
Keywords
Computer Science
Journal of the American Statistical AssociationProbability, Random Variables, and Stochastic Processes.
16,350 Citations1984Julia Abrahams, A. Papoulis
Communications of the ACMA relational model of data for large shared data banks
5,238 Citations1970E. F. Codd
A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.
Foundations of database design/Foundations of database design seriesIntroduction to Database Systems
3,542 Citations2006
Readers of this book will gain a strong working knowledge of the overall structure, concepts, and objectives of database systems and will become familiar with the theoretical principles underlying the construction of such systems.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Conditional Independence in Statistical Theory
1,546 Citations1979A. P. Dawid
Journal of the Franklin InstituteInformation and information stability of random variables and processes
784 Citations1964
ACM Transactions on Database SystemsMultivalued dependencies and a new normal form for relational databases
720 Citations1977Ronald Fagin
It is shown that every relation schema can be decomposed into a family of relation schemata in fourth normal form without loss of information (that is, the original relation can be obtained from the new relations by taking joins).
Information SystemsInformation systems theoretical foundations
669 Citations1981Zdzisław Pawlak
The presented approach leads to a new information systems organization and the implementation shows many advantages compared with other methods.
IBM Journal of Research and DevelopmentFunctional Dependencies in a Relational Database and Propositional Logic
171 Citations1977Ronald Fagin
An equivalence is shown between functional dependency statements of a relational database and implicational statements of propositional logic, where it is shown that a dependency statement is a consequence of a set of dependency statements if the correspondingimplicational statement isA consequence of the corresponding set of implICational statements.
ACM Transactions on Database SystemsNormalization and hierarchical dependencies in the relational data model
158 Citations1978Claude Delobel
A new approach to the conceptual design of logical schemata for relational databases by means of functional dependencies and multivalued dependencies is presented and first-order hierarchical decomposition is introduced.
Journal of the ACMAn Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
154 Citations1981Yehoshua Sagiv, Claude Delobel +2 more
It is shown that there is an eqmvalence between functional dependencies m a relatmonal database and a certain fragment of proposmonal logic that cannot be extended to include either join dependencies or embedded multivalued dependencies.
Transactions of the IRE Professional Group on Information TheoryThe lattice theory of information
144 Citations1953Claude E. Shannon
The present note outlines a new approach to information theory which is aimed specifically at the analysis of certain communication problems in which there exist a number of information sources simultaneously in operation.
The use of cluster analysis in physical data base design
128 Citations1975Jeffrey A. Hoffer, Dennis G. Severance
A metric with which to measure the similarity of usage among data items is developed and used by a clustering algorithm to reduce the space of alternative designs to a point where solution is economically feasible.
IBM Journal of Research and DevelopmentDecomposition of a Data Base and the Theory of Boolean Switching Functions
127 Citations1973Claude Delobel, R. G. Casey
An important equivalence between operations with functional relations and operations with analogous Boolean functions is demonstrated and is computationally helpful in exploring the properties of a given set of functional relations, as well as in the task of partitioning a data set into subfiles for efficient implementation.
ACM Transactions on Database SystemsA statistical approach to incomplete information in database systems
87 Citations1982Eugene Wong
Information and ControlA metric space of discrete probability distributions
75 Citations1961C. Rajski
A functional defined by means of entropy is considered and it is shown that it is a distance in the set of discrete probability distributions.
ACM Transactions on Database SystemsDecompositions and functional dependencies in relations
61 Citations1980William W. Armstrong, C. Deobel
Information Processing & ManagementInformation theory and information science†
18 Citations1981Pranas Zunde
It is argued that extension of the scope of Information Theory as well as development of new theories of information science presupposes better understanding of relevant empirical regularities and laws.
Algorithmic Applications For A New Result On Multivalued Dependencies
17 Citations1979Dennis Parker, Claude Delobel
This paper reviews some of the basic implications of this result and outlines new applications in FD/MVD membership testing, generation of dependency closure, cover, and keys, and testing for lossless and independent decompositions.
Very Large Data BasesSome analytic tools for the design of relational database systems
16 Citations1980K.K. Nambiar
It is shown that the use of null elements is important in handling data and an explicit formula is derived for representing dependencies that would remain in a projection of a relation.