CN114691625A - Data management method for massive dynamic files - Google Patents
Data management method for massive dynamic files Download PDFInfo
- Publication number
- CN114691625A CN114691625A CN202210424022.5A CN202210424022A CN114691625A CN 114691625 A CN114691625 A CN 114691625A CN 202210424022 A CN202210424022 A CN 202210424022A CN 114691625 A CN114691625 A CN 114691625A
- Authority
- CN
- China
- Prior art keywords
- directory
- file
- sequence number
- deleted
- control variable
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
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/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/172—Caching, prefetching or hoarding of files
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/14—Details of searching files based on file metadata
- G06F16/148—File search processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
- G06F16/162—Delete operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
-
- 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
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
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)
- Human Computer Interaction (AREA)
- Library & Information Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A data management method for massive dynamic files comprises the following steps: s1, setting a directory architecture for file storage, wherein the directory architecture comprises a plurality of layers of directories which start from a root directory; s2, trying to store the new file to the deleted file position; s3, trying to store a new file in the current directory; s4, adding a directory, and storing the new file into the newly added directory; and S5, determining whether the new peer subdirectory or the new hierarchy is added. The invention sets each parameter, automatically searches the vacant position and the vacant directory which can be stored, strictly limits the generation of the new directory, avoids the phenomena of uneven directory storage files and numerous and disordered directory hierarchies caused by randomly establishing the new directory in the past, and accelerates the data searching efficiency by adopting the mode of combining the global deletion marker file and the local deletion marker file.
Description
Technical Field
The invention relates to the technical field of software, in particular to a data management method for massive dynamic files.
Background
In a geological disaster monitoring and early warning system, geological disaster monitoring points have various accessory files, such as monitoring point deformation pictures, equipment pictures, staff patrol pictures and the like.
The huge number of files brings about a lot of trouble to management.
There are two main ways of file management:
mode 1: saving the file to a database;
mode 2: the files are directly saved in a file directory.
The mode 2 feature is opposite to the mode 1. If the number of files is many, such as millions, and changes frequently, the files are difficult to organize.
The traditional file organization mode is a mode of generating a multilevel directory structure according to the characteristics of data to organize and manage files, for example, in the management of files attached to geological disasters, one mode is to construct a file directory structure according to administrative areas where disasters are located and place the files in a last-level directory. The main disadvantages of this way of organizing files are: the directory structure is tightly bound with the application, and the universality is lacked; the difference between the number of files contained in each sub-directory may be large, and the number of files contained in some directories may be too large; the files in a single directory are too many to manage conveniently.
Disclosure of Invention
In order to overcome the technical defects in the prior art, the invention discloses a data management method for massive dynamic files.
The data management method facing to the mass dynamic files comprises the following steps:
s1, setting a file storage directory architecture, which comprises a plurality of layers of directories from a root directory;
configuring parameter files, including global deletion mark files under a root directory;
configuring a local deletion mark file under each directory;
configuring a root directory path rootPath as a global variable;
configuring the maximum number of the contained subdirectories maxDirnum of each directory;
configuring the maximum storable file number maxFileNum of each directory;
wherein the maximum number of storable files of each directory represents files directly stored under the directory, excluding subdirectory storage files of the directory;
setting a directory control variable currentDirs as a global variable; the initial value of a directory control variable currentDirs is a root directory; the directory control variable currentDirs is used for storing the newly added directory and a directory path from the root directory to the current directory;
setting a file sequence number control variable currentSn as a global variable according to the storage sequence number of the previous newly added file; the initial value of a file sequence number control variable currentSn is 0;
s2, storing the newly added file at the deleted file position, and specifically comprising the following steps:
inquiring whether the global deletion marker file contains a directory of deleted files, if so, obtaining a first directory A1, opening a local deletion marker file of the directory A1, obtaining a deleted file sequence number list, and performing file vacancy storage at a storage position corresponding to a first file sequence number in the deleted file sequence number list;
otherwise, performing step S3;
s3, trying to store the newly added file into the current directory, and specifically comprising the following steps:
checking whether the current directory is full, namely whether the file sequence number control variable currentSn is smaller than the maximum storable file number maxFileNum, if the file sequence number control variable currentSn is smaller than the maximum storable file number maxFileNum, indicating that the current directory is not full, entering step S31, otherwise, entering step S4;
s31, updating a file sequence number control variable currentSn to be a current value plus 1, namely updating according to currentSn = currentSn + 1; proceeding to S32;
s32, updating the storage sequence number storage file;
s4, adding a file storage subdirectory newly, and determining the position of the subdirectory, wherein the specific steps are as follows:
according toGenerating a query directory array dirs by a directory control variable currentDirs; searching from the last valid value of the directory array dirs step-wise upwards, one of the following two cases S41 and S42 is experienced:
s41, when a certain effective value C1 is smaller than the maximum number of the contained subdirectories maxDirnum, adding a new subdirectory on the directory layer corresponding to the effective value, wherein the number of the subdirectory is 1, and simultaneously, the effective value C1 is updated to C1+ 1;
the last element value of the directory array dirs is inquired and modified to be 1; generating a directory control variable currentDirs according to the dirs; setting a file sequence number control variable currentSn = 1;
s42, traversing and inquiring a directory array dirs, and if all effective values are equal to the maximum number of the contained subdirectories, maxDirnum, adding a new directory layer; and creating a new directory at the new directory level: modifying the last element value of the dirs array to be 1, generating a directory path according to the directory array dirs, and creating a new subdirectory under the directory, wherein the number of the subdirectory is 1; adding a new element with a value of 1 at the end of the directory array dirs query;
updating a directory control variable currentDirs according to the directory array dirs, and setting a file sequence number control variable currentSn = 1;
synthesizing a full path file name fullFileName of the newly added file according to the global variable root directory path rootPath, the directory control variable currentDirs, the file sequence number control variable currentSn and the user file name; returning the fullFileName;
s5, in the data management method, when a file is deleted, updating a global deleted file mark and a local deleted file mark, and recording and storing a directory where the deleted file is located for the global deleted file mark; and for the directory where the deleted file is located, storing the storage sequence number of the deleted file in the local deletion marker file under the directory.
Preferably, the file vacancy storage in the step S2 is specifically:
opening the local deletion marker file of the directory A1, obtaining a deleted file sequence number list, taking the first ranked file sequence number, and performing file vacancy storage at the corresponding position:
s21, storing the file at a first file serial number D1 position in a deleted file serial number list in the local deletion marker file under the directory A1;
preferably, in the step S6, when a file is deleted, a directory where the deleted file is located needs to be recorded in the global deletion flag file gdelet. And simultaneously recording the serial number of the deleted file in the local deletion mark file of the directory where the deleted file is located.
The invention realizes the automatic establishment and the file management of the multi-layer directory based on the hierarchy through a simple data structure and a smart and efficient algorithm, and has the following advantages:
1: all directories except the root directory are named by natural numbers, and directory allocation is performed by integer calculation, so that simplicity and high efficiency are realized; each file has a file serial number of the directory, so that the management of the directory and the files can be completed through simple integer operation;
2: the current file directory and the file sequence number are stored by adopting global variables, and the next file storage directory and the file sequence number can be conveniently calculated through the two variables;
3: the data searching and processing efficiency is accelerated by adopting a mode of combining the global deletion marker file and the local deletion marker file.
Drawings
FIG. 1 is a schematic diagram of a data management method for massive dynamic files according to an embodiment of the present invention;
FIG. 2 is a flow chart illustrating an embodiment of a directory architecture according to the present invention.
Detailed Description
The following describes embodiments of the present invention in further detail with reference to the accompanying drawings.
The data management method for the massive dynamic files comprises two aspects of file addition and file deletion.
The function of the newly added file is the core function of the invention, and the function determines the storage directory of the newly added file and the serial number of the file in the directory.
In one embodiment, a new file service may be provided via the newFile function, with the input parameter being a file name without a path, and returning a file name with a file storage path and a serial number extension. The specific function of the newFile function is a function of adding a file.
The function of adding the file comprises the following steps:
s1, setting a file storage directory architecture comprising a plurality of layers of directories starting from a root directory
A parameter file is configured, wherein the parameter file comprises a global deletion marker file gdelet.json and records all directories with deleted files;
json, configuring a local deletion mark file ldeelet under each directory, and recording the serial number of a deleted file under the current directory;
configuring a root directory path rootPath;
configuring the maximum number of the contained subdirectories maxDirnum of each directory;
configuring the maximum storable file number maxFileNum of each directory;
setting a directory control variable currentDirs, wherein the initial value can be the root directory:;
the initial value of the setting file number control variable currentSn may be 0.
The root directory is a layer 0 directory, the direct subdirectory of the root directory is a layer 1 directory, and the direct subdirectory of the layer 1 directory is a layer 2 directory; and by analogy, the direct subdirectory of the nth layer is the (n + 1) th layer directory. The directory hierarchy is shown in FIG. 2.
Each directory may include maxDirNum subdirectories, each subdirectory being named by a number, 1, 2, 3, …, and maxDirNum, respectively. The number of files that can be stored in each directory is determined by the maximum storage maxFileNum.
For example, a typical system configuration is: json stores parameters in a configuration file in json format, as follows:
｛
rootPath：d:\attachfile,
maxDirNum: 500,
maxFileNum:500,
currentDirs:\,
currentSn:0
｝
rootPath: a root directory path.
maxDirNum: each directory may contain a number of subdirectories, and may be modified by a default value of 500.
maxFileNum: each directory can store the number of files, and the default value is 500, which can be modified.
Json, stores global configuration parameters rootPath, maxFileNum and maxDirNum in json format.
The directory control variable currentDirs is the current directory, and the typical format is: the sequence number of the first-level subdirectory, the sequence number of the second-level directory, the sequence number of the n-level directory, and the initial value are the root directory: \ is carried out.
Example of the directory control variable currentDirs:
\: root directory
1: indicating a second level directory with a second level directory number of 1
\500\ 101: the directory number of the third layer is 500, the directory number of the third layer is 101, the directory number of the second layer 500 indicates that the layer reaches the maximum storable file number maxFileNum =500, that is, the directory number is full, and the directory number of the third layer 101 indicates that the layer does not reach the maximum storable file number maxFileNum, that is, the directory number is not full.
The file sequence number control variable currentSn is the file sequence number of the directory where the previous newly added file is located, is an integer, and has an initial value of 0.
S2, inquiring whether the global deletion mark file contains a directory
Json records which directories have file deletion in json format, and can store the newly added files. One specific format is as follows:
"\\ 1\ 3" "," \1\100\31 "", which indicates that two directories with file deletion are respectively the second layer of sub-directories with the serial number of 3; and a third layer subdirectory with the sequence number of 31, which is positioned below the second layer subdirectory with the sequence number of 100.
Json is a json string array where each element is a directory, indicating that a file under the directory is deleted, leaving room for new files to be saved in the directory.
Json is a local deletion marker file under each directory, which records the deleted file sequence number under the directory. Json records each deleted file sequence number in json array format as:
[10,50,106]
the array indicates that three files with sequence numbers 10, 50 and 106 in the current directory have been deleted, and three files can be accepted to fill the three gaps.
Setting a catalog generation rule: except the root directory, other directory layers can generate the (n + 1) th layer directory only after the number of files stored in the nth layer directory reaches the upper limit.
Setting a directory saving rule: all files are stored in the directory according to the following principle: only after the number of files of all directories of the low level reaches maxFileNum, the newly added files can be stored in the directories of the high level.
To avoid the problem of user files overlapping each other due to the same name, the file number stored in the directory may be added to the front of the extension in the file name. For example, the original file name: doc, modified to: intersection-102. doc, 102 is the file number stored in the directory where the file is located.
When a file is newly added, the file is preferentially stored in a vacant space reserved by the deleted file. The system saves the space left by the deleted file by two types of files: a global deletion marker file gdelet and a local deletion marker file ldeelet.
Only one global deletion marker file gdelet is used for recording the directory where the deleted file is located; each directory has an ldeelet file, and the file sequence number of the deleted file under the directory is recorded. If gdelet is not empty, S21 is performed, otherwise S3 is performed.
S21, a deleted file directory can be quickly obtained from the global deletion marker file gdelet, and a deleted file number is obtained from the corresponding ldeelet file according to the directory, so that a storage directory and a file number of a newly added file are obtained.
S3, judging whether the current directory file is full
If the file sequence number control variable currentSn is smaller than maxFileNum, which indicates that the current directory is not full, the file can be added to the current directory, and steps S31 and S32 are executed. If currentSn is equal to maxFileNum, which indicates that the current directory has no file storage space and needs to be added with new directories, step S4 is executed.
S31, updating a storage sequence number:
updating a file sequence number control variable currentSn to be a current value plus 1, namely updating according to currentSn = currentSn + 1; storing the file;
s32, updating a storage sequence number storage file;
and finishing the process of adding the file in the current directory.
S4, searching upwards from the last effective value of the directory array step by step:
the query directory array dirs is generated by a directory control variable currentDirs. The effective value of each element of dirs is equal to the current directory number of the layer directory, and the effective value is an integer between 1 and maxDirnum; when the element value of the query directory array is equal to the invalid value, indicating that the directory of the layer is not created;
each element of the directory array dirs represents a level of directory numbers.
One specific implementation of querying the directory array dirs is:
for example, set dirs [0] to store the root directory number, set its value constant to 0; dirs [1] stores layer 2 directory number; dir 2 stores the 3 rd layer directory number; by analogy, dirs [ n ] stores the n +1 th layer directory number.
currentDirs and dirs array relationship example:
starting with the last element of the directory array dirs being queried, the search proceeds up one by one. Starting from dirs [ n ], going to dirs [ n-1], dirs [ n-2], …, and going to dirs [0], one-by-one, one of the following two cases, S41 and S42, are experienced.
S41, if the value C1 of a certain array element dirs [ i ] is larger than 1 and smaller than maxDirnum, adding a new subdirectory with the subdirectory serial number of 1 to the directory corresponding to the element, and simultaneously updating C1 to C1+1 and keeping C1 to dirs [ i ];
querying a directory array dirs element dirs [ i +1] to modify to 1; then generating a directory control variable currentDirs according to the dirs array; setting a file sequence number control variable currentSn = 1;
this step shows that the number of subdirectories of a certain directory reaches the maximum value, but the directory number is not maxDirNum, which shows that the subdirectories can be added to the sibling directory of the same layer, and the directory number of the sibling directory is the directory number of the current directory plus 1.
S42, traversing and inquiring the directory array dirs, if all effective values are equal to the maximum number maxDirnum of the contained subdirectories, adding a new directory layer, and creating a new directory in the new directory layer, wherein the specific method comprises the following steps:
modifying the last element value of the dirs array of the query directory array to be 1, generating a directory path according to dirs, and newly building a subdirectory under the directory, wherein the number of the subdirectory is 1; adding an element at the end of dirs, wherein the value of the newly added element is 1;
this step shows that the number of subdirectories of each established directory layer is full, a new directory layer needs to be created, and the new directory is located under the directory with the directory sequence number of 1.
In steps S41 and S42, a directory control variable currentDirs is generated according to the directory array dirs.
Synthesizing a full path file name fullFileName of the newly added file according to the global variable root directory path rootPath, the directory control variable currentDirs, the file sequence number control variable currentSn and the user file name; returns the fullFileName.
The invention searches possible new directories from the lowest-level directory to the high-level directory through the array structure, and realizes the establishment and management of the directory system by simple addition operation. By setting each parameter, the method automatically searches for the storable vacant position and the vacant directory, strictly limits the generation of the new directory, avoids the phenomena of uneven directory storage files and numerous and disordered directory layers caused by randomly establishing the new directory in the past, and accelerates the data searching efficiency by adopting the mode of combining the global file deletion mark and the local file deletion mark.
What has been described above is a preferred embodiment of the present invention, and if not explicitly contradictory or prerequisite to a preferred embodiment, the preferred embodiments can be used in any combination, the examples and specific parameters in the examples are merely for the purpose of clearly illustrating the inventor's process of verifying the invention, the invention is not limited to the protection scope of the patent, the English in the parentheses of the present invention is the English name of Chinese in the computer language or function before the parentheses, and the English in the parentheses is the name of the mathematical function or database without strict Chinese translation.
Claims (3)
1. A data management method for massive dynamic files is characterized by comprising the following steps:
s1, setting a file storage directory architecture, which comprises a plurality of layers of directories from a root directory;
configuring parameter files, including global deletion mark files under a root directory;
configuring a local deletion marker file under each directory;
configuring a root directory path rootPath as a global variable;
configuring the maximum number maxDirnum of containable subdirectories of each directory;
configuring the maximum storable file number maxFileNum of each directory;
wherein the maximum number of storable files of each directory represents files directly stored under the directory, excluding subdirectory storage files of the directory;
setting a directory control variable currentDirs as a global variable; the initial value of a directory control variable currentDirs is a root directory; the directory control variable currentDirs is used for storing the newly added directory and a directory path from the root directory to the current directory;
setting a file sequence number control variable currentSn as a global variable according to the storage sequence number of the previous newly added file; the initial value of a file sequence number control variable currentSn is 0;
s2, storing the newly added file at the deleted file position, and specifically comprising the following steps:
inquiring whether the global deletion marker file contains a directory of the deleted file, if so, obtaining a first directory A1, opening a local deletion marker file of the directory A1, obtaining a deleted file sequence number list, and performing file vacancy storage at a storage position corresponding to a first file sequence number in the deleted file sequence number list;
otherwise, performing step S3;
s3, trying to store the newly added file into the current directory, and specifically comprising the following steps:
checking whether the current directory is full, namely whether the file sequence number control variable currentSn is smaller than the maximum storable file number maxFileNum, if the file sequence number control variable currentSn is smaller than the maximum storable file number maxFileNum, indicating that the current directory is not full, entering step S31, otherwise, entering step S4;
s31, updating a file sequence number control variable currentSn to be a current value plus 1, namely updating according to currentSn = currentSn + 1; proceeding to S32;
s32, updating the storage sequence number storage file;
s4, adding a new file storage subdirectory, and determining the position of the subdirectory, wherein the specific steps are as follows:
according toDirectory control variable currentDirs generation query meshRecording an array dirs; searching from the last valid value of the directory array dirs step-wise upwards, one of the following two cases S41 and S42 is experienced:
s41, when a certain effective value C1 is smaller than the maximum number maxDirnum of the contained subdirectories, adding a new subdirectory on the directory layer corresponding to the effective value, wherein the number of the subdirectory is 1, and meanwhile, the effective value C1 is updated to be C1+ 1;
the last element value of the directory array dirs is inquired and modified to be 1; generating a directory control variable currentDirs according to dirs; setting a file sequence number control variable currentSn = 1;
s42, traversing and inquiring a directory array dirs, and if all effective values are equal to the maximum number of the contained subdirectories, maxDirnum, adding a new directory layer; and creating a new directory at the new directory level: modifying the last element value of the dirs array to be 1, generating a directory path according to the directory array dirs, and newly building a subdirectory under the directory, wherein the number of the subdirectory is 1; adding a new element with a value of 1 at the end of the directory array dirs query;
updating a directory control variable currentDirs according to the directory array dirs, and setting a file sequence number control variable currentSn = 1;
synthesizing a full path file name fullFileName of the newly added file according to the global variable root directory path rootPath, the directory control variable currentDirs, the file sequence number control variable currentSn and the user file name; returning the fullFileName;
s5, in the data management method, when a file is deleted, updating a global deleted file mark and a local deleted file mark, and recording a directory where the deleted file is stored for the global deleted file mark; and for the directory where the deleted file is located, storing the storage sequence number of the deleted file in the local deletion marker file under the directory.
2. The mass dynamic file-oriented data management method according to claim 1, wherein the file vacancy storage in the step S2 specifically includes:
opening the local deletion marker file of the directory A1, obtaining a deleted file sequence number list, taking the first ranked file sequence number, and performing file vacancy storage at the corresponding position:
s21, storing the file at the first file serial number D1 position of the deleted file serial number list in the local deletion marker file under the directory A1.
3. The mass dynamic file-oriented data management method of claim 1, wherein in the step S6, when a file is deleted, a directory where the deleted file is located needs to be recorded in the global deletion marker file; and simultaneously recording the serial number of the deleted file in the local deletion mark file of the directory where the deleted file is located.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210424022.5A CN114691625B (en) | 2022-04-21 | 2022-04-21 | Data management method for mass dynamic files |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210424022.5A CN114691625B (en) | 2022-04-21 | 2022-04-21 | Data management method for mass dynamic files |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114691625A true CN114691625A (en) | 2022-07-01 |
| CN114691625B CN114691625B (en) | 2023-05-16 |
Family
ID=82143987
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210424022.5A Active CN114691625B (en) | 2022-04-21 | 2022-04-21 | Data management method for mass dynamic files |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114691625B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116056146A (en) * | 2023-03-06 | 2023-05-02 | 至控科技(湖州)创新研究院有限公司 | Wireless positioning signal buffer memory transmission method and system based on hash array |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1449530A (en) * | 2000-03-30 | 2003-10-15 | 微软公司 | Transactional file system |
| US20050238314A1 (en) * | 2004-03-30 | 2005-10-27 | Sako Asayama | Recording system, recording apparatus, recording method, recording program and recording medium |
| US20100100574A1 (en) * | 2007-07-06 | 2010-04-22 | Fujitsu Limited | File management system and apparatus, and computer readable recording medium storing program |
| CN101782921A (en) * | 2009-12-28 | 2010-07-21 | 北京握奇数据系统有限公司 | Directory creating, inquiring and deleting method and device |
| US20130198251A1 (en) * | 2012-01-31 | 2013-08-01 | Hitachi Solutions, Ltd. | File list generation method and system, file list generation apparatus, and program |
| JP2014215962A (en) * | 2013-04-30 | 2014-11-17 | 株式会社沖データ | File management program |
| CN107423369A (en) * | 2017-07-01 | 2017-12-01 | 珠海格力电器股份有限公司 | A kind of method and device for handling file to be deleted |
| CN112446061A (en) * | 2020-11-18 | 2021-03-05 | 合肥致存微电子有限责任公司 | Data undeletable method, mobile terminal and storage medium |
-
2022
- 2022-04-21 CN CN202210424022.5A patent/CN114691625B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1449530A (en) * | 2000-03-30 | 2003-10-15 | 微软公司 | Transactional file system |
| CN1746893A (en) * | 2000-03-30 | 2006-03-15 | 微软公司 | Transactional file system |
| US20050238314A1 (en) * | 2004-03-30 | 2005-10-27 | Sako Asayama | Recording system, recording apparatus, recording method, recording program and recording medium |
| US20100100574A1 (en) * | 2007-07-06 | 2010-04-22 | Fujitsu Limited | File management system and apparatus, and computer readable recording medium storing program |
| CN101782921A (en) * | 2009-12-28 | 2010-07-21 | 北京握奇数据系统有限公司 | Directory creating, inquiring and deleting method and device |
| US20130198251A1 (en) * | 2012-01-31 | 2013-08-01 | Hitachi Solutions, Ltd. | File list generation method and system, file list generation apparatus, and program |
| JP2014215962A (en) * | 2013-04-30 | 2014-11-17 | 株式会社沖データ | File management program |
| CN107423369A (en) * | 2017-07-01 | 2017-12-01 | 珠海格力电器股份有限公司 | A kind of method and device for handling file to be deleted |
| CN112446061A (en) * | 2020-11-18 | 2021-03-05 | 合肥致存微电子有限责任公司 | Data undeletable method, mobile terminal and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 陈涛: "大规模网络存储环境中的数据布局与查询优化技术研究", 《中国博士学位论文全文数据库 信息科技辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116056146A (en) * | 2023-03-06 | 2023-05-02 | 至控科技(湖州)创新研究院有限公司 | Wireless positioning signal buffer memory transmission method and system based on hash array |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114691625B (en) | 2023-05-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108804510B (en) | Key value file system | |
| US9317511B2 (en) | System and method for managing filesystem objects | |
| US7228299B1 (en) | System and method for performing file lookups based on tags | |
| CN108491549B (en) | Method and device for creating file directory in distributed storage system | |
| US7797283B2 (en) | Systems and methods for maintaining distributed data | |
| US7917474B2 (en) | Systems and methods for accessing and updating distributed data | |
| US7562087B2 (en) | Method and system for processing directory operations | |
| CN111045857B (en) | Method for data backup and recovery, electronic device and computer readable storage medium | |
| US9149054B2 (en) | Prefix-based leaf node storage for database system | |
| KR100856245B1 (en) | File system device and method for saving and seeking file thereof | |
| US8504541B2 (en) | File management method | |
| US7287046B2 (en) | Method and system of compacting sparse directories in a file system | |
| US20160283501A1 (en) | Posix-compatible file system, method of creating a file list and storage device | |
| CN103077199A (en) | File resource searching and locating method and device | |
| US20100082636A1 (en) | Methods and Apparatus for Content-Defined Node Splitting | |
| CN113010486B (en) | Metadata layered caching method and device for centerless distributed file system | |
| US10949385B2 (en) | Hybrid metadata and folder based file access | |
| JP2012531688A (en) | Method for accessing file system file according to metadata, and apparatus for implementing the method | |
| CN111104377B (en) | File management method, electronic device and computer readable storage medium | |
| CN111209259A (en) | NAS distributed file system and data processing method | |
| CN114691625A (en) | Data management method for massive dynamic files | |
| US8495025B2 (en) | Foldering by stable query | |
| CN110765073A (en) | File management method, medium, device and apparatus for distributed storage system | |
| CN106874457B (en) | Method for improving metadata cluster performance through virtual directory | |
| CN104537023A (en) | Storage method and device for reverse index records |
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 | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Deng Hui Inventor after: Zhang Wenjiang Inventor after: Zhu Deming Inventor after: Hu Xiaohong Inventor after: Zhang Hui Inventor after: Zhang Bin Inventor before: Zhang Wenjiang Inventor before: Deng Hui Inventor before: Zhu Deming Inventor before: Hu Xiaohong Inventor before: Zhang Hui Inventor before: Zhang Bin |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |