Access management method, information processing device, program, and recording medium
To appropriately access various portions of a concealed graph while suppressing a processing load. Provided is an access management method in which a computer including a control unit performs access management of a graph comprising nodes and directed links between the nodes. The control unit determines, in response to an attempt to access a node N, whether a completeness condition, which indicates that complete access information that is access information with which it is possible to access the node N can be obtained, is satisfied, by combining pieces of access information which have been acquired before accessing the node N. The control unit permits access to the node N from a node M when the completeness condition is satisfied. The control unit suspends access to the node N from the node M when the completeness condition is not satisfied.
1. An access management method in which a computer including a control unit performs access management of a graph comprising nodes and directed links between the nodes, wherein
the control unit:
determines, in response to an attempt to access a node N, whether a completeness condition, which indicates that complete access information that is access information with which it is possible to access the node N is available, is satisfied, by combining pieces of access information which have been acquired before accessing the node N;
permits access to the node N when the completeness condition is satisfied; and
suspends access to the node N when the completeness condition is not satisfied.
2. The access management method according to claim 1 , wherein
permitting the access involves:
generating the complete access information from one or more pieces of access information when the completeness condition is satisfied; and
revealing information contained in the node N by using the complete access information.
3. The access management method according to claim 1 , wherein
when a virtual node containing multiple nodes is formed, writing and reading of data to the virtual node is performed by one single communication.
4. The access management method according to claim 1 , wherein
permitting the access involves:
restricting, when rights description data on a right of data user who uses information contained in the node N is obtained, use of the information contained in the node N, on the basis of the rights description data.
5. The access management method according to claim 1 , wherein
the control unit further:
generates a node O;
generates a link NO; and
appends, to the link NO, access information that is available on the basis of the completeness condition.
6. An information processing device that performs access management of a graph comprising nodes and directed links between the nodes, the device comprising:
a determining unit that determines, in response to an attempt to access a node N, whether a completeness condition, which indicates that complete access information that is access information with which it is possible to access the node N is available, is satisfied, by combining pieces of access information which have been acquired before accessing the node N;
a permitting unit that permits access to the node N when the completeness condition is satisfied; and
a restricting unit that suspends access to the node N when the completeness condition is not satisfied.
7. A computer-readable non-transitory recording medium comprising program for causing a computer to execute access management of a graph comprising nodes and directed links between the nodes, the program causing the computer to execute the processes of:
determining, in response to an attempt to access a node N, whether a completeness condition, which indicates that complete access information that is access information with which it is possible to access the node N is available, is satisfied, by combining pieces of access information which have been acquired before accessing the node N;
permitting access to the node N when the completeness condition is satisfied; and
suspending access to the node N when the completeness condition is not satisfied.