Comparison of the different data models
| Property-based model | Timeline model | Hierarchy model | |
|---|---|---|---|
| Expressiveness | Low, simple property with dedicated datatype (only storage, no semantic information), supports time zones, the property is not unique, needs an additional property to resolve timestamp equality, the user must know how to interpret stored data | Medium, simple property with dedicated datatype in dedicated node, supports time zones, the node can be unique, semantic information: absolute temporal order given by directed edges | High, tree like structure with shared nodes, each node is unique, allows indication of timestamp precision, fine grained node fetching possible, no time zone support, the relative temporal order of nodes of the same level and sub tree by directed edges, requires directed edge to resolve timestamp equality |
| Complexity | Low, comparable complex as the equivalent query in a relational database | Medium, the problem described in Section 7.1 forces usage of two different approaches for node access and matching | High requires complex queries due to different levels when searching specific nodes |
| Suitability | Does not exploit graph database specific functionality | Basic usage of nodes and directed edges by constructing a global timeline | Extensive usage of nodes and edges, most information expressed by these elements |
| Property-based model | Timeline model | Hierarchy model | |
|---|---|---|---|
| Expressiveness | Low, simple property with dedicated datatype (only storage, no semantic information), supports time zones, the property is not unique, needs an additional property to resolve timestamp equality, the user must know how to interpret stored data | Medium, simple property with dedicated datatype in dedicated node, supports time zones, the node can be unique, semantic information: absolute temporal order given by directed edges | High, tree like structure with shared nodes, each node is unique, allows indication of timestamp precision, fine grained node fetching possible, no time zone support, the relative temporal order of nodes of the same level and sub tree by directed edges, requires directed edge to resolve timestamp equality |
| Complexity | Low, comparable complex as the equivalent query in a relational database | Medium, the problem described in Section 7.1 forces usage of two different approaches for node access and matching | High requires complex queries due to different levels when searching specific nodes |
| Suitability | Does not exploit graph database specific functionality | Basic usage of nodes and directed edges by constructing a global timeline | Extensive usage of nodes and edges, most information expressed by these elements |
Sharing content requires targeting cookies to be enabled. Please update your cookie preferences to use this feature.