JP2009208904A - Distribution history management system and method for managing/retrieving distribution history - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To securely and efficiently perform management and retrieval of commercial products by link information. <P>SOLUTION: Commodity history information 10 collects node lists from all sites and holds only link information with respect to each commodity node (parent node link, parent site link). A management/retrieval server 20 extracts a terminal of a graph in accordance with presence/absence of the link information when holding data having a flat structure by processes A-D, and performs comparison, presence confirmation and duplication removal of IDs during this extraction to extract a most ancestral node. After refinement based on node type conditions, by addition of another names, comparison, presence confirmation and duplication removal of IDs, a most ancestral node is extracted within a range satisfying the conditions. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a system for managing distribution history of products and the like, and a distribution history management / search method.

  The distribution history management (traceability) system allows you to check the history, whereabouts, location, composition and content of products, and the history of changes and changes later. In general, products and products such as industrial products, foods, and pharmaceuticals Products, parts, materials, etc. are identified individually (individually) or for each lot so that historical information can be referenced across procurement, processing, production, distribution, sales, disposal, etc.

  In this system, a bar code or the like has been used for individual identification of “things”, but recently, an IC tag (RFID) is expected. In history information management, the distribution history of products in a site (distributor) is stored in a database as product information including IDs indicating individual products and ID-parent-child relationship history information, and the history of parent-child relationships is traced. Thus, a distribution history such as the raw material manufacturer and sales destination of the designated product can be obtained (see, for example, Patent Documents 1 and 2).

  In the merchandise history information management shown in FIG. 7, the distribution history in the site is held as graph structure data for each site. In the figure, the direction of the arrow indicates a parent, that is, a distribution source or a raw material. When expressing this, in order to simplify the process and not to deepen the hierarchical structure, instead of having the parent-child hierarchical relationship as the data structure as it is, links are made to each product node as shown in FIG. Only information (parent node link, parent site link) is retained, and each node has a flat (not a hierarchical tree structure) as a simple set. In addition to the parent-child link, the delivery information between the sites holds only the site information as the transportation history information, and the product ID is common between the sites (this is represented by broken line arrows in FIG. 7). The most ancestor node in the site has no parent.

  When crossing multiple sites, a plurality of connected graphs can be created, but when expressing the entire node data, the inter-site portion is identified by the same ID and does not hold special data. This data retention method is standard in the EU fisheries traceability standard TraceFish.

  If there is transportation history information, you can search for ancestor products across sites by querying the database for the site indicated there, but that site may not return a response. May be unable to obtain an ancestor node, and may be the most ancestor node even if there is a transportation history.

Although it is possible to manage node data of multiple sites together with a single server, it is managed separately for each site as described above, and the transportation and manufacturing processes are clearly divided by expressing transportation history information between sites, You can share the processing.
JP 2004-342096 A JP 2006-318144 A

  As in Patent Document 1, when managing node data of a plurality of sites with one server, the number of data handled by the server may become too large, which may cause a problem in response time.

  Hereinafter, a case where data is managed for each of a plurality of sites will be considered. Here, for the purpose of obtaining information on raw materials and harvested information, it is necessary to trace the parent of the graph structure and search for all nodes that have no parent and are the most ancestor locally. There can be a plurality of ancestors for one item (node).

  A site can communicate with each site, and information on the site can be obtained by making a request to the site. This allows you to trace the history of the site, but if you have multiple sites, there are multiple graphs, but the connected part has no parent-child relationship (only parent site information), and everything is connected in a parent-child relationship. It is not possible to simply follow the parent (there is no parent link, only the site containing the parent is known).

  For this reason, it is only necessary to provide the node data with the link information between the sites as the parent information. However, the parent information is expressed only by the ID, and a plurality of nodes crossing the sites cannot be distinguished because they have the same ID. .

  Therefore, it is necessary to change the data schema, distinguish the data by site information and ID, hold the site and ID in the parent information, or keep linked secret information between sites as link information different from the parent information. Don't be. However, when the data schema is determined as an industry standard and cannot be changed (such as TraceFish), this cannot be dealt with.

  An object of the present invention is to provide a distribution history management system and a distribution history management / retrieval method in which merchandise management and search based on link information is reliable and efficient.

  In order to solve the above-mentioned problems, the present invention extracts the end of a graph based on the presence or absence of link information when the graph structure is held as flat structure data, and in this extraction, compares IDs, confirms existence, and eliminates duplicates. The most ancestor node is extracted, and after narrowing down by the node type condition, the ancestor node is extracted in the range that meets the condition by adding and comparing aliases, checking for existence, and removing duplicates. It is characterized by the following system and method.

(1) The distribution history of products in each site is managed as product information including IDs indicating individual products and parent-child history information of IDs, and the distribution history of designated products is searched based on the history information. Distribution history management system,
A means for collecting node lists from all sites and creating all node lists;
Means for searching for an ancestor node without a parent by examining the presence or absence of a parent link for the entire node list;
Means for extracting, from the ancestor nodes having no parent, a node having the same ID and no parent in the list;
Means for deleting duplicate nodes with the same ID across the sites;
It is provided with.

(2) The distribution history of products in each site is managed as product information including IDs indicating individual products and parent-child history information of IDs, and the distribution history of designated products is searched based on the history information. Distribution history management system,
A means for collecting node lists from all sites and creating all node lists;
Means for narrowing down all node lists by type, deleting different types, and naming the node as an alias to the parent of the deleted node;
Of the nodes narrowed down by the type, means for deleting a node having no parent but having the same ID as the parent node;
Of the nodes narrowed down by the type, means for deleting a node that exists even if the parent is an alias;
Means for deleting a node having the same ID across the sites among the deleted nodes; and
It is provided with.

(3) The distribution history of products in each site is managed as product information including IDs indicating individual products and parent-child history information of IDs, and the distribution history of designated products is searched based on the history information. Distribution history management / search method,
Collecting node lists from all sites and creating all node lists;
Searching for an ancestor node without a parent by examining the presence or absence of a parent link for the entire node list; and
Extracting from the list of ancestor nodes without a parent that a node with the same ID and a parent is not in the list;
Deleting duplicate nodes with the same ID across the sites;
It is provided with.

(4) The distribution history of products in each site is managed as product information including IDs indicating individual products and parent-child history information of IDs, and the distribution history of designated products is searched based on the history information. Distribution history management / search method,
Collecting node lists from all sites and creating all node lists;
Narrowing down all node lists by type, deleting different types, and naming the node as an alias to the parent of the deleted node;
Deleting a node that has the same ID as the parent node, but has no parent among the nodes narrowed down by the type;
Of the nodes narrowed down by the type, the step of deleting a node whose parent is an alias, and
A step of deleting, among the deleted nodes, a node in which nodes with the same ID across sites overlap;
It is provided with.

  As described above, according to the present invention, when the graph structure is held with flat structure data, the end of the graph is extracted based on the presence or absence of link information, and in this extraction, ID comparison and existence confirmation, duplication removal, Since the most ancestor node is extracted, and after narrowing down by node type condition, ID alias addition and comparison, existence confirmation, duplicate removal, the ancestor node is extracted within the range that meets the condition, so link Product management and search by information is reliable and efficient.

  Specifically, all the ancestor nodes can be locally extracted (terminal search) in a flat data structure in which data having graph structure information is held only by parent link information. In addition, in the data across a plurality of sites, the link state can be collectively held by holding only the link information in the parent direction of each node at each site. Furthermore, in the data across a plurality of sites, end information can be collectively collected by collecting link information of each site, extracting ends by this, and removing unnecessary nodes by ID. Furthermore, by narrowing down according to the type of node, it is possible to perform a terminal search in a node that matches the type.

(Embodiment 1)
FIG. 1 is a configuration diagram of a distribution history management system showing the present embodiment. As in FIG. 7, the product history information 10 collects a node list from each site A, B, C and holds only link information (parent node link, parent site link) for each product node. Stored in the database as a flat data structure.

  The management / search server 20 executes management of the product history information 10 having the above-described data structure and searches by the processes A to D, and stores data and search results necessary for the management and execution in the database 30. Enable its use.

  FIG. 2 shows a search flow of a terminal ancestor node having no parent by the processes A to D, and the processing state in each process is shown in FIG. Each processing A to D is as follows.

  (Processing A and B) In order to search for an ancestor node without a parent (a node that is locally the most ancestor), first, a node without a parent (link information) is extracted as a complement. This can be extracted by collecting a node list from all sites (servers), initializing the parent list (S1, S2), and examining the presence or absence of parent links for all nodes in the site (S3, S3). S4).

  (Process C) The result list extracted in the above processes A and B is held at the site where the search is performed. However, this alone will also extract products that cross sites. Therefore, a node having the same ID and no parent in the list is further extracted (S5). This eliminates nodes that are only transported between sites.

  (Process D) Since the nodes with the same ID across the sites may be duplicated up to the process C, the duplicate IDs are deleted (S6, S7).

Therefore, according to this embodiment,
(Processing A and B) In a flat data structure in which data having graph structure information is held only with parent link information, all ancestor nodes can be locally extracted (terminal search).

  (Processing C) In the data across a plurality of sites, the link state can be held together by holding only the link information in the parent direction of each node at each site.

  (Process D) In the data across a plurality of sites, the end information can be collectively searched by collecting link information of each site, extracting the end by this, and removing unnecessary nodes by ID.

(Embodiment 2)
FIG. 4 is a search flow according to this embodiment. In the present embodiment, the search is performed for the end ancestor without a parent including the narrowing by type, the narrowing processing state by type is shown in FIG. 5, the processing state of the end ancestor search without parent is shown in FIG. Each of these processes A to E is as follows.

  (Processing A, S11) As shown in FIG. 6, a node list is collected from each site and an all node list is created.

  (Processing B, S12) All node lists are narrowed down by type, and items of different types are deleted. When searching by node type (product attributes, etc.), you can narrow down all nodes by type, but if you want to search for the most ancestor of those types (Figure 5) Simple filtering by type for all nodes (product c is searched as an ancestor because there is no parent of product c in the example of FIG. 5), or narrowing down after searching for ancestors (FIG. 5). In the example, the product g is not searched because it is not an ancestor). Therefore, first, nodes with different types of refinement are deleted. At this time, the node name is given as an alias to the parent of the deleted node. This creates a link relationship packed with deleted nodes.

  (Processing C, S13) A node having no parent but having the same ID as the parent node is deleted. As a result, the transported nodes are excluded (partly).

  (Processing D, S14) Delete a node that exists even if the parent is an alias. This excludes intermediate nodes that are not ancestors.

  (Processing E, S15) Since the node having the same ID across sites may be duplicated only by the above process D, the duplicated ID is deleted.

  (S16) The search results are output as a list.

  In the present embodiment, in addition to the effect of carrying, it is possible to narrow down according to the type of node, and to perform end search within the node that matches the type.

The block diagram of the distribution log | history management system which shows Embodiment 1 of this invention. Search flow for end ancestor nodes with no parent. Search processing status of the terminal ancestor node that has no parent. The search flow of the terminal ancestor node without a parent which shows Embodiment 2 of this invention. Narrow down by type. Search processing status of end ancestors without parents to narrow down by type. Product history information management status. Flat data structure.

Explanation of symbols

10 Product History Information 20 Management / Search Server 30 Database

Claims (4)

Distribution history for managing distribution history of products in each site as product information including IDs indicating individual products and parent-child history information of IDs, and searching distribution history of specified products based on the history information A management system,
A means for collecting node lists from all sites and creating all node lists;
Means for searching for an ancestor node without a parent by examining the presence or absence of a parent link for the entire node list;
Means for extracting, from the ancestor nodes having no parent, a node having the same ID and no parent in the list;
Means for deleting duplicate nodes with the same ID across the sites;
A distribution history management system characterized by comprising: Distribution history for managing distribution history of products in each site as product information including IDs indicating individual products and parent-child history information of IDs, and searching distribution history of specified products based on the history information A management system,
A means for collecting node lists from all sites and creating all node lists;
Means for narrowing down all node lists by type, deleting different types, and naming the node as an alias to the parent of the deleted node;
Of the nodes narrowed down by the type, means for deleting a node having no parent but having the same ID as the parent node;
Of the nodes narrowed down by the type, means for deleting a node that exists even if the parent is an alias;
Means for deleting a node having the same ID across the sites among the deleted nodes; and
A distribution history management system characterized by comprising: Distribution history for managing distribution history of products in each site as product information including IDs indicating individual products and parent-child history information of IDs, and searching distribution history of specified products based on the history information Management / search method,
Collecting node lists from all sites and creating all node lists;
Searching for an ancestor node without a parent by examining the presence or absence of a parent link for the entire node list; and
Extracting from the list of ancestor nodes without a parent that a node with the same ID and a parent is not in the list;
Deleting duplicate nodes with the same ID across the sites;
A distribution history management / retrieval method characterized by comprising: Distribution history for managing distribution history of products in each site as product information including IDs indicating individual products and parent-child history information of IDs, and searching distribution history of specified products based on the history information Management / search method,
Collecting node lists from all sites and creating all node lists;
Narrowing down all the node lists by type, deleting different types, and naming the node as an alias to the parent of the deleted node;
Deleting a node that has the same ID as the parent node, but has no parent among the nodes narrowed down by the type;
Of the nodes narrowed down by the type, the step of deleting a node whose parent is an alias, and
A step of deleting, among the deleted nodes, a node in which nodes with the same ID across sites overlap;
A distribution history management / retrieval method characterized by comprising:

Images