User Tools

Site Tools


groimp-platform:extents

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
groimp-platform:extents [2025/01/14 15:15] gaetangroimp-platform:extents [2025/01/14 15:29] (current) gaetan
Line 98: Line 98:
 === Graph complexity ===  === Graph complexity === 
  
-Extent are used in RGG for queries that involve Node types. E.g. the query ''F +> Node /> Model.A == >;'' will be resolved by: looping over the Extent of //F//, finding the edges that matches to the Extent of //Node//, ...+Extent are used in RGG for queries that involve Node types. E.g. the query ''F +> Node /> Model.A %%==>%%;'' will be resolved by: looping over the Extent of //F//, finding the edges that matches to the Extent of //Node//, ...
  
 Such a query will **not** visit the graph. It will loop over the extents data. Thus, the complexity of the graph //might// not affect the query. Such a query will **not** visit the graph. It will loop over the extents data. Thus, the complexity of the graph //might// not affect the query.
  
-Speed up queries by using more specific Node type: As the query loop over the extents content, ''( (*Node*))'' will loop over all nodes in the graph, while ''( (*Model.A*))'' only on the Extent Model.A and its sub extent. Each edge condition add a level of complexity. For instance: ''[Node Node Node == >;]'' has a complexity of n³ (n being the number of Node).+Speed up queries by using more specific Node type: As the query loop over the extents content, ''( (*Node*))'' will loop over all nodes in the graph, while ''( (*Model.A*))'' only on the Extent Model.A and its sub extent. Each edge condition add a level of complexity. For instance: ''[Node Node Node %%==>%%;]'' has a complexity of n³ (n being the number of Node).
  
  
groimp-platform/extents.1736864118.txt.gz · Last modified: 2025/01/14 15:15 by gaetan