A universal table model for categorical databases
From MaRDI portal
Publication:918682
DOI10.1016/0020-0255(89)90028-5zbMath0706.68040OpenAlexW1999705032MaRDI QIDQ918682
Publication date: 1989
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(89)90028-5
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete axiomatization of full acyclic join dependencies
- Connections in acyclic hypergraphs
- Computing the maximum-entropy extension of given discrete probability distributions
- Existence of extensions and product extensions for discrete probability distributions
- Markov fields and log-linear interaction models for contingency tables
- Statistical treatment of the information content of a database
- On the Desirability of Acyclic Database Schemes
- Information Theory and Statistical Mechanics
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- On the foundations of the universal relation model
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Interaction in multidimensional contingency tables: an information theoretic approach
- Prior Probabilities
- Partitioning of Chi-Square, Analysis of Marginal Contingency Tables, and Estimation of Expected Frequencies in Multidimensional Contingency Tables
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: A universal table model for categorical databases
