A universal table model for categorical databases

DOI10.1016/0020-0255(89)90028-5MaRDI QIDQ918682zbMATH OpenOpenAlexFDO

Authors Francesco M. Malvestuto

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

zbMATH Keywords

maximum-entropycategorical databaseuniversal table interfaceuniversal table model

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• On the foundations of the universal relation model
• Maximal objects and the semantics of universal relation databases
• scientific article; zbMATH DE number 3934440
• scientific article; zbMATH DE number 527369
• scientific article; zbMATH DE number 219595

Cites work

• scientific article; zbMATH DE number 4205777 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3481687 (Why is no real title available?)
• scientific article; zbMATH DE number 3509596 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• A complete axiomatization of full acyclic join dependencies
• Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
• Computing the maximum-entropy extension of given discrete probability distributions
• Connections in acyclic hypergraphs
• Depth-First Search and Linear Graph Algorithms
• Existence of extensions and product extensions for discrete probability distributions
• Information Theory and Statistical Mechanics
• Interaction in multidimensional contingency tables: an information theoretic approach
• Markov fields and log-linear interaction models for contingency tables
• On the Desirability of Acyclic Database Schemes
• On the foundations of the universal relation model
• Partitioning of Chi-Square, Analysis of Marginal Contingency Tables, and Estimation of Expected Frequencies in Multidimensional Contingency Tables
• Prior Probabilities
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Statistical treatment of the information content of a database

Cited in

(1)

• A fast algorithm for query optimization in universal-relation databases

This page was built for publication: A universal table model for categorical databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918682)