Differences

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

--- groimp-platform:extents [2024/12/16 18:38] – [Extent in XL queries] gaetan
+++ groimp-platform:extents [2025/01/14 15:29] (current) – gaetan
@@ Line 1: / Line 1: @@
 ====== Graph Extents ======
-A special feature of the graph management is the manipulation of [[https://javadoc.grogra.de/graph/de/grogra/graph/impl/Extent.html|extents]]. For each used node class in the graph, there exists an Extent which collects all nodes of this class and also has a link to the extent of its superclass and to the extents of its subclasses. This feature is currently used within the RGG plug-in for a fast processing of queries which specify node type patterns like in the rule ''F(x) == > F(2*x);''. Instead of having to scan the whole graph for nodes of class F, the corresponding extent is used together with its sub-extents to directly iterate over all nodes of class F.
+A special feature of the graph management is the manipulation of [[https://javadoc.grogra.de/graph/de/grogra/graph/impl/Extent.html|extents]]. For each used node class in the graph, there exists an Extent which collects all nodes of this class and also has a link to the extent of its superclass and to the extents of its subclasses. This feature is currently used within the RGG plug-in for a fast processing of queries which specify node type patterns like in the rule ''F(x) %%==>%% F(2*x);''. Instead of having to scan the whole graph for nodes of class F, the corresponding extent is used together with its sub-extents to directly iterate over all nodes of class F.
@@ Line 41: / Line 41: @@
 ===== Extent index =====
-An extent collects its nodes not by a single list, but by a number of (doubly linked) lists. Currently, eight lists are used, but this can easily be changed. This feature is used to partition the extents.
+An extent collects its nodes not by a single list, but by a number of (doubly linked) lists. Currently, eight lists are used, but this can easily be changed. This feature is used to partition the extents. The eight lists are called the extent indexes.
 The extent indexes are defined from 0 to 7. By default most nodes added to the graph are added with the index 0. There are two exceptions (by default. You can manually set index of Node):
   - //meta objects//: Nodes of the meta graph. Added at index 7.
-  - //GUI inserted objects//: Nodes inserted from the GUI. Added at index 6.
+  - //GUI inserted objects//: Nodes inserted from the GUI. Added at index 6 (since GroIMP 2.1.5, they where added to index 7 before).
 The most common example of extent index is the //meta-graph//. Each project in GroIMP includes a //meta-graph// with at least one node per compiled file in the project. Yet, these Nodes are not returned by default in XL queries. The reason is that, they were added to an invisible (by default) extent index.
@@ Line 98: / Line 98: @@
 === 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.
-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).