CN116226131B - Multi-temporal three-dimensional slice data storage method and device under multi-tree structure - Google Patents
Multi-temporal three-dimensional slice data storage method and device under multi-tree structure Download PDFInfo
- Publication number
- CN116226131B CN116226131B CN202310210501.1A CN202310210501A CN116226131B CN 116226131 B CN116226131 B CN 116226131B CN 202310210501 A CN202310210501 A CN 202310210501A CN 116226131 B CN116226131 B CN 116226131B
- Authority
- CN
- China
- Prior art keywords
- file
- node
- dimensional slice
- global
- tree structure
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 40
- 238000013500 data storage Methods 0.000 title claims abstract description 19
- 238000004590 computer program Methods 0.000 claims description 8
- 238000012545 processing Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000004806 packaging method and process Methods 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
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
- G06F16/2246—Trees, e.g. B+trees
-
- 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/23—Updating
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02A—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
- Y02A90/00—Technologies having an indirect contribution to adaptation to climate change
- Y02A90/10—Information and communication technologies [ICT] supporting adaptation to climate change, e.g. for weather forecasting or climate simulation
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a multi-temporal three-dimensional slice data storage method and device under a multi-tree structure, belonging to the technical field of data processing, wherein the method comprises the following steps: acquiring a global three-dimensional slice file and updating the three-dimensional slice file; the global three-dimensional slice file and the updated three-dimensional slice file include: a description file, a node page file, and a node file; respectively updating the description file, the node page file and the node file according to a data updating method; and determining a global three-dimensional slice file with a multi-tree structure according to the updated description file, the node page file and the node file. The invention adopts the multi-tree structure to realize the access of the global data in different periods, realizes the aim of incremental update on the global data during update through the separate storage of the tree structure and the node data, effectively solves the problem of large occupied storage resource of the data, and improves the maintainability of the data and the service.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a method, an apparatus, a device, and a storage medium for storing multi-temporal three-dimensional slice data in a multi-tree structure.
Background
Along with projects such as real-scene three-dimensional Chinese construction, CIM, natural resource three-dimensional map and the like, a large amount of inclined three-dimensional model data can be produced/updated, a large amount of storage resources can be occupied, and the management and maintenance of the data are also subject to huge pressure. Different periodic updates create a large amount of data redundancy and multi-periodic data management is cumbersome.
Disadvantages of separate storage of different periodic data include: each piece of data is data (TB level or PB level) covering the whole domain, and the data of the magnitude has higher requirement on storage resources and occupies a large amount of storage resources; the different data needs multiple service addresses when providing service to the outside, which is inconvenient for the data maintenance and management of the system.
Disclosure of Invention
The invention provides a multi-temporal three-dimensional slice data storage method, device and equipment under a multi-tree structure and a storage medium. The invention adopts the multi-tree structure to realize the access of the global data in different periods, realizes the aim of incremental update on the global data during update through the separate storage of the tree structure and the node data, effectively solves the problem of large occupied storage resource of the data, and improves the maintainability of the data and the service.
In a first aspect, an embodiment of the present invention provides a multi-temporal three-dimensional slice data storage method under a multi-tree structure, the method including:
acquiring a global three-dimensional slice file and updating the three-dimensional slice file;
the global three-dimensional slice file and the updated three-dimensional slice file comprise: a description file, a node page file, and a node file;
respectively updating the description file, the node page file and the node file according to a data updating method;
and determining a global three-dimensional slice file with a multi-tree structure according to the updated description file, the node page file and the node file.
According to the technical scheme, the multi-tree structure is adopted, the global data access of different periods can be realized, the aim of incremental update on the global data during update is realized through the separate storage of the tree structure and the node data, the problem that the data occupy large storage resources is effectively solved, and the maintainability of the data and the service is improved.
Optionally, updating the description file, the node page file and the node file according to the data updating method includes:
obtaining the maximum index value in the node page of the global three-dimensional slice file, and setting the access index value of the new tree according to the maximum index value;
acquiring a description file of the global three-dimensional slice file and judging whether the description file contains a dataversion key value or not;
if the data version is included, adding a new data version, and if the data version is not included, creating new data version information;
updating the dataversion key value into the description file of the global three-dimensional slice file, and storing the description file into the global three-dimensional slice file with the multi-tree structure.
Optionally, the updating of the description file, the node page file and the node file is performed according to the data updating method, and further includes:
copying node files in the global three-dimensional slice file into the global three-dimensional slice file with the multi-tree structure, and acquiring the largest node file in the global three-dimensional slice file;
and obtaining node files in the updated three-dimensional slice file, renaming the node files in the updated three-dimensional slice file according to the maximum node file names in the global three-dimensional slice file, and storing the renamed node files in the global three-dimensional slice file with the multi-tree structure.
Optionally, the updating of the description file, the node page file and the node file is performed according to the data updating method, and further includes:
acquiring a node page file in an updated three-dimensional slice file, and updating an ID of a node file referenced in the node page file and an index in the node page file;
traversing nodes in node pages of the global three-dimensional slice file and the updated three-dimensional slice file, performing space matching, and recording a matching relationship;
generating a new tree structure according to the matching relation;
copying node page files except the last node page in the global three-dimensional slice file into the global three-dimensional slice file with the multi-tree structure;
and acquiring the last node page file in the global three-dimensional slice file, adding node information of the new tree, dividing the node page file into different node page files according to the number of the nodes, and writing the different node page files into the global three-dimensional slice file with the multi-tree structure.
Optionally, generating a new tree structure according to the matching relationship includes:
directly referencing the original index if no update exists in a tree structure formed by nodes in a node page of the global three-dimensional slice file;
and generating a new index when the top node is updated in the tree structure formed by the nodes in the node pages of the global three-dimensional slice file, and replacing the original index in the global three-dimensional slice file.
In a second aspect, embodiments of the present invention provide a multi-temporal three-dimensional slice data storage apparatus under a multi-tree structure, the apparatus comprising:
the acquisition module is used for acquiring the global three-dimensional slice file and updating the three-dimensional slice file;
the global three-dimensional slice file and the updated three-dimensional slice file comprise: a description file, a node page file, and a node file;
the updating module is used for updating the description file, the node page file and the node file according to the data updating method;
and the determining module is used for determining the global three-dimensional slice file with the multi-tree structure according to the updated description file, the node page file and the node file.
In a third aspect, an embodiment of the present invention provides an electronic device, including a memory and a processor, where the memory stores a computer program, and the processor implements the method according to any implementation manner of the first aspect when executing the program.
In a fourth aspect, embodiments of the present invention provide a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method according to any of the implementations of the first aspect.
The invention provides a multi-temporal three-dimensional slice data storage method and device under a multi-tree structure, wherein the method comprises the following steps: acquiring a global three-dimensional slice file and updating the three-dimensional slice file; the global three-dimensional slice file and the updated three-dimensional slice file include: a description file, a node page file, and a node file; respectively updating the description file, the node page file and the node file according to a data updating method; and determining a global three-dimensional slice file with a multi-tree structure according to the updated description file, the node page file and the node file. The invention adopts the multi-tree structure to realize the access of the global data in different periods, realizes the aim of incremental update on the global data during update through the separate storage of the tree structure and the node data, effectively solves the problem of large occupied storage resource of the data, and improves the maintainability of the data and the service.
It should be understood that the description in this summary is not intended to limit the critical or essential features of the embodiments of the invention, nor is it intended to limit the scope of the invention. Other features of the present invention will become apparent from the description that follows.
Drawings
The above and other features, advantages and aspects of embodiments of the present invention will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. In the drawings, the same or similar reference numerals denote the same or similar elements.
FIG. 1 is a flow chart of a multi-temporal three-dimensional slice data storage method under a multi-tree structure according to an embodiment of the present invention;
FIG. 2 is a flow chart of a multi-temporal three-dimensional slice data storage method under a multi-tree structure according to another embodiment of the present invention;
FIG. 3 is a schematic structural diagram of a multi-temporal three-dimensional slice data storage device in a multi-tree structure according to an embodiment of the present invention;
fig. 4 is a block diagram of an electronic device according to an embodiment of the present invention.
Description of the embodiments
In order to enable a person skilled in the art to better understand the technical solutions in one or more embodiments of the present specification, the technical solutions in one or more embodiments of the present specification will be clearly and completely described below with reference to the drawings in one or more embodiments of the present specification, and it is obvious that the described embodiments are only some embodiments of the present specification, not all embodiments. All other embodiments, which can be made by one or more embodiments of the present disclosure without inventive faculty, are intended to be within the scope of the present disclosure.
It should be noted that, the description of the embodiment of the present invention is only for the purpose of more clearly describing the technical solution of the embodiment of the present invention, and does not constitute a limitation on the technical solution provided by the embodiment of the present invention.
Fig. 1 is a flowchart of a multi-temporal three-dimensional slice data storage method under a multi-tree structure according to an embodiment of the present invention. As shown in fig. 1, includes:
s101, acquiring a global three-dimensional slice file and updating the three-dimensional slice file.
The global three-dimensional slice file and the updated three-dimensional slice file comprise: description files, node page files, and node files.
Illustratively, the global three-dimensional slice file and the updated three-dimensional slice file are SLPK packets, which may include: description files (3 dscreenlayer. Json. Gz), node page folders, node folders, etc., the data organization of which may be as follows:
.\example.slpk
+--nodePages
| +--0.json.gz
| +-- (...)
+--nodes
| +--root
| | +--3dNodeIndexDocument.json.gz
| +--0
| | +--geometries
| | | +-- 0.bin.gz
| | | +--(...)
| | +--textures
| | | +--0.jpg
| | | +--0_0_1.bin.dds.gz
| | | +--(...)
| +--(...)
+--3dSceneLayer.json.gz
+--@specialIndexFileHASH128@ 。
s102, updating the description file, the node page file and the node file according to a data updating method.
Optionally, updating the description file, the node page file and the node file according to the data updating method includes:
obtaining the maximum index value in the node page of the global three-dimensional slice file, and setting the access index value of the new tree according to the maximum index value;
acquiring a description file of the global three-dimensional slice file and judging whether the description file contains a dataversion key value or not;
if the data version is included, adding a new data version, and if the data version is not included, creating new data version information;
updating the dataversion key value into the description file of the global three-dimensional slice file, and storing the description file into the global three-dimensional slice file with the multi-tree structure.
Illustratively, the access index value for the new book may be set to: new tree index value = maximum index value +1.
Illustratively, creating new data version information may be as follows:
"dataversion":{
"0":{
"readindex":0,
"time":2022-3-29
},
"1":{
"readindex":NewTreeIndex,
"time":2023-1-28
}
}。
optionally, the updating of the description file, the node page file and the node file is performed according to the data updating method, and further includes:
copying node files in the global three-dimensional slice file into the global three-dimensional slice file with the multi-tree structure, and acquiring the largest node file in the global three-dimensional slice file;
and obtaining node files in the updated three-dimensional slice file, renaming the node files in the updated three-dimensional slice file according to the maximum node file names in the global three-dimensional slice file, and storing the renamed node files in the global three-dimensional slice file with the multi-tree structure.
Illustratively, the renaming rule may be: new name = original name + maximum node filename +1.
Optionally, the updating of the description file, the node page file and the node file is performed according to the data updating method, and further includes:
acquiring a node page file in an updated three-dimensional slice file, and updating an ID of a node file referenced in the node page file and an index in the node page file;
illustratively, the ID update rule of the node file may be: new node name = original node name + maximum node filename +1.
Illustratively, the index update rule in the node page file may be: new index value = old index value + new tree index value.
Traversing nodes in node pages of the global three-dimensional slice file and the updated three-dimensional slice file, performing space matching, and recording a matching relationship;
generating a new tree structure according to the matching relation;
copying node page files except the last node page in the global three-dimensional slice file into the global three-dimensional slice file with the multi-tree structure;
and acquiring the last node page file in the global three-dimensional slice file, adding node information of the new tree, dividing the node page file into different node page files according to the number of the nodes, and writing the different node page files into the global three-dimensional slice file with the multi-tree structure.
Optionally, generating a new tree structure according to the matching relationship includes:
directly referencing the original index if no update exists in a tree structure formed by nodes in a node page of the global three-dimensional slice file;
and generating a new index when the top node is updated in the tree structure formed by the nodes in the node pages of the global three-dimensional slice file, and replacing the original index in the global three-dimensional slice file.
S103, determining a global three-dimensional slice file with a multi-tree structure according to the updated description file, the node page file and the node file.
Alternatively, the updated description file, the node page file, and the node file may be repackaged to form three-dimensional slice data having a multi-tree structure.
For example, non-redundant storage can be adopted when the node is updated, so that the redundancy of data is reduced to the greatest extent; when the node page is updated, the global access of different time phase data can be realized by constructing a multi-tree structure, and an access interface for accessing different time phase/period data can be provided in the description file.
Fig. 2 is a flowchart illustrating a multi-temporal three-dimensional slice data storage method under a multi-tree structure according to another embodiment of the present invention, as shown in fig. 2:
inputting a global three-dimensional slice file and updating the three-dimensional slice file, adding the current situation to the description file in the global three-dimensional slice file, accessing the node name (the number in the node page) by historical data to obtain a new description file, and packaging;
then, acquiring the node number in the node page files in the global three-dimensional slice file, the node page files and the node page files after the node page resource reference naming in the updating three-dimensional slice file, updating the global tree node file, merging the updated global tree node file and the node page files in the global three-dimensional slice file to generate a multi-tree node page file, and packaging the multi-tree node page file;
the node page resource reference names can be modified according to the node page files in the updated three-dimensional slice files and the node files in the global three-dimensional slice files, the node file number in the global three-dimensional slice files can be obtained during modification, and the increment value for node naming of the updated three-dimensional slice files is determined;
finally renaming the nodes in the node files in the global three-dimensional slice file;
and obtaining the global three-dimensional slice file with the multi-tree structure according to the packed multi-tree node page file, the new description file and the renamed node file.
Illustratively, the global three-dimensional slice file, the update three-dimensional slice file, and the global three-dimensional slice file having a multi-tree structure may be SLPK format files.
The embodiment of the invention provides a multi-temporal three-dimensional slice data storage method under a multi-tree structure, which comprises the following steps: acquiring a global three-dimensional slice file and updating the three-dimensional slice file; the global three-dimensional slice file and the updated three-dimensional slice file include: a description file, a node page file, and a node file; respectively updating the description file, the node page file and the node file according to a data updating method; and determining a global three-dimensional slice file with a multi-tree structure according to the updated description file, the node page file and the node file. The invention adopts the multi-tree structure to realize the access of the global data in different periods, realizes the aim of incremental update on the global data during update through the separate storage of the tree structure and the node data, effectively solves the problem of large occupied storage resource of the data, and improves the maintainability of the data and the service.
The following describes in detail, with reference to fig. 3, a device provided in an embodiment of the present application, where the method for storing multi-temporal three-dimensional slice data in the multi-tree structure can be executed.
FIG. 3 is a schematic diagram illustrating a multi-temporal three-dimensional slice data storage device in a multi-tree structure according to an embodiment of the present invention; as shown in fig. 3, the multi-temporal three-dimensional slice data storage device 30 in the multi-tree structure includes:
an acquiring module 301, configured to acquire a global three-dimensional slice file and update the three-dimensional slice file;
the global three-dimensional slice file and the updated three-dimensional slice file comprise: a description file, a node page file, and a node file;
the updating module 302 is configured to update the description file, the node page file, and the node file according to a data updating method;
the determining module 303 is configured to determine a global three-dimensional slice file with a multi-tree structure according to the updated description file, the node page file and the node file.
Optionally, the updating module 302 is further configured to obtain a maximum index value in a node page of the global three-dimensional slice file, and set an access index value of the new tree according to the maximum index value; acquiring a description file of the global three-dimensional slice file and judging whether the description file contains a dataversion key value or not; if the data version is included, adding a new data version, and if the data version is not included, creating new data version information; updating the dataversion key value into the description file of the global three-dimensional slice file, and storing the description file into the global three-dimensional slice file with the multi-tree structure.
Optionally, the updating module 302 is further configured to copy the node file in the global three-dimensional slice file into a global three-dimensional slice file with a multi-tree structure, and obtain a largest node file in the global three-dimensional slice file; and obtaining node files in the updated three-dimensional slice file, renaming the node files in the updated three-dimensional slice file according to the maximum node file names in the global three-dimensional slice file, and storing the renamed node files in the global three-dimensional slice file with the multi-tree structure.
Optionally, the updating module 302 is further configured to obtain and update a node page file in the three-dimensional slice file, and update an ID of a node file referenced in the node page file and an index in the node page file; traversing nodes in node pages of the global three-dimensional slice file and the updated three-dimensional slice file, performing space matching, and recording a matching relationship; generating a new tree structure according to the matching relation; copying node page files except the last node page in the global three-dimensional slice file into the global three-dimensional slice file with the multi-tree structure; and acquiring the last node page file in the global three-dimensional slice file, adding node information of the new tree, dividing the node page file into different node page files according to the number of the nodes, and writing the different node page files into the global three-dimensional slice file with the multi-tree structure.
Optionally, the updating module 302 is further configured to directly reference the original index if there is no update in the tree structure formed by the nodes in the node pages of the global three-dimensional slice file; and generating a new index when the top node is updated in the tree structure formed by the nodes in the node pages of the global three-dimensional slice file, and replacing the original index in the global three-dimensional slice file.
The embodiment of the present invention also provides a computer electronic device, fig. 4 shows a schematic diagram of the structure of an electronic device to which the embodiment of the present invention can be applied, and as shown in fig. 4, the computer electronic device includes a central processing module (CPU) 401 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data required for the system operation are also stored. The CPU 401, ROM 402, and RAM 403 are connected to each other by a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output portion 407 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage section 408 including a hard disk or the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. The drive 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed on the drive 410 as needed, so that a computer program read out therefrom is installed into the storage section 408 as needed.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules or modules involved in the embodiments of the present invention may be implemented in software or in hardware. The described modules or modules may also be provided in a processor, for example, as: a processor comprises an acquisition module 201 and a determination module 202, wherein the names of these modules do not in some cases constitute a limitation of the module itself, e.g. the determination module 202 may also be described as "determination module 202 for determining a user of a multi-temporal three-dimensional slice data store under a multi-tree structure according to the gray scale basis and the gray scale policy".
As another aspect, the present invention also provides a computer readable storage medium, which may be a computer readable storage medium contained in the multi-temporal three-dimensional slice data storage device in a multi-tree structure as described in the above embodiment; or may be a computer-readable storage medium, alone, that is not incorporated into an electronic device. The computer readable storage medium stores one or more programs for use by one or more processors to perform a multi-temporal three-dimensional slice data storage method described under a multi-tree structure of the present invention.
The above description is only illustrative of the preferred embodiments of the present invention and of the principles of the technology employed. It will be appreciated by persons skilled in the art that the scope of the invention referred to in the present invention is not limited to the specific combinations of the technical features described above, but also covers other technical features formed by any combination of the technical features described above or their equivalents without departing from the inventive concept. Such as the above-mentioned features and the technical features disclosed in the present invention (but not limited to) having similar functions are replaced with each other.
Claims (4)
1. A multi-temporal three-dimensional slice data storage method under a multi-tree structure, comprising:
acquiring a global three-dimensional slice file and updating the three-dimensional slice file; the global three-dimensional slice file and the updated three-dimensional slice file include: a description file, a node page file, and a node file;
respectively updating the description file, the node page file and the node file according to a data updating method;
determining a global three-dimensional slice file with a multi-tree structure according to the updated description file, the node page file and the node file;
the updating of the description file, the node page file and the node file according to the data updating method comprises the following steps:
acquiring a maximum index value in a node page of the global three-dimensional slice file, and setting an access index value of a new tree according to the maximum index value;
acquiring a description file of the global three-dimensional slice file and judging whether a dataversion key value is included or not;
if the data version is included, adding a new data version, and if the data version is not included, creating new data version information;
updating a dataversion key value into a description file of the global three-dimensional slice file, and storing the dataversion key value into the global three-dimensional slice file with the multi-tree structure;
copying a node file in the global three-dimensional slice file to the global three-dimensional slice file with the multi-tree structure, and acquiring the largest node file in the global three-dimensional slice file;
acquiring node files in the updated three-dimensional slice file, renaming the node files in the updated three-dimensional slice file according to the maximum node file names in the global three-dimensional slice file, and storing the renamed node files in the global three-dimensional slice file with the multi-tree structure;
acquiring a node page file in the updated three-dimensional slice file, and updating an ID of a node file referenced in the node page file and an index in the node page file;
traversing nodes in the node pages of the global three-dimensional slice file and the updated three-dimensional slice file, performing space matching, and recording a matching relationship;
generating a new tree structure according to the matching relation;
copying node page files except for the last node page in the global three-dimensional slice file into the global three-dimensional slice file with the multi-tree structure;
acquiring the last node page file in the global three-dimensional slice file, adding node information of a new tree, dividing the node page file into different node page files according to the number of nodes, and writing the different node page files into the global three-dimensional slice file with the multi-tree structure;
the generating a new tree structure according to the matching relation comprises the following steps:
directly referencing the original index if no update exists in a tree structure formed by nodes in a node page of the global three-dimensional slice file;
and generating a new index when the top node is updated in the tree structure formed by the nodes in the node pages of the global three-dimensional slice file, and replacing the original index in the global three-dimensional slice file.
2. A multi-temporal three-dimensional slice data storage device in a multi-tree structure, comprising:
the acquisition module is used for acquiring the global three-dimensional slice file and updating the three-dimensional slice file; the global three-dimensional slice file and the updated three-dimensional slice file include: a description file, a node page file, and a node file;
the updating module is used for updating the description file, the node page file and the node file respectively according to a data updating method;
the determining module is used for determining a global three-dimensional slice file with a multi-tree structure according to the updated description file, the node page file and the node file;
the updating module is further configured to obtain a maximum index value in a node page of the global three-dimensional slice file, and set an access index value of a new tree according to the maximum index value; acquiring a description file of the global three-dimensional slice file and judging whether a dataversion key value is included or not; if the data version is included, adding a new data version, and if the data version is not included, creating new data version information; updating a dataversion key value into a description file of the global three-dimensional slice file, and storing the dataversion key value into the global three-dimensional slice file with the multi-tree structure;
the updating module is further configured to copy a node file in the global three-dimensional slice file to the global three-dimensional slice file with the multi-tree structure, and obtain a largest node file in the global three-dimensional slice file; acquiring node files in the updated three-dimensional slice file, renaming the node files in the updated three-dimensional slice file according to the maximum node file names in the global three-dimensional slice file, and storing the renamed node files in the global three-dimensional slice file with the multi-tree structure;
the updating module is further used for acquiring the node page file in the updated three-dimensional slice file, and updating the ID of the node file referenced in the node page file and the index in the node page file; traversing nodes in the node pages of the global three-dimensional slice file and the updated three-dimensional slice file, performing space matching, and recording a matching relationship; generating a new tree structure according to the matching relation; copying node page files except for the last node page in the global three-dimensional slice file into the global three-dimensional slice file with the multi-tree structure; acquiring the last node page file in the global three-dimensional slice file, adding node information of a new tree, dividing the node page file into different node page files according to the number of nodes, and writing the different node page files into the global three-dimensional slice file with the multi-tree structure;
the updating module is further used for directly referencing the original index if no updating exists in the tree structure formed by the nodes in the node pages of the global three-dimensional slice file; and generating a new index when the top node is updated in the tree structure formed by the nodes in the node pages of the global three-dimensional slice file, and replacing the original index in the global three-dimensional slice file.
3. An electronic device comprising a memory and a processor, the memory having stored thereon a computer program, the processor implementing the method of claim 1 when executing the computer program.
4. A computer readable storage medium, characterized in that a computer program is stored, which computer program, when being executed by a processor, implements the method according to claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310210501.1A CN116226131B (en) | 2023-03-07 | 2023-03-07 | Multi-temporal three-dimensional slice data storage method and device under multi-tree structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310210501.1A CN116226131B (en) | 2023-03-07 | 2023-03-07 | Multi-temporal three-dimensional slice data storage method and device under multi-tree structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116226131A CN116226131A (en) | 2023-06-06 |
| CN116226131B true CN116226131B (en) | 2024-03-19 |
Family
ID=86578424
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310210501.1A Active CN116226131B (en) | 2023-03-07 | 2023-03-07 | Multi-temporal three-dimensional slice data storage method and device under multi-tree structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116226131B (en) |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106611438A (en) * | 2016-12-27 | 2017-05-03 | 广州都市圈网络科技有限公司 | Method and device for updating and slicing local area of three-dimensional simulation map |
| CN109774152A (en) * | 2018-12-18 | 2019-05-21 | 西安交通大学 | A method of it is compressed and is stored based on threedimensional model serial section image increment type |
| CN111429560A (en) * | 2020-04-14 | 2020-07-17 | 国家基础地理信息中心 | Three-dimensional terrain service fusion method and device and server |
| CN111862292A (en) * | 2020-07-29 | 2020-10-30 | 中国南方电网有限责任公司 | Data rendering method and device for power transmission line corridor and computer equipment |
| KR20210033186A (en) * | 2019-09-18 | 2021-03-26 | 한국전자통신연구원 | Apparatus and method for providing a city model |
| CN113066157A (en) * | 2021-04-07 | 2021-07-02 | 奥格科技股份有限公司 | Data grading request rendering method and system based on CIM platform |
| CN113282697A (en) * | 2021-06-03 | 2021-08-20 | 济南华信计算机技术有限公司 | Dojo-based GIS (geographic information System) for realizing multi-platform heterogeneous compatibility and design and deployment methods thereof |
| CN113516745A (en) * | 2021-04-02 | 2021-10-19 | 深圳市斯维尔科技股份有限公司 | Image data processing method and computer-readable storage medium |
| CN113778961A (en) * | 2021-08-17 | 2021-12-10 | 广东国地规划科技股份有限公司 | Production management method, device and system for CIM model data |
| CN114445561A (en) * | 2022-01-29 | 2022-05-06 | 四川九洲电器集团有限责任公司 | Interactive tooth three-dimensional image display and update method, device and system |
| CN114898043A (en) * | 2022-05-19 | 2022-08-12 | 中国南方电网有限责任公司超高压输电公司检修试验中心 | Laser point cloud data tile construction method |
| CN115471617A (en) * | 2022-10-14 | 2022-12-13 | 浙江省测绘科学技术研究院 | Local updating method for large-scene real-scene three-dimensional slice data |
| CN115641407A (en) * | 2022-10-27 | 2023-01-24 | 武汉幻城经纬科技有限公司 | Three-dimensional pipe network incremental updating modeling method and device, storage medium and electronic equipment |
| CN115718824A (en) * | 2023-01-10 | 2023-02-28 | 北京飞渡科技股份有限公司 | Method for judging position of equipment and automatically pushing equipment information through space distance |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU2014295814B2 (en) * | 2013-07-23 | 2019-07-11 | Ayvri Holdings Pty Ltd | Geo-located activity visualisation, editing and sharing |
| US10802157B2 (en) * | 2017-09-28 | 2020-10-13 | Apple Inc. | Three-dimensional city models and shadow mapping to improve altitude fixes in urban environments |
| CN113519011A (en) * | 2019-03-08 | 2021-10-19 | 松下电器（美国）知识产权公司 | Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device |
-
2023
- 2023-03-07 CN CN202310210501.1A patent/CN116226131B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106611438A (en) * | 2016-12-27 | 2017-05-03 | 广州都市圈网络科技有限公司 | Method and device for updating and slicing local area of three-dimensional simulation map |
| CN109774152A (en) * | 2018-12-18 | 2019-05-21 | 西安交通大学 | A method of it is compressed and is stored based on threedimensional model serial section image increment type |
| KR20210033186A (en) * | 2019-09-18 | 2021-03-26 | 한국전자통신연구원 | Apparatus and method for providing a city model |
| CN111429560A (en) * | 2020-04-14 | 2020-07-17 | 国家基础地理信息中心 | Three-dimensional terrain service fusion method and device and server |
| CN111862292A (en) * | 2020-07-29 | 2020-10-30 | 中国南方电网有限责任公司 | Data rendering method and device for power transmission line corridor and computer equipment |
| CN113516745A (en) * | 2021-04-02 | 2021-10-19 | 深圳市斯维尔科技股份有限公司 | Image data processing method and computer-readable storage medium |
| CN113066157A (en) * | 2021-04-07 | 2021-07-02 | 奥格科技股份有限公司 | Data grading request rendering method and system based on CIM platform |
| CN113282697A (en) * | 2021-06-03 | 2021-08-20 | 济南华信计算机技术有限公司 | Dojo-based GIS (geographic information System) for realizing multi-platform heterogeneous compatibility and design and deployment methods thereof |
| CN113778961A (en) * | 2021-08-17 | 2021-12-10 | 广东国地规划科技股份有限公司 | Production management method, device and system for CIM model data |
| CN114445561A (en) * | 2022-01-29 | 2022-05-06 | 四川九洲电器集团有限责任公司 | Interactive tooth three-dimensional image display and update method, device and system |
| CN114898043A (en) * | 2022-05-19 | 2022-08-12 | 中国南方电网有限责任公司超高压输电公司检修试验中心 | Laser point cloud data tile construction method |
| CN115471617A (en) * | 2022-10-14 | 2022-12-13 | 浙江省测绘科学技术研究院 | Local updating method for large-scene real-scene three-dimensional slice data |
| CN115641407A (en) * | 2022-10-27 | 2023-01-24 | 武汉幻城经纬科技有限公司 | Three-dimensional pipe network incremental updating modeling method and device, storage medium and electronic equipment |
| CN115718824A (en) * | 2023-01-10 | 2023-02-28 | 北京飞渡科技股份有限公司 | Method for judging position of equipment and automatically pushing equipment information through space distance |
Non-Patent Citations (4)
| Title |
|---|
| Optimization of automatied retrieval of semantic 3D city data;Pispidikis等;《URI: https://dspace.lib.ntua.gr/xmlui/handle/123456789/52145》;20201202;1-246 * |
| 三维地理信息数据服务规范研究与实践;邱天;李佩;吕志慧;;地理空间信息;20200928(第09期);6+36-39 * |
| 基于WebGL的智慧城市三维地理信息系统设计与实现;赵军;宫丽玮;周圣川;胡振彪;王海银;;城市勘测;20200831(第04期);49-54 * |
| 特征驱动的城市三维模型多尺度表达方法研究;段元晶;《中国优秀硕士学位论文全文数据库 (基础科学辑)》;20220115(第01期);A008-123 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116226131A (en) | 2023-06-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109254733B (en) | Method, device and system for storing data | |
| US10083092B2 (en) | Block level backup of virtual machines for file name level based file search and restoration | |
| US20200210381A1 (en) | Optimized content object storage service for large scale content | |
| US20150220527A1 (en) | Database table format conversion based on user data access patterns in a networked computing environment | |
| US10572178B2 (en) | Expiration handling for block level backup of virtual machines | |
| US10585760B2 (en) | File name level based file search and restoration from block level backups of virtual machines | |
| WO2013132377A1 (en) | Managing tenant-specific data sets in a multi-tenant environment | |
| US11270471B2 (en) | Efficient refinement of tiles of a HLOD tree | |
| CN110914814B (en) | Cognitive file and object management for distributed storage environments | |
| US20070011275A1 (en) | Multi-environment document management system access | |
| US8849996B2 (en) | Efficiently providing multiple metadata representations of the same type | |
| US20150012553A1 (en) | Dynamic assignment of business logic based on schema mapping metadata | |
| CN110914817A (en) | Cognitive data filtering for storage environments | |
| JP6748653B2 (en) | Efficient performance of insert and point query operations in the column store | |
| US11119977B2 (en) | Cognitive compression with varying structural granularities in NoSQL databases | |
| US20190354576A1 (en) | Atom-based sensible synchronization for information indexing | |
| EP3123699B1 (en) | System and method for supporting data types conversion in a heterogeneous computing environment | |
| CN116226131B (en) | Multi-temporal three-dimensional slice data storage method and device under multi-tree structure | |
| Smart et al. | A scalable object store for meteorological and climate data | |
| US10275470B2 (en) | Network-backed file system | |
| CN115586872A (en) | Container mirror image management method, device, equipment and storage medium | |
| US11416468B2 (en) | Active-active system index management | |
| CN112965939A (en) | File merging method, device and equipment | |
| US20200142625A1 (en) | Data Management System for Storage Tiers | |
| US11514016B2 (en) | Paging row-based data stored as objects |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |