CN111897769B - Management method of embedded data management file system - Google Patents

Management method of embedded data management file system Download PDF

Info

Publication number
CN111897769B
CN111897769B CN202010573389.4A CN202010573389A CN111897769B CN 111897769 B CN111897769 B CN 111897769B CN 202010573389 A CN202010573389 A CN 202010573389A CN 111897769 B CN111897769 B CN 111897769B
Authority
CN
China
Prior art keywords
file
directory
name
node
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010573389.4A
Other languages
Chinese (zh)
Other versions
CN111897769A (en
Inventor
曾兴隆
陈佳华
张磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujian Newland Communication Science Technologies Co ltd
Original Assignee
Fujian Newland Communication Science Technologies Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Fujian Newland Communication Science Technologies Co ltd filed Critical Fujian Newland Communication Science Technologies Co ltd
Priority to CN202010573389.4A priority Critical patent/CN111897769B/en
Publication of CN111897769A publication Critical patent/CN111897769A/en
Application granted granted Critical
Publication of CN111897769B publication Critical patent/CN111897769B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/13File access structures, e.g. distributed indices
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/16File or folder operations, e.g. details of user interfaces specifically adapted to file systems
    • G06F16/162Delete operations

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)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Storage Device Security (AREA)

Abstract

The invention provides a management method of an embedded data management file system in the technical field of embedded equipment, which comprises the following steps: step S10, creating a data linked list, defining file name format, file creating mode and file opening authority; step S20, initializing a file system based on the data linked list; step S30, acquiring a file to be written, wherein the file attribute of the file to be written comprises a file name, a file creation mode, a file length (data size) and an opening state; verifying the file name of the file to be written based on the file name format; step S40, writing the file to be written into the memory based on the file creating mode and the data linked list; the data link list comprises a directory link and a file link, and the directory link can be created according to needs. The invention has the advantages that: the efficiency and the stability of embedded equipment data management are greatly improved.

Description

Management method of embedded data management file system
Technical Field
The invention relates to the technical field of embedded equipment, in particular to a management method of an embedded data management file system.
Background
After the embedded device introduces the file system, compared with a direct operation memory, the embedded device enables the operation of data to be more flexible and provides convenience for the maintenance of the data. However, when storing data, the conventional file system stores the data directly in binary format, and has the following disadvantages:
1. the data are stored in a binary format, so that the data are inconvenient to view, and particularly when the data volume is large; 2. when different types of data are stored, the operation sequence of storing and reading the data is complicated; 3. newly added data can only be added in an additional mode; 4. when the memory is rewritten, data must be erased, and the number of times of erasing the memory is limited, and if the number of times of erasing is over, the memory cannot be normally used.
Therefore, how to provide a management method for an embedded data management file system to improve the efficiency and stability of data management of an embedded device becomes a problem to be solved urgently.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a management method for an embedded data management file system, so as to improve the efficiency and stability of data management of an embedded device.
The invention is realized in the following way: a management method of an embedded data management file system comprises the following steps:
step S10, creating a data linked list, defining file name format, file creating mode and file opening authority;
step S20, initializing a file system based on the data linked list;
step S30, acquiring a file to be written, wherein the file attribute of the file to be written comprises a file name, a file creation mode, a file length and an opening state; verifying the file name of the file to be written based on the file name format;
and step S40, writing the file to be written into the memory based on the file creating mode and the data linked list.
Further, in the step S10, the data link list includes a directory link and a file link;
the file chain consists of a plurality of file nodes; the file node comprises a file address and a file data field; the file data field comprises file attributes and a file node pointer; the file node pointer of the previous file node points to the file address of the next file node;
the directory chain consists of a plurality of directory nodes; the directory node comprises a directory address and a directory data field; the directory data field comprises directory attributes, directory content node pointers and directory node pointers; the directory attribute comprises a directory name and a flag bit for marking the data type as a directory or a file; if the directory data field of the current directory node is not null, the directory content node pointer points to the next directory content node address, otherwise, the directory content node pointer points to null; and if the directory chain has a next directory node, the directory node pointer of the previous directory node points to the directory address of the next directory node, otherwise, the directory node pointer points to null.
Further, in step S10, the file name format specifically includes: contain only lower case letters, upper case letters, "-", "_" or "/" characters;
the file creating mode comprises a new file and an original covering file;
the file opening authority comprises read only, write only, read and write, overlay write and additional write.
Further, the step S40 is specifically:
and writing the file attribute of the file to be written into the file node based on the data linked list, and establishing a new memory space or clearing an old memory space for the file to be written in the memory based on the file creating mode.
Further, the method further comprises deleting the file:
s50, acquiring a first file name of a file to be deleted, judging whether the first file name is matched with the file name format, if so, passing the verification, and entering the step S60; if not, the verification is not passed, the process is ended, and the user is prompted that the input parameters are wrong;
and step S60, searching and deleting the corresponding file node in the data link list based on the first file name, and releasing the memory occupied by the file node.
Further, the method further comprises opening the file:
step S51, acquiring a second file name and a file opening authority of a file to be opened, judging whether the second file name is matched with the file name in format, if so, passing the verification, and entering step S61; if not, the verification is not passed, and the process is ended;
step S61, searching a corresponding file node in a data link table based on the first file name, searching a file to be opened in a memory based on the file node, and opening the file to be opened based on the file opening authority.
Further, the method further comprises renaming the file:
s52, acquiring an original file name and a new file name of a file to be renamed, judging whether the original file name and the new file name are matched with the file name format, if so, passing the verification, and entering S62; if not, the verification is not passed, and the process is ended;
step S62, searching a corresponding file node in a data link table based on the original file name, judging whether the file to be renamed is in an opened state based on the opened state in the file attribute of the file node, and if not, entering step S72; if yes, ending the process;
and step S72, replacing the file name of the file attribute with a new file name.
Further, the method further comprises setting a file state:
step S53, acquiring a third file name and file state parameters of a file to be set, wherein the file state parameters comprise file length and the position of a file node pointer, judging whether the third file name is matched with the file name format, if so, passing the verification, and entering step S63; if not, the verification is not passed, and the process is ended;
and step S63, searching a corresponding file node in a data link list based on the third file name, and performing assignment modification of the file state on the file node based on the file state parameter.
Further, the method further comprises opening a directory:
s54, acquiring a first directory name to be opened, traversing the directory chain in the data link table to search the first directory name, and if the first directory name exists, entering S64; if the first directory name does not exist, ending the process;
and step S64, opening all data associated under the first directory name.
Further, the method further comprises synchronizing the files:
step S55, acquiring a fourth file name to be synchronized, judging whether the fourth file name is matched with the file name in format, if so, passing the verification, and entering step S65; if not, the verification is not passed, and the process is ended;
step S65, judging whether a file node corresponding to a fourth file name exists based on the data link list, and if yes, synchronizing data corresponding to the file node to a memory of the embedded device; if not, the flow ends.
The invention has the advantages that:
1. by creating the data linked list, when file creation, file deletion, file opening, file renaming, file removal, file state setting, file writing, file reading, total storage size acquisition, residual storage size acquisition, directory opening, directory reading and file synchronization are performed after a file system is initialized, and corresponding paths and files can be quickly found through file names; the file name format, the file creating mode and the file opening authority are defined, so that the file name can be standardized, and the file is operated based on the preset file creating mode and the preset file opening authority, so that the file addition, deletion, modification and check are more flexible; compared with a traditional direct operation memory, in the face of binary files, data management cannot be performed on different files, if data of a certain file needs to be modified, the initial address and the file size of the file storage need to be known, the offset of the file address needs to be calculated, and the efficiency of data management of the embedded device is greatly improved.
2. The data linked list is used for carrying out file adding, deleting, modifying and checking, the erasing times of the storage are reduced, the loss of the storage is reduced, and compared with the traditional method that the binary data is erased before being written every time, otherwise, the data is disordered, the stability of data management of the embedded equipment is greatly improved, and a storage space is not newly built every time the file is written, so that a large amount of memory space is saved.
Drawings
The invention will be further described with reference to the following examples with reference to the accompanying drawings.
FIG. 1 is a flow chart of a management method of an embedded data management file system according to the present invention.
FIG. 2 is a diagram illustrating the structure of a data link table according to the present invention.
Fig. 3 is a schematic structural diagram of a directory node of the present invention.
FIG. 4 is a schematic diagram of the structure of a file node according to the present invention.
Detailed Description
Referring to fig. 1 to 4, a preferred embodiment of a management method for an embedded data management file system according to the present invention includes the following steps:
step S10, creating a data linked list, defining file name format, file creating mode and file opening authority; the data linked list is used for quickly searching files;
step S20, calling an initialization function (VFS Init ()), and initializing a file system (VFS) based on the data linked list; a path is reserved for a directory of the data linked list in a file system, for example, the directory of a computer C disk is C: \, if a file exists under the C disk, namely the name of the C: \ file or the directory exists under the C disk, and the file exists under the directory, the name of the C: \ directory \ file is initialized, the purpose of initialization is to read the stored file and directory data in flash, create a root node of a VFS in a memory, and hang the file and directory data in flash to corresponding nodes;
step S30, acquiring a file to be written, wherein the file attribute of the file to be written comprises a file name, a file creation mode, a file length (data size) and an opening state; verifying the file name of the file to be written based on the file name format, namely judging whether the format of the file name accords with the file name format; the open state includes opened and unopened;
and step S40, writing the file to be written into the memory based on the file creation mode and the data linked list.
In step S10, the data link list includes a directory link and a file link;
the file chain consists of a plurality of file nodes; the file node comprises a file address and a file data field; the file data field comprises file attributes and a file node pointer; the file node pointer of the previous file node points to the file address of the next file node;
the directory chain consists of a plurality of directory nodes; the directory node comprises a directory address and a directory data field; the directory data field comprises directory attributes, directory content node pointers and directory node pointers; the directory attribute comprises a directory name and a flag bit for marking the data type as a directory or a file; if the directory data field of the current directory node is not null, the directory content node pointer points to the next directory content node address, otherwise, the directory content node pointer points to null; and if the directory chain has a next directory node, the directory node pointer of the previous directory node points to the directory address of the next directory node, otherwise, the directory node pointer points to null. For example, one folder may store documents or another folder.
In step S10, the file name format specifically includes: contain only lower case letters, upper case letters, "-", "_" or "/" characters;
the file creation mode comprises a NEW file (VFS _ CREATE _ NEW) and an overlay original file (VFS _ CREATE _ ALWAYS);
the FILE opening authority includes READ ONLY (VFS _ FILE _ OPEN _ READ _ ONLY), WRITE ONLY (VFS _ FILE _ OPEN _ WRITE _ ONLY), READ WRITE (VFS _ FILE _ OPEN _ READ _ WRITE), overwrite WRITE (VFS _ FILE _ OPEN _ true), and APPEND WRITE (VFS _ FILE _ OPEN _ APPEND). The additional writing means that new data is additionally written on the basis of the original file, and the original data is not overwritten.
The step S40 specifically includes:
and writing the file attribute of the file to be written into the file node based on the data linked list, and establishing a new memory space or clearing an old memory space for the file to be written in the memory based on the file creating mode.
The method further comprises deleting the file:
step S50, calling a deletion function (vfsRemoveFile), acquiring a first file name of a file to be deleted, judging whether the first file name is matched with the file name format, if so, passing the verification, and entering step S60; if not, the verification is not passed, the process is ended, and the user is prompted that the input parameters are wrong;
and step S60, searching and deleting the corresponding file node in the data link list based on the first file name, and releasing the memory occupied by the file node.
The method further comprises opening the file:
step S51, calling an opening function (vfopenFile), acquiring a second file name and a file opening authority of a file to be opened, judging whether the second file name is matched with the file name format, if so, passing the verification, and entering step S61; if not, the verification is not passed, and the process is ended;
step S61, searching a corresponding file node in a data link table based on the first file name, searching a file to be opened in a memory based on the file node, and opening the file to be opened based on the file opening permission.
The method further comprises renaming the file:
step S52, acquiring an original file name (OldName) and a new file name (NewName) of the file to be renamed, judging whether the original file name and the new file name are matched with the file name format, if so, passing the verification, and entering step S62; if not, the verification is not passed, and the process is ended;
step S62, searching a corresponding file node in a data link table based on the original file name, judging whether the file to be renamed is in an opened state based on the opened state in the file attribute of the file node, and if not, entering step S72; if yes, ending the process;
and step S72, replacing the file name of the file attribute with a new file name.
The method further comprises setting a file state:
step S53, a third file name and file state parameters of a file to be set are obtained, the file state parameters comprise the file length and the position of a file node pointer, whether the format of the third file name is matched with that of the file name is judged, if yes, the verification is passed, and the step S63 is entered; if not, the verification is not passed, and the process is ended;
and step S63, searching a corresponding file node in a data link list based on the third file name, and carrying out assignment modification of the file state on the file node based on the file state parameter.
The method further comprises opening a directory:
s54, acquiring a first directory name to be opened, traversing the directory chain in the data link table to search the first directory name, and if the first directory name exists, entering S64; if the first directory name does not exist, ending the process;
and step S64, opening all data related under the first directory name.
The method further comprises synchronizing the files:
step S55, acquiring a fourth file name to be synchronized, judging whether the fourth file name is matched with the file name in format, if so, passing the verification, and entering step S65; if not, the verification is not passed, and the process is ended;
step S65, judging whether a file node corresponding to a fourth file name exists based on the data linked list, and if so, synchronizing data corresponding to the file node into a memory of the embedded equipment; if not, the flow ends.
The invention can also realize the following functions by applying the data linked list:
closing the file: synchronizing the content of the file to the flash before closing the file, checking whether the file is valid, if so, setting the opening mark of the file node to 0 (closing and opening state) and setting the pointer of the file node to 0 when the file passes the verification.
Writing a file: the function is to write the opened file; acquiring handle, buffer address reference and file size; checking whether the acquired file exists, namely judging whether the acquired handle is empty, if so, ending the process, and returning information of parameter errors; if not, accessing the file node through the handle; checking the opening mode of the file, if the file is closed, returning that the handle transmitted to the function is invalid, and otherwise, continuing to execute the flow; if the file opening authority is the additional writing, a file node pointer is placed to the end of the file; otherwise, checking the obtained buffer, if the buffer is empty, ending the process, and returning the information of parameter error; otherwise, the process is continued, and the writing is started according to the position of the file node pointer. Then checking the space size on the flash, if the space is insufficient, ending the process, and returning the information that the space of the file system is full; and backing up original data, writing in a file, and updating the content of the file.
Reading a file: acquiring a handle of a file to be read, wherein the file stores address reference of a buffer, the size to be read and the actual read size; checking the obtained handle, if the obtained handle is NULL (NULL), returning information of parameter errors, and ending the process; otherwise, the process is carried out, the actual reading size is judged to be NULL, parameter error information is returned, and the process is ended; otherwise, continuing the process, and checking whether the file is valid; and checking whether the file is opened or not, checking the opening state information of the file node, and returning file access error information if the file is closed. Judging the readable size of the file, and if the readable size of the file is smaller than the size needing to be read, returning the read size; if the file data is empty, the access cannot be performed; otherwise, continuing to execute, and performing data reading access on the file.
Changing the file lookup pointer: if the file is opened with an additional write, the next write will still be performed at the end of the file.
Acquiring the size of a magnetic disk: returning the total size (in bytes) of the disk partition used by the VFS; obtain the directory name, the address reference of the total size. The directory name needs to be checked to determine whether the directory exists, if the directory exists, the content of the directory is obtained, if the directory content is empty, the size is 0, otherwise, the size is the default size, which is defined as 256K.
Obtaining the residual space: return the free size (in bytes) of the disk partition used by the VFS; obtaining a directory name and address reference of the total size; the directory name needs to be checked, whether the directory exists is judged, if the directory exists, the operation is continued, and a directory content node pointer of the directory name is obtained; if the content is not empty, the remaining space is obtained by reducing the total size of the directory content according to the specified size.
Reading a directory: checking the handle of the catalog, if the handle exists, continuing the process, and if a second parameter is not input, ending the process and returning the information of parameter abnormality; if the input exists, continuing the process; acquiring all contents in a directory, and acquiring all data by using the offset of a directory content node pointer in a linked list according to the number of the directory contents; when the directory content node is not empty, continuing to execute the process; and displays the directory contents one by one according to the offset of the content node.
Closing the directory: acquiring a directory handle to be closed, judging whether the handle is acquired or not, if not, ending the process, and returning information of error parameters; if yes, continuing the process; and deleting the directory node, and deleting the data linked list of the content to be deleted. Releasing the memory of the directory node needing to be deleted according to the content of the directory node; finally, deleting the directory node information and releasing the memory for storing the directory nodes; that is, all the contents in the folder are deleted, and then the folder without contents is deleted.
In conclusion, the invention has the advantages that:
1. by creating the data linked list, when file system initialization is performed, file creation, file deletion, file opening, file renaming, file removal, file state setting, file writing, file reading, total storage size obtaining, residual storage size obtaining, directory opening, directory reading and file synchronizing are performed, and corresponding paths and files can be quickly found through file names; the file name format, the file creating mode and the file opening authority are defined, so that the file name can be standardized, and the file is operated based on the preset file creating mode and the preset file opening authority, so that the file addition, deletion, modification and check are more flexible; compared with a traditional direct operation memory, in the face of binary files, data management cannot be performed on different files, if data of a certain file needs to be modified, the initial address and the file size of the file storage need to be known, the offset of the file address needs to be calculated, and the efficiency of data management of the embedded device is greatly improved.
2. The data linked list is used for carrying out file adding, deleting, modifying and checking, the erasing times of the storage are reduced, the loss of the storage is reduced, and compared with the traditional method that the binary data is erased before being written every time, otherwise, the data is disordered, the stability of data management of the embedded equipment is greatly improved, and a storage space is not newly built every time the file is written, so that a large amount of memory space is saved.
Although specific embodiments of the invention have been described above, it will be understood by those skilled in the art that the specific embodiments described are illustrative only and are not limiting upon the scope of the invention, and that equivalent modifications and variations can be made by those skilled in the art without departing from the spirit of the invention, which is to be limited only by the appended claims.

Claims (7)

1. A management method of an embedded data management file system is characterized in that: the method comprises the following steps:
step S10, creating a data linked list, defining file name format, file creating mode and file opening authority;
step S20, initializing a file system based on the data linked list;
step S30, acquiring a file to be written, wherein the file attribute of the file to be written comprises a file name, a file creation mode, a file length and an opening state; verifying the file name of the file to be written based on the file name format;
step S40, writing the file to be written into the memory based on the file creating mode and the data linked list;
in step S10, the data link list includes a directory link and a file link;
the file chain consists of a plurality of file nodes; the file node comprises a file address and a file data field; the file data field comprises file attributes and a file node pointer; the file node pointer of the previous file node points to the file address of the next file node;
the directory chain consists of a plurality of directory nodes; the directory node comprises a directory address and a directory data field; the directory data field comprises directory attributes, directory content node pointers and directory node pointers; the directory attribute comprises a directory name and a flag bit for marking the data type as a directory or a file; if the directory data field of the current directory node is not null, the directory content node pointer points to the next directory content node address, otherwise, the directory content node pointer points to null; if the directory chain has a next directory node, the directory node pointer of the previous directory node points to the directory address of the next directory node, otherwise, the directory node pointer points to null;
the method further comprises deleting the file:
s50, acquiring a first file name of a file to be deleted, judging whether the first file name is matched with the file name format, if so, passing the verification, and entering the step S60; if not, the verification is not passed, the process is ended, and the user is prompted that the input parameters are wrong;
step S60, searching and deleting corresponding file nodes in a data link table based on the first file name, and releasing the memory occupied by the file nodes;
the method further comprises opening the file:
step S51, acquiring a second file name and a file opening authority of a file to be opened, judging whether the second file name is matched with the file name in format, if so, passing the verification, and entering step S61; if not, the verification is not passed, and the process is ended;
step S61, searching a corresponding file node in a data link table based on the first file name, searching a file to be opened in a memory based on the file node, and opening the file to be opened based on the file opening permission.
2. A management method of an embedded data management file system according to claim 1, characterized in that: in step S10, the file name format specifically includes: contain only lower case letters, upper case letters, "-", "_" or "/" characters;
the file creating mode comprises a new file and an original covering file;
the file opening authority comprises read only, write only, read and write, overlay write and additional write.
3. A management method of an embedded data management file system according to claim 1, characterized in that: the step S40 specifically includes:
and writing the file attribute of the file to be written into the file node based on the data linked list, and establishing a new memory space or clearing an old memory space for the file to be written in the memory based on the file creating mode.
4. A management method of an embedded data management file system according to claim 1, characterized in that: the method further comprises renaming the file:
s52, acquiring an original file name and a new file name of a file to be renamed, judging whether the original file name and the new file name are matched with the file name format, if so, passing the verification, and entering S62; if not, the verification is not passed, and the process is ended;
step S62, searching a corresponding file node in a data link list based on the original file name, judging whether the file to be renamed is in an opened state based on the opened state in the file attribute of the file node, and if not, entering step S72; if yes, ending the process;
and step S72, replacing the file name of the file attribute with a new file name.
5. A management method of an embedded data management file system according to claim 1, characterized in that: the method further comprises setting a file state:
step S53, acquiring a third file name and file state parameters of a file to be set, wherein the file state parameters comprise file length and the position of a file node pointer, judging whether the third file name is matched with the file name format, if so, passing the verification, and entering step S63; if not, the verification fails, and the process is ended;
and step S63, searching a corresponding file node in a data link list based on the third file name, and performing assignment modification of the file state on the file node based on the file state parameter.
6. A management method of an embedded data management file system according to claim 1, characterized in that: the method further comprises opening a directory:
s54, acquiring a first directory name to be opened, traversing the directory chain in the data link table to search the first directory name, and if the first directory name exists, entering S64; if the first directory name does not exist, ending the process;
and step S64, opening all data associated under the first directory name.
7. A management method of an embedded data management file system according to claim 1, characterized in that: the method further comprises synchronizing the files:
step S55, acquiring a fourth file name to be synchronized, judging whether the fourth file name is matched with the file name in format, if so, passing the verification, and entering step S65; if not, the verification fails, and the process is ended;
step S65, judging whether a file node corresponding to a fourth file name exists based on the data link list, and if yes, synchronizing data corresponding to the file node to a memory of the embedded device; if not, the flow ends.
CN202010573389.4A 2020-06-22 2020-06-22 Management method of embedded data management file system Active CN111897769B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010573389.4A CN111897769B (en) 2020-06-22 2020-06-22 Management method of embedded data management file system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010573389.4A CN111897769B (en) 2020-06-22 2020-06-22 Management method of embedded data management file system

Publications (2)

Publication Number Publication Date
CN111897769A CN111897769A (en) 2020-11-06
CN111897769B true CN111897769B (en) 2022-06-17

Family

ID=73206895

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010573389.4A Active CN111897769B (en) 2020-06-22 2020-06-22 Management method of embedded data management file system

Country Status (1)

Country Link
CN (1) CN111897769B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112732198B (en) * 2021-01-15 2023-11-14 广州Tcl互联网小额贷款有限公司 File management method, device, equipment and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7370054B1 (en) * 2003-09-29 2008-05-06 Sun Microsystems, Inc Method and apparatus for indexing a hash table which is organized as a linked list
CN101621405A (en) * 2009-07-07 2010-01-06 中兴通讯股份有限公司 Distributed type management monitoring system, monitoring method and establishing method thereof
CN102682015A (en) * 2011-03-15 2012-09-19 中国科学院声学研究所 High-definition media-oriented embedded file storage structure and method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7370054B1 (en) * 2003-09-29 2008-05-06 Sun Microsystems, Inc Method and apparatus for indexing a hash table which is organized as a linked list
CN101621405A (en) * 2009-07-07 2010-01-06 中兴通讯股份有限公司 Distributed type management monitoring system, monitoring method and establishing method thereof
CN102682015A (en) * 2011-03-15 2012-09-19 中国科学院声学研究所 High-definition media-oriented embedded file storage structure and method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
C++的基于函数模板实现单向链表;宫彦军等;《湖南科技学院学报》;20171001(第10期);全文 *

Also Published As

Publication number Publication date
CN111897769A (en) 2020-11-06

Similar Documents

Publication Publication Date Title
US5623661A (en) System for and method of providing delta-versioning of the contents of PCTE file objects
US7711696B2 (en) File system for nonvolatile memory
US8341123B2 (en) Event structured file system (ESFS)
JP4388078B2 (en) Method for generating symbolic link maintaining compatibility with file system, method and apparatus for accessing file / directory using symbolic link
US6862599B2 (en) Software-based methodology for the storage and retrieval of diverse information
US20040107223A1 (en) File management method
US20050071359A1 (en) Method for automated database schema evolution
CN1983266A (en) File system storing transaction records in flash-like media
JPH04248623A (en) Method and device for conducting single entity version control for source data
EP0770243A1 (en) Method and apparatus for managing text objects
JP2000194590A (en) Extension card file system
JP2004038960A (en) System and method of managing file name for file system filter driver
JP2005302038A (en) Method and system for renaming consecutive key in b-tree
CN111897769B (en) Management method of embedded data management file system
CN107908364B (en) Embedded file system based on norflash
US20040139122A1 (en) Data management system using a plurality of data operation modules
US6697817B2 (en) Variable-length database apparatus and method for accessing the same
EP1977348A1 (en) Event structured file system (esfs)
CN112800007B (en) Directory entry expansion method and system suitable for FAT32 file system
KR100954603B1 (en) A log file of file system and method for recovering file system
US6684226B1 (en) Method for storing data in one or more files so that both previous and new versions of the data are separately accessible
US11803313B2 (en) Method of constructing a file system based on a hierarchy of nodes
JP2822869B2 (en) Library file management device
KR100631691B1 (en) Data management system of mobile communication terminal
JP3890212B2 (en) Information storage system and information storage method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant