CN108197323A - Applied to distributed system map data processing method - Google Patents
Applied to distributed system map data processing method Download PDFInfo
- Publication number
- CN108197323A CN108197323A CN201810110349.9A CN201810110349A CN108197323A CN 108197323 A CN108197323 A CN 108197323A CN 201810110349 A CN201810110349 A CN 201810110349A CN 108197323 A CN108197323 A CN 108197323A
- Authority
- CN
- China
- Prior art keywords
- distributed system
- map
- map datum
- data
- data processing
- 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.)
- Granted
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/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
- G06F16/56—Information retrieval; Database structures therefor; File system structures therefor of still image data having vectorial format
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
-
- 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/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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
Abstract
The present invention, which provides, is applied to distributed system map data processing method, the distributed system is made of multiple distributed type assemblies, each distributed type assemblies are in charge of server and several data servers including one, described to be in charge of server for managing the data server, the map data processing method includes：In response to uploading the instruction of map datum to distributed system, map datum is uploaded；In preset time, the distributed system is spontaneous to carry out two wheel backups for map datum.The present invention provides complete distributed system and carries out the Complete Method of map datum upload, backup and processing in a distributed system, so as to solve the technical issues of massive map data storage management and data processing.
Description
Technical field
The present invention relates to data processing field more particularly to applied to distributed system map data processing method.
Background technology
Map datum data volume is huge, no matter storage, processing or rendering all have higher want for server and terminal
It asks, and for a user, the timeliness of data switching and map rendering is very important, and the second gap of grade is just enough seriously
Reduce user experience；
In order to increase storage, management and the processing capacity for map datum, it can yet be regarded as one kind more using distributed network
Feasible mode, however the technology of distributed network is more demanding, it is also higher for the algorithm requirement of data consistency and backup；
In addition to this, even if solving the problems, such as data storage management based on distributed network, the huge data volume of map datum is also
Terminal rendering brings white elephant.
Invention content
In order to solve the above technical problem, the present invention provides applied to distributed system map data processing method.
The present invention is realized with following technical solution：
Applied to distributed system map data processing method, the distributed system is made of multiple distributed type assemblies, each
Distributed type assemblies are in charge of server and several data servers including one, described to be in charge of server for managing the data clothes
Business device, the map data processing method include：
In response to uploading the instruction of map datum to distributed system, map datum is uploaded；
In preset time, the distributed system is spontaneous to carry out two wheel backups for map datum.
Further, in response to the instruction to distributed system upload map datum, the map datum is carried out primary
Hash, obtains the target storage node for storing the map datum；
Judge whether the target storage node is current available node；
If so, allow to upload and the map datum is received by the target storage node；
If the target storage node is is currently unavailable node, the abstract of file where obtaining the map datum, and root
Secondary hash, which is carried out, according to abstract obtains hashed value.
Further, primary hash is carried out according to creation time and obtains hashed value；Secondary hash is carried out according to abstract to obtain
Hashed value.
Further, in the data back up method, since uploading successfully, the distributed system generates timing
Device, in order to complete to be directed to the backup of the map datum in preset time.
Further, distributed system described in the setting reference pair of preset time in response to user accesses data behavior into
The result of capable analysis.
Further, should be less than 2 days for the preset time of map vector data, for the default of photomap data
Time should be less than 5 days.
The beneficial effects of the invention are as follows：
It is provided by the invention to be applied to distributed system map data processing method, it has the advantages that：
（1）Complete distributed system is provided and carries out the complete of map datum upload, backup and processing in a distributed system
Preparation Method, so as to solve the technical issues of massive map data storage management and data processing；
（2）In order to accelerate the speed that mobile terminal renders map datum, provide and preserving map datum topology pass
The premise of system vacuates map datum the method to generate simplified-file so that terminal can when summary browses,
Simplified-file is rendered, in fine browsing, renders original document, so as to the rendering effect for obtaining rendering speed and user wishes to
The balance of fruit, in the present invention, difference vacuate degree and obtain different simplified-files, so that cleverer when rendering map
It is living.
Description of the drawings
Fig. 1 is provided in an embodiment of the present invention applied to distributed system map data processing method flow chart；
Fig. 2 is distributed system block diagram provided in an embodiment of the present invention；
Fig. 3 is backup method flow chart provided in an embodiment of the present invention；
Fig. 4 is the method flow diagram provided in an embodiment of the present invention that data processing is carried out to map datum；
Fig. 5 is small figure spot integrated conduct method flow chart provided in an embodiment of the present invention；
Fig. 6 is simplified process method flow chart provided in an embodiment of the present invention；
Fig. 7 is broken line compression algorithm flow chart provided in an embodiment of the present invention.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, the present invention is made into one below in conjunction with attached drawing
Step ground detailed description.
The embodiment of the present invention, which provides, is applied to distributed system map data processing method, as shown in Figure 1, the method packet
It includes：
In response to uploading the instruction of map datum to distributed system, the map datum is once hashed, is used for
Store the target storage node of the map datum；
Judge whether the target storage node is current available node；
If so, allow to upload and the map datum is received by the target storage node.
In preset time, the distributed system is spontaneous to carry out two wheel backups for map datum.
The distributed system has such as lower structure, as shown in Fig. 2, the distributed system is by multiple distributed type assemblies structures
Into each distributed type assemblies are in charge of server and several data servers including one, described to be in charge of server for managing institute
State data server.The i.e. described name node be in charge of server and constitute distributed type assemblies, the data server constitute
The back end of the distributed type assemblies, a name node and the administrative back end of the name node constitute distribution
Cluster, and the summation of whole distributed type assemblies constitutes distributed system, and governed by the management server in distributed system.
In the distributed system, each distributed type assemblies have its corresponding cluster identity, the mark of each name node with it is described
Cluster identity corresponds to, and each back end mark is made of name node mark and difference code.
When user issues the instruction for uploading map datum to the distributed system, then the map datum place is obtained
The creation time and file size of file carry out primary hash according to the creation time and obtain hashed value, and dissipate to described
The corresponding back end of train value（Target storage node）Status request is sent out, in order to which the back end returns to status data,
Whether the status data includes can be used and residual memory space.
If the back end is less than the remaining storage sky of the back end for available mode and the file size
Between when, then the target storage node is current available node, allows to upload and be received by the target storage node described
Diagram data.
If status data is not less than the residual memory space of the back end for unavailable or file size, institute
Target storage node is stated to be currently unavailable node.The abstract of file where then obtaining the map datum, and according to make a summary into
The secondary hash of row obtains hashed value, and to back end corresponding with the hashed value（Target storage node）Sending out state please
It asks, in order to which the back end returns to status data, whether the status data includes can be used and residual memory space.If
It is when the back end is the residual memory space that available mode and the file size are less than the back end, then described
Target storage node is current available node, allows to upload and receives the map datum by the target storage node.
Further, in order to avoid the loss of data, an embodiment of the present invention provides a kind of data back up method.
In the data back up method, since uploading successfully, the distributed system generates timer, in order to
Completion is directed to the backup of the map datum in preset time.Distributed system described in the setting reference pair of preset time is rung
The result of analysis that should be carried out in the behavior of user accesses data.
For example, it is learnt based on the access log analysis to being safeguarded in the distributed system, 80% map vector data meeting
It is accessed uploading in two days, 85% photomap data can be accessed after uploading 5 days, as a result, for map vector data
Preset time should be less than 2 days, for photomap data preset time should be less than 5 days.It will be apparent that with dividing
The use of cloth system can be also updated based on the result that access log is analyzed, correspondingly, preset time also occurs therewith
It changes.
In preset time, the distributed system is spontaneous to carry out two wheel backups for map datum.
As shown in figure 3, in first round backup procedure, the uplink time of map datum is obtained, and in the distributed system
In target group space the uplink time is hashed, the corresponding target backup node of hashed value is obtained, described in judgement
Whether target backup node is current available node（Judgment method is as previously described）, if so, being given birth in the target backup node
Into first part of copy of the map datum.Specifically, the target group space is excludes map in the distributed system
The summation of other distributed type assemblies except distributed type assemblies where back end where data.
Backup procedure is taken turns second, obtains the byte number of map datum, and the target data section in the compartment system
The space of points hashes the byte number, obtains the corresponding target backup node of hashed value, judges the target backup node
Whether it is current available node（Judgment method is as previously described）, if so, generating the map number in the target backup node
According to second part of copy.Specifically, the target data node space is the distribution where the node where first part of copy
In cluster, the summation of back end obtained after the back end where first part of copy is excluded.
On the basis of distributed system is stored and backed up to the map datum got, the embodiment of the present invention provides
A kind of method that data processing is carried out to map datum, the map datum are vector data, and the vector data includes figure
Spot position data and attribute data.
The method as shown in figure 4, including：
Carry out small figure spot integrated treatment；
Vector data after integrated treatment is repeatedly simplified respectively；Simplification scale during simplifying every time differs,
Simplify scale to be identified by the execution threshold value during simplifying；
A simplified-file is generated for simplification result each time.
Specifically, the small figure spot integrated treatment as shown in figure 5, including：
Obtain figure spot all minimum outsourcing rectangles；
Obtain the target complete figure spot that minimum outsourcing rectangle is less than preset area value；
Operations described below is performed for each target figure spot：
（1）Judge that the target figure spot with the presence or absence of ground class code, if being not present, deletes the target figure spot；
（2）If in the presence of the ground class code of the adjacent figure spot of the target figure spot being obtained, if there is ground class code and the target figure spot
The same or similar adjacent figure spot of ground class code, then the target figure spot is merged to the adjacent figure spot；Otherwise, institute is deleted
State target figure spot.
To simplify to vector data, the embodiment of the present invention a kind of simplified process method is provided as shown in fig. 6, including：
S1. the vector data is stored in preset first data structure, generates former data.
S2. according to preset algorithm, the former data is compressed, obtain compressed target data.
S3. the target data is stored in preset second data structure, is simplified file.
Further, figure spot each in vector data is filtered before S1, can also also having, to filter out weight
The step of multiple position data.
In the following, step S1 is described in detail：
Vector data is described using the first data structure in the embodiment of the present invention, specifically, first data structure is one kind
Quad-tree structure, one figure spot of each node identification.The topology of the quaternary tree reacts the spatial relation of the figure spot.
In the following, step S2 is described in detail：
In the map show using vector data as data source, planar figure spot is non-overlapping, seamless distribution, and
Directly carry out lossy compression to figure spot, it is inevitable due to lose some position datas so that there is crack in compressed figure spot and nothing
Method keeps the effect of non-overlapping, seamless distribution, in order to avoid occurring figure spot crack after compression, seamless display is maintained to imitate
Fruit, before lossy compression is carried out, it is necessary to carry out data prediction.
In node, a figure spot is recorded using a vector container, each element in the vector containers
It is a chained list, each chained list node in chained list represents one section of broken line in the figure spot, is split in order to avoid there is figure spot
Seam, data prediction need to obtain figure spot topology, and the figure spot topology includes the common edge of figure spot and adjacent figure spot, in order to obtain
Common edge, each chained list node have recorded the description below：
This figure spot identifies；
First starts to identify, and starts for minute book figure spot broken line；
First end of identification terminates for minute book figure spot broken line；
Figure spot mark is matched, the matching figure spot is to seek figure spot topological and that common edge extraction is carried out with this figure spot；Obviously
Matched icon is the adjacent figure spot of this figure spot；
Second starts to identify, and starts for recording adjacent figure spot broken line；
Second end of identification terminates for recording adjacent figure spot broken line；
Common edge identify, for identify chained list node record broken line whether be this figure spot and adjacent figure spot common edge.
During topology is asked for, when handling some chained list node, one section of broken line and matching to this figure spot are schemed
One section of broken line of spot, when judging whether it overlaps, if finding, its whole position all overlaps, and the common edge is marked to identify.If
It was found that it partially overlaps, then chained list node according to intersection into line splitting, specifically：
If intersection is located at this figure spot broken line and starts or ending, chained list is split into two target chained lists, a mesh
Chained list record common edge is marked, another object chain token records not common side.
If intersection is located in the middle part of this figure spot broken line, chained list is split into three target chained lists, intermediate object chain
Token record common edge, other object chain tokens record not common side.
After being extracted to the common edge of all figure spots, you can obtain the topology of former data, carried out according to the topology
Compression implements compression algorithm to common edge and not common side respectively, and will distinguish compressed result deposit preset second
Data generate simplified-file.
Identical or different compression algorithm, the embodiment of the present invention can be used for the compression of common edge and not common side
It is middle that a kind of feasible broken line compression algorithm is provided, as shown in fig. 7, comprises：
（1）Straight line AB is connected between two point A, B of broken line head and the tail, which is the string of curve；
（2）Point C maximum with a distance from the straightway on broken line is obtained, calculates its distance d with AB；
（3）Compare the distance with performing the size of threshold value, if less than threshold value is performed, then delete C；
（4）If distance, which is more than, performs threshold value, broken line is divided into two sections of AC and BC, and two sections of broken lines are carried out respectively with C（1）
~（3）Processing.
Need important is, former data topology obtain under the premise of, thus it is possible to vary perform threshold value repeatedly compressed, obtain
Data after to the compression of different scale.Data after each compression according to preset second data structure are stored, are obtained not
With the simplified-file of scale.
Obviously, simplified-file is very useful under the scene of map denotation, can when user needs to observe summary data
Simplified-file to be used to show map, so as to not only with Fast rendering map but also user can be allowd quickly to know that map is general
Condition；When user needs to observe detail data, former data can be used, so as to lossless display map details.Obviously, user's
During amplifieroperation or reduction operation, the simplified-file of different scale or former data according to scaling, can be loaded.
In the specification provided in this place, numerous specific details are set forth.It is to be appreciated, however, that the implementation of the present invention
Example can be put into practice without these specific details.In some instances, well known method, structure is not been shown in detail
And technology, so as not to obscure the understanding of this description.
Similarly, it should be understood that in order to simplify the disclosure and help to understand one or more of each inventive aspect,
Above in the description of exemplary embodiment of the present invention, each feature of the invention is grouped together into single implementation sometimes
In example, figure or descriptions thereof.However, the method for the disclosure should be construed to reflect following intention：I.e. required guarantor
Shield the present invention claims the more features of feature than being expressly recited in each claim.More precisely, such as this hair
As bright claims reflect, inventive aspect is all features less than single embodiment disclosed above.Cause
This, it then follows thus claims of specific embodiment are expressly incorporated in the specific embodiment, wherein each claim
Itself is all as separate embodiments of the invention.
Those skilled in the art, which are appreciated that, to carry out adaptively the module in the equipment in embodiment
Change and they are arranged in one or more equipment different from the embodiment.It can be the module or list in embodiment
Member or component be combined into a module or unit or component and can be divided into addition multiple submodule or subelement or
Sub-component.Other than such feature and/or at least some of process or unit exclude each other, it may be used any
Combination is disclosed to all features disclosed in this specification (including adjoint claim, abstract and attached drawing) and so to appoint
Where all processes or unit of method or equipment are combined.Unless expressly stated otherwise, this specification is (including adjoint power
Profit requirement, abstract and attached drawing) disclosed in each feature can be by providing the alternative features of identical, equivalent or similar purpose come generation
It replaces.
In addition, it will be appreciated by those of skill in the art that although embodiment described herein includes institute in other embodiments
Including certain features rather than other feature, but the combination of the feature of different embodiment means in the scope of the present invention
Within and form different embodiments.For example, in claims of the present invention, embodiment claimed it is arbitrary
One of mode can use in any combination.
The present invention be also implemented as some or all equipment for performing method as described herein or
System program (such as computer program and computer program product).Such program for realizing the present invention can be stored in computer
It or can the form with one or more signal on readable medium.Such signal can be above and below internet website
Load obtains, and can also provide on carrier signal or be provided in the form of any other.
It should be noted that above-described embodiment is that the present invention will be described rather than limits the invention, and
Those skilled in the art can design alternative embodiment without departing from the scope of the appended claims.In claim
In, any reference mark between bracket should not be configured to limitations on claims.Word "comprising" is not excluded for depositing
In elements or steps not listed in the claims etc..Word "a" or "an" before element does not exclude the presence of more
A such element.The present invention can be by means of including the hardware of several different elements and by means of properly programmed calculating
Machine is realized.If in the unit claim for listing dry systems, several in these systems can be by same
Hardware branch embodies.The use of word first, second and third etc. does not indicate that any sequence, can explain these words
For title.
Claims (6)
1. applied to distributed system map data processing method, which is characterized in that the distributed system is by multiple distributions
Cluster is formed, and each distributed type assemblies are in charge of server and several data servers including one, and the server of being in charge of is used for
The data server is managed, the map data processing method includes：
In response to uploading the instruction of map datum to distributed system, map datum is uploaded；
In preset time, the distributed system is spontaneous to carry out two wheel backups for map datum.
2. according to claim 1 be applied to distributed system map data processing method, it is characterised in that：
In response to uploading the instruction of map datum to distributed system, the map datum is once hashed, is used for
Store the target storage node of the map datum；
Judge whether the target storage node is current available node；
If so, allow to upload and the map datum is received by the target storage node；
If the target storage node is is currently unavailable node, the abstract of file where obtaining the map datum, and root
Secondary hash, which is carried out, according to abstract obtains hashed value.
3. according to claim 2 be applied to distributed system map data processing method, it is characterised in that：
Primary hash is carried out according to creation time and obtains hashed value；Secondary hash is carried out according to abstract and obtains hashed value.
4. according to claim 1 be applied to distributed system map data processing method, it is characterised in that：
In the data back up method, since uploading successfully, the distributed system generates timer, in order to pre-
If completion is directed to the backup of the map datum in the time.
5. according to claim 4 be applied to distributed system map data processing method, it is characterised in that：
The knot of analysis that distributed system described in the setting reference pair of preset time is carried out in response to the behavior of user accesses data
Fruit.
6. according to claim 5 be applied to distributed system map data processing method, it is characterised in that：
It should be less than 2 days for the preset time of map vector data, should be less than 5 for the preset time of photomap data
My god.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810110349.9A CN108197323B (en) | 2018-02-05 | 2018-02-05 | Map data processing method applied to distributed system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810110349.9A CN108197323B (en) | 2018-02-05 | 2018-02-05 | Map data processing method applied to distributed system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108197323A true CN108197323A (en) | 2018-06-22 |
| CN108197323B CN108197323B (en) | 2021-03-30 |
Family
ID=62592612
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810110349.9A Active CN108197323B (en) | 2018-02-05 | 2018-02-05 | Map data processing method applied to distributed system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108197323B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108319701A (en) * | 2018-02-05 | 2018-07-24 | 丁武轩 | Map datum integrated conduct method |
| CN109213905A (en) * | 2018-08-27 | 2019-01-15 | 贵州宽凳智云科技有限公司北京分公司 | Map datum operational method and system |
| CN113254553A (en) * | 2021-04-14 | 2021-08-13 | 湖北省地质调查院 | Web map publishing method and system based on intelligent agent platform |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101719148A (en) * | 2009-11-24 | 2010-06-02 | 北京灵图软件技术有限公司 | Three-dimensional spatial information saving method, device, system and dispatching system |
| CN101902498A (en) * | 2010-07-02 | 2010-12-01 | 广州鼎甲计算机科技有限公司 | Network technology based storage cloud backup method |
| CN101976534A (en) * | 2010-11-01 | 2011-02-16 | 百度在线网络技术（北京）有限公司 | Electronic map generation method and device |
| CN102843403A (en) * | 2011-06-23 | 2012-12-26 | 盛大计算机（上海）有限公司 | File processing method based on distributed file system, system, and client |
| US20130036088A1 (en) * | 2004-07-29 | 2013-02-07 | Hitachi Data System Corporation | Metadata management for fixed content distributed data storage |
| CN103412863A (en) * | 2013-06-05 | 2013-11-27 | 东南大学 | Embedded-device-oriented method for achieving rapid visualization of high-capacity vector map |
| US20140304231A1 (en) * | 2013-04-06 | 2014-10-09 | Citrix Systems, Inc. | Systems and methods for application-state distributed replication table hunting |
| CN107547653A (en) * | 2017-09-11 | 2018-01-05 | 华北水利水电大学 | A kind of distributed file storage system |
-
2018
- 2018-02-05 CN CN201810110349.9A patent/CN108197323B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130036088A1 (en) * | 2004-07-29 | 2013-02-07 | Hitachi Data System Corporation | Metadata management for fixed content distributed data storage |
| CN101719148A (en) * | 2009-11-24 | 2010-06-02 | 北京灵图软件技术有限公司 | Three-dimensional spatial information saving method, device, system and dispatching system |
| CN101902498A (en) * | 2010-07-02 | 2010-12-01 | 广州鼎甲计算机科技有限公司 | Network technology based storage cloud backup method |
| CN101976534A (en) * | 2010-11-01 | 2011-02-16 | 百度在线网络技术（北京）有限公司 | Electronic map generation method and device |
| CN102843403A (en) * | 2011-06-23 | 2012-12-26 | 盛大计算机（上海）有限公司 | File processing method based on distributed file system, system, and client |
| US20140304231A1 (en) * | 2013-04-06 | 2014-10-09 | Citrix Systems, Inc. | Systems and methods for application-state distributed replication table hunting |
| CN103412863A (en) * | 2013-06-05 | 2013-11-27 | 东南大学 | Embedded-device-oriented method for achieving rapid visualization of high-capacity vector map |
| CN107547653A (en) * | 2017-09-11 | 2018-01-05 | 华北水利水电大学 | A kind of distributed file storage system |
Non-Patent Citations (2)
| Title |
|---|
| JIANJIANGLI ET AL: "A data-check based distributed storage model for storing hot temporary data", 《FUTURE GENERATION COMPUTER SYSTEMS》 * |
| 龙少杭: "基于Storm的实时大数据分析系统的研究与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108319701A (en) * | 2018-02-05 | 2018-07-24 | 丁武轩 | Map datum integrated conduct method |
| CN108319701B (en) * | 2018-02-05 | 2020-09-15 | 北京纬思拓信息科技有限公司 | Map data comprehensive processing method |
| CN109213905A (en) * | 2018-08-27 | 2019-01-15 | 贵州宽凳智云科技有限公司北京分公司 | Map datum operational method and system |
| CN113254553A (en) * | 2021-04-14 | 2021-08-13 | 湖北省地质调查院 | Web map publishing method and system based on intelligent agent platform |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108197323B (en) | 2021-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105677250B (en) | The update method and updating device of object data in object storage system | |
| CN105100146B (en) | Date storage method, apparatus and system | |
| US8620926B2 (en) | Using a hashing mechanism to select data entries in a directory for use with requested operations | |
| CN108011929A (en) | Data request processing method, apparatus, computer equipment and storage medium | |
| CN106294352B (en) | A kind of document handling method, device and file system | |
| CN106202416B (en) | Table data write method and device, table data read method and device | |
| CN105868231A (en) | Cache data updating method and device | |
| CN103634361B (en) | The method and apparatus for downloading file | |
| CN105824723B (en) | The method and system that a kind of data to publicly-owned cloud storage account are backed up | |
| CN106302595A (en) | A kind of method and apparatus that server is carried out physical examination | |
| CN108614976A (en) | Authority configuring method, device and storage medium | |
| CN108197323A (en) | Applied to distributed system map data processing method | |
| WO2016169237A1 (en) | Data processing method and device | |
| CN108427728A (en) | Management method, equipment and the computer-readable medium of metadata | |
| CN110427364A (en) | A kind of data processing method, device, electronic equipment and storage medium | |
| CN106021566A (en) | Method, device and system for improving concurrent processing capacity of single database | |
| CN109981569A (en) | Network system access method, device, computer equipment and readable storage medium storing program for executing | |
| CN112559463A (en) | Method and device for processing compressed file | |
| CN108304555A (en) | Distributed maps data processing method | |
| US20150186060A1 (en) | Selective disk volume cloning for virtual disk creation | |
| CN106980618B (en) | File storage method and system based on MongoDB distributed cluster architecture | |
| CN107844542A (en) | A kind of distributed document storage method and device | |
| CN108319701A (en) | Map datum integrated conduct method | |
| US8589652B2 (en) | Reorganization of a fragmented directory of a storage data structure comprised of the fragmented directory and members | |
| CN108363727B (en) | Data storage method and device based on ZFS file system |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210305 Address after: 14-15 / F, block a, building 10, Shenzhen Bay science and technology ecological park, No.10, Gaoxin South 9th Road, high tech Zone community, Yuehai street, Nanshan District, Shenzhen, Guangdong 518000 Applicant after: SHENZHEN ETOP INFORMATION Co.,Ltd. Address before: 317203 98 group 1, Xinqiao village, Lei Feng Township, Tiantai County, Taizhou, Zhejiang Applicant before: Ding Wuxuan |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |