JP2008052531A - Tracking system, tracking method and tracking program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a tracking system, a tracking method and a tracking program, retrieving time information and ID information distributively stored in each computer connected to a network, and performing tracking. <P>SOLUTION: A computer 20 receives a retrieval target ID and a retrieval target time range, and transmits a retrieval request to a computer of an adjacent network. The computer having received the retrieval request retrieves whether a corresponding record is present inside its own database or not, and transmits a retrieval result to the computer 20 of a retrieval request source. The computer 20 produces a time table from the retrieval result received from the computer of a retrieval request destination. A representative request is transmitted to a computer of a database having a record that is a final record of the time table to request retrieval. The computer performed with the representative request transmits the retrieval request to the computer of the adjacent network, gathers the retrieval results, and transmits it to the computer 20. The computer 20 receives a final result, and displays a movement line. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a tracking system, a tracking method, and a tracking program, and in particular, a tracking system, a tracking method, and a tracking for searching by tracking ID information and time information distributed and stored in each computer connected to a network. Regarding the program.

  An example of a conventional tracking system is described in Patent Document 1 as a “searched object tracking system”. This system monitors a mobile object to be searched equipped with a non-contact type wireless IC tag, a number of tag reading sensors installed to read information recorded on the wireless IC tag, and each tag reading sensor. And a monitoring center that operates as follows.

  The tag reading sensor detects a wireless IC tag mounted on the moving body, reads information, and transmits information on the read moving body to the monitoring center. The monitoring center receives the information regarding the moving body transmitted from the tag reading sensor, and stores the received information regarding the moving body in the management database. The monitoring center displays the current position information of the moving body equipped with the wireless IC tag detected by the tag reading sensor from the received information on the moving body on the monitoring screen of the monitoring display device. In addition, the monitoring center records and accumulates the received current position information of the moving body and time information of the time when the information about the moving body is received in the management database. Then, the log information relating to the search for the specified arbitrary moving body is edited and output, and the log information is plotted on the map information and edited and output.

JP 2005-83781 A

  However, the conventional tracking system represented by the search target tracking system described above has a problem that it does not have expandability and openness.

  The reason is that the conventional tracking system is used to search for location information on a fixed route such as collection and delivery, and to display the movement route of a person within a specific building or land. Because.

  An object of the present invention is to provide a tracking system, a tracking method, and a tracking program that solve the above-described conventional problems.

  In the first tracking system of the present invention, each of a plurality of computers reads ID information from a tracked object, and stores the ID information and time information at which the ID information is read in a database connected to the own apparatus. A database registration means is provided, and a representative computer of the plurality of computers inputs ID information and time range information, searches the database connected to the own apparatus using them as search conditions, and the corresponding information is A search unit that stores the time information and the location information of the computer as a search result in a storage area, and a search request transmission unit that transmits the search condition to another computer of the plurality of computers, if present And receiving time information as a search result and position information of the other computer from the other computer, A search result receiving means for storing in a storage area, wherein the other computer receives the search condition from the representative computer and searches the database connected to the own apparatus, and the corresponding information exists. Comprises search result transmission means for transmitting the time information and the position information of the own computer as a search result to the representative computer.

  The second tracking system of the present invention is a search result processing means in the first tracking system, wherein the representative computer rearranges the search results stored in the storage area based on the time information to create a time table. It is provided with.

  According to a third tracking system of the present invention, in the second tracking system, the representative computer includes flow line creation means for creating and outputting flow line information of the tracked object based on the time table. It is characterized by.

  According to a fourth tracking system of the present invention, in the second or third tracking system, the representative computer determines a new representative computer from the plurality of computers based on the time table, and determines the new representative computer. It is characterized by comprising a representative request transmission means for transmitting a representative request notification and operating as a representative computer.

  According to a fifth tracking system of the present invention, in the tracking system according to any one of the first to fourth aspects, the search request transmission unit is configured to have a hop count from a network to which the representative computer is connected among the plurality of computers. The search condition is transmitted to another computer connected to the network within 1.

  In the first tracking method of the present invention, each of a plurality of computers reads ID information from a tracked object, and stores the ID information and time information at which the ID information is read in a database connected to the own apparatus. A database registration step and a representative computer of the plurality of computers inputs ID information and time range information, searches the database connected to the own device using them as search conditions, and the corresponding information exists. If so, a search step for storing the time information and the position information of the own computer as a search result in a storage area, and the representative computer transmits the search condition to another computer among the plurality of computers. A search request transmission step, and the other computer receives the search condition from the representative computer. A search result transmitting step of searching the database connected to the own device and transmitting the time information and the location information of the own computer to the representative computer as a search result when corresponding information exists, and the representative The computer includes a search result receiving step of receiving time information as a search result from the other computer and position information of the other computer and storing the received information in the storage area.

  The second tracking method of the present invention is a search result processing step in which, in the first tracking method, the representative computer rearranges the search results stored in the storage area based on the time information to create a time table. It is characterized by including.

  According to a third tracking method of the present invention, in the second tracking method, the representative computer includes a flow line creation step of creating and outputting flow line information of the tracked object based on the time table. Features.

  According to a fourth tracking method of the present invention, in the second or third tracking method, the representative computer determines a new representative computer from the plurality of computers based on the time table, and determines the new representative computer. It includes a representative request transmission step of transmitting a representative request notification and operating as a representative computer.

  According to a fifth tracking method of the present invention, in the tracking method according to any one of the first to fourth aspects, the search request transmission step includes the number of hops from the network to which the representative computer is connected among the plurality of computers. The search condition is transmitted to another computer connected to the network within 1.

  The first tracking program of the present invention reads the ID information from the tracked object, stores the ID information and the time information at which the ID information is read in a database connected to the own device, and the ID information. And the time range information are input, and the database connected to the own device is searched using them as a search condition. If the corresponding information exists, the time information and the location information of the own computer are searched. As a search process to be stored in a storage area, a search request transmission process for transmitting the search condition to another computer, and the other computer searches the database connected to the other computer according to the search condition. When there is information to be searched, the time information and the position information of the other computer are searched from the other computer. Characterized in that to perform a search result receiving process to be stored in the storage area to receive the result, to the computer.

  The second tracking program of the present invention causes the computer to perform search result processing for creating a time table by rearranging the search results stored in the storage area based on the time information in the first tracking program. It is characterized by.

  A third tracking program of the present invention is characterized in that, in the second tracking program, a computer performs a flow line generation process for generating and outputting flow line information of the tracked object based on the time table. To do.

  The fourth tracking program of the present invention determines a representative computer based on the time table, transmits a representative request notification to the representative computer, and performs processing performed by the second or third tracking program on the representative computer. It is made to perform.

  According to a fifth tracking program of the present invention, in the tracking program according to any one of the first to fourth aspects, the search request transmission process is connected to a network having a hop count within one from a network to which the own computer is connected. The search condition is transmitted to another computer.

  The present invention has an effect that a tracking system having expandability and openness can be realized. The reason is that the next representative computer is determined based on the search result, and the search is performed in the search network range related to the determined next representative computer.

  The present invention is characterized by searching and tracking ID information (identification information) of a tracked object recorded for each time in a distributed database, and making it a flow line.

  Hereinafter, the configuration of the best mode for carrying out the present invention will be described in detail with reference to the drawings.

  Referring to FIG. 1, the first embodiment of the present invention includes databases (DB) 10 to 16, computers 20 to 26 operating under program control, and networks 1 and 2 connecting them. .

  A computer 20, a computer 21, a computer 22, and a computer 23 are connected to the network 1. The computer 20 connects the database 10, the computer 21 connects the database 11, the computer 22 connects the database 12, and the computer 23 connects the database 13.

  A computer 24, a computer 25, and a computer 26 are connected to the network 2. The computer 24 connects the database 14, the computer 25 connects the database 15, and the computer 26 connects the database 16.

  The network 1 and the network 2 are connected by a relay device such as a router (not shown).

  As shown in FIG. 2, a record including ID information (identification information) and time information (time stamp) of the tracked object is registered in the database 10. ID information and time information are integrated and encrypted and registered as one field. The other databases 11 to 16 have the same configuration.

  The configuration of the computer 20 will be described with reference to FIG. The other computers 21 to 26 have the same configuration.

  The computer 20 is an information processing device such as a server device that operates under program control, and includes a search request receiving unit 2001, a search unit 2002, a search result storage unit 2003, a search request transmitting unit 2004, and a search request receiving unit 2005. A search result transmission unit 2006, a search result reception unit 2007, a search result processing unit 2008, a position information storage unit 2009, a database registration unit 2010, a representative determination unit 2011, a representative request transmission unit 2012, a representative Request receiving means 2013 and flow line creating means 2014 are included.

  The search request receiving unit 2001 receives a search request input by an operator from an input device (not shown) such as a keyboard, and stores the received search request in a storage unit (not shown). The search request includes a search condition, and the search condition includes a search target ID and a search target time range (start time and end time). Then, the search request receiving unit 2001 extracts a search condition from the stored search request, and delivers the extracted search condition to the search unit 2002 and the search request transmission unit 2004.

  The search unit 2002 receives the search condition from the search request reception unit 2001, searches the database 10 with the received search condition, and checks whether there is a record that matches the search condition. If there is a matching record, the time information is stored in the search result storage unit 2003 as a search result. Details of the operation of the search means 2002 will be described later.

  The search result storage unit 2003 stores the search result (time information) acquired by the search unit 2002 and the position information (latitude information, longitude information) of the own computer. Also, the IP address information of the search request destination computer is stored. The search result storage unit 2003 of the initial representative computer stores the search result received from each representative computer and the position information (latitude information, longitude information) of the search destination computer.

  The search request transmission unit 2004 broadcasts a search request including a search condition to an adjacent computer, and requests the adjacent computer to perform a search. In the present example, the adjacent computer refers to a computer connected to a network having up to 1 hops. A network with a hop count of up to 1 may be referred to as a search network range.

  The search request receiving means 2005 receives and stores the search request transmitted from the search request source computer, extracts the search condition, and delivers it to the search means.

  The search result transmission unit 2006 reads the search result (time information) from the search result storage unit 2003 and transmits it to the search request source computer together with the position information of the own computer.

  The search result receiving means 2007 receives the search result (time information) transmitted from the search request destination computer and the position information of the search request destination computer. At this time, the IP address information of the search request destination computer is acquired. Then, the received search result and location information and the acquired IP address information of the search request destination computer are stored in the search result storage unit 2003.

  The search result processing unit 2008 reads the search result (time information), the position information, and the IP address information from the search result storage unit 2003, sorts the information by the time information, and creates a time table.

  In the position information storage unit 2009, position information (latitude information, longitude information) where the computer is located is stored in advance. The location information for storing can be acquired using, for example, GPS (Global Positioning System). Since a method for acquiring position information using GPS is well known, description thereof is omitted.

  The database registration unit 2010 reads ID information attached to the tracked object (including a person) and registers the read ID information in its own database. At this time, the time information is read from a time mechanism (not shown), and the time information (time stamp) is registered together with the ID information. The time information is represented by the year, month, day, hour and minute. When registering in the database, the ID information and time information (time stamp) are integrated and encrypted as one field, and the encrypted data is registered in the database. For example, a hash value is calculated from the ID information and time information (time stamp) by a hash function and encrypted. As an example of the database registration unit 2010, ID information may be stored in an RFID tag, the RFID tag may be attached to a tracked object, and the ID information may be read by an RFID tag reader.

  The representative determining unit 2011 reads the last record (the record with the latest time information) from the time table. Then, the computer existing at the position indicated by the position information of the record is determined as the next representative computer.

  The representative request transmission unit 2012 transmits a representative request to the IP address indicated by the IP address information on the last record of the time table (the record with the latest time information).

  The representative request receiving unit 2013 receives and stores the representative request from the initial representative computer 20 or the immediately preceding representative computer, and recognizes that the own computer operates as the representative computer. Then, the search condition included in the representative request is extracted and sent to the search request transmission means.

  The flow line creation unit 2014 extracts time information and position information from the time table when a series of searches is completed. Then, according to the extracted time information and position information, a position (point) indicated by the position information is marked, a flow line is created by connecting the marked points, and displayed on a display device (not shown). The map information may be stored in advance, the map information may be read out, marked at the point indicated by the position information on the map information, and the flow line may be displayed superimposed on the map information.

  Here, the operation modes of the computers 20 to 26 will be described.

  The computers 20 to 26 operate as either an initial representative computer, a representative computer, or a general computer depending on the situation at that time.

  The initial representative computer is a computer that has received a search request input from an operator. The initial representative computer requests an adjacent computer to perform a search, and receives a search result from each computer. The next representative computer is determined from the received search result, and a search is requested. In this example, the computer 20 is an initial representative computer.

  The representative computer is a computer that receives a representative request from the initial representative computer or the immediately preceding representative computer, requests an adjacent computer to search, and collects the search results. The representative computer receives the search result from the search request destination computer, determines the next representative computer from the received search result, and transmits the representative request. Further, the search result received from the search request destination computer is transmitted to the initial representative computer.

  The general computer is a computer that receives a search request from an initial representative computer or a representative computer and executes a search. The general computer returns the search result to the initial representative computer or the representative computer that is the search request source.

  Next, the operation of the first exemplary embodiment of the present invention will be described in detail with reference to the drawings.

  First, operations of the initial representative computer, the representative computer, and the general computer will be described.

  First, the operation of the initial representative computer (computer 20) will be described with reference to FIG.

  The search request receiving unit 2001 receives a search request input by an operator from an input device (not shown) such as a keyboard, and stores the received search request in a storage unit (not shown). Then, when a search request is received from an input device (not shown), it recognizes that its own computer 20 operates as an initial representative computer. The search request includes a search condition, and the search condition includes a search target ID and a search target time range (start time and end time). The search request receiving unit 2001 extracts search conditions included in the search request and sends them to the search unit 2002 and the search request transmission unit 2004.

  The search unit 2002 searches the database 10 based on the received search condition, and checks whether there is a record that matches the search condition. If there is a matching record, the time information is stored in the search result storage unit 2003 as a search result. Further, the position information (latitude information and longitude information) of the computer 20 is read from the position information storage unit 2009 and the position information is also stored in the search result storage unit 2003. FIG. 6A shows an example of records stored in the search result storage unit 2003.

  The search request transmission unit 2004 broadcasts a search request including a search condition to an adjacent computer to request a search.

  The search result receiving means 2007 receives the search result (time information) and the position information of the search request destination computer (search computer) from the search request destination computer. At this time, the IP address of the search request destination computer is acquired. The received search result and position information and the acquired IP address of the search request destination computer are stored in the search result storage unit 2003.

  The search result processing unit 2008 sorts the records in the search result storage unit 2003 by time information and creates a time table.

  The representative determining unit 2011 reads the last record (the record with the latest time information) from the time table. Then, the computer existing at the position indicated by the position information of the record is determined as the next representative computer. FIG. 7 shows an example of determining the next representative computer.

  The representative request transmission unit 2012 transmits a representative request to the IP address indicated by the IP address information on the last record of the time table (the record with the latest time information).

  The flow line creation unit 2014 extracts time information and position information from the time table when a series of searches is completed. Then, according to the extracted time information and position information, the points indicated by the position information are marked, a flow line is created by connecting the marked points, and displayed on a display device (not shown).

  Next, the operation of the general computer (computer 2n) will be described with reference to FIG.

  The search request receiving means 2n05 receives and stores search conditions from the initial representative computer 20 or the representative computer 2m, and sends the search conditions to the search means 2n02.

  The search means 2n02 searches the database 1n based on the received search condition, and checks whether there is a record that matches the search condition. If there is a matching record, the time information is stored in the search result storage unit 2n03 as a search result. FIG. 6B shows an example of a record stored in the search result storage unit 2n03.

  The search result transmission unit 2n06 reads the search result from the search result storage unit 2n03 and returns the search result to the initial representative computer 20 or the representative computer 2m that is the search request source. At this time, the position information (latitude information and longitude information) of the computer 2n is read from the position information storage unit 2n09, and the read position information is also transmitted at the same time. If there is no record that matches the search condition, the fact that there is no matching record is transmitted.

  Next, the representative computer (computer 2m) will be described with reference to FIG.

  The representative request receiving unit 2m13 receives a representative request from the initial representative computer 20 or the immediately preceding representative computer, and recognizes that the own computer 2m operates as the representative computer. Then, the search condition included in the representative request is extracted and sent to the search request transmission unit 2m04.

  The search request transmission unit 2m04 broadcasts search conditions to adjacent computers and requests a search.

  The search result receiving means 2m07 receives the search result (time information) and the position information of the search request destination computer (search computer) from the search request destination computer. At this time, the IP address of the search request destination computer is acquired. The received search result and position information and the acquired IP address of the search request destination computer are stored in the search result storage unit 2m03. FIG. 6C shows an example of a record stored in the search result storage unit 2m03.

  The search result processing unit 2m08 sorts the records in the search result storage unit 2m03 according to time information and creates a time table.

  The search result transmission unit 2m06 reads the search result (time information) and the position information from the search result storage unit 2m03 and transmits them to the initial representative computer 20.

  The representative determining unit 2m11 reads the last record (the record with the latest time information) from the time table. Then, the computer existing at the position indicated by the position information of the record is determined as the next representative computer. FIG. 7 shows an example of determining the next representative computer.

  The representative request transmission unit 2m12 transmits a representative request to the IP address indicated by the IP address information on the last record of the time table (the record with the latest time information).

  Next, the operation of the first embodiment of the present invention will be described in detail with reference to FIG. 1, FIG. 4, FIG. 5, and FIG. In this description, the computer 20 is an initial representative computer.

  Referring to FIG. 8, the search request receiving means 2001 of the computer 20 (initial representative computer) receives the search target ID and the search target time range (start time and end time) (step A01).

  The search request transmission unit 2004 transmits a search condition including the search target ID and the search target time range to the computers 21 to 26 in the adjacent networks (network 1 and network 2) (step A02).

  The search means 2002 calculates a hash value from the ID and the time (time stamp) within the corresponding time range, and integrates the ID and the time (time stamp) to encrypt them as one field (step A03).

  Whether or not the encrypted data exists in the own database (database 10) is searched, and if there is a record including the encrypted data, the time stamp (time information) at that time is stored (steps A04 to A05). .

  The search request receiving means 2n05 of the computers 21 to 26 receives the search request (step A21).

  The search means 2n02 calculates a hash value from the ID and the time stamp within the corresponding time range, and integrates the ID and the time stamp to encrypt them as one field (step A22).

  It is searched whether the encrypted data exists in its own database (database 1n), and if there is a record including the encrypted data, the time stamp (time information) at that time is stored (step A23).

  The search result transmitting means 2n06 transmits the search result (time information) and the position information of the computer 2n to the search requesting computer 20 (step A24), and returns to the idle state (step A25).

  The search result receiving means 2007 of the computer 20 receives and stores the search result and the position information of the search request destination computer 2n from the search request destination computers 21 to 26 (step A06).

  The search result processing unit 2008 merges and sorts the search results to create a time table for the search target ID (step A07).

  The representative determining unit 2011 determines the computer of the database having the record that is the last record of the time table as the next representative computer. In order to delegate the representative computer to the computer, the representative request transmitting unit 2012 transmits a representative request to the determined computer to request a search after the last record time (step A08). In this example, the computer 22 is determined as the next representative computer.

  The flow line creation unit 2014 displays the search results up to the present as a flow line, and the computer 20 enters an idle state (step A09).

  The representative request receiving means 2213 of the computer 22 receives the request for delegated delegate (step A26).

  A search request (including a search condition including a search target ID and a search target time range) is transmitted from the network 1 and the network 2 or other computer to the network having a certain metric number (step A27).

  Thereafter, steps A03 to A08 are performed as the representative computer, and the result is transmitted to the initial representative computer 20.

  The initial representative computer (computer 20) receives the final result and displays a flow line (step A10).

  Further, the operation of the present invention will be described with reference to the drawings.

  A person to be tracked wearing a wireless tag including an ID value stops at each point where the computer is installed, and sensed time information together with the sensed ID value is registered in a database connected to the computer. To do.

  In the description with reference to the configuration diagram of FIG. 9A, the computer a is an initial representative computer. The search target time range is “09: 0 to 17:00”, and the search target ID is “ID-a”. In FIG. 9A, a computer having a database that does not include the search target ID “ID-a” is not shown.

  First, the computer a transmits a search request requested by the user to a computer in the search network range a to request a search. Each computer that has received the search condition searches its own database and transmits the search result to the computer a as the search request source. The computer a receives the search results from each search request destination computer, merges the received search results, and sorts them by time information to create a time table a (see FIG. 10A). Then, the computer (computer h) of the database having the record that becomes the last record of the time table a is determined as the next representative computer, and a representative request is transmitted to request a search after the last record time (after 12:15). .

  Next, the computer h sets the search target time range to 12:16 to 17:00, sends a search condition to the computers in the search network range b, and requests a search. Each computer that has received the search condition searches its own database and transmits the search result to the computer h as a search request source. The computer h receives the search results from each search request destination computer, merges the received search results, and sorts them by time information to create a time table b (see FIG. 10B). Then, the computer (computer p) of the database having the record that becomes the last record of the time table b is determined as the next representative computer, and a representative request is transmitted to request a search after the last record time (after 15:00). . In addition, the computer h transmits a search result within the search network range b to the computer a.

  Next, the computer p requests the search by transmitting the search condition to the computers in the search network range c by setting the search target time range to 15:01 to 17:00. Each computer that has received the search condition searches its own database and transmits the search result to the computer p as a search request source. The computer p receives the search results from each search request destination computer, merges the received search results, and sorts them by time information to create a time table c (see FIG. 10C). Then, the computer (computer u) of the database having the record that becomes the last record of the time table c is determined as the next representative computer, and a representative request is transmitted to request a search after the last record time (after 16:15). . In addition, the computer p transmits a search result within the search network range c to the computer a.

  Next, the computer u makes a search request by transmitting a search condition to a computer in the search network range d with a search target time range of 16:16 to 17:00. Each computer that has received the search condition searches its own database and transmits the search result to the computer u as the search request source. The computer u receives the search results from each search request destination computer and recognizes that there is no target search result. The computer u transmits to the computer a that there is no search result and that the search has been completed by reaching the end time 17:00 of the search target time range.

  Next, the computer a merges and sorts the search results received from the representative computers, and creates a final time table (see FIG. 10D) of the search results. Then, the computer a displays the flow line of the search target ID “ID-a” with reference to the final time table (see FIG. 11A).

  Next, the operation flow of the search means will be further described. That is, step A03 to step A04 and step A22 to step A23 in FIG. 8 will be described in more detail.

  Referring to FIG. 12, first, a search condition including an ID value and a time range is received (step 02-1).

  The ID value and the initial time of the time range (09:00 in the example of FIG. 12) are integrated and encrypted as one field to generate encrypted data (step 02-2). For example, a hash value is calculated from the ID value and time (time stamp) and encrypted. Hereinafter, the generated encrypted data is referred to as a generated value. The time may be referred to as a time stamp.

  The generated value is compared with the DB value of the database (DB value-1 to DB value-n in the example of FIG. 12) (step 02-3).

  If there is a match (Yes in Step 02-4), the time stamp at that time is stored in the search result storage unit (Step 02-5), and the process proceeds to Step 02-6. For example, if the time stamp is 09:03 and the generated value matches the DB value-2, “09:03” is stored.

  If there is no match (No in Step 02-4), the process proceeds to Step 02-6.

  Increment the time stamp (step 02-6). For example, if the time stamp 09:00 is incremented, it becomes 09:01.

  When the time stamp that has been implemented does not exceed the final time (09:59 in the example of FIG. 12) (No in Step 02-7), the ID value and the time stamp are integrated and encrypted as one field. Data is generated (step 02-8), and the process returns to step 02-3.

  If the time stamp that has been included exceeds the final time (09:59 in the example of FIG. 12) (Yes in step 02-7), the search is terminated.

  Next, effects of the first exemplary embodiment of the present invention will be described.

  The first effect is that it is possible to construct a tracking system that is scalable and has a high degree of freedom in scalability. The reason is that the next representative computer is determined based on the search result, and the search is performed in the search network range related to the determined next representative computer.

  The second effect is that a search can be performed while protecting the information registered in the database. This is because the ID value registered in the database and the time information are integrated and the encrypted value is compared with the value specified in the search condition while being encrypted.

  The third effect is that the load is distributed. The reason is that the representative computer collects the search results in the search network range and transmits only necessary information to the initial representative computer.

  Next, a second embodiment of the present invention will be described in detail with reference to the drawings. The second embodiment is a form in which the search process is performed at a higher speed than the first embodiment.

  The second embodiment differs from the first embodiment in the database, database registration means, and search means. A database, database registration means, and search means different from the first embodiment will be described.

  As shown in FIG. 13, a record including ID information (identification information), time information (time stamp), and time order information is registered in the database. ID information and time information are integrated and encrypted and registered as one field. Also, the time order information may be encrypted and registered.

  The database registration means reads the ID information attached to the tracked object (including a person) and registers the read ID information and the read time information (time stamp) in the database. The time information is expressed by year, month, day, hour, and the like, and is acquired from a time mechanism (not shown). At this time, the time order information is also registered. For example, if the read time is 09:38 (09:38), “09 hours” is registered as time order information. When registering in the database, ID information and time information (time stamp) are integrated and encrypted as one field, and the encrypted data is registered in the database. Further, the time order information may be encrypted and registered.

  The search means receives the search condition from the search request reception means, searches the extracted file (extracted file will be described later) with the received search condition, and checks whether there is a record that matches the search condition. If there is a matching record, the time information is stored in the search result storage unit as a search result.

  Further, details of the operation of the search means will be described.

  Referring to FIG. 14, first, a search condition including an ID value and a time range is received (step B2-1).

  Time order information is created from the time range specified by the search condition (step B2-2). In the example of FIG. 14, since the time range is 09:00 to 09:59, the time order information of time is “09 o'clock”.

  The database is searched for the order information at the time of creation, and a record including the order information at the time of creation is extracted to create an extraction file (step B2-3). In the example of FIG. 14, record-3 and record-4 including “09 o'clock” as time order information are extracted from the database to create an extraction file.

  The ID value and the initial time of the time range (09:00 in the example of FIG. 14) are integrated and encrypted as one field to generate encrypted data (step B2-4). For example, a hash value is calculated from the ID value and time (time stamp) and encrypted. Hereinafter, the generated encrypted data is referred to as a generated value.

  The generated value is compared with the DB value of the extracted file (DB value-3 to DB value-4 in the example of FIG. 14) (step B2-5).

  If there is a match (Yes in step B2-6), the time stamp at that time is stored in the search result storage unit (step B2-7), and the process proceeds to step B2-8. For example, if the time stamp is 09:03 and the generated value matches the DB value -4, “09:03” is stored.

  If there is no match (No in step B2-6), the process proceeds to step B2-8.

  The time stamp is incremented (step B2-8). For example, if the time stamp 09:00 is incremented, it becomes 09:01.

  When the time stamp that has been implemented does not exceed the final time (09:59 in the example of FIG. 14) (No in step B2-9), the ID value and the time stamp are integrated and encrypted as one field for encryption. Data is generated (step B2-10), and the process returns to step B2-5.

  If the time stamp that has been included exceeds the final time (09:59 in the example of FIG. 14) (Yes in step B2-9), the search is terminated.

  The effect of the second embodiment of the present invention is that search processing can be performed at a higher speed while maintaining the strength of encryption for each database. The reason is that a record related to the time range specified by the search condition is extracted from the database, and the extracted record is searched.

  Next, a third embodiment of the present invention will be described. The third embodiment is a form in which search processing is performed more efficiently than in the first embodiment.

  The third embodiment is different from the first embodiment in that search condition limiting means is added as a component of the computer. The added search condition limiting means will be described.

  The search condition limiting unit limits the search condition passed from the search request receiving unit, and delivers the limited search condition to the search unit and the search request transmission unit. Further, the search condition delivered from the representative request receiving means is limited, and the limited search condition is delivered to the search request transmitting means.

  Limiting the search condition means limiting the time range specified in the search condition in a certain increment (for example, in units of one hour).

  For example, the operation when “09:00 to 16:59” is specified in the time range of the search condition by the search request receiving means will be described. The time limit is 2 hours.

  First, the search condition limiting unit limits the time range of the search condition passed from the search request receiving unit to “09: 00-10: 59”, and delivers the limited search condition to the search unit and the search request transmission unit. Each search means searches the database under limited search conditions and transmits the search result to the initial representative computer (step C-1).

  When the search target ID does not exist as a result of Step C-1, the search condition limiting unit limits the time range of the search condition to “11: 0 to 12:59” and sets the limited search condition to the search unit and Deliver to search request transmission means. Each search means searches the database under limited search conditions and transmits the search result to the initial representative computer (step C-2).

  If the search target ID exists as a result of step C-2, the search result processing means creates a time table, and the representative determining means determines the next representative computer from the time table. The representative request transmitting means transmits a representative request to the determined next representative computer (step C-3). Subsequent processing is performed by the next representative computer thus determined.

  The effect of the third embodiment of the present invention is that the search process can be performed more efficiently. The reason is that a search condition limiting means for limiting the time range of the search condition is provided, the search is performed for each limited time range, and if the search target ID exists, the next representative computer is determined. .

  Furthermore, another embodiment of the present invention will be described.

  In the embodiment described above, the ID value and time information are encrypted using a hash function common to each database. However, as another embodiment, a hash function unique to each database may be used. Good. Thereby, the encryption strength can be further maintained against hacking to each database.

  In the above-described embodiment, authentication for a person who inputs a search request (searcher) is not specified. However, as another embodiment, PKI (Public Key Infrastructure) or the like is used for searcher authentication. You may make it introduce. This makes it possible to introduce a search method according to the authenticated authority.

  The present invention was originally devised for the purpose of tracking victims of kidnapping and abduction. Normally, personal movement information is encrypted and stored in a protected state, but when an incident occurs, it is a system that enables a quick search over a wide range of times. Used in a community where inexpensive and small devices that enable location recording such as wireless tags are scattered in the daily activity range, or in areas where the system of the present invention is introduced for the purpose of crime prevention Is done. In addition, it is considered that the position information search technology can be used in a wide range, and the currently used technology can be replaced or integrated by the technology of the present invention because of its high degree of freedom in scalability.

It is a figure which shows the structural example in the 1st Embodiment of this invention. It is a figure which shows the example of the record information registered into the database in the 1st Embodiment of this invention. It is a figure which shows the structural example of the computer in the 1st Embodiment of this invention. It is a figure explaining operation | movement with the initial stage representative computer and general computer in the 1st Embodiment of this invention. It is a figure explaining operation | movement with the representative computer and general computer in the 1st Embodiment of this invention. It is a figure which shows the example of the record stored in the search result storage part in the 1st Embodiment of this invention. It is a figure explaining the next representative computer determination in the 1st Embodiment of this invention. It is a flowchart which shows the operation | movement in the 1st Embodiment of this invention. It is a figure explaining operation | movement of this invention. It is a figure explaining operation | movement of this invention. It is a figure explaining operation | movement of this invention. It is a flowchart which shows operation | movement of the search means in the 1st Embodiment of this invention. It is a figure which shows the example of the record information registered into the database in the 2nd Embodiment of this invention. It is a flowchart which shows operation | movement of the search means in the 2nd Embodiment of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Network 2 Network 10 Database 11 Database 12 Database 13 Database 14 Database 15 Database 16 Database 1n Database 20 Computer 21 Computer 22 Computer 23 Computer 24 Computer 25 Computer 26 Computer 2m Computer 2n Computer 2001 Search request reception means 2002 Search means 2003 Search result storage Unit 2004 Search request transmission unit 2005 Search request reception unit 2006 Search result transmission unit 2007 Search result reception unit 2008 Search result processing unit 2009 Location information storage unit 2010 Database registration unit 2011 Representative determination unit 2012 Representative request transmission unit 2013 Representative request reception unit 2014 Flow line creation means 2 13 Representative request receiving means 2m03 Search result storage unit 2m04 Search request transmitting means 2m06 Search result transmitting means 2m07 Search result receiving means 2m08 Search result processing means 2m11 Representative determining means 2m12 Representative request transmitting means 2m13 Representative request receiving means 2n02 Search means 2n03 Search results Storage unit 2n05 Search request reception unit 2n06 Search result transmission unit 2n09 Position information storage unit

Claims (15)

Each of multiple computers
It comprises database registration means for reading ID information from the tracked object and storing the ID information and the time information at which the ID information is read in a database connected to the device itself,
A representative computer of the plurality of computers is
The ID information and the time range information are input, and the database connected to the own device is searched using them as search conditions. If the corresponding information exists, the time information and the location information of the own computer are obtained. Search means for storing in a storage area as a search result, search request transmission means for transmitting the search condition to another computer of the plurality of computers, time information as a search result from the other computer, and the other Search result receiving means for receiving computer location information and storing it in the storage area,
The other computer is
Receiving the search condition from the representative computer and searching the database connected to its own device, and when the corresponding information exists, the representative computer uses the time information and the location information of the own computer as a search result. A tracking system characterized by comprising search result transmission means for transmitting to. The tracking system according to claim 1, wherein the representative computer includes search result processing means for creating a time table by rearranging the search results stored in the storage area based on the time information. 3. The tracking system according to claim 2, wherein the representative computer includes flow line creation means for creating and outputting flow line information of the tracked object based on the time table. The representative computer includes a representative request transmission unit that determines a new representative computer from the plurality of computers based on the time table, transmits a representative request notification to the new representative computer, and operates as the representative computer. The tracking system according to claim 2 or 3, wherein The search request transmitting means transmits the search condition to another computer connected to a network having a hop count of 1 or less from the network to which the representative computer is connected among the plurality of computers. The tracking system according to claim 1. A database registration step in which each of the plurality of computers reads the ID information from the tracked object, and stores the ID information and the time information at which the ID information is read in a database connected to the device;
When the representative computer of the plurality of computers inputs ID information and time range information, searches the database connected to the own apparatus using them as search conditions, and when the corresponding information exists, A search step of storing the time information and the location information of the computer in a storage area as a search result;
A search request transmission step in which the representative computer transmits the search condition to another computer of the plurality of computers;
The other computer receives the search condition from the representative computer and searches the database connected to its own device. When there is applicable information, the time information and the location information of the own computer are obtained. A search result transmission step of transmitting to the representative computer as a search result;
A search result receiving step in which the representative computer receives time information as a search result from the other computer and position information of the other computer and stores it in the storage area;
The tracking method characterized by including. The tracking method according to claim 6, further comprising a search result processing step in which the representative computer rearranges the search results stored in the storage area based on the time information to create a time table. 8. The tracking method according to claim 7, further comprising a flow line creating step in which the representative computer creates and outputs flow line information of the tracked object based on the time table. The representative computer includes a representative request transmission step of determining a new representative computer from the plurality of computers based on the time table, transmitting a representative request notification to the new representative computer, and operating as a representative computer. 9. The tracking method according to claim 7, wherein the tracking method is characterized in that: In the search request transmission step, the search condition is transmitted from the network to which the representative computer is connected to another computer connected to a network having a hop count of 1 or less. The tracking method according to claim 6. A database registration process for reading ID information from the tracked object and storing the ID information and time information at which the ID information is read in a database connected to the device;
The ID information and the time range information are input, and the database connected to the own device is searched using them as search conditions. If the corresponding information exists, the time information and the location information of the own computer are obtained. Search processing to store in the storage area as a search result;
A search request transmission process for transmitting the search condition to another computer;
When the other computer searches the database connected to the other computer according to the search condition and the corresponding information exists, the time information and the position information of the other computer are obtained from the other computer. A search result receiving process for receiving as a search result and storing it in the storage area;
A tracking program characterized by causing a computer to perform. 12. The tracking program according to claim 11, further comprising: causing a computer to perform search result processing for rearranging the search results stored in the storage area based on the time information to create a time table. 13. The tracking program according to claim 12, which causes a computer to perform flow line generation processing for generating and outputting flow line information of the tracked object based on the time table. 14. A tracking program that determines a representative computer based on the time table, transmits a representative request notification to the representative computer, and causes the representative computer to perform the processing according to claim 12 or 13. 15. The search request transmission process according to claim 11, wherein the search condition is transmitted from a network to which the local computer is connected to another computer connected to a network having a hop count of 1 or less. Tracking program described in.

Images