Method and device for controlling the access to knowledge networks

Abstract

The invention relates to an efficient system for user rights in a semantic digital network, whereby users are arranged in the same semantic network as the information objects. The rights are thus derived from the semantic relations between users and information objects in a common semantic network.

1 . Method for the efficient representation of rights in a semantic network deposited in a digital storage medium, which consists of nodes and edges, whereby the nodes represent information objects and the edges represent semantic relations, wherein 
 users or user groups are stored as nodes which are set in relationship with other information objects, whereby the rights are derived via the relations.    
   
   
       2 . Method according to the foregoing  claim 1  wherein the rights are determined by derivation dynamically in relation to the run time.  
   
   
       3 . Method according to  claim 1  wherein a right is defined by r:<o, t, op>, whereby the right is composed of the components of owner, target, and operation, and wherein an owner (o) of the right may or may not be allowed to carry out the operation (op) on a target (t).  
   
   
       4 . Method according to the  claim 3  characterised in that rights are defined positively or negatively.  
   
   
       5 . Method according to  claim 1 , wherein the rights are arranged in a rights tree in the semantic network.  
   
   
       6 . Method according to  claim 1 , wherein the rights are defined in a folder hierarchy, whereby the folder hierarchy comprises the levels of Operation, Owner/user, and Target Object.  
   
   
       7 . Method according to  claim 1 , wherein the rights of an owner is indicated explicitly by referencing of a user or owner group, or by the existence of a relationship between an information object and a user or by the determination of the roles which a user has.  
   
   
       8 . Method according to  claim 1 , wherein the target is determined explicitly or by a search query.  
   
   
       9 . Method according to  claim 1 , wherein rights which have concordant components share these components by referencing with one another.  
   
   
       10 . Method according to  claim 1  wherein during the examination as to whether a user may carry out an operation on an information object, all the part trees of the rights tree are run through for as long as required until the response from a part tree provides a positive answer; by contrast, if no part tree is found, the response is negative.  
   
   
       11 . Data structure for the deposition of digital rights in a semantic network consisting of nodes and edges, whereby the nodes for represent information objects and the edges represent semantic relations, 
 wherein users or groups are stored as nodes, which are set in relationship with other information objects via the data structure, and whereby the rights are derived via the relations.    
   
   
       12 . Data structure according to  claim 11 , wherein the right is defined by r:<o, t, op>, whereby the right is composed of the components of owner, target, and operation, whereby an owner o of the right may or may not be allowed to carry out the operation op on a target t, whereby the data structure provides a memory area for the direct or indirect deposition, in particular by means of pointers.  
   
   
       13 . (canceled)  
   
   
       14 . Data carrier comprising a data structure which allows the running of the method according to  claim 1 , when loaded into a computer.  
   
   
       15 . Data carrier comprising a data structure according to  claim 11.