CN110232105A - A kind of Compilation Method and device of road net data - Google Patents
A kind of Compilation Method and device of road net data Download PDFInfo
- Publication number
- CN110232105A CN110232105A CN201910510566.1A CN201910510566A CN110232105A CN 110232105 A CN110232105 A CN 110232105A CN 201910510566 A CN201910510566 A CN 201910510566A CN 110232105 A CN110232105 A CN 110232105A
- Authority
- CN
- China
- Prior art keywords
- road
- block
- sub
- circuit node
- index
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Software Systems (AREA)
- Traffic Control Systems (AREA)
Abstract
The embodiment of the present application provides the Compilation Method and device of a kind of road net data, it is related to Cartographic Technique field, this method comprises: after road net data to be compiled is mapped to original data block, judge whether the road element number in original data block meets initial threshold, if being unsatisfactory for, then by original data block, successively iteration is split as sub-block step by step, road element number until splitting the sub-block obtained, which meets the preset threshold value of corresponding fractionation rank or splits rank, meets pre-set level, therefore the road element number in each sub-block is more uniform, when establishing index to the road element in each sub-block again later, avoid the road that road element is more than the index upper limit and deletes inferior grade, to ensure that the integrality of road data, secondly, also avoiding road element excessively makes data block excessive, improve the speed of path search And the download performance of road net data.In addition, also avoiding waste of storage space caused by road element is very few in data block.
Description
Technical field
The invention relates to Cartographic Technique field more particularly to the Compilation Methods and device of a kind of road net data.
Background technique
The bustling degree of different cities different zones is different, and the road quantity and grade of corresponding region are also different, road network number
According to usually storing these road informations with the map sheet of some fixed size.Road net data is due to factors such as file size, structures
It is unfavorable for navigation engine directly to use, it will usually carry out data compilation.At present when being compiled to road net data, schemed with one
Width is unit, and the road in map sheet is mapped in block, is then indexed using fixed byte to the road in map sheet, due to not
It is different with the road quantity in region, and index there are fixed upper limit, it is excessively overflowed so as to cause road in the map sheet having, in turn
Deleting inferior grade road causes road to lose, and road is very few and waste memory space in some map sheets.
Summary of the invention
When being indexed in block since as unit of a map sheet, the road in map sheet being mapped to, lead to the map sheet having
Middle road is excessive and overflows, and then deletes inferior grade road and road is caused to lose, and road is very few in some map sheets and waste stores
The problem of space, the embodiment of the present application provide the Compilation Method and device of a kind of road net data.
On the one hand, the embodiment of the present application provides a kind of Compilation Method of road net data, comprising:
Obtain road net data to be compiled；
The road net data to be compiled is mapped in original data block；
When road element number in the original data block is greater than initial threshold, the original data block is torn open
Point, obtain multiple first order sub-blocks；
For the multiple first order sub-block, road element number is greater than the first order subdata of level-one threshold value if it exists
Block, the then each first order sub-block for continuing to be greater than road element number level-one threshold value are split as multiple second level subdatas
Block；
Successively iteration is split step by step, until the corresponding fractionation rank of road element number satisfaction in all sub-blocks is preset
Threshold value or fractionation rank meet pre-set level；
Road element in each sub-block respectively obtained creates index.
On the one hand, the embodiment of the present application provides a kind of compilation device of road net data, comprising:
Module is obtained, for obtaining road net data to be compiled；
Mapping block, for mapping to the road net data to be compiled in original data block；
Module is split, when being greater than initial threshold for the road element number in the original data block, to described original
Data block is split, and multiple first order sub-blocks are obtained；For the multiple first order sub-block, road is first if it exists
Prime number is greater than the first order sub-block of level-one threshold value, then continues each first order for being greater than level-one threshold value to road element number
Data block is split as multiple second level sub-blocks；Successively iteration is split step by step, until the road element in all sub-blocks
Number, which meets the preset threshold value of corresponding fractionation rank or splits rank, meets pre-set level；
Index module, for being respectively that the road element in each sub-block obtained creates index.
Optionally, the road element includes road and road circuit node；
The index module is specifically used for:
Road and road circuit node creation index for each sub-block of acquisition, in the respectively described sub-block.
Optionally, the index module is specifically used for:
For each sub-block, when the road circuit node of road is respectively positioned on the sub-block, by the category of the road
Property information, the attribute information of the road circuit node of the road, the sub-block index of the attribute information as the road；
Blocking the way circuit node is located at the sub-block, and is respectively positioned on the subdata with the associated road of road circuit node
When block, using the attribute information of the attribute information of the road circuit node and the associated road of road circuit node as the road
The index of node.
Optionally, the index module is specifically used for:
For each sub-block, when the start channel circuit node of road is located at the sub-block, the terminal of the road
When road circuit node is located at other sub-blocks, the first mapping of the terminal road circuit node and other sub-blocks of the road is determined
Relationship, by the attribute information of the road, the attribute information of the start channel circuit node of the road, the sub-block attribute
The index of information and first mapping relations as the road；
When the terminal road circuit node of the road is located at the sub-block, the start channel circuit node of the road is located at it
When his sub-block, determine the second mapping relations of the road Yu other sub-blocks, using second mapping relations as
The index of the road.
Optionally, the index module is specifically used for:
For each sub-block, blocking the way circuit node is located at the sub-block, with the associated road of road circuit node
In when including the road across sub-block, determine that terminal road circuit node is the road circuit node from the road across sub-block
Target road, and determine the attribute information of the target sub-block where the start channel circuit node of the target road, it will be described
The attribute information of road circuit node, the attribute with the attribute information of the associated road of road circuit node, the target sub-block
Index of the information as the road circuit node.
It optionally, further include enquiry module；
The enquiry module is specifically used for:
It obtains target position and determines screening areas centered on the target position；
The position of screening areas data block corresponding with the road net data to be compiled is compared, determine described in
The corresponding target data block of screening areas；
Traverse the road in the target data block, the determining and matched road of the screening areas.
Optionally, the initial threshold and other threshold values at different levels are all the same, and/or, the sub-block split in every grade
Size is identical.
On the one hand, the embodiment of the present application provides a kind of computer equipment, including memory, processor and is stored in storage
On device and the computer program that can run on a processor, the processor realize the compiling of road net data when executing described program
The step of method.
On the one hand, the embodiment of the present application provides a kind of computer readable storage medium, and being stored with can be set by computer
The standby computer program executed, when described program is run on a computing device, so that the computer equipment executes road network
The step of Compilation Method of data.
In the embodiment of the present application, after road net data to be compiled is mapped to original data block, original data block is judged
In road element number whether meet initial threshold, if not satisfied, then by original data block step by step successively iteration split, until tearing open
The road element number of the sub-block separately won, which meets the preset threshold value of corresponding fractionation rank or splits rank, meets pre-set level,
Therefore the road element number in each sub-block is more uniform, establishes index to the road element in each sub-block again later
When, the road that road element is more than the index upper limit and deletes inferior grade is avoided, thus ensure that the integrality of road data,
It is secondary, it also avoids road element and excessively makes data block excessive, improve the downloading of the speed and road net data of path search
Performance.In addition, also avoiding waste of storage space caused by road element is very few in data block.
Detailed description of the invention
In order to more clearly explain the technical solutions in the embodiments of the present application, make required in being described below to embodiment
Attached drawing is briefly introduced, it should be apparent that, drawings in the following description are only some embodiments of the invention, for this
For the those of ordinary skill in field, without any creative labor, it can also be obtained according to these attached drawings
His attached drawing.
Fig. 1 is a kind of application scenarios schematic diagram provided by the embodiments of the present application；
Fig. 2 is a kind of schematic diagram of navigation circuit provided by the embodiments of the present application；
Fig. 3 is a kind of schematic diagram of the method for inquiry roads provided by the embodiments of the present application；
Fig. 4 is a kind of flow diagram of the Compilation Method of road net data provided by the embodiments of the present application；
Fig. 5 is a kind of schematic diagram for splitting data block provided by the embodiments of the present application；
Fig. 6 is a kind of schematic diagram for splitting data block provided by the embodiments of the present application；
Fig. 7 is a kind of schematic diagram for splitting data block provided by the embodiments of the present application；
Fig. 8 a is a kind of schematic diagram of sub-block and road element provided by the embodiments of the present application；
Fig. 8 b is a kind of schematic diagram of sub-block and road element provided by the embodiments of the present application；
Fig. 8 c is a kind of schematic diagram of sub-block and road element provided by the embodiments of the present application；
Fig. 8 d is a kind of schematic diagram of sub-block and road element provided by the embodiments of the present application；
Fig. 8 e is a kind of schematic diagram of sub-block and road element provided by the embodiments of the present application；
Fig. 9 is a kind of flow diagram of the method for inquiry roads provided by the embodiments of the present application；
Figure 10 is a kind of schematic diagram of inquiry roads provided by the embodiments of the present application；
Figure 11 is a kind of schematic diagram of the Compilation Method of road net data provided by the embodiments of the present application；
Figure 12 is a kind of structural schematic diagram of the compilation device of road net data provided by the embodiments of the present application；
Figure 13 is a kind of structural schematic diagram of computer equipment provided by the embodiments of the present application.
Specific embodiment
In order to which the purpose of the present invention, technical solution and beneficial effect is more clearly understood, below in conjunction with attached drawing and implementation
Example, the present invention will be described in further detail.It should be appreciated that specific embodiment described herein is only used to explain this hair
It is bright, it is not intended to limit the present invention.
In order to facilitate understanding, noun involved in the embodiment of the present application is explained below.
Data compilation: source road net data is encoded into the binary format file of set specification.
Original data block: the corresponding data block of a map sheet in road net data.
Sub-block (SubBlock): super large data block cuts into smaller small data block.
Road (Link): a unit of road type is stored in data.
Road circuit node (Node): the connection relationship between storage road both ends terminal point information and Lu Yulu.
During concrete practice, discovery when being compiled to road net data, as unit of a map sheet, will be schemed at present
Road in width is mapped in block, is then indexed using fixed byte to the road in map sheet.For example, using 2 bytes to one
Road in a map sheet indexes, and it is 65535 that 2 bytes, which store the path search index upper limit,.And the bustling journey of different cities different zones
Degree is different, and the road quantity and grade of corresponding region are also different.It, will when the road quantity in a map sheet is more than the index upper limit
There is the case where index overflows.It is retrieved in order to not influence to high-grade road, will be deleted the road of some inferior grades, from
And lead to the loss of road, while this excessive data block will affect the search performance of road and the downloading of road net data
Energy.When the road quantity in a map sheet far smaller than indexes the upper limit, the waste of memory space will lead to.
In consideration of it, the embodiment of the present application provides a kind of Compilation Method of road net data, this method comprises: obtaining to be compiled
Road net data maps to road net data to be compiled in original data block.Road element number in original data block is greater than just
When beginning threshold value, original data block is split, obtains multiple first order sub-blocks.For multiple first order sub-blocks,
Road element number is greater than the first order sub-block of level-one threshold value if it exists, then continues to be greater than level-one threshold value to road element number
Each first order sub-block is split as multiple second level sub-blocks.Successively iteration is split step by step, until all sub-blocks
In road element number meet and corresponding split the preset threshold value of rank.It is later again respectively the road in each sub-block obtained
Road element creation index.
After road net data to be compiled is mapped to original data block, judge that the road element number in original data block is
It is no to meet initial threshold, if not satisfied, then by original data block, successively iteration is split step by step, until splitting the sub-block obtained
Road element number meet it is corresponding split the preset threshold value of rank or split rank meet pre-set level, therefore in each sub-block
Road element number it is more uniform, later again in each sub-block road element establish index when, avoid road element
The road of inferior grade is deleted more than the index upper limit, to ensure that the integrality of road data, secondly, also avoiding road member
Element excessively makes data block excessive, improves the speed of path search and the download performance of road net data.In addition, also avoiding
Waste of storage space caused by road element is very few in data block.
The Compilation Method of road net data in the embodiment of the present application can be applied to application scenarios as shown in Figure 1, at this
It include terminal device 101, server 102 in application scenarios.
Terminal device 101 is the electronic equipment for having network communications capability, which can be smart phone, plate
Computer or portable personal computer etc..Map application is installed, terminal device 101 passes through nothing on terminal device 101
Gauze network is connect with server 102.It include the compilation device of road net data in server 102, for road net data to be compiled
It is compiled.
Scene one, when user navigates, in the map application of terminal device 101 input navigation starting point
Position and navigation final position.Terminal device 101 sends navigation requests to server 102.Server 102 is advised according to road net data
Navigation routine is drawn, it is specific as shown in Figure 2.Section in navigation circuit is located at sub-block 0 and sub-block 1, therefore by subnumber
Terminal device 101, the map application of terminal device 101 are sent to according to the information in the navigation section in block 0 and sub-block 1
Show navigation routine.Since in navigation, the section in navigation routine is the part road in map sheet, therefore by original data block
It splits after determining multiple sub-blocks, the data block that terminal device only needs download navigation route to be located at, without downloading
Entire original data block, to improve the download performance and navigation efficiency of road net data.
Scene two, when user needs to inquire nearest apart from current location road, in the map application of terminal device 101
Current location p is positioned in program, then clicks " inquiry peripheral path ", terminal device 101 sends the request of inquiry peripheral path
To server 102, server 102 determines screening areas centered on the p of current location, then determines the target that screening areas is located at
Data block is sub-block 0, specific as shown in Figure 3.In sub-block 0 exist with the matched road L1 of screening areas, by road
Road L1 determination and the nearest target road in current location, are then sent to terminal device 101 for the relevant information of target road, eventually
The map application displaying target road of end equipment 101.After original data block is split determining multiple sub-blocks, therefore
In inquiry roads, the road in sub-block can be first traversed, then gradually expands the range of traversal, without at the beginning
With regard to traversing entire original data block, to improve the efficiency of path search.
Based on application scenario diagram shown in FIG. 1, the embodiment of the present application provides a kind of stream of the Compilation Method of road net data
The process of journey, this method can be executed by the compilation device of road net data, as shown in Figure 4, comprising the following steps:
Step S401 obtains road net data to be compiled.
Step S402 maps to road net data to be compiled in original data block.
Specifically, road net data to be compiled is source road network map sheet, and source road network can divide more according to fixed area size
Then a map sheet is compiled for each map sheet, the quantity of road element is marked in each map sheet.
Step S403 tears original data block open when the road element number in original data block is greater than initial threshold
Point, obtain multiple first order sub-blocks.
Specifically, road element includes road and road circuit node, can be with when judging whether original data block needs to split
Individually judge whether road number is greater than initial threshold in original data block, can also individually judge road circuit node in original data block
Whether number is greater than initial threshold, can also judge whether the sum of road number and road number of nodes are greater than initial threshold in original data block
Value, for this purpose, the embodiment of the present application is not specifically limited.
Step S404, for multiple first order sub-blocks, road element number is greater than the first order of level-one threshold value if it exists
Sub-block then continues to be split as each first order sub-block that road element number is greater than level-one threshold value multiple second level
Data block.
In specific implementation, the first order sub-block of level-one threshold value is not more than for road element number, can to such the
Level-one sub-block is split, and can not also be split to such first order sub-block.
Step S405, successively iteration is split step by step, until the road element number in all sub-blocks meets corresponding split
The preset threshold value of rank or fractionation rank meet pre-set level.
In a kind of possible embodiment, initial threshold and other threshold values at different levels are all the same, and/or, it is split in every grade
The size of sub-block is identical.
Illustratively, as shown in figure 5, setting initial threshold and other threshold values at different levels are 2000.Judge initial data block
In road number of nodes whether be greater than 2000, if more than, then by original data block carry out 2*2 fractionation, it is identical to obtain 4 sizes
First order subnumber block, respectively sub-block 0, sub-block 1, sub-block 2, sub-block 3.Otherwise not to initial data
Block is split.Then judge whether the road number of nodes in each first order sub-block is greater than 2000 respectively, if subdata
Road number of nodes in block 0 is greater than 2000, sub-block 1, sub-block 2, the road number of nodes in sub-block 3 no more than
When 2000, sub-block 0 is carried out to the fractionation of 2*2, obtains the identical second level subnumber block of 4 sizes, respectively sub-block
4, sub-block 5, sub-block 6, sub-block 7.Subdata block 1, sub-block 2, sub-block 3 are without splitting.So
Judge whether the road number of nodes in each second level sub-block is greater than 2000 respectively afterwards, if being all not more than, stops splitting.
Illustratively, as shown in fig. 6, setting initial threshold and other threshold values at different levels are 2000.Judge initial data block
In road number of nodes whether be greater than 2000, if more than, then by original data block carry out 2*2 fractionation, it is identical to obtain 4 sizes
First order subnumber block, respectively sub-block 0, sub-block 1, sub-block 2, sub-block 3, otherwise not to initial data
Block is split.Then judge whether the road number of nodes in each first order sub-block is greater than 2000 respectively, if subdata
Road number of nodes in block 0 is greater than 2000, sub-block 1, sub-block 2, the road number of nodes in sub-block 3 no more than
When 2000, then give up level-one and split the first order subnumber block obtained, original data block is carried out to the fractionation of 4*4, obtains 16 big
Small identical second level subnumber block, respectively sub-block 4-19.Since the default rank that splits is second level, then regardless of second level
Whether the road number of nodes in several piece, which is greater than 2000, stops splitting.
In a kind of possible embodiment, initial threshold and other threshold values at different levels are all different, and/or, it is split in every grade
Sub-block size it is not exactly the same.
For example, initial threshold can be all larger than level-one threshold value, level-one threshold value is greater than secondary threshold.For another example, such as Fig. 7 institute
Show, judge whether the road number of nodes in initial data block is greater than initial threshold, if more than then original data block is torn open
Point, obtain 3 first order subnumber blocks, respectively sub-block 0, sub-block 1, sub-block 2, wherein sub-block 1 and son
2 size of data block is identical, and sub-block 0 is greater than sub-block 1 and sub-block 2.
Step S406, the road element in each sub-block respectively obtained create index.
In specific implementation, the index of road element in each sub-block can be created using fixed byte, for example uses 2
Byte creates the index of road element in each sub-block, then the index upper limit in each data block is 65535, thus
The path search index range of entire road network can be improved.
After road net data to be compiled is mapped to original data block, judge that the road element number in original data block is
It is no to meet initial threshold, if not satisfied, then by original data block, successively iteration is split step by step, until splitting the sub-block obtained
Road element number meet it is corresponding split the preset threshold value of rank or split rank meet pre-set level, therefore in each sub-block
Road element number it is more uniform, later again in each sub-block road element establish index when, avoid road element
The road of inferior grade is deleted more than the index upper limit, to ensure that the integrality of road data, secondly, also avoiding road member
Element excessively makes data block excessive, improves the speed of path search and the download performance of road net data.In addition, also avoiding
Waste of storage space caused by road element is very few in data block.
It optionally, since road element includes road and road circuit node, therefore is being respectively in each sub-block obtained
Road element create index when, can for obtain each sub-block, road and road respectively in sub-block
Node creation index.It specifically, include the relevant information of road or road circuit node in index.The index of road and road circuit node
Index can be separated and be established, and in inquiry, can be inquired respectively for inquiry target.
Due to when splitting to data block, not interrupting original road network information, therefore can in the data block after splitting
Can be comprising the road or road circuit node not across data block, while including road or road circuit node across data block, for not across
Data block and road or road circuit node across data block, the embodiment of the present application is using following implementation creation index:
In a kind of possible embodiment, for each sub-block, when the road circuit node of the road is respectively positioned on subnumber
When according to block, i.e., when the road is not across data block, by the attribute information of the road, attribute information, the son of the road circuit node of the road
Index of the attribute information of data block as the road.
In specific implementation, attribute information can be mark, location information, shape information etc..
Illustratively, as shown in Figure 8 a, setting data block is divided into four sub-blocks, respectively sub-block 0, subnumber
According to block 1, sub-block 2, sub-block 3.The road circuit node of road L0 is N0 and N1, since N0 and N1 is respectively positioned on sub-block 2,
Then road L0 is the road not across data block.Index of the road L0 in sub-block 2 can be (L0:N0:N1: sub-block
2)。
In a kind of possible embodiment, for each sub-block, when the road circuit node is located at sub-block, and with
When the associated road of road circuit node is respectively positioned on sub-block, when the road Ji Gai circuit node is not across data block, by the road circuit node
Index of the attribute information of attribute information and the associated road of road circuit node as the road circuit node.
Illustratively, as shown in Figure 8 b, data block is divided into four sub-blocks, respectively sub-block 0, sub-block
1, sub-block 2, sub-block 3.Road circuit node is that N0 is located at sub-block 2, is road with the associated road of road circuit node N0
L0 and road L1, wherein the road circuit node of L0 is N0 and N1, and the road circuit node of L1 is N0 and N2, due to road section N0, N1, N2
It is respectively positioned on sub-block 2, therefore road L0 and road L1 be not across data block, and then it can be concluded that road circuit node N0 is not trans-regional,
Then index of the circuit node N0 in road in sub-block 2 can be (N0:L0:L1).
In a kind of possible embodiment, for each sub-block, when the start channel circuit node of road is located at the son
Data block when that is, the road is across data block, determines the road when terminal road circuit node of the road is located at other sub-blocks
First mapping relations of terminal road circuit node and other sub-blocks, by the attribute information of the road, the starting road of the road
The index of the attribute information of node, the attribute information of sub-block and the first mapping relations as road.
When the terminal road circuit node of the road is located at sub-block, the start channel circuit node of the road is located at other subdatas
When block, second mapping relations of the road Yu other sub-blocks are determined, using the second mapping relations as the index of road.
Specifically, the start channel circuit node and terminal road circuit node of each road in road network can be marked in advance.
Illustratively, as shown in Figure 8 c, data block is divided into four sub-blocks, respectively sub-block 0, sub-block
1, sub-block 2, sub-block 3.The road circuit node of road L1 is N1 and N2, wherein N1 is the start channel circuit node of road L1,
N1 is located at sub-block 2, and N2 is the terminal road circuit node of road L1, and N2 is located at sub-block 0.Since N0 and N1 is positioned at different
Sub-block, then road L0 is the road across data block.
The start channel circuit node N1 of sub-data block 2, road L1 is located at sub-block 2, then road L1 belongs to subnumber
According to block 2.The terminal road circuit node N2 of road L1 and the first mapping relations of other sub-blocks are established in sub-block 2 are as follows:
The terminal road circuit node N2 of road L1 is located at sub-block 0.Index of the road L1 in sub-block 2 can be (L1:N1: son
Data block 2: the terminal road circuit node N2 of road L1 is located at sub-block 0).
The terminal road circuit node N2 of sub-data block 0, road L1 is located at sub-block 0, then road L1 does not belong to son
Data block 0.The second mapping relations of road L1 Yu other sub-blocks are established in sub-block 0 are as follows: the start channel of road L1
Circuit node N1 is located at sub-block 2.Index of the road L1 in sub-block 2 can be (the start channel circuit node N1 of road L1
Positioned at sub-block 2).
Further, for each sub-block, when road crosses over the sub-block, and the start channel circuit node of the road
When being respectively positioned on other sub-blocks with terminal road circuit node, the third mapping relations of the road Yu other sub-blocks are determined, it will
Index of the third mapping relations as road.
Illustratively, as shown in figure 8d, data block is divided into four sub-blocks, respectively sub-block 0, sub-block
1, sub-block 2, sub-block 3.The road circuit node of road L1 is N1 and N2, wherein N1 is the start channel circuit node of road L1,
N1 is located at sub-block 2, and N2 is the terminal road circuit node of road L1, and N2 is located at sub-block 1, road L1 for across sub-block 0,
Sub-block 1, sub-block 2.
Sub-data block 2, the start channel circuit node N1 of road L1 are located at sub-block 2, the terminal road section of road L1
Point N2 is located at sub-block 1, then road L1 belongs to sub-block 2.The terminal road section of road L1 is established in sub-block 2
The first mapping relations of point N2 and sub-block 1 are as follows: the terminal road circuit node N2 of road L1 is located at sub-block 1.Road L1 exists
Index in sub-block 2 can be (L1:N1: sub-block 2: the terminal road circuit node N2 of road L1 is located at sub-block 1).
Sub-data block 1, the start channel circuit node N1 of road L1 are located at sub-block 2, the terminal road section of road L1
Point N2 is located at sub-block 1, then road L1 does not belong to sub-block 1.Road L1 and sub-block are established in sub-block 1
2 the second mapping relations are as follows: the start channel circuit node N1 of road L1 is located at sub-block 2.Rope of the road L1 in sub-block 1
Drawing can be (the start channel circuit node N1 of road L1 is located at sub-block 2).
Sub-data block 0, road L1 cross over sub-block 0, and the start channel circuit node N1 of road L1 is located at sub-block
The terminal road circuit node N2 of 2, road L1 are located at sub-block 1, then road L1 does not belong to sub-block 0.In sub-block 0
Establish the third mapping relations of road L1 Yu sub-block 1 and sub-block 2 are as follows: the start channel circuit node N1 of road L1 is located at son
The terminal road circuit node N2 of data block 2, road L1 is located at sub-block 1.Index of the road L1 in sub-block 0 can be
(the start channel circuit node N1 of road L1 is located at sub-block 2, and the terminal road circuit node N2 of road L1 is located at sub-block 1).
In a kind of possible embodiment, for each sub-block, blocking the way circuit node is located at the sub-block, with this
When including the road across sub-block in the associated road of road circuit node, terminal road section is determined from the road across sub-block
The target road of the road Dian Weigai circuit node, and determine the attribute of the target sub-block where the start channel circuit node of target road
Information, by the attribute information of the road circuit node, the category with the attribute information of the associated road of road circuit node, target sub-block
Index of the property information as the road circuit node.
Specifically, illustratively, as figure 8 e shows, data block is divided into four sub-blocks, respectively sub-block 0,
Sub-block 1, sub-block 2, sub-block 3.Road circuit node N2 is located at sub-block 0, with the associated road of road circuit node N2
For road L1 and road L2, wherein road L1 is N1 across sub-block 0 and sub-block 2, the start channel circuit node of road L1,
The terminal road circuit node of road L1 is N2, and N1 is located at sub-block 2.Road L2 is across sub-block 0 and sub-block 1, road L2
Start channel circuit node be N2, the terminal road circuit node of road L2 is N3, and N3 is located at sub-block 1.Road across sub-block
The target road that terminal road circuit node is circuit node N2 in L1 and road L2 is road L1, the start channel circuit node position of road L1
In sub-block 2, then target sub-block is sub-block 2.To sum up, index of the circuit node N2 in road in sub-block 2 can be with
For (N2:L1:L2: sub-block 2).
It should be noted that by the subnumber where the road ownership start channel circuit node across data block in above embodiment
According to block, but this is only one of embodiment, can also will be where the road across data block belongs to terminal road circuit node
Sub-block, in this regard, the embodiment of the present application is not specifically limited.
After data block is split into sub-block, in each data block across data block and not across data block
Index is respectively created in road element, so both without destroying original road network structure, while convenient for subsequent in each data block
Inquiry roads improve the efficiency of inquiry roads.
It optionally, can be based on the index in sub-block after establishing the index of the road element in each sub-block
Inquiry roads include the following steps, as shown in Figure 9:
Step S901 is obtained target position and is determined screening areas centered on target position.
Specifically, target position can be the current position of user, be also possible to some position that user specifies in map
It sets.Screening areas can be centered on target position, and set distance is the rectangle of radius, be also possible to target position be
The heart, set distance is the circle of radius, in this regard, the embodiment of the present application is not specifically limited.
The position of screening areas data block corresponding with road net data to be compiled is compared step S902, determines sieve
The corresponding target data block of favored area.
Specifically, the latitude and longitude coordinates of screening areas can be determined according to the latitude and longitude coordinates of target position, then with number
It is compared according to the latitude and longitude coordinates of block, determines the corresponding target data block of screening areas.
Illustratively, as shown in Figure 10, setting data block is divided into four sub-blocks, respectively sub-block 0, subnumber
According to block 1, sub-block 2, sub-block 3.Centered on the p of target position, set distance is the rectangular area m that radius determines, will
Rectangular area m is compared with the position of four sub-blocks, determines that sub-block 0 and rectangular area, then will be sub there are Chong Die
Data block 0 is used as target data block.
Step S903 traverses the road in target data block, the determining and matched road of screening areas.
Using the index of road element each in target data block, the road in target data block is traversed.With screening areas
The road matched can be the road intersected with screening areas, such as road L2 shown in Fig. 10, be also possible to be located at screening areas
Interior road, than road L1 as shown in Figure 10.
Optionally, when the road in traversal target data block, when not finding road matched with screening areas, Ke Yizeng
The radius of big screening areas, and then expand screening areas, then new screening areas is compared with the position of each data block,
Determine new target data block.Later again from new target data block inquiry with the matched road of screening areas, and so on,
Stop when finding with the matched section of screening areas or target data block is original data block.
Optionally, when the road in traversal target data block, determine with the matched road of screening areas to be a plurality of, and user
When the road for needing to inquire is the road nearest with target position, target position and a plurality of matched road can be calculated separately
Distance will be determined as and the nearest road in target position apart from the smallest road.
Since data block is divided into multistage sub-block by the quantity according to road element in data block, therefore in inquiry roads
When, the road in sub-block can be first traversed, if it does not exist when matched road, then expands the model of the sub-block of traversal
It encloses, otherwise directly exports matched road, without traversing all roads in original data block at the very start, to improve
The efficiency of road inquiry.
In order to preferably explain the embodiment of the present application, the embodiment of the present application is described below with reference to specific implement scene and is provided
A kind of road net data Compilation Method process, as shown in figure 11, method includes the following steps:
It setting initial threshold and other threshold values at different levels is 5000, the road number of nodes in initial data block is greater than 5000,
The fractionation that original data block is then carried out to 2*2 obtains the identical first order subnumber block of 4 sizes, respectively sub-block 0, son
Data block 1, sub-block 2, sub-block 3.Then judge whether is road number of nodes in each first order sub-block respectively
Greater than 5000, sets the road number of nodes in sub-block 0 and be greater than 5000, sub-block 1, sub-block 2, in sub-block 3
Road number of nodes no more than 5000 when, sub-block 0 is carried out to the fractionation of 2*2, obtains 4 sizes identical second level
Several piece, respectively sub-block 4, sub-block 5, sub-block 6, sub-block 7.Subdata block 1, sub-block 2, subnumber
According to block 3 without splitting.Then judge whether the road number of nodes in each second level sub-block is greater than 5000 respectively, setting
All it is not more than, then stops splitting.
Set includes two road, respectively road L1 and road L2 in original data block, wherein the starting road section of L1
Point is N1, and N1 is located at sub-block 2, and the terminal road circuit node of L1 is N2, and N2 is located at sub-block 0.The start channel circuit node of L2
Terminal road circuit node for N2, L2 is N3, and N3 is located at sub-block 1.Circuit node N1 and road L1 belong to sub-block 2 in road,
Index of the road circuit node N1 in sub-block 2 is (N1:L1).Index of the road L1 in sub-block 2 is (L1:N1: subnumber
According to block 2: the terminal road circuit node N2 of road L1 is located at sub-block 0).Index of the road L1 in sub-block 0 is (road L1
Start channel circuit node N1 be located at sub-block 2).
Road circuit node N2 and road L2 belong to sub-block 0, index of the road circuit node N2 in sub-block 0 be (N2:
L1:L2: sub-block 2), index of the road L2 in sub-block 0 is (L2:N2: sub-block 0: the terminal road of road L2
Node N3 is located at sub-block 1).Index of the road L2 in sub-block 1 is that (the start channel circuit node N2 of road L2 is located at son
Data block 0).Road circuit node N3 belongs to sub-block 1, and index of the road circuit node N3 in sub-block 1 is (N3:L2: subnumber
According to block 0).
Target position is set as p point, centered on the p of target position, set distance is radius, screening areas m is determined, by square
Shape region m is compared with the position of sub-block any in sub-block 4 to 7, determines that rectangular area m is not located at subnumber
According in any sub-block of block 4 to 7.Then the position of any sub-block in rectangular area m and sub-block 0 to 3 is carried out
Compare, show that rectangular area m is located in sub-block 0, then regard sub-block 0 as target data block.Then according to subdata
Road in block 0 in the index traversal sub-block 0 of road, determines that screening areas m intersects with road L1, then can be by road L1
As with the matched road in target position.
After road net data to be compiled is mapped to original data block, judge that the road element number in original data block is
It is no to meet initial threshold, if not satisfied, then by original data block, successively iteration is split step by step, until splitting the sub-block obtained
Road element number meet it is corresponding split the preset threshold value of rank or split rank meet pre-set level, therefore in each sub-block
Road element number it is more uniform, later again in each sub-block road element establish index when, avoid road element
The road of inferior grade is deleted more than the index upper limit, to ensure that the integrality of road data, secondly, also avoiding road member
Element excessively makes data block excessive, improves the speed of path search and the download performance of road net data.In addition, also avoiding
Waste of storage space caused by road element is very few in data block.
Based on the same technical idea, the embodiment of the present application provides a kind of compilation device of road net data, such as Figure 12 institute
Show, which includes:
Module 1201 is obtained, for obtaining road net data to be compiled；
Mapping block 1202, for mapping to the road net data to be compiled in original data block；
Module 1203 is split, when being greater than initial threshold for the road element number in the original data block, to described
Original data block is split, and multiple first order sub-blocks are obtained；For the multiple first order sub-block, road if it exists
Road member prime number is greater than the first order sub-block of level-one threshold value, then continues to be greater than each of level-one threshold value first to road element number
Grade sub-block is split as multiple second level sub-blocks；Successively iteration is split step by step, until the road in all sub-blocks
First prime number, which meets the preset threshold value of corresponding fractionation rank or splits rank, meets pre-set level；
Index module 1204, for being respectively that the road element in each sub-block obtained creates index.
Optionally, the road element includes road and road circuit node；
The index module 1204 is specifically used for:
Road and road circuit node creation index for each sub-block of acquisition, in the respectively described sub-block.
Optionally, the index module 1204 is specifically used for:
For each sub-block, when the road circuit node of road is respectively positioned on the sub-block, by the category of the road
Property information, the attribute information of the road circuit node of the road, the sub-block index of the attribute information as the road；
Blocking the way circuit node is located at the sub-block, and is respectively positioned on the subdata with the associated road of road circuit node
When block, using the attribute information of the attribute information of the road circuit node and the associated road of road circuit node as the road
The index of node.
Optionally, the index module 1204 is specifically used for:
For each sub-block, when the start channel circuit node of road is located at the sub-block, the terminal of the road
When road circuit node is located at other sub-blocks, the first mapping of the terminal road circuit node and other sub-blocks of the road is determined
Relationship, by the attribute information of the road, the attribute information of the start channel circuit node of the road, the sub-block attribute
The index of information and first mapping relations as the road；
When the terminal road circuit node of the road is located at the sub-block, the start channel circuit node of the road is located at it
When his sub-block, determine the second mapping relations of the road Yu other sub-blocks, using second mapping relations as
The index of the road.
Optionally, the index module 1204 is specifically used for:
For each sub-block, blocking the way circuit node is located at the sub-block, with the associated road of road circuit node
In when including the road across sub-block, determine that terminal road circuit node is the road circuit node from the road across sub-block
Target road, and determine the attribute information of the target sub-block where the start channel circuit node of the target road, it will be described
The attribute information of road circuit node, the attribute with the attribute information of the associated road of road circuit node, the target sub-block
Index of the information as the road circuit node.
It optionally, further include enquiry module 1205；
The enquiry module 1205 is specifically used for:
It obtains target position and determines screening areas centered on the target position；
The position of screening areas data block corresponding with the road net data to be compiled is compared, determine described in
The corresponding target data block of screening areas；
Traverse the road in the target data block, the determining and matched road of the screening areas.
Optionally, the initial threshold and other threshold values at different levels are all the same, and/or, the sub-block split in every grade
Size is identical.
Based on the same technical idea, the embodiment of the present application provides a kind of computer equipment, as shown in figure 13, including extremely
Lack a processor 1301, and the memory 1302 connecting at least one processor, does not limit place in the embodiment of the present application
The specific connection medium between device 1301 and memory 1302 is managed, is passed through between processor 1301 and memory 1302 in Figure 13 total
For line connection.Bus can be divided into address bus, data/address bus, control bus etc..
In the embodiment of the present application, memory 1302 is stored with the instruction that can be executed by least one processor 1001, until
The instruction that a few processor 1301 is stored by executing memory 1302, can execute the Compilation Method of road net data above-mentioned
In included step.
Wherein, processor 1301 is the control centre of computer equipment, can use various interfaces and connection calculates
The various pieces of machine equipment are stored in memory by running or executing the instruction being stored in memory 1302 and calling
Data in 1302, to compile road net data.Optionally, processor 1301 may include one or more processing units, processing
Device 1301 can integrate application processor and modem processor, wherein the main processing operation system of application processor, Yong Hujie
Face and application program etc., modem processor mainly handle wireless communication.It is understood that above-mentioned modem processor
It can not also be integrated into processor 1301.In some embodiments, processor 1301 and memory 1302 can be in same cores
On piece realizes that in some embodiments, they can also be realized respectively on independent chip.
Processor 1301 can be general processor, such as central processing unit (CPU), digital signal processor, dedicated collection
At circuit (Application Specific Integrated Circuit, ASIC), field programmable gate array or other
Perhaps transistor logic, discrete hardware components may be implemented or execute the application reality for programmable logic device, discrete gate
Apply each method, step disclosed in example and logic diagram.General processor can be microprocessor or any conventional processing
Device etc..The step of method in conjunction with disclosed in the embodiment of the present application, can be embodied directly in hardware processor and execute completion, or
With in processor hardware and software module combination execute completion.
Memory 1302 is used as a kind of non-volatile computer readable storage medium storing program for executing, can be used for storing non-volatile software journey
Sequence, non-volatile computer executable program and module.Memory 1302 may include the storage medium of at least one type,
It such as may include flash memory, hard disk, multimedia card, card-type memory, random access storage device (Random Access
Memory, RAM), static random-access memory (Static Random Access Memory, SRAM), may be programmed read-only deposit
Reservoir (Programmable Read Only Memory, PROM), read-only memory (Read Only Memory, ROM), band
Electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory,
EEPROM), magnetic storage, disk, CD etc..Memory 1302 can be used for carrying or storing have instruction or data
The desired program code of structure type and can by any other medium of computer access, but not limited to this.The application is real
Applying the memory 1302 in example can also be circuit or other devices that arbitrarily can be realized store function, for storing program
Instruction and/or data.
Based on the same technical idea, the embodiment of the present application provides a kind of computer readable storage medium, and feature exists
In, it is stored with the computer program that can be executed by computer equipment, when described program is run on a computing device, so that
The computer equipment executes the step of Compilation Method of road net data.
It should be understood by those skilled in the art that, the embodiment of the present invention can provide as method or computer program product.
Therefore, complete hardware embodiment, complete software embodiment or embodiment combining software and hardware aspects can be used in the present invention
Form.It is deposited moreover, the present invention can be used to can be used in the computer that one or more wherein includes computer usable program code
The shape for the computer program product implemented on storage media (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Formula.
The present invention is referring to method, the process of equipment (system) and computer program product according to the embodiment of the present application
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
Although preferred embodiments of the present invention have been described, it is created once a person skilled in the art knows basic
Property concept, then additional changes and modifications may be made to these embodiments.So it includes excellent that the following claims are intended to be interpreted as
It selects embodiment and falls into all change and modification of the scope of the invention.
Obviously, various changes and modifications can be made to the invention without departing from essence of the invention by those skilled in the art
Mind and range.In this way, if these modifications and changes of the present invention belongs to the range of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to include these modifications and variations.
Claims (10)
1. a kind of Compilation Method of road net data characterized by comprising
Obtain road net data to be compiled；
The road net data to be compiled is mapped in original data block；
When road element number in the original data block is greater than initial threshold, the original data block is split, is obtained
Obtain multiple first order sub-blocks；
For the multiple first order sub-block, road element number is greater than the first order sub-block of level-one threshold value if it exists,
The each first order sub-block for then continuing to be greater than road element number level-one threshold value is split as multiple second level sub-blocks；
Successively iteration is split step by step, until the road element number in all sub-blocks meets the corresponding fractionation preset threshold value of rank
Or it splits rank and meets pre-set level；
Road element in each sub-block respectively obtained creates index.
2. the method as described in claim 1, which is characterized in that the road element includes road and road circuit node；
Described is respectively that the road element in each sub-block obtained creates index, comprising:
Road and road circuit node creation index for each sub-block of acquisition, in the respectively described sub-block.
3. method according to claim 2, which is characterized in that it is described for each sub-block obtained, it is respectively described
Road and road circuit node creation index in sub-block, comprising:
For each sub-block, when the road circuit node of road is respectively positioned on the sub-block, the attribute of the road is believed
It ceases, index of the attribute information of the attribute information of the road circuit node of the road, the sub-block as the road；
Blocking the way circuit node is located at the sub-block, and is respectively positioned on the sub-block with the associated road of road circuit node
When, using the attribute information of the attribute information of the road circuit node and the associated road of road circuit node as the road section
The index of point.
4. method as claimed in claim 3, which is characterized in that further include:
For each sub-block, when the start channel circuit node of road is located at the sub-block, the terminal road of the road
When node is located at other sub-blocks, determine that the first mapping of the terminal road circuit node and other sub-blocks of the road is closed
System believes the attribute of the attribute information of the road, the attribute information of the start channel circuit node of the road, the sub-block
The index of breath and first mapping relations as the road；
When the terminal road circuit node of the road is located at the sub-block, the start channel circuit node of the road is located at other sons
When data block, the second mapping relations of the road Yu other sub-blocks are determined, using second mapping relations as described in
The index of road.
5. method as claimed in claim 3, which is characterized in that further include:
For each sub-block, blocking the way circuit node is located at the sub-block, and wraps in the associated road of road circuit node
When including the road across sub-block, determine that terminal road circuit node is the target of the road circuit node from the road across sub-block
Road, and determine the attribute information of the target sub-block where the start channel circuit node of the target road, by the road
The attribute information of node, the attribute information with the attribute information of the associated road of road circuit node, the target sub-block
Index as the road circuit node.
6. method as claimed in claim 1 to 5, which is characterized in that further include:
It obtains target position and determines screening areas centered on the target position；
The position of screening areas data block corresponding with the road net data to be compiled is compared, determines the screening
The corresponding target data block in region；
Traverse the road in the target data block, the determining and matched road of the screening areas.
7. method as claimed in claim 6, which is characterized in that the initial threshold and other threshold values at different levels are all the same, and/
Or, the size of the sub-block split in every grade is identical.
8. a kind of compilation device of road net data characterized by comprising
Module is obtained, for obtaining road net data to be compiled；
Mapping block, for mapping to the road net data to be compiled in original data block；
Module is split, when being greater than initial threshold for the road element number in the original data block, to the initial data
Block is split, and multiple first order sub-blocks are obtained；For the multiple first order sub-block, road element number if it exists
Greater than the first order sub-block of level-one threshold value, then continue each first order subdata for being greater than level-one threshold value to road element number
Block is split as multiple second level sub-blocks；Successively iteration is split step by step, until the road element number in all sub-blocks is full
The preset threshold value of the corresponding fractionation rank of foot or fractionation rank meet pre-set level；
Index module, for being respectively that the road element in each sub-block obtained creates index.
9. a kind of computer equipment including memory, processor and stores the meter that can be run on a memory and on a processor
Calculation machine program, which is characterized in that the processor is realized described in claim 1~7 any claim when executing described program
The step of method.
10. a kind of computer readable storage medium, which is characterized in that it is stored with the computer journey that can be executed by computer equipment
Sequence, when described program is run on a computing device, so that computer equipment perform claim requirement 1~7 is any described
The step of method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910510566.1A CN110232105A (en) | 2019-06-13 | 2019-06-13 | A kind of Compilation Method and device of road net data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910510566.1A CN110232105A (en) | 2019-06-13 | 2019-06-13 | A kind of Compilation Method and device of road net data |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110232105A true CN110232105A (en) | 2019-09-13 |
Family
ID=67859863
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910510566.1A Pending CN110232105A (en) | 2019-06-13 | 2019-06-13 | A kind of Compilation Method and device of road net data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110232105A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1507613A (en) * | 2002-02-28 | 2004-06-23 | 松下电器产业株式会社 | Position information transfer apparatus and method |
| CN104700639A (en) * | 2015-02-05 | 2015-06-10 | 厦门雅迅网络股份有限公司 | Real-time traffic status broadcasting method |
| CN105589891A (en) * | 2014-11-05 | 2016-05-18 | 高德软件有限公司 | Link data production and updating method and device in electronic map |
| US20180046648A1 (en) * | 2013-10-17 | 2018-02-15 | Nant Holdings Ip, Llc | Wide area augmented reality location-based services |
| CN108932310A (en) * | 2018-06-19 | 2018-12-04 | 腾讯大地通途（北京）科技有限公司 | Simulation spatial service providing method, device, server and storage equipment |
-
2019
- 2019-06-13 CN CN201910510566.1A patent/CN110232105A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1507613A (en) * | 2002-02-28 | 2004-06-23 | 松下电器产业株式会社 | Position information transfer apparatus and method |
| US20180046648A1 (en) * | 2013-10-17 | 2018-02-15 | Nant Holdings Ip, Llc | Wide area augmented reality location-based services |
| CN105589891A (en) * | 2014-11-05 | 2016-05-18 | 高德软件有限公司 | Link data production and updating method and device in electronic map |
| CN104700639A (en) * | 2015-02-05 | 2015-06-10 | 厦门雅迅网络股份有限公司 | Real-time traffic status broadcasting method |
| CN108932310A (en) * | 2018-06-19 | 2018-12-04 | 腾讯大地通途（北京）科技有限公司 | Simulation spatial service providing method, device, server and storage equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110322694A (en) | A kind of method and device of urban traffic control piece Division | |
| CN106096023B (en) | Method for reading data, method for writing data and data server | |
| CN108981739A (en) | Path planning method, device, server and storage medium | |
| US10068033B2 (en) | Graph data query method and apparatus | |
| CN106325756B (en) | Data storage method, data calculation method and equipment | |
| CN109144791A (en) | Data conversion storage method, apparatus and data management server | |
| CN108989205A (en) | Identity, routing data creation method, device and server | |
| CN108268974A (en) | The method and device that a kind of path is recommended | |
| RU2010138732A (en) | CARD UPDATE SYSTEM AND CARD UPDATE PROGRAM USING DYNAMIC CACHE MEMORY | |
| CN109815419A (en) | Point of interest indexing means, device, medium and electronic equipment based on geographical location | |
| CN109886529A (en) | A kind of resource allocation methods and device, electric terminal and storage medium | |
| CN109033173A (en) | It is a kind of for generating the data processing method and device of multidimensional index data | |
| CN108304585A (en) | A kind of result data choosing method and relevant apparatus based on spatial key search | |
| CN104516929B (en) | Method and apparatus for file system | |
| CN110765073B (en) | File management method, medium, device and apparatus for distributed storage system | |
| KR102124657B1 (en) | Apparatus and method for processing map data by real time index creation and system thereof | |
| CN110232105A (en) | A kind of Compilation Method and device of road net data | |
| CN113709006A (en) | Flow determination method and device, storage medium and electronic device | |
| CN109271438A (en) | A kind of data bank access method and its system | |
| CN104680782A (en) | Traffic control cloud system | |
| CN109086339A (en) | It is a kind of for generating the data processing method and device of index recombination rate | |
| CN115989485A (en) | Data processing method, device and system | |
| CN108898862A (en) | The determination method, apparatus and electronic equipment of traffic light intersection | |
| CN109117091A (en) | A kind of SSD equipment mount point acquisition methods and relevant apparatus | |
| CN112070561B (en) | Electronic coupon recommendation method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190913 |
|
| RJ01 | Rejection of invention patent application after publication |