JP4616088B2 - Geographic information processing system and geographic information processing program - Google Patents

Description

  The present invention relates to a map information processing system and a map information processing program for managing geographic information as a database, and more particularly to a plurality of records (for example, geographic information) constituting geographic information in a geographic information system (GIS). A geographic information processing system that employs a method of distributing and storing each of a linear record or a planar record) that is a graphic shape type of a record that constitutes a plurality of spatial areas of a predetermined size, and geographic information The present invention relates to a computer program for managing geographic information as a database in a geographic information processing system that employs a method of distributing and storing each of the plurality of records in a plurality of space areas of a predetermined size.

  In GIS, as shown in FIG. 1, for example, a plurality of records constituting geographic information of a 30 km square map space (left side in FIG. 1) (for example, linear records which are graphic shape types of records constituting geographic information) When the distribution record is distributed and stored in a plurality of space areas of a predetermined size, for example, as shown on the right side of FIG. 1, the area is divided into 10 km squares and stored in nine space areas. These spatial regions are called tile maps (files) (general names) in which a wide range of geographic information is divided and stored, and as shown on the right side of FIG. 1, for example, 10 km square Each of the nine spatial regions is called a tile (general name).

  In such “distribution preservation”, it is important to process linear records (roads and rivers) and area records (administrative boundaries, buildings, lakes) across tile boundaries.

  If the conventional method in this process is analyzed, it can be classified into the following three types.

  The first method is the “division method”. In this method, cutting is performed at the boundary between tiles, and the linear record and area record are stored in each tile.

  The second method is the “registration method”. In this method, linear records and area records are stored only in one tile including the start point.

  The third method is the “copying method”. In this method, the same linear record and area record are copied and stored in all straddling tiles.

  Hereinafter, each of the above methods will be illustrated. Assuming that there is a road that straddles two spatial regions as shown in FIG. 2, each method and method will be described for the case where road data (linear records) is stored in the tiles corresponding to this spatial region. To do.

  In the division method, as shown in FIG. 3, the divided linear records are stored in the tile A and the tile B, respectively. For this reason, the process which cut | disconnects the linear record showing a road is required.

  In the real address system, if the starting point of the road is in the space area (tile) A (FIG. 2), a linear record representing the road is stored only in the tile A including the starting point as shown in FIG.

  In the copying method, as shown in FIG. 5, the same linear records representing roads are copied and stored in tile A and tile B, respectively.

  Next, extraction (restoration) of records constituting geographic information from a spatial area (tile) in which linear records representing roads are stored as described above will be described.

  When restoring these records (for example, when simultaneously displaying the range of four adjacent tiles, etc.), restoration of a linear record that crosses the tile boundary is processed for each of the above three methods. .

  In the case of tiles stored in the “division method”, there is no problem even if linear records are displayed on the computer screen as they are, and they appear to be connected. However, when the number of records is obtained, they are counted more than actual. However, it is only necessary to add them when obtaining the length.

  In tiles stored in the “Personal Account” system, linear records that cross a certain tile (linear records whose start and end points are outside the range of the tile) are stored only in the tile where the start point exists. Therefore, if the tile is not opened at the same time, it will not be displayed. For example, as shown in FIG. 6, even if nine adjacent tiles are opened, the linear record indicated by the dotted line in FIG. 6 is not displayed because the start point is outside the range of these nine tiles. Become (deficient). Therefore, the “registration system” can only be applied to those with a limited length.

  The tiles stored in the “copying system” can overcome the above-mentioned deficiencies in the “registration system”, but conversely, duplication of records occurs. Since they do not notice even if they overlap in the display, they can be ignored, but this overlap is unacceptable when determining the length or the number of records.

As described above, each of the conventional methods has drawbacks and advantages. Select one of the methods according to the purpose of using the records that make up the geographic information, I had to create a program for each case to eliminate the shortcomings such as “missing”. In other words, when distributing and storing a plurality of records that constitute geographic information (linear records or area records that are graphic shape types of records that constitute geographic information) in a plurality of space areas (tiles) having a predetermined size. It is necessary to perform the process opposite to that performed in the above step when restoring the original geographical information before being distributed and stored from the information distributed and stored in the plurality of space areas (tiles) having a predetermined size. It was.

JP2004-177959

  As described above, the conventional method of separating processes according to the storage method of records means that geographic information cannot be “databaseed”. A mechanism that allows the target data (records) to be extracted and used simply by following certain query rules is the “data database” programming method, but this has not been achieved.

  In order to “geographically” geographic information, a system can be realized in which linear records and area records across tile boundaries can be extracted as they are without being cut or overlapped. The database system side takes over all these processes, and the user side makes them unnecessary. As a result, it is not necessary for the user side (data utilization program side) to know how linear records and area records across tile boundaries are processed and stored. The existence of the boundary due to being distributed and stored in the space area (tile) of the size of is also forgotten.

  Such processing has not been required for conventional database systems that have dealt only with text and numerical data, and it has become a “map database” of geographic information that must store a continuous and infinite map space. It is an essential and essential function.

  Therefore, the present invention is a geographic information processing system that manages a geographic information including a linear record and a planar record, which are graphic shape types of records, as a database. A geographical information processing system adopting a method of distributing and storing each of a plurality of records constituting the geographic information in a plurality of spatial areas of a predetermined size, and a plurality of the records constituting the geographic information being a plurality of In a computer program for managing geographic information as a database in a geographic information processing system that employs a method of distributing and storing in a spatial area of a predetermined size, the geographical information is stored in a plurality of spatial areas (tiles) of a predetermined size. ) Straddling the boundaries of each spatial area (tile), both when saving and distributing to Specific records and, and the purpose of the areal record Suggest "cut nor not overlap also" Geographic Information System and geographic information processing program.

  The present invention is a geographic information processing system configured to manage, as a database, geographic information including a plurality of records, and each of the plurality of records includes a linear record and a planar record that are graphic shape types of the records. A geographical information processing system adopting a method of distributing and storing each of a plurality of records constituting the geographic information in a plurality of spatial areas of a predetermined size, and each of the plurality of records constituting the geographic information being a plurality of predetermined In a computer program for managing geographic information as a database in a geographic information processing system adopting a method of distributing and storing in a spatial area of a size, each linear record and area record of geographical information distributed and stored in the spatial area It is determined whether or not to be included in a spatial area, and if included in each spatial area, a linear record, If a spatial record is stored in a file corresponding to one spatial area and restored from this, the linear record and the area record of geographical information distributed and stored in the spatial area are not included in each spatial area. , While recognizing this, a plurality of files corresponding to a plurality of spatial regions over which the linear record and the planar record are copied by copying the linear record and the planar record across the plurality of spatial regions When restoring and restoring from here, it is determined whether the linear record and area record to be sent to the restoration process have already been sent to the restoration process, and the linear record that has not yet been sent to the restoration process Only records and area records are sent to the restoration process, and line records and area records that have already been sent to the restoration process are not sent to the restoration process. A filter means for so, by causing the process to allow the operation of the filter means to the computer, it was to solve the above problems.

  According to the geographic information processing system and the geographic information processing program of the present invention, the geographic information includes a plurality of records, and the plurality of records include a linear record that is a graphic shape type of the record and an area record. Information processing system that manages a plurality of records constituting geographic information in a plurality of spatial areas of a predetermined size, and a geographical information processing system In a computer program for managing geographic information as a database in a geographic information processing system adopting a method of distributing and storing each of a plurality of records constituting a plurality of spatial areas of a predetermined size, a plurality of the geographic information Even when distributed and stored in a space area (tile) of a predetermined size, it is taken out and restored Liver, and-linear record across the boundary of each spatial regions (tiles), an areal record can be made to "cut nor not overlap also."

  That is, according to the geographic information processing system and the geographic information processing program of the present invention, the original geographic information before being distributed and stored from the geographical information distributed and stored in a plurality of space areas (tiles) having a predetermined size. In the case of restoring the data, or when the number of data and the attribute aggregation are performed, it is not necessary to consider the data straddling the boundary of the space area (tile).

  In this way, when geographical information is distributed and stored in a plurality of spatial areas (tiles) of a predetermined size, or retrieved and restored, linear records that cross the boundaries of each spatial area (tiles) Since the function of “not cutting or duplicating” a record is executed by the geographic information processing system and the geographic information processing program of the present invention, a plurality of predetermined sizes can be obtained using the geographic information processing system of the present invention. The user who restores the original geographical information before being distributed and saved from the geographical information distributed and stored in the spatial area (tile) is a linear record or a plane record that crosses the boundary of the spatial area (tile). Can be taken out in a form that is neither cut nor duplicated, and the user can use the “Linear record across the boundary of the spatial area (tile), the area record in a form that is not cut or duplicated. Or take out "there is no need to perform special processing for. This not only eliminates the need for the user to know how linear records and area records across the boundary of the spatial area (tile) are processed and stored in the geographic information processing system of the present invention. In addition, it is possible to forget the existence of a boundary due to the geographical information being distributed and stored in a plurality of spatial areas (tiles) having a predetermined size.

  The geographic information processing system of the present invention and the geographic information processing program of the present invention are composed of a plurality of records. The plurality of records include a linear record and a planar record (coordinates of all vertices) that are graphic shape types of the records. A geographic information processing system and a geographic information processing program for managing geographic information including a linear record and a planar record of value strings as a database, each of a plurality of records constituting the geographic information being a plurality of predetermined A method of distributing and storing in a space area of the size of is adopted.

  For example, as shown in FIG. 1, the geographical information (linear record, area record) in a map space of 30 km square (left side of FIG. 1) is divided into a range of 10 km square as shown on the right side of FIG. Distributed and stored in nine spatial areas (tiles), and as shown in FIG. 6, for example, distributed and stored in nine spatial areas (tiles) divided in a range of 10 km square. The original geographical information before being distributed and stored from the geographical information (linear record, area record) is restored.

  Here, the geographic information processing system of the present invention comprising a computer performs the following processing operations under the instruction of the geographic information processing program (computer program) of the present invention, as illustrated in FIG. Record identification value setting means, search means, determination means, first information storage hand, second information storage means, space identification value determination means, first filter means, record identification value storage status determination means, second filter Means and third filter means.

  The record identification value setting means is a processing operation unit of a computer that sets a record identification value for distinguishing each record in a plurality of records constituting geographic information in a record identification field.

  In addition, the search means may include all the spatial areas (tiles) in which linear records or area records in the plurality of records constituting the geographic information are distributed and stored as the plurality of spatial areas (tiles) of the predetermined size. The processing operation unit of the computer obtained from the above.

  The processing operation by this search means is performed as follows, for example.

  First, a minimum rectangular range that completely contains a linear record or a planar record (this is a linear record or a planar record consisting of a coordinate value sequence of all vertices) is obtained. For example, the minimum XY coordinate and the maximum XY coordinate of a linear record or a plane record consisting of a coordinate value sequence of all vertices are obtained, and from this, a linear record or a plane record consisting of a coordinate value sequence of all vertices is obtained. Find the smallest rectangular range that is completely contained. In the case of FIG. 8, a rectangular range in which hatching is drawn in the figure is a minimum rectangular range that completely includes a linear record or a planar record made up of coordinate values of all vertices.

  Next, the search means obtains all the spatial areas (tiles) included in this minimum rectangular range. In the case of FIG. 8, the three spatial areas (tiles) that are hatched in the figure are all the spatial areas (tiles) included in the minimum rectangular range.

  Next, for all the obtained spatial regions (tiles), the search means includes a line (side) connecting a linear record consisting of coordinate value sequences of all vertices or a coordinate value sequence of area records, and a spatial region. Find the intersection with the (tile) boundary.

  As a result, when there is an intersection, the linear record or the planar record is recognized as straddling the adjacent space area (tile) with the boundary line in between.

  On the other hand, when there is no intersection point, the inside / outside determination is performed as to whether or not the start point coordinates of the linear record or the planar record exist in one spatial area (tile). When the start point coordinates of the linear record or the planar record are present in one spatial area (tile), the linear record or the planar record is included in the one spatial area (tile). This means that the record is completely contained.

  It should be noted that the above-described linear record or surface record consisting of the coordinate value sequence of all vertices or the minimum XY coordinate and maximum XY coordinate of the surface record are obtained, and from this, the linear record or surface consisting of the coordinate value sequence of all vertices The processing operation for obtaining the minimum rectangular range completely including the target record and the processing operation for obtaining all the spatial regions (tiles) included in the minimum rectangular range are performed in the same manner. In this case, when the inside / outside determination is performed and the start point coordinates of the linear record or the planar record are not present in one spatial area (tile), the linear record or the planar record is the one spatial area. It exists outside (tile).

  The determination means is a processing operation unit of a computer that determines whether or not the linear record or area record is included in each space area (tile) obtained by the search means. The processing operation is also performed as described above, for example.

  Next, when the linear record or area record is included in one space area, the first information storage unit includes the line record or area record included in one space area. A first spatial identification value indicating that the linear record or area record is included in the file corresponding to the one spatial region in which the linear record or the area record is included. It is a processing operation part of a computer that stores a face record.

  For example, when a linear record or a planar record is included in one spatial area (tile), a logical value “false” called a “duplicate flag” is assigned to the linear record or the planar record as a spatial identification field. To store the linear record or area record in which the first spatial identification value “false” is set in a file in one spatial area containing the line record or area record. Is done.

  The second information storage means indicates that when the linear record or area record is not included in one space area, the line record or area record is not included in one space area. A second spatial identification value is set in the spatial identification field, and the linear record or area record is respectively stored in a plurality of files corresponding to a plurality of spatial areas containing the linear record or area record. A processing operation unit of a computer for copying and storing.

  For example, as shown in FIG. 8, when a linear record is not included in one spatial area (tile), that is, the linear record straddles three spatial areas (tiles) indicated by diagonal lines in FIG. When a static record or a planar record is not included in one spatial area (tile) and exists in a plurality of spatial areas (tiles), a logical value “duplicate flag” for the linear record or planar record “ “True” is set in the space identification field, and the linear record or area record in which the second space identification value “true” is set is represented by a plurality of spatial areas in which the line record or area record is included. A process of copying and saving each of a plurality of files (three spatial areas (tiles) indicated by diagonal lines in FIG. 8) is performed.

  Next, the spatial discriminating value determining means restores the original geographic information from the information stored in the spatial region file, and the linear record or area record stored in the spatial region file is restored. A processing operation unit of a computer for determining whether a space identification value set in the space identification field is a first space identification value (“false”) or a second space identification value (“true”); is there.

  The first filter means uses the first identification value (“false”) as the spatial identification value set in the spatial identification field of the linear record or area record stored in the spatial domain file. Only in some cases, it is a processing operation unit of a computer that sends the record to the process of restoring.

  Therefore, when a linear record or area record is included in one spatial area (tile), the linear record or area record is included in one spatial area (tile) in which the linear record or area record is included. Records or face records are restored.

  The record identification value storage status determination means, when the spatial identification value set in the spatial identification field of the linear record or area record stored in the file of the spatial domain is the second identification value, It is a processing operation unit of a computer that determines whether or not a record identification value set in the record identification field of a linear record or a planar record is already stored in the record identification value storage unit.

  And the second filter means, when the record identification value set in the record identification field of the linear record or area record is not stored in the record identification value storage unit, the record identification value It is a processing operation unit of the computer that stores the record identification value storage unit and sends it to the process of restoring the record.

  On the other hand, the third filter means is a step of restoring the record when the record identification value set in the record identification field of the linear record or the area record is stored in the record identification value storage unit. For example, it is a processing operation unit of a computer that performs processing that is not sent to the computer, for example, processing that destroys the linear record or area record.

  According to the geographic information processing system of the present invention, the linear record and the area record of geographic information distributed and stored in a plurality of space areas (tiles) having a predetermined size are stored in each space by the function of the processing operation unit described above. Whether it is included in an area (tile) or not included, there is no cutting of linear records and area records that straddle the boundary of each spatial area (tile), and multiple If the linear record and the area record of geographical information distributed and stored in a space area (tile) of a predetermined size are not included in each space area (tile), the space area (tile) spans the plurality of space areas (tiles). Although each linear record or area record is copied and saved in a plurality of files corresponding to the plurality of space areas across the line record and area record, each spatial area (task -Linear record across the boundary Le), never overlapping areal record occurs.

  The record identification value storage unit includes a data registration unit (for example, referred to as “ID stack” in the present specification and drawings) provided in the map information processing system of the present invention including a computer. . For example, a hash table can be used as the ID stack. In this case, “store the record identification value in the record identification value storage unit (ID stack)” is a process of registering in the hash table.

  As a result of the processing operation performed by the second information storage means, for example, as shown in FIG. 8, the linear record is not included in one space area (tile), that is, the linear record is hatched in FIG. When straddling the three spatial areas (tiles) shown, a logical value “true” called “overlap flag” is set in the spatial identification field for the linear record, and the second spatial identification value “true” Is a process of copying and saving a linear record set with a plurality of files in a plurality of spatial regions (three spatial regions (tiles) indicated by diagonal lines in FIG. 8) containing the linear record. Done.

  Therefore, when the linear records respectively stored (stored) in the files of the three spatial areas (tiles) indicated by diagonal lines in FIG. 8 are restored, as in the case of the “copying method” in the conventional method described above. When a record is duplicated (three will be restored), the length or the number of records is found.

  However, according to the system of the present invention, as described above, when the record identification value set in the record identification field of the linear record is not stored in the record identification value storage unit (ID stack), the second The filter means stores the record identification value in the record identification value storage unit (ID stack) and sends it to the process of restoring the record, while the record identification value set in the record identification field of the linear record is When stored in the record identification value storage unit (ID stack), the third filter means performs processing not to send to the process of restoring the record. Therefore, there will be no duplicate records.

  As a result, even when restoring the original geographic information before being distributed and stored from the geographical information distributed and stored in a plurality of spatial areas of a predetermined size, or when performing the number of records and attribute aggregation, This eliminates the need to consider any record that straddles the boundary of the spatial area (tile).

  Next, a map information processing program proposed by the present invention causes a computer to execute the above-described geographic information processing system of the present invention, and is composed of a plurality of records. Each of a plurality of records constituting geographic information including a linear record and a planar record (a linear record consisting of a coordinate value sequence of all vertices and a planar record) is a plurality of spatial areas of a predetermined size. In order to manage geographic information as a database in a geographic information processing system that employs a distributed storage system, a computer is used as the record identification value setting means described above, a linear record or a planar record in a plurality of records constituting the geographic information. Search means for finding all the spatial areas in which the distribution is stored from among the plurality of spatial areas of a predetermined size; Determination means for determining whether a linear record or a planar record is included in each spatial area obtained by the search means, first information storage means, second information storage means, spatial identification value determination means , Functioning as first filter means, record identification value storage status judging means, second filter means, and third filter means.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the accompanying drawings.

  The geographic information processing system of the present invention and the geographic information processing program of the present invention are composed of a plurality of records. The plurality of records include a linear record and a planar record (coordinates of all vertices) that are graphic shape types of the records. Management of geographic information including linear records and area records consisting of value strings as a database, and each of a plurality of records constituting the geographic information is distributed to a plurality of spatial areas of a predetermined size. A method of saving is adopted.

  For example, as shown in FIG. 1, the geographical information (linear record, area record) in a map space of 30 km square (left side of FIG. 1) is divided into a range of 10 km square as shown on the right side of FIG. Distributed and stored in nine spatial areas (tiles), and as shown in FIG. 6, for example, distributed and stored in nine spatial areas (tiles) divided in a range of 10 km square. The original geographical information before being distributed and stored from the geographical information (linear record, area record) is restored.

  The geographic information processing system of the present invention comprising a computer performs the following processing operations under the command of the geographic information processing program (computer program) of the present invention, as illustrated in FIG. Record identification value setting means to perform, search means, determination means, first information storage hand, second information storage means, space identification value determination means, first filter means, record identification value storage status determination means, second Filter means and third filter means are provided.

  With reference to FIG. 11, a process of distributing and storing geographic information in a plurality of space areas having a predetermined size by the geographic information processing system of the present invention will be described.

  First, in the geographic information processing system of the present invention, the record identification value setting means discriminates each record in a plurality of records (linear record and area record made up of coordinate value sequences of all vertices) constituting geographic information. The record identification value for this is set in the record identification field.

  Under this, the processing operation is performed as follows.

  First, all spatial areas (tiles) in which linear records or area records in a plurality of records constituting geographic information are distributed and stored by the search means are spatial areas (tiles) of the plurality of predetermined sizes. (Step 1101).

  The processing operation by the search means is performed as follows, for example, as shown in FIG.

  First, a minimum rectangular range that completely contains a linear record or a planar record (this is a linear record or a planar record made up of coordinate values of all vertices) is obtained (step 1201).

  For example, the minimum XY coordinate and the maximum XY coordinate of a linear record or a plane record consisting of a coordinate value sequence of all vertices are obtained, and from this, a linear record or a plane record consisting of a coordinate value sequence of all vertices is obtained. Find the smallest rectangular range that is completely contained.

  In the case of FIG. 8, a rectangular record indicated by a solid line (for example, a linear record corresponding to a road) is included. This is the minimum rectangular range that completely contains a linear record consisting of the coordinate value sequences of all vertices.

  Note that the upper right tile (spatial region) of the four tiles (spatial region) in FIG. 8 of the linear record indicated by the solid line in FIG. 8 (for example, the linear record corresponding to the road). The arrow described in 1 indicates the vertex on the end side of the linear record, and is not a figure as data. A linear record consisting of a coordinate value sequence of all vertices and a planar record consist of a line segment sequence.

  Next, all the spatial regions (tiles) included in this minimum rectangular range are obtained (step 1202). In the case of FIG. 8, the three spatial areas (tiles) that are hatched in the figure are all the spatial areas (tiles) included in the minimum rectangular range.

  Next, for all the obtained spatial regions (tiles), the line (side) connecting the linear record consisting of the coordinate value sequence of all vertices or the coordinate value sequence of the planar record, and the boundary line of the spatial region (tile) The intersection with is obtained (step 1203).

  As a result, when there is an intersection, the linear record or the planar record is recognized as straddling the adjacent space area (tile) with the boundary line in between.

  On the other hand, if there is no intersection, it is determined whether or not the start point coordinates of the linear record or the planar record exist in one spatial area (tile) (step 1204).

  When the start point coordinates of the linear record or the planar record are present in one spatial area (tile), the linear record or the planar record is included in the one spatial area (tile). This means that the record is completely contained.

  On the other hand, when the inside / outside determination is performed and the start point coordinates of the linear record or the planar record are not present in one spatial area (tile), the linear record or the planar record is the one spatial area ( Existing outside the tile).

  It should be noted that the above-described linear record or surface record consisting of the coordinate value sequence of all vertices or the minimum XY coordinate and maximum XY coordinate of the surface record are obtained, and from this, the linear record or surface consisting of the coordinate value sequence of all vertices The processing operation for obtaining the minimum rectangular range completely including the target record and the processing operation for obtaining all the spatial regions (tiles) included in the minimum rectangular range can be performed in accordance with the steps after step 1203 in FIG.

  Next, it is determined by the determining means whether or not the linear record or area record is included in each spatial area (tile) obtained by the searching means (step 1102). This step can also be performed according to the steps after step 1203 in FIG.

  Next, when the linear record or area record is included in one spatial area, the linear information or area record is included in one space area by the first information storage unit. A first spatial identification value indicating that the linear record or area record is included in the file corresponding to the one spatial area containing the linear record or area record. The record is saved (step 1103).

  For example, when a linear record or area record is included in one spatial area (tile), a logical value “false” called “duplicate flag” is set to the first value for the line record or area record. The linear record or area record set in the space identification field by the information storage means and the first space identification value “false” is set as one space in which the line record or area record is included. Save to area file.

  On the other hand, if the linear record or area record is not included in one spatial area, the line information or area record is not included in one space area by the second information storage means. Is set in the spatial identification field, and the linear record or area record is stored in a plurality of files corresponding to a plurality of spatial areas containing the linear record or area record. Are copied and stored (step 1104).

  For example, as shown in FIG. 8, when the linear record represented by a solid line in the figure is not included in one spatial area (tile), that is, the three spatial areas indicated by the diagonal lines in FIG. When a linear record or a planar record exists in a plurality of spatial areas (tiles) without being included in one spatial area (tile), the second information storage means A logical value “true” called “duplicate flag” is set in the space identification field for the record or area record, and the line record or area record in which the second space identification value “true” is set, The data is copied and stored in a plurality of files in a plurality of spatial regions (three spatial regions (tiles) indicated by diagonal lines in FIG. 8) containing the linear record or area record.

  Next, with reference to FIG. 13 and FIG. 9, a process of restoring geographical information distributed and stored in a plurality of space areas of a predetermined size by the geographical information processing system of the present invention will be described.

  When restoring the original geographic information from the information stored in the spatial domain file, first, the spatial identification field of the linear record or area record stored in the spatial domain file is determined by the spatial identification value determination means. It is determined whether the space identification value set to is the first space identification value (“false”) or the second space identification value (“true”) (step 1301).

  And only when the spatial identification value set in the spatial identification field of the linear record or area record stored in the file of the spatial domain is the first identification value (“false”) The filter means sends the record to the restoring process (step 1302).

  That is, when a linear record or area record is included in one spatial area (tile), one record is sent to the record restoration process, and one line record or area record is included. In the space area (tile), the linear record or the area record is restored.

  On the other hand, if the spatial identification value set in the spatial identification field of the linear record or area record stored in the spatial domain file is the second identification value (“true”), the record identification The value storage status determination means determines whether or not the record identification value set in the record identification field of the linear record or area record is already stored in the record identification value storage unit (ID stack). (Step 1303).

  If the record identification value set in the record identification field of the linear record or area record is not stored in the record identification value storage unit (ID stack), the record identification is performed by the second filter means. The value is stored in the record identification value storage (ID stack) and sent to the process of restoring the record (step 1304).

  On the other hand, when the record identification value set in the record identification field of the linear record or area record is stored in the record identification value storage unit (ID stack), the record is recorded by the third filter means. For example, a process for destroying the linear record or the area record is performed (step 1305).

  According to the geographic information processing system of the present invention, as a result of the processing operation performed by the second information storage means, for example, as shown in FIG. 8, a linear record indicated by a solid line in FIG. (Corresponding linear record) is not included in one spatial area (tile), that is, if the linear record straddles three spatial areas (tiles) indicated by diagonal lines in FIG. On the other hand, a logical value “true” called “duplicate flag” is set in the spatial identification field, and a plurality of linear records in which the second spatial identification value “true” is set are included in the linear record. Are copied and stored in a plurality of files in the space area (three space areas (tiles) indicated by oblique lines in FIG. 8) (the “distribution copy” step on the right side of FIG. 7).

  Therefore, when the linear records respectively stored (stored) in the files of the three spatial areas (tiles) indicated by diagonal lines in FIG. 8 are restored, as in the case of the “copying method” in the conventional method described above. When a record is duplicated (three will be restored), the length or the number of records is found.

  However, according to the system of the present invention, as described above, the above-described ID check is performed by the record identification value storage status determination means (shown in the center of FIG. 9) and set in the record identification field of the linear record. When the record identification value being stored is not stored in the record identification value storage unit (ID stack), the second filter means stores the record identification value in the record identification value storage unit (ID stack) and the record Is sent to the process of restoring. On the other hand, if the record identification value set in the record identification field of the linear record is stored in the record identification value storage unit (ID stack), the third filter means restores the record. Do not send. This is a function named “deduplication filter” shown in the center of FIG.

  Therefore, when the function indicated by “distributed copy” on the right side of FIG. 7 described above does not include a linear record indicated by a solid line in FIG. 8 in one space area (tile) as shown in FIG. As shown in the right side of FIG. 9, the linear record includes a plurality of files in a plurality of spatial areas (three spatial areas (tiles) indicated by diagonal lines in FIG. 8) in which the linear record is included. In spite of being copied and stored respectively, only the one record that has been distributed and copied by the above-described deduplication and deduplication filter functions is sent to the restoration process as shown on the left side of FIG. And records are not duplicated.

  As a result, the geographic information processing system of the present invention (shown as “map database” in FIG. 7) is accessed as shown in FIG. 7, and a conventionally known data utilization program A (computer program for data graphic display). Alternatively, the user (displayed as “client” in FIG. 7) distributes and stores in a plurality of space areas of a predetermined size by using a conventionally known data utilization program B (computer program for data attribute aggregation). Regardless of whether or not to restore the original geographical information before being distributed and stored from the geographical information that is stored, or when counting the number of records and attribute aggregation, all records that cross the boundaries of the spatial area (tile) are considered. There is no need to do it.

  As described above, according to the present invention, it is possible to realize a system in which linear records and planar records that straddle tile boundaries can be extracted as they are without being cut or overlapped, and geographic information can be “databaseed”. Then, as shown on the right side of FIG. 7, the database system side takes over all of these processes, and the user side shown on the left side of FIG. 7 can make these processes unnecessary. As a result, it is not necessary for the user side (data utilization program side) to know how linear records and area records across tile boundaries are processed and stored. The existence of the boundary due to being distributed and stored in the space area (tile) of the size of is also forgotten.

  The information stored in the record identification value storage unit (ID stack) can be cleared only when a person using the system of the present invention instructs, for example.

  According to the geographic information processing system and the geographic information processing program of the present invention described above, for example, as shown in FIG. 8, when a linear record is not included in one spatial area (tile), that is, When straddling three spatial regions (tiles) indicated by diagonal lines in FIG. 8, as a result of the processing operation performed by the second information storage unit, a logical value “duplicate flag” for the linear record “ “True” is set in the space identification field, and a linear record in which the second space identification value “true” is set is represented by a plurality of spatial regions (3 indicated by hatching in FIG. 8). Since a process of copying and saving each of a plurality of files in one space area (tile) is performed (so-called “distributed copying”), the amount of data stored in the database is larger than the actual amount.

  Compared with a disk system (RAID system) that stores data twice in order to avoid data destruction, this amount is small and is not particularly problematic.

  However, in order to avoid duplicate data as much as possible, the following method can be adopted.

  In this method, the size (width and height) of the tile map is determined in consideration of the spatial spread depending on the type of linear record and area record.

  For example, tiles that store prefectural boundaries (area records) can be tile sizes that can include the entire Japanese archipelago. In addition, the tile for storing the municipality boundaries can be sized at the prefecture level (for example, 50 km). Furthermore, it can be said that the size of the ledger drawing size (400 m × 300 m) is suitable for the tile storing the sewer pipe (linear record).

  In other words, the tile size is determined so that there is as little duplicate data as possible (the direction in which the tile size increases), and the tile size is determined so that the amount of data stored in one tile is as small as possible (the direction in which the tile size decreases). ) The decision is made taking into account both ways of thinking.

  By optimizing the tile size as described above, the geographic information processing system of the present invention becomes efficient, the data delivered to the client is averaged to be approximately equal, and a certain response time is guaranteed.

The figure explaining the state which distributes and preserve | saves the geographical information of a wide map space in the space area | region of several predetermined magnitude | sizes. The figure explaining the linear record (road) which straddles two adjacent space area | regions. FIG. 3 is a diagram for explaining a case where the linear record shown in FIG. 2 is distributed and stored in two spatial areas by a conventional “division method”. The figure explaining the case where the linear record of FIG. 2 illustration is distributed and preserve | saved to two space area | regions by the conventional "registrant system". FIG. 3 is a diagram for explaining a case where the linear record shown in FIG. 2 is distributed and stored in two space areas by a conventional “copying method”. The figure explaining the state which a "missing" arises when restoring the linear record distributed and preserve | saved by the conventional "primary registration system" in the several space area | region of predetermined magnitude | size. The conceptual diagram explaining the condition where a user utilizes geographic information using the geographic information processing system of this invention. The figure explaining the process which distributes and preserve | saves the linear record straddling a several space area | region (tile) to the file of a some space area | region (tile) using the geographic information processing system of this invention. When linear records straddling a plurality of spatial areas (tiles) are distributed and stored in a plurality of spatial area (tile) files, the geographic information processing system of the present invention uses the multiple spatial area (tile) files. The figure explaining the process by which the original linear record is decompress | restored from the information currently distributed and stored. The figure explaining the outline of the system configuration | structure of the geographic information processing system of this invention. The flowchart explaining an example of the process by which geographic information is distributed and preserve | saved in the several space area | region of the predetermined magnitude | size by the geographic information processing system of this invention. The flow figure explaining an example of the process by which all the tiles in which the linear record or area record contained in geographic information exists by the search means in the geographic information processing system of this invention are calculated | required from several tiles. The flowchart explaining an example of the process by which the geographical information distributed and preserve | saved to the several space area of the predetermined | prescribed magnitude | size is restored | restored by the geographical information processing system of this invention.

Claims (2)

In a geographic information processing system that manages geographic information as a database, the geographic information processing system adopts a method of distributing and storing each of a plurality of records constituting the geographic information in a plurality of spatial areas of a predetermined size,
A record identification value setting means for setting a record identification value for distinguishing each record in a plurality of records constituting the geographic information in a record identification field;
Search means for obtaining all spatial areas in which linear records or area records in a plurality of records constituting geographic information are distributed and stored from among the plurality of spatial areas of a predetermined size,
Determining means for determining whether the linear record or the area record is included in each spatial region obtained by the search means;
When the linear record or area record is included in one spatial area, a first spatial identification value indicating that the linear record or area record is included in one space area is set. First information storage means for setting the spatial identification field and storing the linear record or area record in a file corresponding to the one spatial area containing the linear record or area record;
If the linear record or area record is not included in one spatial area, a second spatial identification value indicating that the linear record or area record is not included in one space area is A second record that is set in the space identification field and is copied and stored in a plurality of files corresponding to a plurality of spatial areas in which the line record or area record is included. Information storage means;
When restoring the original geographic information from the information stored in the spatial domain file, the spatial identification value set in the spatial identification field of the linear record or area record stored in the spatial domain file A space identification value determination means for determining whether is a first space identification value or a second space identification value;
Only when the spatial identification value set in the spatial identification field of the linear record or area record stored in the spatial domain file is the first spatial identification value, the record is sent to the step of restoring the record. A first filter means;
If the spatial identification value set in the spatial identification field of the linear record or area record stored in the spatial domain file is the second spatial identification value, the line record or area record Record identification value storage status determination means for determining whether or not a record identification value set in the record identification field is already stored in the record identification value storage unit;
When the record identification value set in the record identification field of the linear record or area record is not stored in the record identification value storage unit, the record identification value is stored in the record identification value storage unit And a second filter means for sending the record to the process of restoring,
Third filter means not sending to the step of restoring the record when the record identification value set in the record identification field of the linear record or area record is stored in the record identification value storage unit When,
Geographic information processing system comprising Said computer for managing geographic information as a database in the geographic information processing system, a computer employing the method of distributing store each of the plurality of records configuring the geographic information to the space areas of the plurality of predetermined size,
A record identification value setting means for setting a record identification value for distinguishing each record in a plurality of records constituting the geographic information in a record identification field;
Search means for obtaining all spatial areas in which linear records or area records in a plurality of records constituting geographic information are distributed and stored from among the plurality of predetermined spatial areas,
Determination means for determining whether or not the linear record or the area record is included in each spatial region obtained by the search means,
When the linear record or area record is included in one spatial area, a first spatial identification value indicating that the linear record or area record is included in one space area is set. First information storage means for setting the spatial identification field and storing the linear record or area record in a file corresponding to the one spatial area containing the linear record or area record;
If the linear record or area record is not included in one spatial area, a second spatial identification value indicating that the linear record or area record is not included in one space area is A second record that is set in the space identification field and is copied and stored in a plurality of files corresponding to a plurality of spatial areas in which the line record or area record is included. Information storage means,
When restoring the original geographic information from the information stored in the spatial domain file, the spatial identification value set in the spatial identification field of the linear record or area record stored in the spatial domain file A space identification value determining means for determining whether is a first space identification value or a second space identification value;
Only when the spatial identification value set in the spatial identification field of the linear record or area record stored in the spatial domain file is the first spatial identification value, the record is sent to the step of restoring the record. First filter means,
If the spatial identification value set in the spatial identification field of the linear record or area record stored in the spatial domain file is the second spatial identification value, the line record or area record A record identification value storage status determination means for determining whether a record identification value set in the record identification field is already stored in the record identification value storage unit;
When the record identification value set in the record identification field of the linear record or area record is not stored in the record identification value storage unit, the record identification value is stored in the record identification value storage unit And a second filter means for sending to the process of restoring the record,
Third filter means not sending to the step of restoring the record when the record identification value set in the record identification field of the linear record or area record is stored in the record identification value storage unit ,
Geographic information processing program to function as

Images