CN114489481A - Method and system for storing and accessing data in hard disk - Google Patents
Method and system for storing and accessing data in hard disk Download PDFInfo
- Publication number
- CN114489481A CN114489481A CN202111592151.7A CN202111592151A CN114489481A CN 114489481 A CN114489481 A CN 114489481A CN 202111592151 A CN202111592151 A CN 202111592151A CN 114489481 A CN114489481 A CN 114489481A
- Authority
- CN
- China
- Prior art keywords
- file
- data
- hard disk
- path
- storing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
- G06F3/0635—Configuration or reconfiguration of storage systems by changing the path, e.g. traffic rerouting, path reconfiguration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0643—Management of files
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
Abstract
The invention discloses a method and a system for storing and accessing data in a hard disk, which store the data to be stored in a hard disk file, maintain a file path, the current state of the path and the data volume stored in the file through a data storage maintenance center, upgrade the current file path to a directory when the data volume stored in the file reaches a threshold value, split a plurality of files under the current directory, store the data of an original file into the split files, and maintain the split file path, the current state of the path and the data volume stored in the split files through the data storage maintenance center, thereby providing a data storage basis for the efficient addressing access of the hard disk.
Description
Technical Field
The invention relates to the technical field of computer retrieval and storage, in particular to a method and a system for storing and accessing data in a hard disk.
Background
With the rapid development of computer and internet technologies, human beings have entered the big data era. The data is accessed at high speed, and the quick response user request is normal. For data with high frequency access, a memory cache mode is generally adopted to achieve the effect of fast reading. The hardware price of the memory is expensive and the capacity is small.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method and a system for storing and accessing data in a hard disk, aiming at least one defect existing in the prior art.
The technical scheme adopted by the invention for solving the technical problems is as follows: a method for constructing and accessing hard disk storage data comprises the following steps:
s1: storing data to be stored into a hard disk file;
s2: maintaining a file path, the current state of the path and the data volume of file storage through a data storage maintenance center;
s3: when the data volume stored in the file reaches a threshold value, upgrading the current file path to a directory, and fission a plurality of files under the current directory;
s4: the data of the original file is stored into the plurality of files of fission, and step S2 is performed.
Preferably, in the method for storing and accessing data in a hard disk according to the present invention, step S1 includes:
and based on a hash self-defined grouping algorithm, uniformly distributing the data to be stored into a plurality of files of the hard disk.
Preferably, in the method for storing and accessing data in a hard disk according to the present invention, step S2 includes:
the file path enters a data storage maintenance center, and the data format is as follows: { file path: file, amount of data stored for file }.
Preferably, in the method for storing and accessing data in a hard disk according to the present invention, step S4 includes:
based on a hash self-defined grouping algorithm corresponding to a directory hierarchy, data of an original file are uniformly distributed into a plurality of fissile files, a path of each fissile file enters a data storage maintenance center, and the data format is as follows: { fissured File Path File, amount of data stored for File }.
Preferably, in the method for storing and accessing data in a hard disk according to the present invention, the method further includes:
s0: self-defining a data storage maintenance center, wherein the data format is as follows: { file path: file or directory, amount of data stored for file }.
Preferably, in the method for storing and accessing data in a hard disk according to the present invention, the method further includes:
s5: when addressing is carried out according to the access input value, whether the current path is a file or not is obtained in the data storage maintenance center;
s6: if not, the next round of addressing is carried out under the directory hierarchy;
s7: and if so, loading the file content, and circularly screening the data corresponding to the access input value.
Preferably, in the method for storing and accessing data in a hard disk according to the present invention, the addressing is a hash custom grouping algorithm addressing.
The invention also constructs a system for storing and accessing data in the hard disk, which comprises:
the storage module is used for storing data to be stored into a hard disk file; and storing data of the original file into the plurality of fissile files;
the data storage maintenance center is used for maintaining the file path, the current state of the path and the data volume of the file storage;
and the fission module is used for upgrading the current file path to a directory when the data volume stored in the file reaches a threshold value, and fissioning a plurality of files under the current directory.
Preferably, in the system for storing and accessing data in a hard disk according to the present invention,
the storage module is further used for uniformly distributing data to be stored into a plurality of files of the hard disk based on a hash self-defined grouping algorithm; and the method is used for uniformly distributing the data of the original file into the plurality of fissile files based on a hash self-defined grouping algorithm corresponding to the directory hierarchy.
Preferably, in the system for storing and accessing data in a hard disk according to the present invention, the system further includes:
the addressing module is used for addressing according to the access input value; and, for a next round of addressing under the directory hierarchy;
the judging module is used for acquiring whether the current path is a file in the data storage maintenance center, and if not, the addressing module is executed; if yes, executing a screening module;
and the screening module is used for loading the file content and circularly screening the data corresponding to the access input value.
By implementing the invention, the following beneficial effects are achieved:
the method comprises the steps of storing data to be stored into a hard disk file, maintaining a file path, the current state of the path and the data volume of the file storage through a data storage maintenance center, upgrading the current file path to a directory when the data volume of the file storage reaches a threshold value, splitting a plurality of files under the current directory, storing data of an original file into the plurality of split files, and maintaining the split file path, the current state of the path and the data volume of the split files through the data storage maintenance center, thereby providing a data storage basis for efficient addressing access of the hard disk.
Meanwhile, when addressing is carried out according to the access input value, whether the current path is a file or not is obtained in the data storage maintenance center, and if not, next round of addressing is carried out under the directory hierarchy; and if so, loading the file content, and circularly screening and accessing data corresponding to the input value, thereby completing the efficient addressing access.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is a first flowchart illustrating a method for storing and accessing data in a hard disk according to the present invention;
FIG. 2 is a flowchart illustrating a second method for storing and accessing data in a hard disk according to the present invention;
FIG. 3 is a first block diagram of a system for storing and accessing data in a hard disk according to the present invention;
FIG. 4 is a second schematic diagram of the system module for storing and accessing data in the hard disk according to the present invention.
Detailed Description
For a more clear understanding of the technical features, objects and effects of the present invention, embodiments of the present invention will now be described in detail with reference to the accompanying drawings.
It should be noted that the flow charts shown in the drawings are only exemplary and do not necessarily include all the contents and operations/steps, nor do they necessarily have to be executed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.
As shown in FIG. 1, the present invention discloses a method for storing and accessing data in a hard disk, comprising the following steps:
step S1: storing data to be stored into a hard disk file;
step S2: maintaining a file path, the current state of the path (a file or directory) and the data volume of file storage through a data storage maintenance center;
step S3: when the data volume stored in the file reaches a threshold value, upgrading the current file path to a directory, and fission a plurality of files under the current directory;
step S4: the data of the original file is stored into the plurality of files of fission, and step S2 is performed.
Specifically, in some embodiments, the method for storing and accessing data by the hard disk comprises the following steps:
step S1: based on a hash self-defined grouping algorithm, uniformly dividing data to be stored into a plurality of files of a hard disk;
step S2: the file path enters a data storage maintenance center, and the data format is as follows: { file path: file, amount of data stored for file }. Wherein, the file stores a line of information as a datum;
step S3: when the data volume stored in the file reaches a threshold value, upgrading the current file path to a directory, and fission a plurality of files under the current directory;
step S4: based on a hash self-defined grouping algorithm corresponding to a directory hierarchy, data of an original file are uniformly distributed into a plurality of fissile files, a path of each fissile file enters a data storage maintenance center, and the data format is as follows: { fissured File Path File, amount of data stored for File }.
Wherein, the data storage maintenance center records the number of data, namely { the path of the file after fission: the file, the data amount of the file storage }. There are several layers of directory structures, corresponding to several hash grouping algorithms. And once the data volume stored in the file reaches a threshold value, performing file fission of the next directory according to a default defined grouping strategy.
In this embodiment, as shown in fig. 2, the method further includes:
step S0: self-defining a data storage maintenance center, wherein the data format is as follows: { file path: file or directory, amount of data stored by file }, which is convenient for fast data storage and addressing.
In this embodiment, as shown in fig. 2, the method further includes:
step S5: and when addressing is carried out according to the access input value, whether the current path is a file or not is acquired in the data storage maintenance center. In some embodiments, addressing may be by a hash custom grouping algorithm based on the access input value;
step S6: if not, the next round of addressing is performed under the directory hierarchy. In some embodiments, the next round of addressing can be performed according to a hash self-defined grouping algorithm corresponding to the directory hierarchy;
step S7: and if so, loading the file content, and circularly screening and accessing the data corresponding to the input value.
Specifically, during fast addressing, one round of hash self-defined grouping algorithm addressing is performed according to access input values, then the current path is obtained from a data storage maintenance center as a file or a directory, and if the current path is the directory, the next round of hash self-defined grouping algorithm addressing is continued until the file is found. If the input value is a file, the content of the file is integrally loaded, and finally, the data corresponding to the input value is circularly screened.
In its entirety, for example: massive user information is stored, and all information of a user needs to be searched by using the name of the user. The method comprises the following steps:
step S0: self-defining a data storage maintenance center, wherein the data format is as follows: { file path: file or directory, amount of data stored by file };
step S1: adding 1000 txt texts under a date file, and equally dividing the user name into 1000 txt texts based on a hash-1000 _1 algorithm;
step S2: when each txt text is stored, the data storage maintenance center maintains data, each txt text path enters the data storage maintenance center, and the data format is as follows: { file path: file, amount of data stored for file }. For example { data/1: File, 1 };
step S3: assuming that the threshold of the data size stored in each txt text is 5000, when the data size stored in the txt text reaches 5000, namely { data/1: file, 5000}, upgrading the current file path to a directory is triggered, and splitting 1000 txt texts under the current directory, wherein data/1 becomes: { data/1: directory };
step S4: meanwhile, 5000 data are evenly distributed into 1000 txt texts which are newly added by using a hash-1000 _2 algorithm corresponding to the directory hierarchy, and the newly added text path is changed into the following paths in the data center: { data/1/1: File, 1 };
step S5: when information is searched according to a user name, acquiring a path under which the user name falls according to a hash _1000_1 algorithm, and then sending the user name to a data storage maintenance center to acquire whether the current path is a file;
step S6: if the current path is a file, selecting a corresponding hash-1000 _2 algorithm according to a default directory hierarchy, and then addressing the path until the current path is a file;
step S7: when the acquired user name is stored in a specific file, the file contents are all read in batch, and then comparison is carried out for 5000 times to accurately position the user.
As shown in fig. 3, the present invention also discloses a system for storing and accessing data in a hard disk, comprising:
the storage module is used for storing data to be stored into a hard disk file; and storing data of the original file into the plurality of fissile files;
and the data storage maintenance center is used for maintaining the file path, the current state of the path (the file or directory) and the data volume of the file storage. Specifically, a file path enters a data storage maintenance center, and the data format is as follows: { file path: file, amount of data stored for file }. Wherein, the file stores a line of information as a datum;
and the fission module is used for upgrading the current file path to a directory when the data volume stored in the file reaches a threshold value, and fissioning a plurality of files under the current directory.
Specifically, in some embodiments, the storage module is further configured to, based on a hash self-defined grouping algorithm, evenly divide data to be stored into a plurality of files of the hard disk; and the method is used for uniformly distributing the data of the original file into the plurality of fissile files based on a hash self-defined grouping algorithm corresponding to the directory hierarchy.
Wherein, the data storage maintenance center records the number of data, namely { the path of the file after fission: the file, the data amount of the file storage }. There are several layers of directory structures, corresponding to several hash grouping algorithms. And once the data volume stored in the file reaches a threshold value, performing file fission of the next directory according to a default defined grouping strategy.
In this embodiment, the data format of a data storage maintenance center defined by the system is as follows: { file path: file or directory, amount of data stored by file }, which is convenient for fast data storage and addressing.
In this embodiment, as shown in fig. 4, the system further includes:
the addressing module is used for addressing according to the access input value, and in some embodiments, addressing can be carried out according to the access input value by a hash self-defined grouping algorithm; and the lower round addressing is performed under the directory hierarchy, and in some embodiments, the lower round addressing can be performed according to a hash self-defined grouping algorithm corresponding to the directory hierarchy;
the judging module is used for acquiring whether the current path is a file in the data storage maintenance center, and if not, the addressing module is executed and is used for carrying out next round of addressing under the directory hierarchy; if yes, executing a screening module;
and the screening module is used for loading the file content and circularly screening and accessing the data corresponding to the input value.
Specifically, during fast addressing, one round of hash self-defined grouping algorithm addressing is performed according to access input values, then the current path is obtained from a data storage maintenance center as a file or a directory, and if the current path is the directory, the next round of hash self-defined grouping algorithm addressing is continued until the file is found. If the input value is a file, the content of the file is integrally loaded, and finally, the data corresponding to the input value is circularly screened.
By implementing the invention, the following beneficial effects are achieved:
the method comprises the steps of storing data to be stored into a hard disk file, maintaining a file path, the current state of the path and the data volume stored in the file through a data storage maintenance center, upgrading the current file path into a directory when the data volume stored in the file reaches a threshold value, splitting a plurality of files under the current directory, storing the data of an original file into the plurality of split files, and maintaining the split file path, the current state of the path and the data volume stored in the split files through the data storage maintenance center, thereby providing a data storage basis for efficient addressing access of the hard disk.
Meanwhile, when addressing is carried out according to the access input value, whether the current path is a file or not is obtained in the data storage maintenance center, and if not, next round of addressing is carried out under the directory hierarchy; and if so, loading the file content, and circularly screening and accessing data corresponding to the input value, thereby completing the efficient addressing access.
It is to be understood that the foregoing examples, while indicating the preferred embodiments of the invention, are given by way of illustration and description, and are not to be construed as limiting the scope of the invention; it should be noted that, for a person skilled in the art, the above technical features can be freely combined, and several changes and modifications can be made without departing from the concept of the present invention, which all belong to the protection scope of the present invention; therefore, all equivalent changes and modifications made within the scope of the claims of the present invention should be covered by the claims of the present invention.
Claims (10)
1. A method for storing and accessing data in a hard disk is characterized by comprising the following steps:
s1: storing data to be stored into a hard disk file;
s2: maintaining a file path, the current state of the path and the data volume of file storage through a data storage maintenance center;
s3: when the data volume stored in the file reaches a threshold value, upgrading the current file path to a directory, and fission a plurality of files under the current directory;
s4: the data of the original file is stored into the plurality of files of fission, and step S2 is performed.
2. The method for storing and accessing data on a hard disk according to claim 1, wherein step S1 comprises:
and based on a hash self-defined grouping algorithm, uniformly distributing the data to be stored into a plurality of files of the hard disk.
3. The method for storing and accessing data of a hard disk according to claim 2, wherein step S2 comprises:
the file path enters a data storage maintenance center, and the data format is as follows: { file path: file, amount of data stored for file }.
4. The method for storing and accessing data of a hard disk according to claim 3, wherein step S4 comprises:
based on a hash self-defined grouping algorithm corresponding to a directory hierarchy, data of an original file are uniformly distributed into a plurality of fissile files, a path of each fissile file enters a data storage maintenance center, and the data format is as follows: { fissured File Path File, amount of data stored for File }.
5. The method for storing and accessing data of a hard disk according to claim 1, further comprising:
s0: self-defining a data storage maintenance center, wherein the data format is as follows: { file path: file or directory, amount of data stored for file }.
6. The hard disk data storage and access method of claim 1, further comprising:
s5: when addressing is carried out according to the access input value, whether the current path is a file or not is obtained in the data storage maintenance center;
s6: if not, the next round of addressing is carried out under the directory hierarchy;
s7: and if so, loading the file content, and circularly screening the data corresponding to the access input value.
7. The hard disk data storage and access method according to claim 6, wherein the addressing is a hash custom grouping algorithm addressing.
8. A system for storing and accessing data on a hard disk, comprising:
the storage module is used for storing data to be stored into a hard disk file; and storing data of the original file into the plurality of fissile files;
the data storage maintenance center is used for maintaining the file path, the current state of the path and the data volume of the file storage;
and the fission module is used for upgrading the current file path to a directory when the data volume stored in the file reaches a threshold value, and fissioning a plurality of files under the current directory.
9. The hard disk data storage and access system of claim 8,
the storage module is further used for uniformly distributing data to be stored into a plurality of files of the hard disk based on a hash self-defined grouping algorithm; and the method is used for uniformly distributing the data of the original file into the plurality of fissile files based on a hash self-defined grouping algorithm corresponding to the directory hierarchy.
10. The system for storing and accessing data on a hard disk according to claim 8, further comprising:
the addressing module is used for addressing according to the access input value; and, for a next round of addressing under the directory hierarchy;
the judging module is used for acquiring whether the current path is a file in the data storage maintenance center, and if not, the addressing module is executed; if yes, executing a screening module;
and the screening module is used for loading the file content and circularly screening the data corresponding to the access input value.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111592151.7A CN114489481A (en) | 2021-12-23 | 2021-12-23 | Method and system for storing and accessing data in hard disk |
| PCT/CN2022/141044 WO2023116828A1 (en) | 2021-12-23 | 2022-12-22 | Method and system for hard disk data storing and access |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111592151.7A CN114489481A (en) | 2021-12-23 | 2021-12-23 | Method and system for storing and accessing data in hard disk |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114489481A true CN114489481A (en) | 2022-05-13 |
Family
ID=81494622
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111592151.7A Pending CN114489481A (en) | 2021-12-23 | 2021-12-23 | Method and system for storing and accessing data in hard disk |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN114489481A (en) |
| WO (1) | WO2023116828A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023116828A1 (en) * | 2021-12-23 | 2023-06-29 | 深圳市世强元件网络有限公司 | Method and system for hard disk data storing and access |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103136338B (en) * | 2013-02-04 | 2016-02-10 | 中国科学院信息工程研究所 | A kind of metadata distribution method based on catalogue division and device |
| CN106843745A (en) * | 2015-12-03 | 2017-06-13 | 南京中兴新软件有限责任公司 | Capacity expansion method and device |
| CN107609140A (en) * | 2017-09-20 | 2018-01-19 | 郑州云海信息技术有限公司 | A kind of method and device of distributive catalogue of document system file access |
| US10705959B2 (en) * | 2018-08-31 | 2020-07-07 | Advanced Micro Devices, Inc. | Region based split-directory scheme to adapt to large cache sizes |
| CN114489481A (en) * | 2021-12-23 | 2022-05-13 | 深圳市世强元件网络有限公司 | Method and system for storing and accessing data in hard disk |
-
2021
- 2021-12-23 CN CN202111592151.7A patent/CN114489481A/en active Pending
-
2022
- 2022-12-22 WO PCT/CN2022/141044 patent/WO2023116828A1/en unknown
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023116828A1 (en) * | 2021-12-23 | 2023-06-29 | 深圳市世强元件网络有限公司 | Method and system for hard disk data storing and access |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2023116828A1 (en) | 2023-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109634932B (en) | Intelligent contract storage method and storage system | |
| US10114908B2 (en) | Hybrid table implementation by using buffer pool as permanent in-memory storage for memory-resident data | |
| US6675180B2 (en) | Data updating apparatus that performs quick restoration processing | |
| JP2005267600A5 (en) | ||
| CN108021717B (en) | Method for implementing lightweight embedded file system | |
| US20200349038A1 (en) | Storage management method, electronic device, and computer program product | |
| CN111324303B (en) | SSD garbage recycling method, SSD garbage recycling device, computer equipment and storage medium | |
| CN110888837B (en) | Object storage small file merging method and device | |
| CN116821437B (en) | Data processing method, device, electronic equipment and storage medium | |
| CN110399333A (en) | Delete method, equipment and the computer program product of snapshot | |
| CN112416880A (en) | Method and device for optimizing storage performance of mass small files based on real-time merging | |
| CN112148217A (en) | Caching method, device and medium for deduplication metadata of full flash storage system | |
| CN115114232A (en) | Method, device and medium for enumerating historical version objects | |
| CN114489481A (en) | Method and system for storing and accessing data in hard disk | |
| CN112000971B (en) | File permission recording method, system and related device | |
| CN115878625A (en) | Data processing method and device and electronic equipment | |
| CN115840731A (en) | File processing method, computing device and computer storage medium | |
| CN113132241B (en) | ACL template dynamic configuration method and device | |
| US11372832B1 (en) | Efficient hashing of data objects | |
| US20210026825A1 (en) | Read iterator for pre-fetching nodes of a b-tree into memory | |
| CN114443629A (en) | Cluster bloom filter data duplication removing method, terminal equipment and storage medium | |
| KR102354343B1 (en) | Spatial indexing method and apparatus for blockchain-based geospatial data | |
| CN110837345A (en) | Bad block table storage method and device | |
| CN113411395B (en) | Access request routing method, device, computer equipment and storage medium | |
| CN115374127B (en) | Data storage method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |