SGML: Darrell R. Raymond, Partial Order Databases

See the full bibliographic entry for the dissertation in the bibliography database.

---

Table of Contents

Introduction -- 1

Why order? -- 2

Why partial orders? -- 3

Why not directed acyclic graphs? -- 7

Temporal databases: an example -- 9

The partial order model -- 16

Partial orders -- 17

An algebra for partial orders -- 18

Partial order predicates -- 19

Operators over a single partial order -- 20

Operators over partial orders with a common base set -- 25

Operators over partial orders with disjoint base sets -- 26

Properties of the algebra -- 32

Implementing the partial order model -- 34

Total -- 38

Unordered -- 38

Equality -- 39

Containment -- 40

Dual -- 41

Up -- 42

Down -- 43

Base set -- 44

Maxima -- 44

Minima -- 45

Down-tail -- 45

Up-tail -- 46

Contradiction -- 46

Selection -- 47

Intersection -- 48

Sum -- 49

Disjoint union -- 50

Lexicographical sum -- 51

Cross product -- 54

Producing a realizer -- 58

Efficiently storing realizers -- 63

Comparing realizers to transitive reductions -- 65

Software -- 68

Building programs -- 68

Version control -- 80

Discussion -- 93

Text -- 97

Orders in text -- 97

Tables -- 109

Summary -- 119

Partial orders and databases -- 123

Dependency theory -- 123

Object-oriented modelling -- 132

Managing redundant data -- 136

Discussion -- 139

Future work and conclusions -- 141

Deploying the model -- 141

Directions for future investigation -- 144

Conclusions -- 148

References -- 150