CN116340449A

CN116340449A - Data index establishment method, map rendering method, device and product

Info

Publication number: CN116340449A
Application number: CN202310313382.2A
Authority: CN
Inventors: 李永超; 侯凤明
Original assignee: Autonavi Software Co Ltd
Current assignee: Autonavi Software Co Ltd
Priority date: 2023-03-28
Filing date: 2023-03-28
Publication date: 2023-06-27

Abstract

The embodiment of the disclosure discloses a data index establishing method, a map rendering method, equipment and a product, wherein the method comprises the following steps: acquiring map tiles in a predetermined map area; aggregating map tiles based on adjacent spatial relationships of the map tiles to obtain at least one tile set; for each set of tiles, determining a total number of map tiles in the set of tiles based on tile identifications of map tiles in the set of tiles; according to a set rule, map tiles in the tile set are traversed, a data index of the tile set is constructed, the data index comprises tile identification indication bits and data state bits, the tile identification indication bits indicate tile identifications of the map tiles in the tile set, each data state bit records the data state of a corresponding map tile according to the traversing sequence, and the number of the data state bits is equal to the total number of the map tiles. The technical scheme can effectively reduce the number of uplink requests and lighten the pressure of a server.

Description

Data index establishment method, map rendering method, device and product

Technical Field

The disclosure relates to the technical field of map rendering, in particular to a data index building method, a map rendering method, equipment and a product.

Background

Electronic maps commonly provide data for map rendering in the form of map tiles (tiles). Map tiles are basic units for creating and managing map data by dividing an electronic map into a series of rectangular or square grids.

The map tile loading method is generally adopted as follows: the method comprises the steps that a server stores map Tile data which are segmented according to the size of a Tile in advance, when a user carries out interactive operation on an electronic map displayed by a client, the client acquires Tile identifiers in a screen display range (also called a map window range) in real time, namely Tile identifiers corresponding to the electronic map to be displayed in the screen, then a Tile data request carrying the Tile identifiers is sent to the server, the server inquires map Tile data corresponding to the corresponding Tile identifiers after receiving the request, the inquired map Tile data are sent to the client, and the client displays the electronic map in the map window range in the screen of the client according to the received map Tile data.

The electronic map is an expression of the real world in the digital world, when a user performs interactive operation on the displayed electronic map, such as sliding operation, one sliding operation can enable real world changes to occur in the range of a map window to be multiple times, the displayed electronic map is assumed to be an electronic map of the A city, when the sliding operation of the user stops, the displayed electronic map is required to be displayed in the B city which is 1000 km away from the A city, in order to ensure continuity of displaying the electronic map in a terminal screen, a jump situation is not required to occur, the electronic map from the A city to the B city also needs to be continuously displayed, tile data requests (uplink requests) generated by single sliding operation can be several to more than ten times, and under the condition that the user base is larger, the total amount of uplink requests from a client side can be larger, so that the pressure of a server side is increased. Therefore, how to reduce the pressure of the server and realize the support of a small amount of server resources to large-scale users becomes a problem to be solved.

Disclosure of Invention

In order to solve the problems in the related art, embodiments of the present disclosure provide a data index building method, a map rendering method, a device, and a product.

In a first aspect, an embodiment of the present disclosure provides a data index establishing method.

Specifically, the data index establishing method includes:

acquiring map tiles in a predetermined map area;

aggregating the map tiles based on adjacent spatial relationships of the map tiles to obtain at least one tile set;

for each set of tiles, determining a total number of map tiles in the set of tiles based on tile identifications of map tiles in the set of tiles;

traversing map tiles in the tile set according to a set rule, constructing a data index of the tile set, wherein the data index comprises tile identification indication bits and data state bits, the tile identification indication bits indicate tile identifications of the map tiles in the tile set, each data state bit records the data state of a corresponding map tile according to the traversing sequence, and the number of the data state bits is the total number of the map tiles.

In a second aspect, a map rendering method is provided in an embodiment of the present disclosure.

Specifically, the map rendering method includes:

acquiring tile identifiers of map tiles covered by a current map window range;

querying a data state corresponding to a tile identifier in the current map window range in a pre-acquired data index of a tile set, wherein the data index comprises a tile identifier indication bit and data state bits, and the tile identifier indication bit indicates the tile identifier of a map tile in the tile set and records the data state of the map tile corresponding to each data state bit;

carrying a tile identifier of a map tile with data in a data state in a tile data request and sending the tile identifier to a server;

and rendering the map in the current map window range according to the map tiles returned by the server in response to the tile data request.

In a third aspect, an embodiment of the present disclosure provides a data index establishing apparatus, including:

the data tile acquisition module is configured to acquire map tiles in a preset map area;

a set acquisition module configured to aggregate the map tiles based on their neighboring spatial relationships to obtain at least one set of tiles;

A rank determination module configured to determine, for each set of tiles, a total number of map tiles in the set of tiles based on tile identifications of map tiles in the set of tiles;

the index generation module is configured to traverse map tiles in the tile set according to a set rule, and construct a data index of the tile set, wherein the data index comprises tile identification indication bits and data state bits, the tile identification indication bits indicate tile identifications of the map tiles in the tile set, each data state bit records a data state of a corresponding map tile according to a traversing sequence, and the number of the data state bits is the total number of the map tiles in the tile set.

In a fourth aspect, in an embodiment of the present disclosure, there is provided a map rendering apparatus including:

the identification acquisition module is configured to acquire tile identifications of map tiles covered by the current map window range;

the query module is configured to query a data index of a tile set acquired in advance for a data state corresponding to a tile identifier in the current map window range, wherein the data index comprises a tile identifier indication bit and data state bits, and the tile identifier indication bit indicates a tile identifier of a map tile in the tile set and the data state of the map tile corresponding to each data state bit record;

The data request sending module is configured to send the tile identifier of the map tile with the data state to the server side by carrying the tile identifier in the tile data request;

and the rendering module is configured to render the map in the current map window range according to the map tiles returned by the server in response to the tile data request.

In a fifth aspect, embodiments of the present disclosure provide an electronic device comprising a memory and a processor, wherein the memory is configured to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement the method of any one of the first or second aspects.

In a sixth aspect, embodiments of the present disclosure provide a computer-readable storage medium having stored thereon computer instructions which, when executed by a processor, implement the method of any one of the first or second aspects.

In a seventh aspect, embodiments of the present disclosure provide a computer program product comprising computer instructions which, when executed by a processor, implement the method steps as in any of the first or second aspects.

In an eighth aspect, an embodiment of the present disclosure provides a navigation method, where a navigation route calculated based on at least a start point, an end point and a road condition is obtained based on an electronic map, the navigation route is used to guide navigation of the carrier, and the electronic map is rendered based on the method according to any one of the second aspects.

According to the technical scheme provided by the embodiment of the disclosure, when the data index is established, map tiles can be aggregated according to adjacent spatial relations of map tiles in a predetermined map area to obtain a plurality of tile sets, for each tile set, the total number of map tiles in the tile set is determined based on tile identifications of the map tiles in the tile set, then map tiles in the tile set are traversed according to a set rule, the data index of the tile set is constructed, tile identifications of map tiles in the tile set are indicated by tile identification indication bits in the data index, data states of a corresponding map tile in the tile set are recorded according to a traversing sequence by each data state bit, and the number of the data state bits is the total number of map tiles in the tile set; therefore, the data index can know which map tiles have data and which map tiles have no data, and the client can only send valid uplink requests corresponding to the tile identifiers of the map tiles with data to the server without sending invalid uplink requests corresponding to the tile identifiers of the map tiles without data, so that the number of the uplink requests can be effectively reduced, and the pressure of the server is reduced.

According to the technical scheme provided by the embodiment of the disclosure, when map rendering is performed, the tile identifiers of map tiles covered by the current map window range can be obtained, then, in the data index of the pre-obtained tile set, the data state corresponding to the tile identifiers in the current map window range is queried, and the tile identifiers of the map tiles with data in the data state are carried in the tile data request and sent to the server, so that the map in the current map window range can be rendered according to the map tiles returned by the server in response to the tile data request, when the tile data request is sent by the client, only the effective uplink request corresponding to the tile identifiers of the data tiles in the type of empty tiles is sent by the client, and the invalid uplink request corresponding to the tile identifiers of the empty tiles is not required to be sent.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

Other features, objects and advantages of the present disclosure will become more apparent from the following detailed description of non-limiting embodiments, taken in conjunction with the accompanying drawings. In the drawings:

FIG. 1 illustrates a flow chart of a data index establishment method according to an embodiment of the present disclosure;

FIG. 2A illustrates a schematic diagram of a positional relationship of map tiles for different tile identifications in accordance with an embodiment of the present disclosure;

FIG. 2B illustrates an aggregate scheme schematic of a set of tiles according to an embodiment of the present disclosure;

FIG. 3 illustrates a flow chart of a map rendering method according to an embodiment of the present disclosure;

FIG. 4 illustrates an application scenario diagram of a data index building and map rendering method according to an embodiment of the present disclosure;

FIG. 5 shows a block diagram of a data index establishing device according to an embodiment of the present disclosure;

fig. 6 illustrates a block diagram of a map rendering apparatus according to an embodiment of the present disclosure;

fig. 7 shows a block diagram of an electronic device according to an embodiment of the disclosure;

fig. 8 shows a schematic diagram of a computer system suitable for use in implementing methods according to embodiments of the present disclosure.

Detailed Description

Hereinafter, exemplary embodiments of the present disclosure will be described in detail with reference to the accompanying drawings so that those skilled in the art can easily implement them. In addition, for the sake of clarity, portions irrelevant to description of the exemplary embodiments are omitted in the drawings.

In this disclosure, it should be understood that terms such as "comprises" or "comprising," etc., are intended to indicate the presence of features, numbers, steps, acts, components, portions, or combinations thereof disclosed in this specification, and are not intended to exclude the possibility that one or more other features, numbers, steps, acts, components, portions, or combinations thereof are present or added.

In addition, it should be noted that, without conflict, the embodiments of the present disclosure and features of the embodiments may be combined with each other. The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.

In the present disclosure, the user information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, presented data, etc.) involved are information and data authorized by the user or sufficiently authorized by the parties, and the collection, use, and processing of relevant data requires compliance with relevant laws and regulations and standards of the relevant country and region, and is provided with corresponding operation portals for the user to select authorization or denial.

As described above, the electronic map is an expression of the real world in the digital world, when the user performs interactive operations on the displayed electronic map, such as sliding operations, one sliding operation may cause a plurality of changes in the real world occurring within the window of the map, assuming that the displayed electronic map is an electronic map of city a, when the sliding operations of the user are stopped, the displayed electronic map is required to be displayed in city B1000 km away from city a, in order to ensure continuity of displaying the electronic map in the terminal screen, no jump occurs, and further, the electronic map from city a to city B needs to be continuously displayed, which may cause a tile data request (uplink request) generated by a single sliding operation to be several to ten times, and in case of a larger user base, the total amount of uplink requests from the client may be larger, resulting in an increase in service end pressure. Therefore, how to reduce the pressure of the server and realize the support of a small amount of server resources to large-scale users becomes a problem to be solved.

According to the scheme provided by the disclosure, a server can establish a data index by taking a tile set formed by a plurality of map tiles as a unit, wherein the data index of the tile set indicates tile identifications and data states (namely whether data exist or not) of map tiles in the tile set; therefore, after the server side transmits the data index of the tile set to the client side, when the client side acquires a plurality of tile identifications in the current map window range in real time, the data state of the map tiles corresponding to the plurality of tile identifications can be determined to be data or no data according to the received data index, so that only the valid uplink request corresponding to the tile identification with the data state can be transmitted to the server side, invalid uplink requests corresponding to the tile identification without the data state are not transmitted, the number of the uplink requests is effectively reduced, the pressure of the server side is lightened, and particularly when the map tiles with the data are in a larger area in the current display range, the effect is more obvious, and the aim of supporting large-scale users by a small amount of server side resources is fulfilled.

Fig. 1 shows a flowchart of a data index establishment method according to an embodiment of the present disclosure. As shown in fig. 1, the data index establishing method includes the following steps S101 to S104:

In step S101, map tiles within a predetermined map area are acquired;

in step S102, aggregating the map tiles based on their neighboring spatial relationships to obtain at least one tile set;

in step S103, for each tile set, determining a total number of map tiles in the tile set based on tile identifications of map tiles in the tile set;

in step S104, according to the set rule, map tiles in the tile set are traversed, and a data index of the tile set is constructed.

In one possible implementation, the data index establishing method is applicable to a computer, a computing device, a server cluster, and the like capable of performing data index establishment.

In one possible implementation, in the field of electronic map, a map is generally divided into a series of rectangular (such as rectangle or square) grids, and the grids are used as basic units for map data production and management, where the grids are called map tiles (Tile), and each map Tile corresponds to a unique Tile identifier (i.e. map Tile code), and the Tile identifier is calculated according to longitude and latitude information of the map Tile, and can reflect the position of the map Tile. Here, the map tile has a plurality of tile levels, and the map tiles described in this embodiment are all map tiles in the same tile level.

In one possible implementation, because map tiles are located in geographical locations, such as in remote mountainous areas or in confidential areas, where they cannot collect map information, vector data is not created in the areas where they are located, i.e. the map tiles have data status of no data, and the map tiles having data status of no data may be referred to as empty tiles and the map tiles having data status of data may be referred to as data tiles.

In one possible implementation, the tile set refers to a set containing a plurality of map tiles, since tile identifiers are calculated through longitude and latitude information of the map tiles, positions of the map tiles can be reflected, so that adjacent spatial relationships of the map tiles can be determined based on the tile identifiers of the map tiles, map tiles connected into one tile set based on the adjacent spatial relationships of the map tiles can be aggregated into one tile set, for example, the predetermined map region can be equally divided into one tile grid, and a plurality of map tiles connected into one tile grid can be used as one tile set, and the map tiles in the tile set can be map tiles with data or map tiles without data. It should be noted that, of course, if the predetermined map area is small, a plurality of map tiles in the predetermined map area may be aggregated into one tile set.

In one possible implementation, for each tile set, the total number of tile identifications of map tiles in the tile set, that is, the total number of map tiles in the tile set, may be counted.

In one possible implementation, a data index of a tile set may be generated in units of the tile set, where the data index includes a tile identification indication bit and a data status bit, where the tile identification indication bit indicates a tile identification of each map tile in the tile set, for example, the tile identification indication bit may record tile identifications of each map tile in a traversal order; the number of the data state bits is the total number of map tiles in the tile set, each data state bit can record the data state of a corresponding map tile according to the traversing sequence, and the data state can be data or data-free; after the data index of each tile set is established, the server can issue the data index of each tile set to the client, and when the client acquires a plurality of tile identifiers in the current map window range in real time, the client can determine the data states of map tiles corresponding to the plurality of tile identifiers according to the received data index, so that only effective uplink requests corresponding to the tile identifiers with data in the data states in the plurality of tile identifiers can be sent to the server, invalid uplink requests corresponding to the tile identifiers with data in the data state are not required to be sent, the number of the uplink requests is effectively reduced, and the pressure of the server is reduced.

When the data index is built, map tiles can be aggregated according to adjacent spatial relations of map tiles in a preset map area to obtain a plurality of tile sets, for each tile set, the total number of map tiles in the tile set is determined based on tile identifications of the map tiles in the tile set, then map tiles in the tile set are traversed according to a set rule, the data index of the tile set is built, the tile identifications of the map tiles in the tile set are indicated by tile identification indication bits in the data index, the data state of a corresponding map tile is recorded according to the traversing sequence by each data state bit, and the number of the data state bits is the total number of the map tiles in the tile set; therefore, the data index can know which map tiles have data and which map tiles have no data, and the client can only send valid uplink requests corresponding to the tile identifiers of the map tiles with data to the server without sending invalid uplink requests corresponding to the tile identifiers of the map tiles without data, so that the number of the uplink requests can be effectively reduced, and the pressure of the server is reduced.

In a possible implementation manner, step S102 in the above data index creating method may be further implemented as the following steps:

based on the adjacent spatial relationship between the map tiles, aggregating the map tiles with data states to obtain a data tile cluster, wherein the map tiles in the data tile cluster are adjacent to at least one other map tile in the same map tile cluster;

and determining a tile set according to the data tile cluster, wherein the area where the tile set is located is the minimum preset shape area covering the data tile cluster.

In this embodiment, the electronic map is a digital representation of the real world, and the information such as road information or POI (point of interest) in the real world often changes, so for a predetermined map area, the map making server needs to monitor the original data in the map area collected by the collection device at regular time to update the map of the map area. When it is detected that the original data in the map area is changed, it is necessary to create vector data based on the changed original data, and the vector data created by the map creation server may be the full-scale data in the map area or the incremental data in the map area, which is not limited thereto.

In this embodiment, when the full-scale data in the map area is acquired, the map tiles having vector data in the map area, that is, the list of map tiles having data in the data state (that is, the data tiles) may be directly acquired, and when the incremental data in the map area is acquired, the acquired incremental data may be fused with the vector data before the map area to obtain the vector data in the map area, and then the list of map tiles having vector data in the map area may be acquired. In this embodiment, a plurality of map tiles with data connected together may be aggregated according to the adjacent spatial relationship between the map tiles to obtain a plurality of data tile clusters, and for each data tile cluster, a spatial region with a minimum predetermined shape capable of covering the data tile cluster may be used as a region where the tile set is located, where map tiles in the region belong to map tiles in the tile set.

In this embodiment, the predetermined shape may be a rectangle, the area where the tile set is located may be a minimum rectangular area capable of covering the data tile cluster, for example, fig. 2B shows a schematic diagram of an aggregation scheme of tile sets according to an embodiment of the disclosure, the rectangle filled with lines in fig. 2B is a map tile with data, as shown in fig. 2B, the map tile with data is a tile with data, and a plurality of map tiles with data connected together into a piece may be aggregated together to form four data tile cluster clusters, so as to obtain a minimum rectangular area capable of covering the four data tile cluster clusters respectively, and map tiles in each minimum rectangular area form one tile set, so that a tile set 201, a tile set 202, a tile set 203 and a tile set 204 may be obtained.

It should be noted that, the area where the tile set is located is a minimum rectangular area capable of covering the data tile cluster, and for the map tiles without data outside the minimum rectangular area, the map tiles without data outside the minimum rectangular area are not aggregated into the tile set to be indexed with data, so that the data quantity of the data index can be reduced, and during the subsequent map rendering, the client only queries the tile identifiers of the map tiles with data, and does not need to query the tile identifiers of the map tiles without data, so that the map tiles without data are not indexed with data. In this way, map tiles with data can be indexed with minimal data volume.

In a possible implementation manner, step S103, that is, determining, for each tile set, based on the tile identifier of the map tile in the tile set, the total number of map tiles in the tile set may be implemented as the following steps:

for each tile set, determining the number of rows and columns of map tiles in the tile set based on tile identifications of map tiles in the tile set;

and calculating the product of the number of rows and the number of columns of map tiles in the tile set to obtain the total number of map tiles in the tile set.

In this embodiment, the area where the tile set is located is a rectangular area, and the number of rows and columns of map tiles in the tile set may be used to determine the total number of map tiles in the tile set, i.e. the product of the number of rows and columns of map tiles in the tile set is the total number of map tiles in the tile set. Because the tile identifiers of the map tiles are obtained by conversion according to longitude and latitude information of the map tiles, the tile identifiers of the map tiles can reflect arrangement positions of the map tiles in a tile set, and therefore the number of rows and the number of columns of the map tiles in the tile set can be determined based on the tile identifiers of the map tiles in the tile set. For example, tile identifications for map tiles in the set of tiles are typically identified by x-y-z, where x-y represents a plane within a tile hierarchy, x represents an abscissa, y represents an ordinate, z represents a tile hierarchy, x-y-z may represent a plane within tile hierarchy z, map tiles A located in the x-y identified region, x each have a value of 1 and each have a value of 1, the identified map tiles are moved one to the right, and each have a value of 1 and each have a value of y and each have a value of 1 and each. Assuming that the tile identifications of the map tiles in the tile set are 2580-449-12, 2581-449-12, 2580-450-12 and 2581-450-12, respectively, it can be presumed that the map tile identified by 2581-449-12 is adjacent to the map tile identified by 2580-449-12 and is positioned on the right side of the map tile identified by 2580-449-12, the map tile identified by 2580-450-12 is adjacent to the map tile identified by 2580-449-12 and is positioned above the map tile identified by 2580-449-12, and the map tile identified by 2581-450-12 is adjacent to the map tile identified by 2581-449-12, namely the position relationship of the map tiles in the map set is shown in fig. 2A, the tile set can be determined to be a set of map tiles of 2 rows and 2 columns, and the total number of map tiles in the map tile set can be obtained to be 2×2=4.

In one possible implementation, the tile identification indication bits include tile identification bits and a set of length bits, and traversing map tiles in the tile set according to a set rule to construct a data index of the tile set includes:

traversing map tiles in the tile set according to a set rule, and acquiring a tile identifier of a first traversed map tile and a data state of each map tile, wherein the data state comprises: with or without data;

storing the data states of the map tiles into a binary number group according to the traversing sequence, wherein the length of the binary number group is equal to the total number of the map tiles, and one binary number in the binary number group corresponds to one data state bit;

and generating a data index corresponding to the tile set, wherein the data index comprises tile identification bits recording tile identifications of the map tiles of the first traversal, the array length bits recording the number of rows and columns and the data state bits stored by the binary number array.

In this embodiment, since the tile identifiers are long, if the tile identifiers are directly used in the data index, the number of data indexes may be excessive, and in order to reduce the data amount, the tile identifier bit and the plurality of length bits may be used to indicate the tile identifiers of the map tiles in the tile set.

In this embodiment, the map tiles in the tile set may be traversed according to a set rule to obtain a tile identifier of the first traversed map tile and a data state of each map tile, where the data states include: with or without data, for example, each map tile may be traversed from bottom to top in a predetermined order from left to right in sequence, with the tile identifier of the first traversed map tile being the map tile in the bottom left corner of the tile set.

In this embodiment, according to the tile identifier of the map tile of the first traversal and the number of rows and columns of map tiles in the tile set, the tile identifiers of other map tiles can be calculated, and assuming that the tile identifiers of the map tiles of the first traversal are 2580-449-12, the tile identifiers located below the tile identifiers can be calculated, and the tile identifiers located on the right side of the tile identifiers are 2580-448-12, so that the number and positions of other map tiles can be determined according to the number of rows and columns, and further the tile identifiers of other map tiles can be calculated.

In this embodiment, assuming that the tile set has map tiles of m rows and n columns, a one-dimensional binary number set with a size of m×n may be constructed, and the binary number in the binary number set represents the data state of the map tiles at the corresponding positions in the tile set, for example, each map tile may be traversed from left to right in a predetermined order from bottom to top sequentially with a bottom left corner as a starting point, where when the traversed current map tile is a map tile with data, the corresponding binary number is 1, and when the traversed current map tile is a map tile without data, the corresponding binary number is 0. Taking the tile set 201, the tile set 202, the tile set 203 and the tile set 204 shown in fig. 2B as an example, the binary number set corresponding to the tile set 201 is 111, and the binary number set corresponding to the tile set 202 is 11111110; the set of tiles 203 corresponds to a binary number of 111011011 and the set of tiles 204 corresponds to a binary number of 11.

In this embodiment, the data index includes a tile identification bit, the array length bit, and the binary array; wherein the tile identification bit records the tile identification of the map tile of the first traversal, the array length bit records the number of rows and columns, and the binary array stores the data status bit. Still referring to the tile set shown in fig. 2B, the data index corresponding to the tile set 201 is (tile identifier a11,1 row and 3 column, 111), and the data index corresponding to the tile set 202 is (tile identifier B11,4 row and 2 column, 11111110); the data index corresponding to the tile set 203 is (tile identifier c11,3 rows and 3 columns, 111011011), and the data index corresponding to the tile set 204 is (tile identifier d11,2 rows and 1 columns, 11).

In one possible embodiment, the method may further comprise the steps of:

generating a data index of the tile set and a version number of vector data corresponding to map tiles in the tile set;

and transmitting the data index of the tile set corresponding to the latest version number to the client.

In this embodiment, in order to facilitate recording of updated vector data each time, a version number is generated, and the same version number may be assigned to both the data index of the current tile set and the vector data corresponding to the map tile in the tile set.

In this embodiment, the server may actively issue the data index of the tile set corresponding to the latest version number to the client, or may issue the data index of the tile set corresponding to the latest version number to the client when receiving the client request.

Fig. 3 illustrates a flowchart of a map rendering method according to an embodiment of the present disclosure. As shown in fig. 3, the map rendering method includes the following steps S301 to S304:

in step S301, obtaining tile identifiers of map tiles covered by a current map window range;

in step S302, in a data index of a pre-acquired tile set, querying a data state corresponding to a tile identifier within the current map window range, where the data index includes a tile identifier indication bit and a data state bit, and the tile identifier indication bit indicates a tile identifier of a map tile in the tile set and a data state of each map tile corresponding to each data state bit record;

in step S303, the tile identifier of the map tile with data status is sent to the server side with the tile identifier carried in the tile data request;

in step S304, according to the map tile returned by the server in response to the tile data request, a map within the current map window is rendered.

In one possible implementation, the map rendering method is suitable for a client capable of executing map rendering, where the client may be a logic body formed by programming language and running in an electronic device such as a tablet computer, a notebook computer, a smart phone, a digital assistant, a smart wearable device, an on-board terminal, and the like, and for example, the client may be an application program (APP) running on the electronic device.

In a possible implementation manner, the server may obtain the data index of the tile set through the data index establishing method, and meanwhile, the server stores map tiles with data states as data. The server may actively issue the data index of the tile set it constructs to each client. Here, the data index of the tile set issued by the server is the data index of the tile set corresponding to the latest version number.

In one possible implementation, the data index includes a tile identification indication bit and a data status bit, the tile identification indication bit indicating a tile identification of a map tile in the set of tiles, each data status bit recording a data status of a corresponding map tile; thus, according to the data index, whether the data state of the map tile corresponding to each tile identifier in the tile set is data or no data can be known.

In one possible implementation manner, when a user starts a client, the client displays a map within a current map window range to provide map services for the user, and an electronic map displayed by the client within the current map window range has two display states, namely, an electronic map in a map browsing state and an electronic map in a map navigation state, and tile identifiers of map tiles covered by the current map window range can be obtained based on different display states. Then, the client queries the data index of the pre-acquired tile set, filters out the tile identifiers with the data state being no data in the tile identifiers in the current map window range, and acquires the tile identifiers of the map tiles with the data state being data in the tile identifiers in the current map window range.

In one possible implementation manner, the client may send the tile identifier of the map tile with data to the server in a corresponding tile data request, and after the server receives the corresponding tile data request, the server may query and obtain the map tile with data corresponding to the tile identifier and return the map tile with data corresponding to the target tile identifier to the client, where the data state of the map tile with data corresponding to the target tile identifier is all data, so that the server returns the map tile with data in the current map window range to the client.

In one possible implementation manner, after the client receives the map tile with data returned by the server, the map within the current map window can be rendered according to the map tile and displayed for the user.

According to the embodiment, when the tile identifiers of the map tiles covered by the current map window range are acquired in real time, the data states of the map tiles corresponding to the tile identifiers can be determined according to the data indexes acquired in advance, then the tile identifiers with the data states of the map tiles being no data in the tile identifiers can be filtered, the tile identifiers with the data states of the map tiles being the map tiles with the data in the tile identifiers are acquired, and therefore the client can send valid tile data requests corresponding to the tile identifiers with the data states being the data to the server, and invalid tile data requests corresponding to the tile identifiers with the data states being no data do not need to be sent, so that the quantity of uplink requests is effectively reduced, the pressure of the server is reduced, and particularly when the map tiles with the data are in a larger area in the current display range, the effect is more obvious, and the aim of large-scale user use of a small quantity of server resource support is achieved.

In one possible implementation manner, the map rendering method may further include the following steps:

responding to the starting of a client, and sending a data index request to the server, wherein the data index request is used for requesting to issue a data index of the tile set;

and receiving the data index of the tile set issued by the server.

In this embodiment, when the client starts, the client may actively send a data index request to the server, to request the server to issue the data index of the tile set, and when the server receives the data index request, the client may issue the data index of the tile set to the client, so that the client may acquire the data index of the tile set.

In one possible embodiment, the method further comprises:

determining tile identifiers and corresponding data states of map tiles in a tile set according to a pre-acquired data index of the tile set;

constructing an index tree according to tile identifiers of map tiles in the tile set and corresponding data states of the map tiles;

in the data index of the pre-acquired tile set, querying the data state corresponding to the tile identifier in the current map window range specifically includes:

And querying a data state corresponding to the tile identifier in the current map window range in an index tree corresponding to the data index of the pre-acquired tile set.

In this embodiment, if the tile identifier in the data index of the tile set indicates the tile identifier of each map tile in the tile set, the tile identifier and the data status of each map tile in the tile set may be directly obtained from the data index of the tile set. If the data index of the tile set includes a tile identification bit, an array length bit, and a data status bit as described in the above embodiments, then the tile identification of each map tile in the tile set needs to be calculated from the tile identification bit and the array length bit. For example, as shown in fig. 2B, the tile set 201 corresponds to a data index of (tile identifier a11,1 row and 3 column, 111), and the tile set 202 corresponds to a data index of (tile identifier B11,4 row and 2 column, 11111110); the data index corresponding to the tile set 203 is (tile identifier c11,3 rows and 3 columns, 100111111), and the data index corresponding to the tile set 204 is (tile identifier d11,2 rows and 1 columns, 11). Tile identifier a11, tile identifier b11, tile identifier c11, tile identifier d11 are each the number of the map tile in the lower left corner of the corresponding set of tiles. For example, the tile set 201 includes map tiles of 1 row and 3 column, and from the tile identifier a11 of the map tile at the lower left corner, the tile identifier a12 of the first map tile located at the right side of the tile set can be deduced, and the tile identifier a13 of the second map tile is deduced, wherein the map tiles corresponding to the tile identifiers a11, a12 and a13 are all map tiles with data. The tile set 202 includes 4 map tiles of row 2 and column 2, and according to the tile identifier b11 of the map tile at the lower left corner, the tile identifier b12 of the first map tile located at the right side of b11, the tile identifier b21 of the first map tile located above b11, and so on, wherein the map tiles corresponding to the tile identifiers b11, b12, b21, b22, b31, b32 and b41 are all map tiles with data, and the map tile corresponding to the tile identifier b42 is all map tiles without data, namely, the map tile at the upper right corner of the tile set is a map without data. Of course. The method of determining tile identifications and their corresponding data states for each map tile in tile set 203 and tile set 204 from the data indices of tile set 203 and tile set 204 is similar to that described above and is not illustrated herein.

In this embodiment, an index tree may be constructed according to the tile identifiers of the map tiles in the tile set and the corresponding data states thereof, so that after the tile identifiers in the current map window range are obtained, the data states corresponding to the tile identifiers in the current map window range can be obtained by querying the index tree, and the tile identifiers of the map tiles with data in the data states in the tile identifiers in the current map window range are obtained.

According to the method, the target tile identifier of the map tile with data in the data state in the tile identifier in the map window range is queried in a mode of constructing the index tree, and the query speed is higher.

Fig. 4 illustrates an application scenario diagram of a data index creation and map rendering method according to an embodiment of the present disclosure. As shown in fig. 4, the index creating server 401 may create a data index of a tile set by using the above data index creating method, and provide the data index of the tile set to the map data server 402, and the map data server 402 may send the data index of the tile set to the client 403, and the client 403 may send a tile data request carrying a tile identifier of the map tile with data by using the above map rendering method, and the map data server 402 may return the map tile with data requested by the tile data request to the client, so that the client may render a map within the current map window range according to the map tile corresponding to the target tile identifier, and display the map within the current map window range for the user.

Fig. 5 shows a block diagram of a data index creating apparatus according to an embodiment of the present disclosure. The apparatus may be implemented as part or all of an electronic device by software, hardware, or a combination of both. As shown in fig. 5, the data index creating apparatus includes:

a data tile acquisition module 501 configured to acquire map tiles within a predetermined map region;

a set acquisition module 502 configured to aggregate the map tiles based on their neighboring spatial relationships to obtain at least one set of tiles;

a rank determination module 503 configured to determine, for each set of tiles, a total number of map tiles in the set of tiles based on tile identifications of map tiles in the set of tiles;

the index generating module 504 is configured to traverse map tiles in the tile set according to a set rule, and construct a data index of the tile set, where the data index includes a tile identifier indication bit and a data status bit, the tile identifier indication bit indicates a tile identifier of each map tile in the tile set, each data status bit records a data status of a corresponding map tile according to a traversal order, and the number of the data status bits is a total number of map tiles in the tile set.

In one possible implementation, the set acquisition module 502 is configured to:

In one possible implementation, the tile identification indication bits include tile identification bits and a group length bit, and the index generation 504 module is configured to:

In one possible embodiment, the apparatus further comprises:

the version number generation module is configured to generate a data index of the tile set and a version number of vector data corresponding to map tiles in the tile set;

and the data issuing module is configured to issue the data index of the tile set corresponding to the latest version number to the client.

Fig. 6 illustrates a block diagram of a map rendering apparatus according to an embodiment of the present disclosure. The apparatus may be implemented as part or all of an electronic device by software, hardware, or a combination of both. As shown in fig. 6, the map rendering apparatus includes:

an identifier obtaining module 601, configured to obtain tile identifiers of map tiles covered by a current map window range;

a query module 602, configured to query a data index of a pre-acquired tile set for a data state corresponding to a tile identifier within the current map window, where the data index includes a tile identifier indication bit and a data state bit, and the tile identifier indication bit indicates a tile identifier of a map tile in the tile set and a data state of each data state bit records a corresponding map tile;

A data request sending module 603 configured to send a tile identifier of a map tile with data in a data state to a server in a tile data request;

and the rendering module 604 is configured to render the map in the current map window range according to the map tiles returned by the server side in response to the tile data request.

In one possible embodiment, the apparatus further comprises:

the index request sending module is configured to respond to the starting of the client and send a data index request to the server, wherein the data index request is used for requesting to issue a data index of the tile set;

and the data receiving module is configured to receive the data index of the tile set issued by the server.

In one possible embodiment, the apparatus further comprises:

a data validation module configured to determine tile identifications and corresponding data states of map tiles in a set of tiles according to a pre-acquired data index of the set of tiles;

the index number construction module is configured to construct an index tree according to tile identifications and corresponding data states of map tiles in the tile set;

The query module 602 is configured to:

Technical terms and technical features mentioned in the embodiment of the present device are the same or similar, and explanation of technical terms and technical features referred to in the present device may refer to explanation of the above method embodiment, and are not repeated herein.

The present disclosure also discloses an electronic device, and fig. 7 shows a block diagram of the electronic device according to an embodiment of the present disclosure.

As shown in fig. 7, the electronic device 700 includes a memory 701 and a processor 702, wherein the memory 701 is configured to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor 702 to implement a method according to an embodiment of the disclosure.

As shown in fig. 8, the computer system 800 includes a processing unit 801 that can execute various processes in the above-described embodiments according to a program stored in a Read Only Memory (ROM) 802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the computer system 800 are also stored. The processing unit 801, the ROM 802, and the RAM 803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to the bus 804.

The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, mouse, etc.; an output portion 807 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and a speaker; a storage section 808 including a hard disk or the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. The drive 810 is also connected to the I/O interface 805 as needed. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as needed so that a computer program read out therefrom is mounted into the storage section 808 as needed. The processing unit 801 may be implemented as a processing unit such as CPU, GPU, TPU, FPGA, NPU.

In particular, according to embodiments of the present disclosure, the methods described above may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising computer instructions which, when executed by a processor, implement the method steps described above. In such embodiments, the computer program product may be downloaded and installed from a network via communication portion 809, and/or installed from removable media 811.

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units or modules referred to in the embodiments of the present disclosure may be implemented in software or in programmable hardware. The units or modules described may also be provided in a processor, the names of which in some cases do not constitute a limitation of the unit or module itself.

As another aspect, the present disclosure also provides a computer-readable storage medium, which may be a computer-readable storage medium included in the electronic device or the computer system in the above-described embodiments; or may be a computer-readable storage medium, alone, that is not assembled into a device. The computer-readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present disclosure.

The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention referred to in this disclosure is not limited to the specific combination of features described above, but encompasses other embodiments in which any combination of features described above or their equivalents is contemplated without departing from the inventive concepts described. Such as those described above, are mutually substituted with the technical features having similar functions disclosed in the present disclosure (but not limited thereto).

Claims

1. A data index building method, comprising:

acquiring map tiles in a predetermined map area;

traversing map tiles in the tile set according to a set rule, constructing a data index of the tile set, wherein the data index comprises tile identification indication bits and data state bits, the tile identification indication bits are used for indicating tile identifications of the map tiles in the tile set, each data state bit records data states of the corresponding map tiles according to a traversing sequence, and the number of the data state bits is equal to the total number of the map tiles.

2. The method of claim 1, wherein the aggregating the map tiles based on adjacent spatial relationships of the map tiles to obtain at least one tile set comprises:

based on the adjacent spatial relationship between the map tiles, aggregating the map tiles with data states to obtain a data tile cluster, wherein the map tiles in the data tile cluster are adjacent to at least one other map tile in the same cluster;

And determining a tile set according to the data tile cluster, wherein map tiles included in the tile set cover the minimum regular-shape area determined by the map tiles in the data tile cluster.

3. The method of claim 1, the determining, for each set of tiles, a total number of map tiles in the set of tiles based on tile identifications of map tiles in the set of tiles, comprising:

4. The method of claim 3, wherein the tile identification indication bits comprise tile identification bits and a set of length bits, the traversing map tiles in the set of tiles according to a set rule, constructing a data index for the set of tiles, comprising:

5. The method of any one of claims 1-4, wherein the method further comprises:

6. A map rendering method, comprising:

acquiring tile identifiers of map tiles covered by a current map window range;

7. The method of claim 6, wherein the method further comprises:

and receiving the data index of the tile set issued by the server.

8. The method of claim 6, the method further comprising:

9. An electronic device includes a memory and a processor; wherein the memory is for storing one or more computer instructions for execution by the processor to perform the method steps of any one of claims 1 to 8.

10. A computer program product comprising computer instructions which, when executed by a processor, implement the method steps of any of claims 1 to 8.