WO2016095749A1

WO2016095749A1 - Method and device for querying spatial object and establishing spatial index of electronic map

Info

Publication number: WO2016095749A1
Application number: PCT/CN2015/097021
Authority: WO
Inventors: 贾双成; 叶旻
Original assignee: 高德软件有限公司
Priority date: 2014-12-18
Filing date: 2015-12-10
Publication date: 2016-06-23
Also published as: CN105786822A; CN105786822B

Abstract

A method and device for querying spatial objects and establishing a spatial index of electronic map, the method comprising: obtaining a binary combination ID of a to-be-queried spatial object; the binary combination ID comprises a level indication bit representing a belonging level of the to-be-queried spatial object in the spatial index, and comprises an initial ID representing a belonging grid of the spatial object in said level (101); according to the level indication bit in the binary combination ID, determining the belonging level of the to-be-queried spatial object in the spatial index (102); according to the initial ID in the binary combination ID, determining the belonging grid of the to-be-queried spatial object in the level represented by the level indication bit (103); querying the to-be-queried spatial object in the determined gird (104). The method can improve query efficiency for the spatial object.

Description

Method and device for querying spatial object and establishing spatial index in electronic map

This application claims the priority of the Chinese Patent Application filed on Dec. 18, 2014, the Chinese Patent Office, Application No. 201410799760.3, entitled "Method and Apparatus for Querying Space Objects and Establishing Spatial Index in Electronic Maps", the entire contents of which is hereby incorporated by reference. This is incorporated herein by reference.

Technical field

The present invention relates to the field of geographic information systems, and in particular, to a method and apparatus for querying spatial objects and establishing spatial indexes in an electronic map.

Background technique

The wide application of satellite positioning technology and Internet technology has driven the development of navigation and location service related industries. The need for location services provided by geographic information systems is becoming more and more urgent. For example, positioning by an electronic map, retrieving the position of a spatial object, and the like. For the retrieval of electronic map data, it is necessary to establish a spatial index of the spatial object. The so-called spatial object refers to the spatial entity represented in the electronic map. For example, a building can be a spatial object, and a road can be a spatial object. A spatial object can also represent a collection of spatial entities, such as several storefronts within a certain area or multiple buildings within a certain area. Spatial objects can be distinguished from other spatial objects by configuring a unique spatial object identifier such as number 1, 2, 3, etc. in the electronic map. A spatial index refers to a data structure arranged in a certain order according to the position and shape of a spatial object or a certain spatial relationship between spatial objects.

In electronic maps, quadtree spatial indexing is a widely used spatial indexing mechanism. The basic idea of quadtree spatial indexing is to recursively divide geospatial into tree structures of different levels. It divides the geographical space of the known range into four equal subspaces. If necessary, divide at least one subspace into four equal subspaces. So recursively, until the level of the tree reaches a certain depth or after some requirements are met, the segmentation is stopped (for example, if the number of spatial objects associated with each node of the current subspace does not exceed the preset number, the segmentation is stopped, otherwise the pair continues This subspace is split). In four In the data structure of the fork tree space index, the correspondence between each node and the child nodes of the node is established, and the range of the spatial object represented by each node (such as the range of the space object identifier) is stored. When a spatial object is queried through the quadtree spatial index, the root node queries the leaf node layer by layer. For example, it is determined whether the spatial object identifier of the spatial object is included in the spatial object range corresponding to the root node, and if so, the query is continued to the lower node of the root node until the leaf node is queried. It can be seen that each query space object needs to query layer by layer in the prior art. When the tree structure level of the quadtree spatial index is large, the existing query method based on the quadtree spatial index query space object is inefficient.

Summary of the invention

An object of the present invention is to provide a method and apparatus for querying a spatial object and establishing a spatial index in an electronic map to overcome the problem of low query efficiency of spatial objects in the prior art.

In a first aspect, the present invention provides a method for querying a spatial object in an electronic map, including:

Obtaining a binary combination ID (Identity) of the to-be-queried spatial object, where the binary combination ID includes a hierarchical indication bit indicating a hierarchy of the spatial object to be queried in the spatial index, and a grid indicating that the spatial object belongs to the hierarchy Initial ID

Determining, according to the hierarchical indicator bit in the binary combination ID, the belonging level of the spatial object to be queried in the spatial index;

Determining, according to an initial ID in the binary combination ID, a mesh to which the to-be-queried spatial object belongs in a hierarchy indicated by the hierarchical indicator bit;

The space object to be queried is queried in the determined grid.

In a second aspect, the present invention provides a method for establishing a spatial index in an electronic map, the method comprising:

The latitude and longitude range included in the electronic map is respectively mapped to an integer range represented by m-bit binary numbers, wherein each layer of the electronic map has been previously divided into 2 ²ⁱ grids having the same geographical space range, and i represents each layer. The level of the electronic map, the value of i is 1 to N, and m is a positive integer greater than or equal to N, and N is a positive integer;

Determining, by each spatial object in each layer, an m-bit binary number of the longitude corresponding mapping of the spatial object, and an m-bit binary number corresponding to the latitude of the spatial object;

From the order of the high order to the low order, taking the i bit from the m-bit binary number of the longitude corresponding mapping of the spatial object and the i bit of the m-bit binary number corresponding to the latitude mapping;

From the high order to the low order, the i-bit longitude and i-bit latitude of the extracted spatial object are staggered to obtain a binary sequence of 2i bits, and the binary sequence of 2i bits represents the mesh to which the spatial object belongs in the i-th layer. Initial ID

The hierarchical indication bit and the initial ID of the spatial object are combined according to a preset combination rule to generate a binary combination ID of the spatial object in the i-th layer.

In a third aspect, corresponding to the first aspect, the present invention further provides an apparatus for querying a spatial object in an electronic map, the apparatus comprising:

An obtaining module, configured to obtain a binary combination ID of the spatial object to be queried, where the binary combination ID includes a hierarchical indication bit indicating a hierarchy of the spatial object to be queried in the spatial index, and a grid indicating that the spatial object belongs to the hierarchy Initial ID

a hierarchy determining module, configured to determine, according to a hierarchical indication bit in the binary combination ID, a hierarchy of the spatial object to be queried in the spatial index;

a grid determining module, configured to determine, according to an initial ID in the binary combination ID, a grid to which the to-be-queried spatial object belongs in a hierarchy indicated by the hierarchical indicator bit;

a query module, configured to query the to-be-queried spatial object in the determined grid.

In a fourth aspect, corresponding to the second aspect, the present invention further provides an apparatus for establishing a spatial index in an electronic map, the apparatus comprising:

A latitude and longitude representation module for mapping the latitude and longitude ranges included in the electronic map to integer ranges each represented by an m-bit binary number, wherein each layer of the electronic map has been previously divided into 2 ²ⁱ grids having the same geographical space range , i denotes the level of each layer of the electronic map, i takes a value from 1 to N, and m is a positive integer greater than or equal to N, and N is a positive integer;

a latitude and longitude determining module, configured to determine, for each spatial object in each layer, an m-bit binary number of the longitude corresponding mapping of the spatial object, and an m-bit corresponding to the latitude of the spatial object Binary number

The bit module is used for the order from the high bit to the low bit, and the i bit is taken from the m binary number of the longitude corresponding mapping of the spatial object and the i bit is taken from the binary number of the latitude corresponding mapping;

The initial ID generation module is configured to interleave the i-bit longitude and the i-bit latitude of the extracted spatial object in order from high to low, to obtain a binary sequence of 2i bits, and the binary sequence of the 2i bits indicates that the spatial object is in the first The initial ID of the grid to which the i layer belongs;

The combined ID generation module is configured to combine the hierarchical indication bit and the initial ID of the spatial object according to a preset combination rule to generate a binary combination ID of the spatial object in the i-th layer.

The present invention has at least the following beneficial effects: the spatial index is established by dividing the electronic map, so that the spatial object of each layer in the spatial index has a binary combination ID, so that the binary combination ID can represent the spatial object to be queried in the spatial index. The hierarchical level indication information of the hierarchical level, and the initial ID of the mesh to which the spatial object belongs in the hierarchy, so that when the spatial object is queried, the hierarchy to which the spatial object belongs and the associated mesh can be quickly determined according to the binary combination ID. Compared with the prior art, the method of querying the mesh to which the spatial object belongs by means of one node and one node can improve the query efficiency.

The above general description and the following detailed description are intended to be illustrative and not restrictive.

DRAWINGS

1 is an exemplary flowchart of a method for querying a spatial object in an electronic map according to an embodiment of the present invention;

2 is an exemplary flowchart of a method for establishing a spatial index in an electronic map according to an embodiment of the present invention;

FIG. 3a is a schematic diagram of a global electronic map, which is divided into four grids in a first layer in a latitude and longitude direction according to an embodiment of the present invention; FIG.

FIG. 3b is a schematic diagram showing 16 grids of the second layer of the global electronic map on the basis of FIG. 3a according to an embodiment of the present invention; FIG.

4 is an exemplary flowchart of constructing a spatial index for a global electronic map according to an embodiment of the present invention;

FIG. 5 is an exemplary flowchart of a process for querying a query space object by using a constructed spatial index according to an embodiment of the present invention; FIG.

6 is a schematic diagram of an apparatus for querying a spatial object in an electronic map according to an embodiment of the present invention;

FIG. 7 is another schematic diagram of an apparatus for querying a spatial object in an electronic map according to an embodiment of the present invention; FIG.

FIG. 8 is a schematic diagram of an apparatus for establishing a spatial index in an electronic map according to an embodiment of the present invention; FIG.

FIG. 9 is another schematic diagram of an apparatus for establishing a spatial index in an electronic map according to an embodiment of the present invention.

detailed description

The preferred embodiments of the present invention are described in conjunction with the accompanying drawings, and the preferred embodiments described herein are intended to illustrate and explain the invention, and not to limit the invention, and The embodiments and the features in the embodiments can be combined with each other.

The embodiment of the invention provides a method for querying a spatial object in an electronic map. In the solution provided by the method, a novel spatial indexing mechanism of the electronic map is provided. Specifically, the electronic map is divided into multiple levels in advance, each level represents a complete electronic map, and each level divides the electronic map into multiple copies, each of which represents a grid (can be understood as a Tile). A spatial object in any level in which it belongs to a mesh in that layer. In the spatial indexing mechanism provided by the present invention, each spatial object has a binary combination ID at each layer, and the binary combination ID includes a hierarchical indication bit indicating a hierarchy of the spatial object to be queried in the spatial index, and Indicates the initial ID of the grid to which the spatial object belongs in the hierarchy, so that when querying the spatial object, there is no need to query from node to node in the prior art. According to the binary combination ID of the spatial object to be queried, the present invention can quickly locate the hierarchy to which the spatial object to be queried belongs, and the mesh to which the affiliation belongs, so that the mesh to which the spatial object belongs can be accurately and quickly located, thereby The prior art can speed up the query efficiency of the query space object.

The present invention includes two aspects of querying a spatial object and establishing a spatial index. These two aspects are described in detail below.

Embodiment 1

As shown in FIG. 1 , it is an example of a method for querying a spatial object in an electronic map according to an embodiment of the present invention. Sexual flow chart, the method includes the following steps:

Step 101: Obtain a binary combination ID of a spatial object to be queried, where the binary combination ID includes a hierarchical indication bit indicating a hierarchy of the spatial object to be queried in the spatial index, and an initial representation of the mesh to which the spatial object belongs. ID.

The space object to be queried may be a spatial entity or a set of multiple spatial entities, such as a Poi (Point of Interest).

Step 102: Determine, according to the hierarchical indicator bit in the binary combination ID, the belonging level of the spatial object to be queried in the spatial index.

In one embodiment, for ease of operation and quick query, step 102 may include the following steps:

Step A1: determining, according to the binary combination ID, the first bit assigned to 1 from the binary combination ID, the first bit assigned a value of 1 is represented in the binary combination ID The hierarchical indication bit of the hierarchy to which the spatial object to be queried belongs in the spatial index.

Step A2: Determine the total number of bits after the first bit in the binary combination ID assigned to 1, the total number of bits being the total number of bits of the initial ID.

Step A3: Divide the total number of bits by 2 to obtain the belonging level of the spatial object.

This makes it possible to quickly determine the hierarchy of the spatial object from the binary combination ID. It is not necessary to query by node-by-node as in the prior art, thereby improving query efficiency.

Step 103: Determine, according to the initial ID in the binary combination ID, the mesh to which the to-be-queried spatial object belongs in the hierarchy indicated by the hierarchical indicator bit.

Step 104: Query the to-be-queried spatial object in the determined grid.

Therein, in one embodiment, there is one more sign bit in front of the most significant bit of the binary combination ID. For example, when the binary combination ID indicates a positive number, the sign bit is 0, and when the binary combination ID indicates a negative number, the sign bit is 1.

The embodiment of the present invention implements the hierarchical level of the query according to the hierarchical indication bit in the binary combination ID, and locates the mesh to which the spatial object to be queried belongs by using the initial ID, so that the query method can quickly locate the spatial object to be queried relative to the prior art node-by-node query method. Grid to help speed up query space The speed of the image, which can improve the query efficiency of the spatial object.

Embodiment 2

This embodiment is used to describe a method for establishing a spatial index. As shown in FIG. 2, it is an exemplary flowchart of a method for establishing a spatial index in an electronic map according to an embodiment of the present invention. The method includes the following steps:

Step 201: Map the latitude and longitude ranges included in the electronic map to integer ranges each represented by an m-bit binary number, wherein each layer of the electronic map has been previously divided into 2 ²ⁱ grids having the same geographical space range, and i represents For each level of the electronic map, i takes a value from 1 to N, and m is a positive integer greater than or equal to N, and N is a positive integer.

Step 202: Determine, for each spatial object in each layer, an m-bit binary number of the longitude corresponding mapping of the spatial object, and an m-bit binary number of the latitude corresponding mapping of the spatial object.

Step 203: Taking the order of the high order to the low order, taking the i bit from the m bit binary number of the longitude corresponding mapping of the spatial object and the i bit of the m bit binary number corresponding to the latitude mapping.

Step 204: The high-order to low-order order is used to interleave the extracted i-bit longitude and i-bit latitude of the spatial object to obtain a binary sequence of 2i bits, and the binary sequence of 2i bits indicates that the spatial object belongs to the i-th layer. The initial ID of the grid.

Step 205: Combine the hierarchical indication bit and the initial ID of the spatial object according to a preset combination rule to generate a binary combination ID of the spatial object in the i-th layer.

The above steps are described in detail below by the contents of 1)-4):

1) In step 201:

Wherein, in one embodiment, when the electronic map is a global electronic map, the global electronic map can be divided into 1 to 15 layers, and each layer is a level.

Wherein, each layer of the electronic map described in step 201 is divided into 2 ²ⁱ grids having the same geographical space range: for example, in the 15th layer, the global electronic map is divided into 2 ³⁰ with the same latitude and longitude range. Equals. For example, as shown in FIG. 3a, in the first layer, the global electronic map is segmented in the latitude direction and segmented in the longitude direction to obtain four meshes. The number in the figure is a binary number, indicating the initial ID of the layer in the layer (the meanings of the numbers in the following figure are the same in Figure 3b, and will not be described later); the formation process of the second layer is as follows: as shown in Figure 3b, in the figure On the basis of 3a, each grid in Fig. 3a is divided once in the latitude direction and the longitude direction, so that each grid in Fig. 3a is divided into four. Therefore, in the second layer, there are 16 grids in total. By analogy, the grid in the i-th layer is obtained by cutting each grid in the i-th layer into four parts. It should be noted that, in the first few layers, the mesh is first cut from the latitude direction and then the mesh is cut from the longitude direction, or the mesh is first cut from the longitude direction to divide the mesh from the latitude direction, or simultaneously The singularity of the mesh from the latitude and longitude directions is applicable to the embodiments of the present invention, which is not limited by the present invention.

Wherein, in one embodiment, m has a value of 31 and N has a value of 15. For global electronic maps, since the circumference of the Earth is about 40,000 kilometers, the geographic range represented by each grid in the 15th layer is about 1.8cm, and the minimum spatial object that can be represented has a geographical range of 1.8 ² cm ^{2 .} In turn, it is possible to accurately represent the position of the spatial object.

Wherein, the integer range represented by the m-bit binary number is represented by the range of the natural number [0, 2 ^m -1], for example, the largest integer that can be represented by the 1-bit binary number is 2 ¹ -1=1, which represents a total of 0, 1 2 (ie, 2 ¹ ) integers; the largest integer that a 2-bit binary number can represent is 2 ² -1=3, which represents a total of 4 (ie, 2 ² ) integers of 0, 1, ² , and 3. By analogy, the largest integer that can be represented by an m-bit binary number is 2 ² -1, which represents a total of 2 ^m integers. The longitude of the electronic map is represented by m-bit binary numbers, and the latitude is also m-bit binary number. The combination of latitude and longitude can represent 2 ^m *2 ^m = 2 ^2m integers. For each layer of the electronic map, in order to make the grid of the layer and the initial ID have a one-to-one correspondence, that is, each grid corresponds to an initial ID, and each initial ID corresponds to a grid, then the latitude and longitude can be combined. The number of integers must be greater than or equal to the number of grids (ie, 2 ^2m ≥ 2 ²ⁱ ), so for the ith layer, ^m ≥ ⁱ . The electronic map has a total of N layers, that is, the maximum value of i is N, so m ≥ N.

For mapping the longitude of the electronic map to the integer range represented by the m-bit binary number, for example, when N is 15 and m is 31, if the longitude range of the electronic map is [0, 90], 31 bits are used. The smallest integer represented by a binary number, that is, 31 zeros represents the minimum longitude (ie, the longitude is 0), and the largest integer represented by a 31-bit binary number, that is, 31, represents the maximum longitude (ie, the longitude is 90); for the same reason, for the electronic map The latitude is mapped to the integer range represented by the m-bit binary number. For example, when N is 15 and m is 31, if the latitude of the electronic map is [0, 90], the 31-bit binary is used. The smallest integer represented, that is, 31 zeros represents the minimum latitude (ie, the latitude is 0), and the largest integer represented by the 31-bit binary number, that is, 31, represents the maximum latitude (ie, the latitude is 90).

2) In step 203:

Wherein, in one embodiment, when the global electronic map is divided into 15 layers, the value of m is 31, that is, the latitude and longitude of the global electronic map are each a 31-bit binary number. If the longitude coordinate of a spatial object B in the fifth layer is "1111111 11111111 11111111 11111110" (where the direction from the high to the low is from left to right), the latitude coordinate of the spatial object B is "0111111 11111111 11111111 11111110" Then, the upper 5 bits of the longitude of the spatial object are "11111", and the latitude of the spatial object is 5 bits higher than "01111".

Among them, assuming that the maximum longitude or latitude is rounded to a binary number and then m bits, the m-bit binary number can fully represent the actual latitude and longitude value. At this time, the m-bit binary number represents the actual integer part. Latitude and longitude.

If the m-bit binary number cannot represent the actual latitude and longitude, then the corresponding mapped m-bit binary number is required for each spatial object. Taking the m-bit binary number of the longitude-corresponding mapping as an example, one of the simplest solving methods is, for example, determining the ratio of the actual longitude of the spatial object to the maximum longitude, which is the m-bit binary number of the corresponding mapping of the longitude. The ratio between the maximum m-bit binary and the largest m-bit binary is determined, and the ratio is determined, and the long-term corresponding mapped m-bit binary number is solvable. Certainly, the m-bit binary number of the corresponding mapping is determined by other mathematical methods, and is also applicable to the embodiment of the present invention, which is not limited by the present invention.

3) In step 204:

For example, the high 3-bit binary number of the latitude of the spatial object is "C ₁ C ₂ C ₃ ", and the high 3-bit binary number of the longitude is "D ₁ D ₂ D ₃ ", which is obtained from the longitude and then staggered. The 6-bit binary sequence should be "D ₁ C ₁ D ₂ C ₂ D ₃ C ₃ ". Then, the 10-bit binary sequence of the space object B in the fifth layer should be "1011111111", and the decimal number is 767 (that is, in the embodiment of the present invention, the decimal object can be used to represent the network object B in the layer 5 The initial ID of the grid is 767). Of course, the staggered arrangement may be started from the latitude direction, which is not limited by the present invention.

By staggering the high i-bit of the longitude of the spatial object and the high i-bit of the latitude, according to the initial ID, quickly and unambiguously determine the parent-child relationship between levels. For example, the initial ID is 101101 (a total of 6 binary digits). The grid is segmented based on the grid of the previous layer (ie, the second layer) with an initial ID of 1011. The principle is first explained by a simple example, for example, the same spatial object is in each layer. Where the m-bit binary numbers of its longitude are the same, then in the second layer, the 4-bit binary number taken from the high-order to the low-order order, and the third-level binary-number in the third layer is also taken from the high-order to the low-order. Then the order of the last 2 bits of the 6-bit binary number is exactly the two-digit binary number after the 4-bit binary number of the second layer, so the first 4 bits of the 6-bit binary number in the third layer are exactly 4 in the second layer. Bit binary numbers, which are also a spatial object, require only a different number of bits in different levels. Similarly, in the i-th layer, the initial ID of the spatial object in the layer is staggered by the high i-bit of longitude and latitude, so the initial ID of the lowest layer (the Nth layer) has a maximum of 2N bits. For the same spatial object, there is only one initial ID at the lowest layer, except that each layer selects the high 2i bit of the initial ID of 2N bits for use. Based on the above simple example, it can be seen that the initial ID of the total number of bits of a spatial object represents the mesh to which the spatial object belongs in each layer, and the spatial object is in the mesh with the initial ID of 101101 in the third layer. The spatial object is in the grid of the second layer with an initial ID of 1011. The position of the spatial object in the electronic map is fixed. According to the division mechanism of the electronic map, the range represented by the upper layer of the grid is larger than the range represented by the grid of the next layer, so the grid with the initial ID of 101101 is initialized. The mesh with the ID of 1011 is derived from the mechanism of dividing the electronic map and establishing the initial ID for the mesh. Similarly, the mesh with the initial ID of 1011 in the second layer is again divided into meshes with an initial ID of 10 in the first layer. It can be seen that the parent-child relationship between the grids in the initial ID is very easy to identify and judge.

In addition, when a new spatial object needs to be added to the index within the geographical range represented by the electronic map, the binary combination ID of the newly added spatial object may be directly generated and stored according to the latitude and longitude of the spatial object. It is not necessary to generate the spatial object identifier cumbersomely for each corresponding node as in the prior art, so that the embodiment of the present invention facilitates simple and fast spatial indexing.

4) In step 205:

By segmenting the electronic map, an initial ID of the mesh in which the spatial object is located is generated according to the latitude and longitude coordinates of the spatial object, and the initial ID can clearly indicate the relationship between the upper and lower levels of the mesh, and The latitude and longitude coordinates are associated with the grid by the initial ID, so that when the spatial object is queried, the grid of the spatial object can be quickly located by the initial ID. The binary combination ID is generated by adding the hierarchical information to the initial ID, so that the binary combination ID can represent the hierarchy to which the spatial object belongs, and the hierarchical level of the mesh in which the spatial object is located can also be represented, so as to quickly determine in which hierarchy the space is determined. The grid to which the object belongs. For example, when a spatial object is in multiple levels, the hierarchical bits of the binary combination ID can quickly determine in which level the grid to which the spatial object belongs is queried. For example, if the binary combination ID is 01101101 (a total of 8 binary numbers) and the level bit is the first bit that is not 0, then the level of the binary combination ID is 7th from the low to the high digit (this bit is set) For the Xth bit), the mesh to which the spatial object belongs is at level 3, ie the level is equal to (7-1) divided by 2. It can be seen that the relationship between level i and X: X = 2i + 1.

Wherein, in an embodiment, step 205 can be implemented as the following steps:

Step B1: Add a bit bit indicating the level indication bit before the highest bit of the secondary sequence corresponding to the initial ID, and set the value of the bit to 1.

Step B2: If the number of bits of the secondary sequence formed by the hierarchical indicator bit and the initial ID is less than the preset number of bits of the binary combination ID, then L bits are added before the level indication bit, and the L bits are The bit bit value is set to 0, and the L is equal to the preset number of bits minus the number of bits remaining after the level indicator bit and the number of bits occupied by the initial ID.

Preferably, the preset number of bits in each layer may be different, and the preset number of bits in each layer is an integer multiple of 8 which can include the initial ID of the layer, for example, the initial ID of a layer is 6 bits. The total number of bits of the initial ID plus the level indicator bit is 7 bits in total, then the preset number of bits in the layer is 8 bits; if the initial ID of a layer is 8 bits, the total number of bits of the initial ID plus the level indicator bit A total of 9 bits, the default number of bits in the layer is 16 bits; if the initial ID of a layer is 10 bits, the total number of bits of the initial ID plus the level indicator is a total of 11 bits, then the preset of the layer The number of digits is 16 bits. Of course, the preset number of bits can be set to a fixed value according to actual needs, for example, the electronic map to be divided is divided into 15 layers, and the longitude and latitude are represented by 31-bit binary numbers, and the initial ID of the 15th layer is The number of digits is up to 30 bits (15+15), so in order to be able to contain 30-bit binary numbers, the preset number of bits can be set to 32 bits; for example, the electronic map to be divided is divided into 31 layers, and the longitude and Latitude is 31 bits each When the binary number is expressed, the initial ID of the 31st layer has a maximum of 62 bits (31+31), so in order to be able to include a 62-bit binary number, the preset number of bits can be set to 64 bits.

For example, by adding a bit indicating the level indicating bit to the 10-bit sequence "0111100111" of the initial ID of the spatial object B, and setting the bit value to 1, an 11-bit binary sequence "10111100111" is obtained, and the preset bit is obtained. When the number is 16 bits, then 16-11 and 5 bit bits are added before the level indication bit. After the 5 bit positions are 0, the final binary combination ID is "0000010111100111", and the binary combination ID is generated. .

Moreover, in one embodiment, to accommodate programming needs, a one-bit sign bit is added before the most significant bit of the binary combination ID. For example, when the binary combination ID indicates a positive number, and the symbol position is 0, when the binary combination ID indicates a negative number, the symbol position is set to 1.

Through the process of generating the binary combination ID, the binary combination ID can include the hierarchical information corresponding to the spatial object and the information of the mesh to which the spatial object belongs, so that the mesh to which the spatial object belongs can be quickly queried in the established spatial index. For subsequent operations, such as rendering the grid in which the spatial object is located, or accurately rendering the location of the spatial object in the electronic map according to the latitude and longitude coordinates of the spatial object.

In summary, the embodiment of the present invention establishes a spatial index on the electronic map, so that the spatial object of each layer in the spatial index has a binary combination ID, so that the binary combination ID can represent the hierarchy of the spatial object to be queried in the spatial index. The hierarchical indicator bit, and the initial ID of the mesh to which the spatial object belongs in the hierarchy, so that when the spatial object is queried, the hierarchy to which the spatial object belongs and the associated mesh can be quickly determined according to the binary combination ID, and thus the relative In the prior art, a method of querying a mesh to which a spatial object belongs by means of a node and a node can improve query efficiency.

The method for querying a spatial object in an electronic map in the embodiment of the present invention is described in detail below through a simple embodiment.

Embodiment 3

The building A is used as the object to be queried, and the space object is queried in the space index, and the mesh to which the space object belongs is located, and the mesh after the positioning is rendered as an example. The method for querying a spatial object in an electronic map is described in detail. The method includes a process of pre-constructing a spatial index in advance, and a process of locating a mobile terminal by using the spatial index of the construct in the later stage:

First, the process of pre-constructing the spatial index is described to illustrate the construction of the spatial index of the global electronic map, as shown in FIG. 4, including the following steps:

Step 401: The global electronic map is divided into 15 layers, and the global electronic map is divided into 2 ²ⁱ equal parts in the same geographical space in each layer, wherein each layer is a level, and i represents a level.

Step 402: Map the latitude and longitude ranges included in the global electronic map to integer ranges each represented by a 31-bit binary number.

The step 402 can be understood as that the global latitude and longitude are respectively quantized, so that the range between the minimum longitude and the maximum longitude of the electronic map to be divided after quantization and the range between the minimum latitude and the maximum latitude are both [0, 2 ³¹ -1], and the longitude and latitude of the electronic map to be divided are respectively represented by a 31-digit binary number.

Step 403: For each spatial object in the i-th layer, determine a 31-bit binary number of the longitude-corresponding mapping of the spatial object, and a 31-bit binary number of the latitude-corresponding mapping of the spatial object.

Step 404: From the order of the high order to the low order, the i bit is taken from the 31-bit binary number of the longitude corresponding map of the spatial object and the 31 bit binary number of the latitude corresponding map is taken.

Step 405: The order of the i-bit longitude and the i-bit latitude of the extracted spatial object are staggered from the high order to the low order to obtain a binary sequence of 2i bits, and the binary sequence of the 2i bits indicates that the spatial object belongs to the i-th layer. The initial ID of the grid.

Step 406: Add a bit indicating the level indication bit before the highest bit of the secondary sequence corresponding to the initial ID, and set the value of the bit to 1.

Step 407: If the number of bits of the secondary sequence formed by the hierarchical indicator bit and the initial ID is less than the preset number of bits of the binary combination ID, that is, 31 bits, then L bits are added before the level indication bit, and The L bit bits take the value set to 0, and the L is equal to the preset number of bits 31 minus the number of bits remaining after the level indicator bit and the number of bits occupied by the initial ID.

Step 408: Add a bit in front of the highest bit of the binary combination ID as a sign bit to generate a binary combination ID with a sign bit.

The following describes the process of querying the grid to which Building A belongs by using the constructed spatial index, as shown in Figure 5, including the following steps:

Step 501: Acquire the latitude and longitude of the building A.

Step 502: According to the latitude and longitude of the building A, and according to step 403-step 408, the binary combination ID of the signed bit of the building A in the 15th layer of the global electronic map is generated.

Wherein, in step 502, a binary combination ID of the 15th layer with a sign bit is generated, and the binary combination ID with the sign bit has a hierarchical relationship of all layers, so that the building A can be located in other levels later.

Of course, the binary combination ID with the sign bit generated at the 15th layer is only illustrated in step 502, and is not intended to limit the present invention. The building A can be queried in the first layer according to actual needs in order to generate a binary combination ID of the signed bit of the layer. For example, it is determined that the building A is displayed in the first floor according to the map scale set by the user. For example, if the scale set by the user is large enough, it can be determined that in the 15th floor, the building A is displayed, and the binary combination ID of the symbol A of the building A of the 15th floor is generated; if the scale set by the user is small enough, When it is determined that the building A is displayed in the first floor, the binary combination ID with the sign bit of the building A of the first floor is generated.

Step 503: Determine the grid to which the building A belongs in the 15th floor of the global electronic map according to the binary combination ID of the sign A of the building A, and determine the position of the building A in the grid.

Step 504: Render the grid to which the building A belongs in the 15th layer of the global electronic map, and render the location of the mobile terminal in the grid.

Step 505: According to the selection operation of the 10th layer selected by the user, it is determined that the user requests to render the grid to which the mobile terminal belongs in the 10th layer.

Step 506: Determine the binary combination ID of the mobile terminal in the 10th layer according to the initial ID of the mobile terminal in the binary combination ID with the sign bit in the 15th layer of the global electronic map.

Wherein, in the spatial index constructed above, the binary combination ID with the sign bit is represented by 32 bits, and if the binary combination ID of the signed bit in the 15th layer of the building A is "01000101 11111111 11111111 11111111, the highest Bit 0 is a sign bit indicating a positive number, then the third bit to the 22nd bit from the high bit is the initial ID of building A in the 10th floor, ie "000101 11111111 111111" (ie, the last 30 bits of the order from the high to the low in the binary combination ID with the sign bit are the initial ID at the 15th layer, and the first 20 bits of the initial ID of the 15th layer are the initial at the 10th layer. ID). According to the method of the foregoing steps B1-B2, the building A is added by a bit indicating the level indicating bit before the high bit of the initial ID in the 10th layer, and the position is set to 1, and then the binary combined ID is generated, and then in the binary Adding a sign bit before the high bit of the combined ID finally obtains the binary combination ID of the 32-bit signed bit of the building A in the 10th floor: 000000000 0001 000101 11111111 111111.

Step 507: Determine the grid to which the building A belongs in the tenth floor according to the binary combination ID of the sign A in the tenth floor of the building A, and determine the position of the building A in the grid.

Step 508: Render the grid to which the building A belongs in the 10th floor of the global electronic map, and render the position of the building A in the grid.

Embodiment 4

An embodiment of the present invention further provides an apparatus for querying a spatial object in an electronic map, as shown in FIG. 6 is a schematic diagram of the apparatus, the apparatus includes:

The obtaining module 601 is configured to obtain a binary combination ID of the spatial object to be queried, where the binary combination ID includes a hierarchical indication bit indicating a hierarchy of the spatial object to be queried in the spatial index, and a network indicating that the spatial object belongs to the hierarchy Initial ID of the grid;

a hierarchy determining module 602, configured to determine, according to a hierarchical indicator bit in the binary combination ID, a hierarchy of the spatial object to be queried in the spatial index;

a grid determining module 603, configured to determine, according to an initial ID in the binary combination ID, a grid to which the to-be-queried spatial object belongs in a hierarchy indicated by the hierarchical indicator bit;

The query module 604 is configured to query the to-be-queried spatial object in the determined grid.

Wherein, in an embodiment, as shown in FIG. 7, the level determining module 602 includes:

The hierarchical indication information determining unit 605 is configured to determine, from the binary combination ID, a first bit assigned a value of 1 according to a binary combination ID from an upper order to a lower order, wherein the first bit assigned a value of 1 is a hierarchical indication bit indicating a hierarchy level of the spatial object to be queried in the spatial index in the binary combination ID;

The initial ID total number of bits determining unit 606 is configured to determine a total number of bits after the first bit of the binary combination ID that is assigned a value of 1, the total number of bits is the total number of bits of the initial ID;

The level determining unit 607 is configured to divide the total number of bits by 2 to obtain the belonging level of the spatial object.

Embodiment 5

In another aspect, based on the same concept, the embodiment of the present invention further provides an apparatus for establishing a spatial index in an electronic map. As shown in FIG. 8, the apparatus includes:

The latitude and longitude indicating module 801 is configured to map the latitude and longitude ranges included in the electronic map to integer ranges each represented by an m-bit binary number, wherein each layer of the electronic map has been previously divided into 2 ²ⁱ networks having the same geographical space range. L, i represents the level of each layer of electronic map, i takes a value from 1 to N, and m is a positive integer greater than or equal to N, N is a positive integer;

The latitude and longitude determination module 802 is configured to determine, for each spatial object in each layer, an m-bit binary number of the longitude corresponding mapping of the spatial object, and an m-bit binary number corresponding to the latitude of the spatial object;

The bit-taking module 803 is configured to take the i-bit from the m-bit binary number of the longitude-corresponding mapping of the spatial object and the m-bit binary number of the latitude-corresponding mapping in the order from the upper bit to the lower bit;

The initial ID generation module 804 is configured to interleave the extracted i-bit longitude and i-bit latitude of the spatial object from the high order to the low order to obtain a binary sequence of 2i bits, wherein the binary sequence of 2i bits indicates that the spatial object is The initial ID of the grid to which the i-th layer belongs;

The combined ID generation module 805 is configured to combine the hierarchical indication bit and the initial ID of the spatial object according to a preset combination rule to generate a binary combination ID of the spatial object in the i-th layer.

In one embodiment, as shown in FIG. 9, the combined ID generating module 805 includes:

a level bit adding unit 806, configured to add a bit bit indicating a level indicator bit before the highest bit of the second-level sequence corresponding to the initial ID, and set the value of the bit bit to 1;

The combined ID generating unit 807 is configured to add L bit positions before the level indicating bit if the number of bits of the two-level sequence formed by the level indicating bit and the initial ID is less than the preset number of bits of the binary combination ID, and The value of the L bit bits is set to 0, and the L is equal to the preset number of bits minus the number of bits remaining after the level indicator bit and the number of bits occupied by the initial ID.

With regard to the apparatus in the above embodiments, the specific manner in which the respective modules perform the operations has been described in detail in the embodiment relating to the method, and will not be explained in detail herein.

Those skilled in the art will appreciate that embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.

The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (system), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or FIG. These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine for the execution of instructions for execution by a processor of a computer or other programmable data processing device. Means for implementing the functions specified in one or more of the flow or in a block or blocks of the flow chart.

The computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device. The apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.

These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device. The instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

While the preferred embodiment of the invention has been described, it will be understood that Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and the modifications and

It is apparent that those skilled in the art can make various modifications and variations to the invention without departing from the spirit and scope of the invention. Thus, it is intended that the present invention cover the modifications and modifications of the invention

Claims

A method for querying a spatial object in an electronic map, the method comprising:

Obtaining a binary combination identifier ID of the space object to be queried, where the binary combination ID includes a hierarchical indication bit indicating a hierarchy of the spatial object to be queried in the spatial index, and an initial ID indicating a grid to which the spatial object belongs;

Determining, according to the hierarchical indicator bit in the binary combination ID, the belonging level of the spatial object to be queried in the spatial index;

Determining, according to an initial ID in the binary combination ID, a mesh to which the to-be-queried spatial object belongs in a hierarchy indicated by the hierarchical indicator bit;

The space object to be queried is queried in the determined grid.
The method according to claim 1, wherein the determining the belonging level of the to-be-queried spatial object in the spatial index according to the hierarchical indication bit in the binary combination ID comprises:

Determining, from the binary combination ID, a first bit assigned a value of 1 according to a binary combination ID from a high order to a low order, the first bit assigned a value of 1 indicates a space to be queried in the binary combination ID The level indicator of the level of the object in the spatial index;

Determining a total number of bits after the first bit of the binary combination ID assigned a value of 1, the total number of bits being the total number of bits of the initial ID;

Divide the total number of bits by 2 to get the level of the spatial object.
A method for establishing a spatial index in an electronic map, the method comprising:

The latitude and longitude range included in the electronic map is respectively mapped to an integer range represented by m-bit binary numbers, wherein each layer of the electronic map has been previously divided into 2 2i grids having the same geographical space range, and i represents each layer. The level of the electronic map, the value of i is 1 to N, and m is a positive integer greater than or equal to N, and N is a positive integer;

Determining, by each spatial object in each layer, an m-bit binary number of the longitude corresponding mapping of the spatial object, and an m-bit binary number corresponding to the latitude of the spatial object;

From the high order to the low order, from the m-bit binary number of the longitude mapping of the spatial object Taking i bits and i bits in the m-bit binary number corresponding to the latitude mapping;

From the high order to the low order, the i-bit longitude and i-bit latitude of the extracted spatial object are staggered to obtain a binary sequence of 2i bits, and the binary sequence of 2i bits represents the mesh to which the spatial object belongs in the i-th layer. Initial ID

The hierarchical indication bit and the initial ID of the spatial object are combined according to a preset combination rule to generate a binary combination ID of the spatial object in the i-th layer.
The method according to claim 3, wherein the hierarchical indication bit and the initial ID of the spatial object are combined according to a preset combination rule, and a binary combination ID of the spatial object in the i-th layer is generated, including :

Adding a bit bit indicating a level indication bit before the highest bit of the secondary sequence corresponding to the initial ID, and setting the bit bit to 1;

If the number of bits of the hierarchical sequence formed by the hierarchical indicator bit and the initial ID is less than the preset number of bits of the binary combination ID, then L bits are added before the level indication bit, and the L bits are taken The value is set to 0, and the L is equal to the preset number of bits minus the number of bits remaining after the level indicator bit and the number of bits occupied by the initial ID.
An apparatus for querying a spatial object in an electronic map, wherein the apparatus comprises:

An acquiring module, configured to obtain a binary combination identifier ID of the spatial object to be queried, where the binary combination ID includes a hierarchical indication bit indicating a hierarchy of the spatial object to be queried in the spatial index, and a network indicating that the spatial object belongs to the hierarchy Initial ID of the grid;

a hierarchy determining module, configured to determine, according to a hierarchical indication bit in the binary combination ID, a hierarchy of the spatial object to be queried in the spatial index;

a grid determining module, configured to determine, according to an initial ID in the binary combination ID, a grid to which the to-be-queried spatial object belongs in a hierarchy indicated by the hierarchical indicator bit;

a query module, configured to query the to-be-queried spatial object in the determined grid.
The apparatus according to claim 5, wherein the level determining module comprises:

a hierarchical indication information determining unit, configured to determine, from the binary combination ID, a first bit assigned a value of 1 according to a binary combination ID from an upper order to a lower order, the first assignment being 1 Bits are hierarchical indication bits in the binary combination ID indicating the belonging level of the spatial object to be queried in the spatial index;

An initial ID total digit determining unit, configured to determine a total number of bits after the first one of the binary combination IDs assigned a value of 1, the total number of bits being the total number of bits of the initial ID;

A level determining unit for dividing the total number of bits by 2 to obtain the belonging level of the spatial object.
An apparatus for establishing a spatial index in an electronic map, the apparatus comprising:

A latitude and longitude representation module for mapping the latitude and longitude ranges included in the electronic map to integer ranges each represented by an m-bit binary number, wherein each layer of the electronic map has been previously divided into 2 2i grids having the same geographical space range , i denotes the level of each layer of electronic map, i takes a value from 1 to N, and m is a positive integer greater than or equal to N, and N is a positive integer;

a latitude and longitude determining module, configured to determine, for each spatial object in each layer, an m-bit binary number of the longitude corresponding mapping of the spatial object, and an m-bit binary number corresponding to the latitude of the spatial object;

The bit module is used for the order from the high bit to the low bit, and the i bit is taken from the m bit binary number of the longitude corresponding mapping of the spatial object and the i bit is taken from the m bit binary number of the latitude corresponding mapping;

The initial ID generation module is configured to interleave the i-bit longitude and the i-bit latitude of the extracted spatial object in order from high to low, to obtain a binary sequence of 2i bits, and the binary sequence of the 2i bits indicates that the spatial object is in the first The initial ID of the grid to which the i layer belongs;

The combined ID generation module is configured to combine the hierarchical indication bit and the initial ID of the spatial object according to a preset combination rule to generate a binary combination ID of the spatial object in the i-th layer.
The device according to claim 7, wherein the combined ID generation module comprises:

a level bit adding unit, configured to add a bit bit indicating a level indicator bit before the highest bit of the second-level sequence corresponding to the initial ID, and set the value of the bit bit to 1;

a combined ID generating unit, if the number of bits of the secondary sequence formed by the hierarchical indicator bit and the initial ID is less than the preset number of bits of the binary combination ID, then L bits are added before the level indication bit, and The L bit bits take a value of 0, and the L is equal to the preset number of bits minus the level indication The number of bits remaining after the bit and the number of bits occupied by the initial ID.