diff --git a/concept.md b/concept.md
index 694e4d6363444e0c43f14494d140ad2ffcdf6ffb..edcb48157ead801728bdccd2102efe0016cc7abf 100644
--- a/concept.md
+++ b/concept.md
@@ -61,11 +61,28 @@ identified. Suggestion: A unique query defines it.
 Example: "FIND RECORD Fish WITH FishNumber=A AND WHICH IS REFERENCED BY B"
 Note that the second part would be no usable condition with the old 
 identifiable concept.
-The query must return 1 or 0 entities. If no entitiy is returned the respective 
+The query must return 1 or 0 entities. If no entity is returned the respective 
 object may be created and if one is returned it is the one we were looking for.
 If more than one is returned, then there is a mistake in the definition or in 
 the data set.
 
+## Entity Construction
+In the simplest case an entity is constructed at a given node from its key 
+value pairs. However, the data for a given entity might be distributed over the 
+tree. Two different approaches are possible:
+1. During the construction of an entity at a given node also key value pairs
+from other nodes are used. For example, key value pairs from parent nodes might
+be made accessible. Or key value pairs might be accessed by providing the path
+to them in the tree. 
+2. Information is added to an entity at other nodes. The simplest case uses the
+identifiable definition to add information. I.e. it is checked whether the 
+respective entity does already exist in the server, if not it is inserted and
+then the information is added. 
+Additionally, it could be made possible to add information to entities that are
+constructed in other nodes without the use of the identifiable. For example, 
+could it be allowed to add information to entities that were created at parent 
+nodes.
+ 
 ## Value computation
 It is quite straight forward how to set a Property of a Record with a value 
 that is contained in the hierarchical structure. However, the example with the