Skip to search formSkip to main contentSkip to account menu

Cardinality (data modeling)

Known as: Cardinality (computer engineering), Cardinality (disambiguation) 
In database design, the cardinality or fundamental principle of one data table with respect to another is a critical aspect. The relationship of one… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Data modelData structure diagramEntity–relationship modelForeign key

Broader (2)

Data modelingRelational model

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Automatic promotional specialization, generalization and analysis of extended feature models with cardinalities in Alloy
2014
2014
An integrated Procedure for Resolving Portfolio Optimization Problems, Using Data Envelopment Analysis, Ant Colony Optimization, and Gene Expression Programming
The portfolio optimization problem is an important issue in the field of investment/financial decision-making and is currently… 
2004
2004
A Distribution Design Methodology for Object DBMS
The design of distributed databases involves making decisions on the fragmentation and placement of data and programs across the… 
Highly Cited
2003
Highly Cited
2003
A Greedy Approach to Identification of Piecewise Affine Models
This paper addresses the problem of identification of piece-wise affine (PWA) models. This problem involves the estimation from… 
2001
2001
On arcs in projective Hjelmslev planes
Highly Cited
2001
Highly Cited
2001
On the implication problem for cardinality constraints and functional dependencies
In database design, integrity constraints are used to express database semantics. They specify the way by that the elements of a… 
2000
2000
Approximate Markovian models of cellular mobile telephone networks with customer retrials
A novel approximate technique is proposed for the estimation of call blocking probabilities in cellular mobile telephone networks… 
1997
1997
A mass assignment based ID3 algorithm for decision tree induction
A mass assignment based ID3 algorithm for learning probabilistic fuzzy decision trees is introduced. Fuzzy partitions are used to… 
1994
1994
Representations for Small Relation Algebras
There are eighteen isomorphism types of finite relation algebras with eight or fewer elements, and all of them are representable… 
1989
1989
A feasibility and performance study of dependency inference (database design)
The feasibility of inferring functional dependencies from an example relation is investigated. The problem occurs in the context… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)