-
Notifications
You must be signed in to change notification settings - Fork 8
Description
Problem overview
A reference type in OCA reflects a traditional RDBMS where relations among objects are established using unnamed edges. The relation cardinality, that is, how two objects relate to each other, depends on how the objects are built and how the relation is built. So whether this is a has one, has many, or many to many relationship depends on both object structure and relationship structure -- especially in the many to many cases. This is what OCA supports.
When we think of labeled property graphs (LPG), the edges between objects (nodes) can be additionally labeled and equipped with properties. Furthermore, due to the intent of such databases, they put a lot more light on the relationships among objects (nodes).
What's the DSWG angle to model LPGs using OCA? Shall we try to mimic the nodes and edges hierarchy in the graph-as-a-whole, or model them separately and enforce consistency using upper-level layers?