Mode of a solution of the task of parallel demand processing to databases
С.В. Osievsky
Annotations languages:
The model of Petri for the analysis of inquiries in a database is given. The algorithm for construction a tree of accessible of a network of Petri is offered. The comparison with algorithm Little is carried out.
Reference:
Osievskii, S.V. (2002), “Sposob resheniia zadachi parallelnoi obrabotki zaprosov k bazam dannykh”, Information Processing Systems, Vol. 5(21), pp. 197-204.
Osievskii, S.V. (2002), “Sposob resheniia zadachi parallelnoi obrabotki zaprosov k bazam dannykh”, Information Processing Systems, Vol. 5(21), pp. 197-204.