# Ordinal Data - Partially Order

A Partially ordered structure is a data structure where not every pair of elements needs to be comparable (compared).

## Example

### Genealogy

A collection of people ordered by genealogical descendancy:

• Some pairs of people bear the descendant-ancestor relationship,
• But other pairs of people are incomparable, with neither being a descendant of the other.

### Heap

A Heap is also a sort of partially ordered structure. (ie the parent node should have a bigger value than the child)

## Properties

A partial order is any binary relation that is:

• reflexive (each element is comparable to itself),
• antisymmetric (no two different elements precede each other),
• transitive (the start of a chain of precedence relations must precede the end of the chain).

## Documentation / Reference

Discover More
Logical Data Modeling - Transitive Relationship Property

transitive is a relationship property that tells that the relationship follows the following rule: when the relation relates a to b and b to c, then the relation relates a to c. In mathematical notation,...
Tree - Heap Data Structure

A heap is a tree data structure constructed from the priority number that needs to satisfy a heap property prioritypriority queues Heaps are favourite data structures for many applications: heap...