Method and device for managing project by using data filtering
Disclosed are a method and device for managing a project by using data filtering. A project is efficiently operated by dividing a project based on a minimum unit task and designing a plurality of child projects connected in sequential order such that a plurality of child projects proceed in order.
1. A project management method, which is performed by a project management device connected with task processing terminals via a network, the method comprising:
transmitting, via the network, source data of an n-th child project among a plurality of child projects connected in sequential order to a first task processing terminal and requesting, via the network, the first task processing terminal to process the n-th child project, wherein ‘n’ is a natural number;
performing, by a processor, a first update on data attribute information associated with the n-th child project based on a processing request for the n-th child project;
receiving, via the network, result data that is a processing result of the n-th child project from the first task processing terminal, in response to the request;
storing, by the processor, the result data of the n-th child project at a specific location in a hardware memory, and generating location information including an address value of the specific location;
recording, by the processor, the location information at a result pointer of the n-th child project by changing a value of the result pointer of the n-th child project from a garbage value or null value to an address value corresponding to the location information;
recording, by the processor, the location information at a source pointer of an (n+1)-th child project among a plurality of child projects by changing a value of the source pointer of the (n+1)-th child project from another garbage value or null value to the address value corresponding to the location information;
performing, by the processor, a second update on the data attribute information associated with the n-th child project based on the received result data;
filtering, by the processor, the result data of the n-th child project based on the data attribute information on which the second update is performed;
performing, by the processor, a third update on the data attribute information associated with the n-th child project based on the filtered result data;
obtaining, by the processor, the result data stored at the location indicated by the source pointer of the (n+1)-th child project as source data of a (n+1)-th child project among the plurality of child projects, based on the data attribute information on which the third update is performed;
transmitting, via the network, the source data of the (n+1)-th child project to a second task processing terminal and requesting the second task processing terminal to process the (n+1)-th child project;
performing, by the processor, a fourth update on data attribute information associated with the (n+1)-th child project based on a processing request for the (n+1)-th child project,
wherein each of the plurality of child projects includes one or more tasks, and is divided depending on a type of a task included in each of the plurality of child projects, and
wherein each of the tasks indicates a minimum unit task to be processed by a task processing terminal; and
processing, by the processor, a cost payment for processing of the n-th child project to the first task processing terminal is after result data of the (n+1)-th child project is received from the second task processing terminal by the project management device;
when the project management device receives a processing-impossibility selection for the (n+1)-th child project from the second task processing terminal, requesting, by the project management device, the first task processing terminal to re-process the n-th child project instead of the cost payment for the processing of the n-th child project.
2. The method of claim 1 , wherein the data attribute information is updated as the plurality of child projects are processed depending on the order, and includes a final unit task ID, a processing status, a filtering status, and a filter pass list.
3. The method of claim 2 , wherein, in the first update, the final unit task ID is updated from a null value to an ID related to the n-th child project, and the processing status is updated from the null value to a value indicating “progress”, and
wherein, in the second update, the final unit task ID is maintained as the ID related to the n-th child project, and the processing status is updated from the value indicating “progress” to a value indicating “completion”.
4. The method of claim 3 , wherein the filtering includes:
when the processing status is updated to the value indicating “completion”, performing the filtering by determining that the received result data of the n-th child project satisfies a filtering target condition.
5. The method of claim 4 , wherein, when a (n−1)-th child project and a (n−2)-th child project are connected in parallel in a previous order of the n-th child project, the filtering includes:
when both a processing status for the (n−1)-th child project and a processing status for the (n−2)-th child project are updated to the value indicating “completion”, performing the filtering by determining that result data of the (n−1)-th child project and result data of the (n−2)-th child project satisfy the filtering target condition.
6. The method of claim 2 , wherein the filtering includes:
when the received result data is the result data of the n-th child project having a previous order of the (n+1)-th child project, determining that a filter condition for a corresponding result data is verified; and
when the received result data is result data of another child project, which does not have the previous order of the (n+1)-th child project, determining that a filter condition for a corresponding result data is not verified.
7. The method of claim 6 , wherein, in the third update, when it is determined that the filter condition is verified, the filtering status is updated from a false value to a true value, and the filter pass list is updated to include a filter ID related to the (n+1)-th child project,
wherein the selecting of the result data includes:
when the filter ID related to the (n+1)-th child project is included in the filter pass list, determining that the received result data of the n-th child project satisfies a task target data condition, and selecting the received result data as the source data of the (n+1)-th child project.
8. The method of claim 7 , wherein the selecting of the result data includes:
when the (n+1)-th child project is connected in parallel to a (n+2)-th child project among the plurality of child projects in a next order of the n-th child project,
even when both the filter ID related to the (n+1)-th child project and a filter ID related to the (n+2)-th child project are included in the filter pass list, determining that the received result data of the n-th child project satisfies the task target data condition, and selecting the received result data as the source data of the (n+1)-th child project and source data of the (n+2)-th child project.
9. The method of claim 2 , wherein, in the fourth update, the final unit task ID is updated from an ID related to the n-th child project having a previous order to an ID related to the (n+1)-th child project, and the processing status is updated from a value indicating that processing of the n-th child project having a previous order is completed, to a value indicating that the (n+1)-th child project is in progress.
10. A non-transitory computer-readable recording medium storing a program combined with a computer being a piece of hardware to execute the method of claim 1 .
11. A project management device using data filtering, the project management device connected with task processing terminals via a network, and comprising:
a communication unit;
a memory including at least one process for project management using data filtering; and
a processor operating the at least one process,
wherein the processor is configured, based on the at least one process, to:
transmit, via the network, source data of an n-th child project among a plurality of child projects connected in sequential order to a first task processing terminal and request, via the network, the first task processing terminal to process the n-th child project, wherein ‘n’ is a natural number;
perform a first update on data attribute information associated with the n-th child project based on a processing request for the n-th child project;
receive, via the network, result data that is a processing result of the n-th child project from the first task processing terminal, in response to the request;
store, in the memory, the result data of the n-th child project at a specific location in a hardware memory, and generating location information including an address value of the specific location;
record, in the memory, the location information at a result pointer of the n-th child project by changing a value of the result pointer of the n-th child project from a garbage value or null value to an address value corresponding to the location information;
record, in the memory, the location information at a source pointer of an (n+1)-th child project among a plurality of child projects by changing a value of the source pointer of the (n+1)-th child project from another garbage value or null value to the address value corresponding to the location information;
perform a second update on the data attribute information associated with the n-th child project based on the received result data;
filter the result data of the n-th child project based on the data attribute information on which the second update is performed;
perform a third update on the data attribute information associated with the n-th child project based on the filtered result data;
obtain the result data stored at the location indicated by the source pointer of the (n+1)-th child project as source data of a (n+1)-th child project among the plurality of child projects, based on the data attribute information on which the third update is performed;
transmit, via the network, the source data of the (n+1)-th child project to a second task processing terminal and request the second task processing terminal to process the (n+1)-th child project;
perform a fourth update on data attribute information associated with the (n+1)-th child project based on a processing request for the (n+1)-th child project,
wherein each of the plurality of child projects includes one or more tasks, and is divided depending on a type of a task included in each of the plurality of child projects, and
wherein each of the tasks indicates a minimum unit task to be processed by a task processing terminal;
process a cost payment for processing of the n-th child project to the first task processing terminal is after result data of the (n+1)-th child project is received from the second task processing terminal by the project management device; and
when the project management device receives a processing-impossibility selection for the (n+1)-th child project from the second task processing terminal, request the first task processing terminal to re-process the n-th child project instead of the cost payment for the processing of the n-th child project.