CN114489481A - Method and system for storing and accessing data in hard disk - Google Patents

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

Method and system for storing and accessing hard disk data

technical field

The present invention relates to the technical field of computer retrieval and storage, and in particular, to a method and system for storing and accessing hard disk data.

Background technique

With the rapid development of computer and Internet technologies, human beings have entered the era of big data. High-speed access to data and quick response to user requests have become the norm. For frequently accessed data, the memory cache mode is generally used to achieve the effect of fast reading. The memory hardware is expensive and has a small capacity.

SUMMARY OF THE INVENTION

The technical problem to be solved by the present invention is to provide a method and system for storing and accessing data on a hard disk, aiming at at least one defect existing in the prior art.

The technical scheme adopted by the present invention to solve the technical problem is: constructing a method for storing and accessing data on a hard disk, comprising the following steps:

S1: Store the data to be stored in the hard disk file;

S2: Maintain the file path, the current state of the path and the amount of data stored in the file through the data storage and maintenance center;

S3: When the amount of data stored in the file has reached the threshold, upgrade the current file path to a directory, and fission multiple files in the current directory;

S4: Store the data of the original file into the multiple fissioned files, and perform step S2.

Preferably, in the method for storing and accessing hard disk data according to the present invention, step S1 includes:

Based on the hash custom grouping algorithm, the data to be stored is evenly divided into multiple files on the hard disk.

Preferably, in the method for storing and accessing data on a hard disk according to the present invention, step S2 includes:

The file path enters the data storage and maintenance center, and the data format is: {file path: file, the amount of data stored in the file}.

Preferably, in the method for storing and accessing hard disk data according to the present invention, step S4 includes:

Based on the hash custom grouping algorithm corresponding to the directory level, the data of the original file is evenly divided into multiple fissioned files, and the file path after fission enters the data storage and maintenance center. The data format is: {file path after fission :file, the amount of data stored in the file}.

Preferably, in the method for storing and accessing data on a hard disk according to the present invention, the method further includes:

S0: Customize a data storage and maintenance center, the data format is: {file path: file or directory, data amount stored in the file}.

Preferably, in the method for storing and accessing data on a hard disk according to the present invention, the method further includes:

S5: when addressing according to the access input value, obtain in the data storage and maintenance center whether the current path is a file;

S6: If not, perform the next round of addressing under the directory level;

S7: If yes, load the content of the file, and cyclically filter the data corresponding to the access input value.

Preferably, in the method for storing and accessing data on a hard disk according to the present invention, the addressing is hash self-defined grouping algorithm addressing.

The present invention also constructs a system for storing and accessing hard disk data, including:

The storage module is used to store the data to be stored in the hard disk file; and, store the data of the original file into the multiple files of fission;

The data storage and maintenance center is used to maintain the file path, the current state of the path and the amount of data stored in the file;

The fission module is used to upgrade the current file path to a directory and fission multiple files in the current directory when the amount of data stored in the file has reached the threshold.

Preferably, in the system for storing data and accessing the hard disk according to the present invention,

The storage module is further used to divide the data that needs to be stored into multiple files of the hard disk based on the hash self-defined grouping algorithm; Evenly split into multiple files of fission.

Preferably, in the system for storing and accessing hard disk data according to the present invention, the system further includes:

an addressing module for addressing according to the access input value; and, for performing the next round of addressing under the directory hierarchy;

a judging module, used to obtain in the data storage and maintenance center whether the current path is a file, if not, execute the addressing module; if so, execute the screening module;

The filtering module is used to load the content of the file, and cyclically filter the data corresponding to the access input value.

By implementing the present invention, it has the following beneficial effects:

By storing the data to be stored in the hard disk file, the present invention maintains the file path, the current state of the path and the amount of data stored in the file through the data storage and maintenance center. When the amount of data stored in the file has reached the threshold, the current file The path is upgraded to a directory, and multiple files are fissioned in the current directory, the data of the original file is stored in the multiple fissioned files, and the fissioned file path, the current state of the path and the fissioned file path, the current state of the path and the fissioned file are stored in the data storage and maintenance center. The amount of data stored in the file is maintained, thereby providing a data storage basis for the efficient addressing and access of the hard disk.

At the same time, when addressing according to the access input value, obtain in the data storage and maintenance center whether the current path is a file, if not, perform the next round of addressing under the directory level; if so, load the file content and cyclically filter Access the data corresponding to the input value, thereby completing efficient addressing access.

Description of drawings

The present invention will be further described below in conjunction with the accompanying drawings and embodiments, in which:

Fig. 1 is the method flow schematic diagram one of hard disk storage data of the present invention and accessing;

Fig. 2 is the method flow schematic diagram two of hard disk storage data and access of the present invention;

Fig. 3 is the system module schematic diagram one of hard disk storage data and access of the present invention;

FIG. 4 is a second schematic diagram of a system module for storing data and accessing the hard disk of the present invention.

Detailed ways

In order to have a clearer understanding of the technical features, objects and effects of the present invention, the specific embodiments of the present invention will now be described in detail with reference to the accompanying drawings.

It should be noted that, the flowcharts shown in the accompanying drawings are only exemplary descriptions, and do not necessarily include all contents and operations/steps, and do not necessarily have to be executed in the described order. For example, some operations/steps can be decomposed, and some operations/steps can be combined or partially combined, so the actual execution order may be changed according to the actual situation.

The block diagrams shown in the figures are merely functional entities and do not necessarily necessarily correspond to physically separate entities. That is, these functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices entity.

As shown in Figure 1, the present invention discloses a method for storing and accessing data on a hard disk, comprising the following steps:

Step S1: store the data to be stored in a hard disk file;

Step S2: maintaining the file path, the current state of the path (file or directory) and the amount of data stored in the file through the data storage and maintenance center;

Step S3: when the amount of data stored in the file has reached the threshold, upgrade the current file path to a directory, and fission multiple files in the current directory;

Step S4: Store the data of the original file into the multiple fissioned files, and execute Step S2.

Specifically, in some embodiments, the method for storing and accessing data on the hard disk includes the following steps:

Step S1: based on the hash self-defined grouping algorithm, evenly divide the data to be stored into multiple files on the hard disk;

Step S2: The file path enters the data storage and maintenance center, and the data format is: {file path: file, data amount stored in the file}. Among them, the file stores one line of information as one data;

Step S3: when the amount of data stored in the file has reached the threshold, upgrade the current file path to a directory, and fission multiple files in the current directory;

Step S4: Based on the hash custom grouping algorithm corresponding to the directory level, the data of the original file is divided into multiple fission files, and the file path after fission enters the data storage and maintenance center, and the data format is: {file after fission path: file, the amount of data stored in the file}.

Among them, as many directories and files exist, the data storage and maintenance center records as many pieces of data, that is, {file path after fission: file, amount of data stored in the file}. There are several levels of directory structure, corresponding to several hash grouping algorithms. Once the amount of data stored in the file reaches the threshold, the file fission of the next directory is performed according to the grouping strategy defined by default.

In this embodiment, as shown in Figure 2, the method further includes:

Step S0: Customize a data storage and maintenance center, and the data format is: {file path: file or directory, data amount stored in the file}, which is convenient for quickly storing data and addressing.

In this embodiment, as shown in Figure 2, the method further includes:

Step S5: when addressing is performed according to the access input value, obtain whether the current path is a file in the data storage and maintenance center. In some embodiments, addressing can be performed by a hash custom grouping algorithm according to the access input value;

Step S6: If not, perform the next round of addressing under the directory level. In some embodiments, the next round of addressing can be performed according to the hash custom grouping algorithm corresponding to the directory level;

Step S7: If yes, load the content of the file, and cyclically filter and access the data corresponding to the input value.

Specifically, during fast addressing, according to the access input value, perform rounds of hash custom grouping algorithm addressing, and then go to the data storage and maintenance center to obtain whether the current path is a file or a directory. If it is a directory, continue to the next The hash of the round is addressed by a custom grouping algorithm until the file is found. If it is a file, load the content of the file as a whole, and finally filter the data corresponding to the input value in a loop.

Completely, for example: to store massive user information, it is necessary to use the user name to find all the information of the user. This method includes:

Step S0: Customize a data storage and maintenance center, the data format is: {file path: file or directory, data amount stored in the file};

Step S1: Add 1000 txt texts under the date file, and divide the user names into 1000 txt texts based on the hash_1000_1 algorithm;

Step S2: When each txt text is stored, the data storage and maintenance center will maintain the data, and each txt text path enters the data storage and maintenance center, and the data format is: {file path: file, data amount stored in the file}. For example {data/1:file,1};

Step S3: Assuming that the threshold value of the data volume stored in each txt text is 5000, when the volume of data stored in the txt text reaches 5000, that is, {data/1: file, 5000}, it will trigger to upgrade the current file path to a directory, and Fission 1000 txt texts in the current directory, data/1 will become: {data/1:directory} in the data storage and maintenance center;

Step S4: At the same time, the hash_1000_2 algorithm corresponding to the directory level will be used to divide the 5000 data into the newly added 1000 txt texts. The new text path in the data center will become: {data/1/1 :File 1};

Step S5: when searching for information according to the user name, according to the hash_1000_1 algorithm, obtain the path to which the user name will fall, and then go to the data storage and maintenance center to obtain whether the current path is a file;

Step S6: If it is a directory, select the corresponding hash_1000_2 algorithm according to the default directory level, and then go to the addressing path until the current path is a file;

Step S7: When the user name is obtained and stored in a specific file, all the contents of the modified file are read in batches, and then only 5000 comparisons are performed to precisely locate the user.

As shown in Figure 3, the present invention also discloses a system for storing and accessing hard disk data, including:

The storage module is used to store the data to be stored in the hard disk file; and, store the data of the original file into the multiple files of fission;

The data storage maintenance center is used to maintain the file path, the current state of the path (file or directory), and the amount of data stored in the file. Specifically, the file path enters the data storage and maintenance center, and the data format is: {file path: file, data amount stored in the file}. Among them, the file stores one line of information as one data;

The fission module is used to upgrade the current file path to a directory and fission multiple files in the current directory when the amount of data stored in the file has reached the threshold.

Specifically, in some embodiments, the storage module is further configured to divide the data that needs to be stored into multiple files on the hard disk based on a hash custom grouping algorithm; and, based on the hash custom corresponding to the directory level The grouping algorithm divides the data of the original file into multiple fission files.

Among them, as many directories and files exist, the data storage and maintenance center records as many pieces of data, that is, {file path after fission: file, amount of data stored in the file}. There are several levels of directory structure, corresponding to several hash grouping algorithms. Once the amount of data stored in the file reaches the threshold, the file fission of the next directory is performed according to the grouping strategy defined by default.

In this embodiment, a data storage and maintenance center is customized by the system, and the data format is: {file path: file or directory, data amount stored in the file}, which is convenient for quickly storing data and addressing.

In this embodiment, as shown in Figure 4, the system further includes:

an addressing module, configured to perform addressing according to the access input value, in some embodiments, can perform addressing according to the access input value according to a hash user-defined grouping algorithm; and, for performing the next round of addressing under the directory hierarchy, In some embodiments, the next round of addressing can be performed according to the hash custom grouping algorithm corresponding to the directory level;

The judgment module is used to obtain whether the current path is a file in the data storage and maintenance center. If not, the addressing module is executed to perform the next round of addressing under the directory level; if so, the screening module is executed;

The filter module is used to load the content of the file and loop through the data corresponding to the input value.

Specifically, during fast addressing, according to the access input value, perform rounds of hash custom grouping algorithm addressing, and then go to the data storage and maintenance center to obtain whether the current path is a file or a directory. If it is a directory, continue to the next The hash of the round is addressed by a custom grouping algorithm until the file is found. If it is a file, load the content of the file as a whole, and finally filter the data corresponding to the input value in a loop.

By implementing the present invention, it has the following beneficial effects:

By storing the data to be stored in the hard disk file, the present invention maintains the file path, the current state of the path and the amount of data stored in the file through the data storage and maintenance center. When the amount of data stored in the file has reached the threshold, the current file The path is upgraded to a directory, and multiple files are fissioned in the current directory, the data of the original file is stored in the fissioned multiple files, and the fissioned file path, the current state of the path and the fissioned file path, the current state of the path and the fissioned file are stored in the data storage and maintenance center. The amount of data stored in the file is maintained, thereby providing a data storage basis for the efficient addressing and access of the hard disk.

At the same time, when addressing according to the access input value, obtain in the data storage and maintenance center whether the current path is a file, if not, perform the next round of addressing under the directory level; if so, load the file content and cyclically filter Access the data corresponding to the input value, thereby completing efficient addressing access.

It can be understood that the above examples only represent the preferred embodiments of the present invention, and the descriptions thereof are more specific and detailed, but should not be construed as a limitation on the scope of the patent of the present invention; it should be noted that for those of ordinary skill in the art In other words, without departing from the concept of the present invention, the above-mentioned technical features can be freely combined, and some deformations and improvements can also be made, and these all belong to the protection scope of the present invention; All equivalent transformations and modifications made shall fall within the scope of the claims of the present invention.

Claims (10)

1. a method for hard disk storage data and access, is characterized in that, comprises the following steps: S1: Store the data to be stored in the hard disk file; S2: Maintain the file path, the current state of the path and the amount of data stored in the file through the data storage and maintenance center; S3: When the amount of data stored in the file has reached the threshold, upgrade the current file path to a directory, and fission multiple files in the current directory; S4: Store the data of the original file into the multiple fissioned files, and perform step S2. 2. the method for hard disk storage data and access according to claim 1, is characterized in that, step S1 comprises: Based on the hash custom grouping algorithm, the data to be stored is evenly divided into multiple files on the hard disk. 3. the method for hard disk storage data and access according to claim 2, is characterized in that, step S2 comprises: The file path enters the data storage and maintenance center, and the data format is: {file path: file, the amount of data stored in the file}. 4. the method for hard disk storage data and access according to claim 3, is characterized in that, step S4 comprises: Based on the hash custom grouping algorithm corresponding to the directory level, the data of the original file is divided into multiple fission files, and the file path after fission enters the data storage and maintenance center. The data format is: {file path after fission :file, the amount of data stored in the file}. 5. The method for storing and accessing hard disk data according to claim 1, wherein the method further comprises: S0: Customize a data storage and maintenance center, the data format is: {file path: file or directory, data amount stored in the file}. 6. The method for storing and accessing hard disk data according to claim 1, wherein the method further comprises: S5: when addressing according to the access input value, obtain in the data storage and maintenance center whether the current path is a file; S6: If not, perform the next round of addressing under the directory level; S7: If yes, load the content of the file, and cyclically filter the data corresponding to the access input value. 7 . The method for storing and accessing hard disk data according to claim 6 , wherein the addressing is hash self-defined grouping algorithm addressing. 8 . 8. A system for storing data and accessing a hard disk, comprising: The storage module is used to store the data to be stored in the hard disk file; and, store the data of the original file into the multiple files of fission; The data storage and maintenance center is used to maintain the file path, the current state of the path and the amount of data stored in the file; The fission module is used to upgrade the current file path to a directory when the amount of data stored in the file has reached the threshold, and fission multiple files in the current directory. 9. The system for hard disk storage data and access according to claim 8, characterized in that, The storage module is further used to divide the data that needs to be stored into multiple files of the hard disk based on the hash self-defined grouping algorithm; Evenly split into multiple files of fission. 10. The system for storing and accessing hard disk data according to claim 8, wherein the system further comprises: an addressing module for addressing according to the access input value; and, for performing the next round of addressing under the directory hierarchy; a judging module, used to obtain in the data storage and maintenance center whether the current path is a file, if not, execute the addressing module; if so, execute the screening module; The filtering module is used to load the content of the file, and cyclically filter the data corresponding to the access input value.

Images