Example of structure

Below is an example structure, which will be used as a basis for discussing the rules of defining rights in the DataGuard module.

The rights can be defined on the level of internal nodes and leaf hosts. Rights effective for leaf nodes are calculated in the following manner: the subsequent nodes, starting from the leaf towards the root (in the present case - Everyone), are searched until the first node with assigned rights is found. These rights will be valid for the leaf node.

Please consider the fact that the given computer can belong to several different maps. In the present situation, this is the case of user Tomek whose workstation belongs to two maps: Support and Testers. In this case the effective rights are calculated on each path to the root, and the logical sum of calculated rights is considered as valid. In other words, if the right effective for any path allows for action in the given category, such action will also be allowed for the considered leaf node.

Workstation	Effective rights	Description
Aga		No rights. Effective right is calculated on the basis of affiliation to group Everyone.
Krystian		No right to execute files. Rights result from affiliation to group Programmers.
Tymoteusz		No writing and executing rights. Rights result from affiliation to group Junior Programmers.
Tomek		No right to execute files. Tomek belongs to two groups with defined rights: Support and Testers. In this case, the sum of their rights is taken into consideration.
Darek		Full rights, assigned individually.