CN101459901B - Vector map data transmission method based on multi-stage slicing mode - Google Patents
Vector map data transmission method based on multi-stage slicing mode Download PDFInfo
- Publication number
- CN101459901B CN101459901B CN2008102374884A CN200810237488A CN101459901B CN 101459901 B CN101459901 B CN 101459901B CN 2008102374884 A CN2008102374884 A CN 2008102374884A CN 200810237488 A CN200810237488 A CN 200810237488A CN 101459901 B CN101459901 B CN 101459901B
- Authority
- CN
- China
- Prior art keywords
- key element
- section
- map
- stage slicing
- level
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Instructional Devices (AREA)
Abstract
The invention discloses a vector map data transmission method based on the multilevel slice mode, which comprises steps: firstly dividing a map into four parts through L (L=1, 2,..., m) to obtain an L-level square region, then felling intersectant elements with weight level of L or elements with the pairing level in the square region under a data set named as a multilevel slice, secondly using the multilevel slice as a basic unit for the map data transmission from a server terminal to a mobile terminal, thirdly integrating the elements of each level of slices and ancestor slices thereof firstly after the mobile terminal receives the multilevel slice, and then piecing the slices together into a complete map of a mobile terminal target region, and finally caching the multilevel slice on oneside of the mobile terminal. Each renovation firstly searches the multilevel slice from a local buffer, or searches from the server if the local buffer does not have the multilevel slice. The method has the advantages that one side of the mobile terminal can reuse the map data stored on the local at high proportion, thereby reducing the communication of the map data transmission.
Description
Technical field
The present invention is mainly concerned with the GIS-Geographic Information System field, refers in particular to a kind of vector map data transmission method based on multi-stage slicing mode.
Background technology
Along with the fast development of wireless communication technology, (Location-based Service LBS) is expected to become killer's level and uses in location-based service.The LBS application system is made up of server, portable terminal and the cordless communication network that is connected both.There are characteristics such as screen is little, the power supply continued power time is short, storage resources is on the low side, the CPU computing capability is low in portable terminal.Problems such as there is the channel instability in cordless communication network, and bandwidth is on the low side.
Online transmission map datum can provide real-time, satisfy information sexual demand, abundant in content to the user in the LBS application system, and the atlas that do not prestore of portable terminal this locality, does not need user's updating maintenance.Yet online transmission map datum faces following problem.The first, relatively power consumption of radio communication, and the power supply continued power time of portable terminal is short.The second, the map datum amount is big, and wireless network sometimes the channel instability, bandwidth is on the low side.
Than grating map, the data volume of map vector still less.Map vector is the set that map elements is formed.As elementary cell, there is following problem with map elements in online transmission: the first, and each portable terminal one side enters new target area, must send request of data to server.Even local cache has the total data in fresh target zone, owing to can't judge this point, so need obtain data again.This has increased unnecessary the connection number of times and the traffic.The second, the key element of delivering to portable terminal has comprised ball of wax, and is not used in small scale map top details.This has increased data traffic.The 3rd, unwanted details is peeled off out in the data volume of key element, need to carry out the map automatic Synthesis operation of intensive.
Summary of the invention
The technical problem to be solved in the present invention just is: at the technical problem of prior art existence, thereby provide a kind of vector map data transmission method based on multi-stage slicing mode that can improve data traffic between the efficiency of transmission of map vector data, the ability minimizing portable terminal that improves portable terminal one side buffer memory and reusing data and the server greatly.
For solving the problems of the technologies described above, the solution that the present invention proposes is: a kind of vector map data transmission method based on multi-stage slicing mode, it is characterized in that: at first map vector data is carried out multi-stage slicing, as elementary cell, portable terminal is spliced into complete map with section after receiving map vector behind the multi-stage slicing to the transmission of map datum from the server end to the portable terminal with multi-stage slicing.
The generation of multi-stage slicing and splicing step are:
A. the generation of multi-stage slicing:
(1) cuts into slices: the full width map is cut in length and breadth be divided into 4, obtain the 1st grade pet chip; Then each 1 grade of multi-stage slicing is divided into 4 again, obtains the 2nd grade pet chip, promptly totally 4
2=16 ..., and the like, until generating the m grade pet chip,, being called father's section by the person of cutting for cutting each time, resulting 4 sections are called the son section;
(2) classification: map scale is divided into n rank successively according to size, wherein 1 grade diminishes successively to n level engineer's scale, map elements is divided into n rank successively by the weight size, wherein n level key element is to appear at the key element that does not but appear in the n level engineer's scale map in the n-1 level engineer's scale map, for setting up corresponding relation between engineer's scale rank and the multi-stage slicing rank, certain grade of key element that intersects with certain grade pet chip is classified as one group, claim this to be grouped into the L grade pet chip, and claim this group key element to belong to this section; Simultaneously, define the elder brother section of certain grade pet chip, S level elder brother section refers to the set that the S level key element that intersects with L grade pet chip corresponding region is formed, S=1 wherein, and 2 ..., L-1; The rank that S level father section refers to the L grade pet chip equals ancestors' section or the father's section of S, and S level elder brother section is the part of S level father section;
(3) increment: the increment of key element is between two engineer's scale ranks, and the difference of the detail data of same key element when increment surpasses than the data total amount of key element under the ratio of setting in limited time, is provided with increment;
The step of B. synthesizing complete map by multi-stage slicing:
(1) multi-stage slicing retrieval: the map of synthetic L level engineer's scale lower area A will be used is the set of the L grade pet chip composition that intersects with regional A, is designated as QSet;
(2) data integration: for each the L grade pet chip in the QSet, data integration is upwards to review along elder brother's relation of section, and except gathering of the key element under each grade pet chip, this process also comprises the merging of the increment of same key element;
(3) section splicing: the data that previous step has obtained each L grade pet chip that intersects with target area A gather, and next are exactly the data of these L grade pet chips to be gathered according to the spatial neighbor relation splice, and finally obtain complete map.
The map datum transmission course is:
1) calculates the L grade pet chip that all and regional A intersect, below this set is designated as QSet;
2), carry out following steps for each the L grade pet chip Q among the QSet:
A. map application is carried out " buffer memory search operaqtion ", and whether retrieves slices Q is at local cache; If Q is in this locality in section, change step F; Otherwise, carry out " extracting existing key element recording operation ", " the existing key element record of terminal " of the Q that obtains cutting into slices;
B. map application is to the data of server requests section Q, and solicited message comprises the numbering QID and the existing key element record of terminal of section;
C. after server is received request, at first extrapolate the zone and the rank L of multi-stage slicing according to numbering QID, then map datum Service Part retrieving map database obtains multi-stage slicing and elder brother's section thereof, then according to the existing key element record of terminal, in the section that retrieves, carry out " removing the existing key element operation of terminal ", at last multi-stage slicing and elder brother's section thereof are sent to portable terminal;
D. map application receives data, the set of multi-stage slicing and elder brother thereof section just;
E. carry out " multi-stage slicing inserts operation " multi-stage slicing Q and elder brother's section thereof are deposited in local cache;
F. carry out " data integration operation ", generate the intactly diagram data collection of section Q;
3) all the L grade pet chips among the QSet are stitched together by spatial relationship, obtain the complete map of L level engineer's scale lower area A.
The local cache of described portable terminal one side is made up of map elements collection, key element hash table and multi-stage slicing concordance list; Described map elements collection is made up of each key element in the buffer memory, and each key element has a list item in the key element hash table, comprises three territories in it, be key element ID, reference count, the pointer of sensing key element memory location, the number of the multi-stage slicing of this key element of reference count record reference; Described key element hash table is carried out the hash ordering according to key element ID, and each multi-stage slicing Q in this locality has a list item in multi-stage slicing concordance list tree, comprises in it: (a) multi-stage slicing numbering; (b) elder brother's chain owner pointer points to elder brother's chained list of cutting into slices; (c) pointer of sensing key element reference list; (d) nearest usage flag; In the described multi-stage slicing concordance list, each list item is pressed the ordering successively of multi-stage slicing numbering.
Compared with prior art, advantage of the present invention just is:
1, in the use, portable terminal one side can be reused the map datum that is buffered in portable terminal this locality in high proportion, thereby effectively reduces the traffic of map datum transmission.The first, during map generation translation, the data that continue to appear at the zone (being made up of section) in the screen will be reused.The second, when dwindling map, the small scale map that the part of the employed data of large-scale map that occur previously will be occurred is later reused.The data reusing ratio reaches as high as 1/4.The 3rd, during enlarged map, the large-scale map that the partial data of the small scale map that occurs previously will be occurred is later reused.The latter in addition only need be under server requests L+1 level engineer's scale the map datum of target area, the data of 1～L level engineer's scale have been buffered in this locality.
2, map elements is by foursquare block (i.e. section) grouping, but do not cut into a plurality of parts key element is rigid.Transmission method can not repeat to transmit the key element that intersects simultaneously with a plurality of blocks, helps reducing the traffic of map datum transmission.
3, multi-stage slicing is helped reducing as buffer unit communicate to connect number of times and data traffic between portable terminal and the server.Reason has two.The first, when entering new zone (being assumed to L level engineer's scale lower area A), can overlay area A by differentiating whether L grade pet chip in the local cache be stitched together, whether it can draw the total data that needs this conclusion in local cache.If be capped just, then do not need more new data of Connection Service device.The second, can only be transferred to portable terminal one side to the part details of key element rather than full details;
4, multi-stage slicing has improved portable terminal one and has stressed chance with map datum, helps reducing data traffic.。Based on multi-stage slicing map elements is divided into groups, not only kept the proximity relations on the space, and taken into account weight.In map shows, the key element of same weight or appearance together, or do not occur.Like this, the probability that multi-stage slicing uses together is the highest, is higher than the grouping that only generates according to the spatial neighbor relation;
5, the method for the present invention map that can effectively reduce map datum transmission scale and portable terminal one side is handled the calculating scale, and it is obviously different that this method and conventional method have, the data content that its each section comprises more accurately, enrich; Data type difference on the one hand, multi-stage slicing of the present invention be at be the vector type map datum, on the other hand, what multi-stage slicing comprised is the key element of same weight.
Description of drawings
Fig. 1 is the present invention carries out multistage cutting to map vector data a schematic diagram.
Fig. 2 is the schematic flow sheet of map datum transmission course of the present invention;
Fig. 3-the 1st, the overall structure schematic diagram of portable terminal local cache among the present invention;
Fig. 3-the 2nd, the structural representation of multi-stage slicing index list item among the present invention;
Fig. 3-the 3rd, the structural representation of key element hash table entry among the present invention;
Fig. 4-the 1st, multi-stage slicing inserts the schematic flow sheet of operation among the present invention;
Fig. 4-the 2nd is as the section key element in-stockroom operation schematic flow sheet of core procedure;
The cut into slices schematic flow sheet of key element warehouse-in of Fig. 4-the 3rd, elder brother;
Fig. 5 is the schematic flow sheet that extracts existing key element recording operation among the present invention;
Fig. 6 is that the system that uses the inventive method constitutes schematic diagram.
Embodiment
Below with reference to accompanying drawing and instantiation the present invention is described in further details.
(1) map datum from the server end to the portable terminal transmits with multi-stage slicing as elementary cell.Multi-stage slicing has two aspect implications, on the one hand is a square area in the map, on the other hand the set of forming with map elements/increment that intersect in this zone, weight is identical.The generation step of multi-stage slicing is as follows:
1) section.At first the full width map is cut in length and breadth and be divided into 4, obtain the 1st grade pet chip; Then each 1 grade of multi-stage slicing is divided into 4 again, obtains the 2nd grade pet chip and (have 4 altogether
2=16); ..., and the like, until generating the m grade pet chip.For cutting each time, be called father's section by the person of cutting, resulting 4 sections are called the son section.
Multi-stage slicing adopts following method to be numbered.At first, 41 grade pet chips are 1,2,3,4 along the order number consecutively of upper left, upper right, bottom right, lower-left; Then, 2 grade pet chips that form of each 1 grade pet chip five equilibrium are 1,2,3,4 along same serial number; , the numbering of the numbering heel corresponding levels of his father's section promptly gets the numbering of 2 grade pet chips; ..., and the like, can draw the numbering of all the other each grade pet chips, as shown in Figure 1.
2) classification.At first, map scale be divided into n rank (wherein, 1 grade of engineer's scale is the highest, and 2 grades are taken second place ..., the n level is minimum).Correspondingly, map elements also is divided into n rank by the weight size.1 grade of key element is to come across 1 grade of key element in the engineer's scale map.2 grades of key elements are to appear at but not appear at 1 grade of key element in the engineer's scale map in 2 grades of engineer's scale maps ..., n level key element is to appear at the key element that does not but appear in the n level engineer's scale map in the n-1 level engineer's scale map.Then, for setting up corresponding relation between engineer's scale rank and the multi-stage slicing rank.In the practical application, m 〉=n must be arranged, that is to say on 1 grade of engineer's scale map has 4
M-n+1Individual m-n+1 grade pet chip.For sake of convenience, suppose m=n in the literary composition, this does not influence the basic principle narration of scheme.Like this, 1 grade of engineer's scale is corresponding with 1 grade pet chip, and 2 grades of engineer's scales are corresponding with 2 grade pet chips ..., n level engineer's scale is corresponding with the n grade pet chip.At last, the L level key element that intersects with the L grade pet chip is classified as one group, claims this to be grouped into the L grade pet chip, and claim this group key element to belong to this section.Also the data acquisition system of key element under the L grade pet chip is called the L grade pet chip in the literary composition.
In addition, elder brother's section of definition L grade pet chip.The S level (S=1,2 ..., L-1) elder brother's section refers to the set of the S level key element composition that intersects with L grade pet chip corresponding region.The rank that S level father section refers to the L grade pet chip equals ancestors' section or the father's section of S.S level elder brother section is the part of S level father section.The numbering of S level elder brother section adds that by the numbering of L grade pet chip rank S forms.
3) increment.During map showed, the details that large-scale key element shows in high-level engineer's scale was few, and the details that shows in the low level engineer's scale is many.The increment of key element is at two engineer's scale rank L, between the K, and the difference of the detail data of same key element.The increment of the L level weight of key element (being referred to as L level increment) is with respect to the increment that shows the employed total data of this key element under L-1 level engineer's scale.No matter whether use increment, the display effect of this key element does not produce discernable difference under L-1 level engineer's scale.Have only when increment when the data total amount of key element surpasses the ratio lower limit V that sets, increment just is set.This is in order to guarantee that benefit that increment brings is greater than the loss that causes thus on calculating.The key element increment had both comprised the detail data (some coordinate points) that is increased, and also comprised the position that coordinate points is inserted.The increment of L grade pet chip is by forming with the L level increment of this section key element that intersect, that the weight rank is higher.
(2) map datum transmission course.Map application on the portable terminal need L level engineer's scale lower area A map datum collection R (A in the time of L), obtains the data (see figure 2) by following steps:
1) calculates the L grade pet chip that all and regional A intersect, below this set is designated as QSet.
2), carry out following steps for each the L grade pet chip Q among the QSet:
A. map application is carried out " buffer memory search operaqtion ", and whether retrieves slices Q is at local cache.If Q is in this locality in section, change step F; Otherwise, carry out " extracting existing key element recording operation ", " the existing key element record of terminal " of the Q that obtains cutting into slices.
B. map application is to the data of server requests section Q, and solicited message comprises the numbering QID and the existing key element record of terminal of section.
C. after server is received request, at first extrapolate the zone and the rank L of multi-stage slicing according to numbering QID, then map datum Service Part retrieving map database obtains multi-stage slicing and elder brother's section thereof, then according to the existing key element record of terminal, in the section that retrieves, carry out " removing the existing key element operation of terminal ", at last multi-stage slicing and elder brother's section thereof are sent to portable terminal.
D. map application receives data, the set of multi-stage slicing and elder brother thereof section just.
E. carry out " multi-stage slicing inserts operation " multi-stage slicing Q and elder brother's section thereof are deposited in local cache.
F. carry out " data integration operation ", generate the intactly diagram data collection of section Q.
3) all the L grade pet chips among the QSet are stitched together by spatial relationship, obtain the complete map of L level engineer's scale lower area A.
(3) structure of buffer memory.The local cache of portable terminal one side is made up of map elements collection, key element hash table and multi-stage slicing concordance list, sees Fig. 3-1, Fig. 3-2, Fig. 3-3.The map elements collection is made up of each key element in the buffer memory.Each key element has a list item in the key element hash table, and its data structure definition is as follows:
struct?featureHashEntry {
long?featureID；
char?refCount；
void*featurePtr；
}
Wherein, featureID is key element ID, and refCount is the reference count of key element, and featurePtr is the pointer that points to the key element memory location.The number of the multi-stage slicing of this key element of reference count record reference.Hash table is carried out the hash ordering according to key element ID.
Each multi-stage slicing Q in this locality (not containing elder brother's section) has a list item at the multi-stage slicing concordance list, and its data structure definition is as follows:
struct?TileIndexEntry{
long?tileID；
void*brotherListHead；
void*featureRefListPtr；
char?used；
}
Wherein, tileID is the multi-stage slicing numbering; BrotherListHead deposits in the territory elder brother's chain owner pointer, is used to refer to the chained list of cutting into slices to the elder brother; FeatureRefListPtr deposits in the territory pointer that points to the key element reference list; The used territory is nearest usage flag.The usage of usage flag is recently: be used each time, then increase 1; Every some cycles T, be clearly 0.When need eliminating section, the used thresholding is that 0 section becomes the candidate.
The rank of supposing section Q is L, and elder brother's total L-1 node of chained list one of cutting into slices then is corresponding successively from the beginning to the end 1,2 ..., L-1 level elder brother cuts into slices.Each node comprises the key element reference list.The key element reference list is made up of the pointer that points to the key element hash table entry.The key element that these list items point to is the key element under L grade pet chip Q or elder brother cut into slices.
In the multi-stage slicing concordance list, each list item is pressed the ordering successively of multi-stage slicing numbering.The numbering of input multi-stage slicing, the retrieval ordering table can be differentiated multi-stage slicing fast whether in this locality, and utilizes key element reference list and the elder brother chained list of cutting into slices can obtain the data of this multi-stage slicing and elder brother thereof the key element under cutting into slices immediately.
(4) buffer memory search operaqtion.The numbering QNo of input section, the step of retrieves slices is:
1) in the multi-stage slicing concordance list, adopt binary search to search numbering QNo.If do not find, then return the conclusion that does not have this section, retrieval finishes.
2) obtain key element reference list and the elder brother chain owner pointer of cutting into slices in the list item that finds.Can obtain the affiliated key element (containing increment) of cutting into slices by the former.Can obtain the key element of each elder brother under cutting into slices by the latter.
3) can obtain the intactly diagram data of L grade pet chip to section and elder brother thereof the execution " data integration operation " of cutting into slices.
(5) multi-stage slicing inserts operation.After receiving multi-stage slicing (and elder brother's section) each time, carry out and insert operation.Multi-stage slicing and elder brother's section can be discerned according to numbering separately.Insert operating procedure following (seeing Fig. 4-1, Fig. 4-2, Fig. 4-3):
1) in the multi-stage slicing concordance list, inserts a list item QEntry according to the order of sequence.
2) distribute the key element reference list, by the key element reference list pointed of QEntry it.
3) carry out the key element in-stockroom operation of cutting into slices.Step comprises:
A. distribute the key element reference list, the list item number equates with the key element number of section.
B. for the section each key element,
If factor content only comprises key element ID (meaning that factor data is in buffer memory), then carry out following steps:
A) with key element ID as input, retrieval key element hash table entry in the key element hash table.
B) reference count in the hash table entry increases 1.
C) quote list item with key element and point to the key element hash table entry.
Otherwise (factor content comprises complete factor data), carry out following steps:
A) key element is deposited in the map datum buffer memory.
B) apply for a key element hash table entry, and point to the memory location of key element with this list item.
C) reference count of hash table entry is changed to 1.
D) quote list item with key element and point to the key element hash table entry.
4),, carry out following steps along rank order from high to low for elder brother's section:
A. distribute elder brother's node, include the key element reference list.
B. carry out the key element in-stockroom operation of section, process is described with step 3.
C. the afterbody that elder brother's node is added elder brother's chained list.
6) the superseded operation of buffer memory.Buffer memory adopts the LRU strategy to eliminate multi-stage slicing.This territory of nearest usage flag of multi-stage slicing index list item is used for writing down nearest used multi-stage slicing.Behind process T cycle time, not being marked as nearest used multi-stage slicing will be eliminated.Eliminate as follows for the step of L grade pet chip Q:
1) for each list item of key element reference list of section Q, the reference count in the key element hash table entry that its is pointed to subtracts 1.If reduce to 0, then discharge the key element memory space of hash table entry and its sensing.Discharge the key element reference list.
2) for each node of elder brother's chained list, carry out the action identical with step 1.
3) list item of deletion section Q correspondence in the multi-stage slicing concordance list.
(7) extract existing key element recording operation.Portable terminal will be carried out " extract and have the key element recording operation " when the data of server requests section Q, draw the key element that can Gong reuse in this locality, and server no longer transmits the data of these key elements in view of the above.Extract the existing following (see figure 5) of key element recording operation step:
1) ancestors of retrieves slices Q section in local cache.Retrieval is from the L-1 level, and upwards (rank is designated as S until running into ancestors' section step by step
Min) or retrieval finish and (make S
Min=0).
2) four of retrieves slices Q son sections in local cache, the set LocalChildSet that draws in this locality.
3) the retrieval L grade pet chip adjacent (having 8 altogether) in local cache with multi-stage slicing Q, the set LocalNebSet that draws in this locality.
4) generate the content that the terminal data with existing writes down, comprise the rank S of existing father's section
Min, in the numbering of the son of terminal section with in the numbering of the contiguous slices of terminal.
(8) remove the existing key element operation of terminal.Server is removed the existing key element of terminal according to the existing key element record of terminal before portable terminal returns the data of section Q.The actual act of removing is to stay key element ID, abandons other parts.It is as follows to remove the existing key element operating procedure of terminal:
1) according to existing father's slice level S
Min, 1～S of removal section Q
MinKey element under the level elder brother cuts into slices.
2) according in the numbering of the son of terminal section, for section Q and elder brother's section thereof, in it key element with intersect in the section of this background, this key element is removed.
3) according in the numbering of the contiguous slices of terminal, remove simultaneously the key element that intersects with section Q and contiguous slices.
(9) data integration operation.For each the L grade pet chip Q in the QSet, data integration is gathering of existing key element and the merging that increment is arranged.Concrete steps are as follows:
1) section Q is joined among the chained list TList.Make G=section Q.
2), then the elder brother of G section is joined the head of section chained list TList if section G is not 1 grade.
3) make the last grade pet chip of G=G, change step 2, arrive 1 grade until the rank of G.
4) travel through section chained list TList from the beginning to the end,, the key element under it is aggregated among the integrated result, affiliated increment is merged in the corresponding key element for each section.
(10) system of transmission multi-stage slicing.Use system of the present invention and form, link together by communication network between the two, as shown in Figure 6 by server and portable terminal.The constituent of server has map datum Service Part and map vector data storehouse.One of its major function is to send multi-stage slicing (containing elder brother's section) to portable terminal.Multi-stage slicing can be stored in advance in the database and also can dynamically generate.
Portable terminal one side comprises map application, cache manager and multi-stage slicing buffer memory collection.Cache manager administers and maintains multi-stage slicing buffer memory collection, retrieves and read multi-stage slicing for map application.All multi-stage slicings that are received from server all will deposit multi-stage slicing buffer memory collection in.
The each map datum request of initiating at multi-stage slicing of portable terminal will attach the existing key element record sheet of terminal.After server was received request, map datum Service Part retrieving map database obtained desired section and elder brother thereof section, then removed in the key element of terminal according to the existing key element record sheet of terminal, at last these sections was sent to portable terminal.
Claims (3)
1. vector map data transmission method based on multi-stage slicing mode, it is characterized in that: at first map vector data is carried out multi-stage slicing, map datum from the server end to the portable terminal transmits with multi-stage slicing as elementary cell, after portable terminal receives multi-stage slicing, each rank key element of integrated section earlier and ancestors' section thereof is followed the complete map that section is spliced into the target area;
The generation of described multi-stage slicing and splicing step are:
A. the generation of multi-stage slicing:
(1) cuts into slices: the full width map is cut in length and breadth be divided into 4, obtain the 1st grade pet chip; Then each 1 grade of multi-stage slicing is divided into 4 again, obtains the 2nd grade pet chip, promptly totally 4
2=16 ..., and the like, until generating the m grade pet chip, for cutting each time, be called father's section by the person of cutting, resulting 4 sections are called the son section, and father's section of higher level is called ancestors' section of son section on father's section of described father's section and the set membership chain;
(2) classification: map scale is divided into n rank successively according to size, wherein 1 grade diminishes successively to n level engineer's scale, map elements is divided into n rank successively by the weight size, wherein n level key element is to appear at the key element that does not but appear in the n level engineer's scale map in the n-1 level engineer's scale map, for setting up corresponding relation between engineer's scale rank and the multi-stage slicing rank, certain grade of key element that intersects with certain grade pet chip is classified as one group, claim this to be grouped into the L grade pet chip, and claim this group key element to belong to this section; Simultaneously, define the elder brother section of certain grade pet chip, S level elder brother section refers to the set that the S level key element that intersects with L grade pet chip corresponding region is formed, S=1 wherein, and 2 ..., L-1; The rank that S level father section refers to the L grade pet chip equals ancestors' section or the father's section of S, and S level elder brother section is the part of S level father section;
(3) increment: the increment of key element is between two engineer's scale ranks, the difference of the detail data of same key element, described key element increment had both comprised the detail data that is increased, also comprise the position that coordinate points is inserted, when increment surpasses than the data total amount of key element under the ratio of setting in limited time, increment is set;
The step of B. synthesizing complete map by multi-stage slicing:
(1) multi-stage slicing retrieval: the map of synthetic L level engineer's scale lower area A will be used is the set of the L grade pet chip composition that intersects with regional A, is designated as QSet;
(2) data integration: for each the L grade pet chip in the QSet, data integration is upwards to review until first order section along elder brother's relation of section, and except gathering of the key element under each grade pet chip, this process also comprises the merging of the increment of same key element;
(3) section splicing: the data that previous step has obtained each L grade pet chip that intersects with target area A gather, and next are exactly the data of these L grade pet chips to be gathered according to the spatial neighbor relation splice, and finally obtain complete map.
2. the vector map data transmission method based on multi-stage slicing mode according to claim 1 is characterized in that the map datum transmission course is:
1) calculates the L grade pet chip that all and regional A intersect, below this set is designated as QSet;
2), carry out following steps for each the L grade pet chip Q among the QSet:
A. map application is carried out " buffer memory search operaqtion ", and whether retrieves slices Q is at local cache; If Q is in this locality in section, change step F; Otherwise, carry out " extracting existing key element recording operation ", " the existing key element record of terminal " of the Q that obtains cutting into slices;
B. map application is to the data of server requests section Q, and solicited message comprises the numbering QID and the existing key element record of terminal of section;
C. after server is received request, at first extrapolate the zone and the rank L of multi-stage slicing according to numbering QID, then map datum Service Part retrieving map database obtains multi-stage slicing and elder brother's section thereof, then according to the existing key element record of terminal, in the section that retrieves, carry out " removing the existing key element operation of terminal ", at last multi-stage slicing and elder brother's section thereof are sent to portable terminal;
D. map application receives data, the set of multi-stage slicing and elder brother thereof section just;
E. carry out " multi-stage slicing inserts operation " multi-stage slicing Q and elder brother's section thereof are deposited in local cache;
F. carry out " data integration operation ", generate the intactly diagram data collection of section Q;
3) all the L grade pet chips among the QSet are stitched together by spatial relationship, obtain the complete map of L level engineer's scale lower area A.
3. according to claim 1 or 2 described vector map data transmission methods based on multi-stage slicing mode, it is characterized in that: the local cache of described portable terminal one side is made up of map elements collection, key element hash table and multi-stage slicing concordance list; Described map elements collection is made up of each key element in the buffer memory, and each key element has a list item in the key element hash table, comprises three territories in it, be key element ID, reference count, the pointer of sensing key element memory location, the number of the multi-stage slicing of this key element of reference count record reference; Described key element hash table is carried out the hash ordering according to key element ID, and each multi-stage slicing Q in this locality has a list item in multi-stage slicing concordance list tree, comprises in it: (a) multi-stage slicing numbering; (b) elder brother's chain owner pointer points to elder brother's chained list of cutting into slices; (c) pointer of sensing key element reference list; (d) nearest usage flag; In the described multi-stage slicing concordance list, each list item is pressed the ordering successively of multi-stage slicing numbering.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102374884A CN101459901B (en) | 2008-12-30 | 2008-12-30 | Vector map data transmission method based on multi-stage slicing mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102374884A CN101459901B (en) | 2008-12-30 | 2008-12-30 | Vector map data transmission method based on multi-stage slicing mode |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101459901A CN101459901A (en) | 2009-06-17 |
| CN101459901B true CN101459901B (en) | 2010-09-08 |
Family
ID=40770468
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008102374884A Expired - Fee Related CN101459901B (en) | 2008-12-30 | 2008-12-30 | Vector map data transmission method based on multi-stage slicing mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101459901B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102023836A (en) * | 2010-11-26 | 2011-04-20 | 北京腾瑞万里科技有限公司 | Display method of mobile terminal vector map and mobile terminal |
| CN102314479A (en) * | 2011-07-05 | 2012-01-11 | 万达信息股份有限公司 | Method for preventing repeated marking of slice map |
| CN103208225B (en) * | 2012-01-12 | 2015-10-28 | 中国科学院遥感应用研究所 | A kind of tile map method for making and system |
| CN102981829B (en) * | 2012-11-01 | 2015-10-21 | 宁波电业局 | A kind of graph data exhibiting method based on Outage Management Systems and device |
| CN103915033A (en) * | 2012-12-29 | 2014-07-09 | 高德软件有限公司 | Method and apparatus for rendering map, and mobile terminal |
| CN104731885B (en) * | 2015-03-11 | 2018-03-30 | 中国石油大学(华东) | A kind of multi-scale modeling topological relation maintaining method based on Layer semantics |
| CN105119949B (en) * | 2015-06-25 | 2018-07-31 | 卡斯柯信号有限公司 | Method of data synchronization and system based on multi-stage slicing difference distribution statistics |
| CN106484693B (en) * | 2015-08-25 | 2019-09-17 | 普天信息技术有限公司 | Map-indication method, picture block storage method and picture display terminal |
| CN106384371B (en) * | 2016-09-20 | 2020-08-11 | 国家基础地理信息中心 | Map drawing method based on vector tiles |
| CN107103072A (en) * | 2017-04-21 | 2017-08-29 | 北京视据科技有限公司 | A kind of method and system in mobile terminal display space graph data |
| CN109981740A (en) * | 2019-02-25 | 2019-07-05 | 湖北金拓维信息技术有限公司 | A kind of distribution image data multi-level buffer method |
| CN111667573B (en) * | 2020-06-07 | 2023-12-29 | 广东南方数码科技股份有限公司 | Map slice generation method and device, storage medium and electronic equipment |
-
2008
- 2008-12-30 CN CN2008102374884A patent/CN101459901B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN101459901A (en) | 2009-06-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101459901B (en) | Vector map data transmission method based on multi-stage slicing mode | |
| CN101466082B (en) | Multilevel sliced sheet processing method for vector map data | |
| CN102521405B (en) | Massive structured data storage and query methods and systems supporting high-speed loading | |
| CN102521406B (en) | Distributed query method and system for complex task of querying massive structured data | |
| CN102419752B (en) | Industrial database message storage method | |
| CN102446139B (en) | Method and device for data storage | |
| CN107590226A (en) | A kind of map vector rendering intent based on tile | |
| CN102831405B (en) | Method and system for outdoor large-scale object identification on basis of distributed and brute-force matching | |
| CN102663801A (en) | Method for improving three-dimensional model rendering performance | |
| CN101777064A (en) | Image searching system and method | |
| CN104246765A (en) | Image search device, image search method, program, and computer-readable storage medium | |
| CN102193929A (en) | Method and equipment for determining word information entropy and searching by using word information entropy | |
| CN109492060A (en) | A kind of map tile storage method based on MBTiles | |
| CN103246549B (en) | A kind of method and system of data conversion storage | |
| CN109087030A (en) | Realize method, General Mobile crowdsourcing server and the system of the crowdsourcing of C2C General Mobile | |
| CN103970853A (en) | Method and device for optimizing search engine | |
| CN102737123B (en) | A kind of multidimensional data distribution method | |
| CN110347680A (en) | A kind of space-time data indexing means towards high in the clouds environment | |
| CN104462527A (en) | Data deduplication method and device | |
| CN108694188A (en) | A kind of newer method of index data and relevant apparatus | |
| CN104699857A (en) | Big data storage method based on knowledge engineering | |
| CN102404411A (en) | Data synchronization method of cloud storage system | |
| KR20170016168A (en) | Tile-based map data updating system and method thereof | |
| CN101477555A (en) | Fast retrieval and generation display method for task tree based on SQL database | |
| CN103543959B (en) | The method and device of mass data cache |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100908 Termination date: 20121230 |