CN112925755A - Intelligent storage method and device for ultra-long path of file system - Google Patents
Intelligent storage method and device for ultra-long path of file system Download PDFInfo
- Publication number
- CN112925755A CN112925755A CN202110189781.3A CN202110189781A CN112925755A CN 112925755 A CN112925755 A CN 112925755A CN 202110189781 A CN202110189781 A CN 202110189781A CN 112925755 A CN112925755 A CN 112925755A
- Authority
- CN
- China
- Prior art keywords
- path
- path segment
- keywords
- segment
- marks
- 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
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000013507 mapping Methods 0.000 claims abstract description 19
- 238000000605 extraction Methods 0.000 claims description 20
- 238000012163 sequencing technique Methods 0.000 claims 1
- 101100242901 Quaranfil virus (isolate QrfV/Tick/Afghanistan/EG_T_377/1968) PB2 gene Proteins 0.000 description 16
- 101150082826 Segment-2 gene Proteins 0.000 description 16
- 101100194052 Thogoto virus (isolate SiAr 126) Segment 2 gene Proteins 0.000 description 16
- 101100242890 Quaranfil virus (isolate QrfV/Tick/Afghanistan/EG_T_377/1968) PA gene Proteins 0.000 description 13
- 101150027881 Segment-3 gene Proteins 0.000 description 13
- 101100242891 Thogoto virus (isolate SiAr 126) Segment 3 gene Proteins 0.000 description 13
- 238000010586 diagram Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 101150093766 Segment-6 gene Proteins 0.000 description 2
- 230000011218 segmentation Effects 0.000 description 2
- 101100247669 Quaranfil virus (isolate QrfV/Tick/Afghanistan/EG_T_377/1968) PB1 gene Proteins 0.000 description 1
- 101150025928 Segment-1 gene Proteins 0.000 description 1
- 101150091797 Segment-4 gene Proteins 0.000 description 1
- 101150036912 Segment-5 gene Proteins 0.000 description 1
- 101100242902 Thogoto virus (isolate SiAr 126) Segment 1 gene Proteins 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000013518 transcription Methods 0.000 description 1
- 230000035897 transcription Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
- G06F16/168—Details of user interfaces specifically adapted to file systems, e.g. browsing and visualisation, 2d or 3d GUIs
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)
Abstract
The invention provides an intelligent storage method and device for an ultra-long path of a file system, wherein the method comprises the following steps: acquiring the length of a path to be processed, and judging whether the length of the path to be processed is greater than a first preset threshold value or not; if yes, dividing the path to be processed into a plurality of path sections according to the path section symbol, acquiring marks of the path sections, replacing the corresponding path sections with the marks, and acquiring and storing a target path; the corresponding path segment is stored in a document and a mapping table is established for the tag and the path segment. By applying the embodiment of the invention, the technical problem of storage of the ultra-long path in the prior art is solved.
Description
Technical Field
The invention relates to the technical field of file management, in particular to an intelligent storage method and device for an ultra-long path of a file system.
Background
With the development of information technology, governments are increasingly turning government services to internet processing. For the convenience of consulting the masses, when an information platform is built, related files need to be displayed in a directory tree form according to categories. Generally, the directory tree needs to be built sequentially according to regions, departments, years, months, file topics, file content synopsis and the like. In addition, for the convenience of file retrieval, the names of the files or folders are named by the abstracts, and for the documents with complex contents, the corresponding abstracts are longer, and some abstracts may have hundreds of characters and are longer. In the actual log system, logs generated by different users accessing regions, departments, years, months, file subjects and file contents in different time periods may have deeper depth of the generated directory tree if stored according to different folders.
To store the above files, after the operating system enables Win32 long paths, the listed Win32 applications and Windows app store applications can access paths that exceed the 260 character per node standard limit on the file system, enabling this setting will result in long paths being accessible in the process. However, even windows ntfs enabling long path only supports pathnames with total path length of 32768 characters. If the path length exceeds the limit of 32768, the system still cannot implement storage. That is to say, the technical problem that the ultra-long path cannot be stored still exists in the prior art.
Disclosure of Invention
The technical problem to be solved by the invention is how to store the ultra-long path.
The invention solves the technical problems through the following technical means:
the invention provides an intelligent storage method for an ultra-long path of a file system, which comprises the following steps:
acquiring the length of a path to be processed, and judging whether the length of the path to be processed is greater than a first preset threshold value or not;
if yes, dividing the path to be processed into a plurality of path sections according to the path section symbol, acquiring marks of the path sections, replacing the corresponding path sections with the marks, and acquiring and storing a target path;
the corresponding path segment is stored in a document and a mapping table is established for the tag and the path segment.
Optionally, the obtaining the mark of the path segment includes:
and aiming at the path segment, extracting keywords of the path segment by using a keyword extraction algorithm, and taking the keywords as marks.
Optionally, the obtaining the mark of the path segment includes:
judging whether the character length corresponding to the path segment exceeds a second preset threshold value or not;
if yes, extracting the keywords of the path segment by using a keyword extraction algorithm, and taking the keywords as marks.
Optionally, the obtaining the mark of the path segment includes:
extracting keywords in the current path segment by using a keyword extraction algorithm, or extracting keywords in each folder and/or file name in the directory tree of the hierarchy corresponding to the current path segment by using a keyword extraction algorithm, or extracting keywords of all files in the directory tree of the hierarchy corresponding to the current path segment by using a keyword extraction algorithm;
sorting according to the word frequency of the keywords to obtain a first word frequency sequence, and selecting the keywords corresponding to a set number of sequence orders from the first word frequency sequence as marks;
optionally, the selecting a set number of keywords corresponding to a sequential order from the first word-frequency sequence as a tag includes:
when a first word frequency sequence corresponding to the current path segment is obtained, removing the first word frequency sequence from keywords appearing in the path segment before the current path segment to obtain a second word frequency sequence;
and selecting the keywords corresponding to the set number of sequence orders from the second word frequency sequence as marks.
Optionally, the method further includes:
acquiring a current path corresponding to a folder displayed to a user, and judging whether a tail path segment in the current path is a mark or not;
if yes, inquiring corresponding target content according to the mark and a mapping table established in advance, and replacing the tail path segment with the target content for displaying.
Optionally, after the target content is displayed in place of the end path segment, the method further includes:
and after the user opens the lower folder of the path of the target content, replacing the target content with the tail path segment for display.
The invention also provides an intelligent storage device for the ultra-long path of the file system, which comprises:
the judging module is used for acquiring the length of a path to be processed and judging whether the length of the path to be processed is greater than a first preset threshold value or not;
the acquisition module is used for dividing the path to be processed into a plurality of path sections according to the path section identifier under the condition that the judgment result of the judgment module is yes, acquiring the marks of the path sections, and replacing the corresponding path sections with the marks to obtain and store a target path;
and the establishing module is used for storing the corresponding path segment in the document and establishing a mapping table for the mark and the path segment.
Optionally, the obtaining module is configured to:
and aiming at the path segment, extracting keywords of the path segment by using a keyword extraction algorithm, and taking the keywords as marks.
Optionally, the obtaining module is configured to:
judging whether the character length corresponding to the path segment exceeds a second preset threshold value or not;
if yes, extracting the keywords of the path segment by using a keyword extraction algorithm, and taking the keywords as marks.
Optionally, the apparatus further comprises: a first replacement module to:
acquiring a current path corresponding to a folder displayed to a user, and judging whether a tail path segment in the current path is a mark or not;
if yes, inquiring corresponding target content according to the mark and a mapping table established in advance, and replacing the tail path segment with the target content for displaying.
Optionally, the second replacing module is configured to:
and after the user opens the lower folder of the path of the target content, replacing the target content with the tail path segment for display.
The invention has the advantages that:
by applying the embodiment of the invention, the path section of the ultra-long path to be processed is compressed to obtain the compressed mark, the path section is stored in the file, and the mapping relation between the mark and the path section is established.
Drawings
Fig. 1 is a schematic flow chart of an intelligent storage method for an ultra-long path of a file system according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an intelligent storage device with an ultra-long path of a file system according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the embodiments of the present invention, and it is obvious that the described embodiments are some embodiments of the present invention, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example 1
Fig. 1 is a schematic flow diagram of an intelligent storage method for an ultra-long path of a file system according to an embodiment of the present invention, and as shown in fig. 1, an embodiment of the present invention provides an intelligent storage method for an ultra-long path of a file system, where the method includes:
s101: acquiring the length of a path to be processed, judging whether the length of the path to be processed is greater than a first preset threshold value, and if so, executing S102; if not, the loop is ended.
The following are exemplary:
the following embodiments of the present invention take an ultra-long path to be processed as an example for explanation:
the obtained path to be processed is as follows:
c, a path segment-1 \ a path segment-2 \ a path segment-3 \ a path segment-4 \ a path segment-5 \ a path segment-6.
Because the path is too long, numbering is carried out on each path segment for the convenience of description, and because the total length of the path to be processed already exceeds a first preset threshold, such as 26000 characters; the step S102 is executed. Further, the first preset threshold value can also be set to 32768; then, when a path to be processed is generated by software or manually, when the total number of characters of the generated path reaches 32678, a path segment input by a user at the current moment can be processed according to the embodiment of the invention; path segments that have already been input may also be processed in accordance with embodiments of the present invention.
It should be emphasized that, in the embodiment of the present invention, the value of the first preset threshold is generally 80% of 32768; the method aims to leave a certain space for a path section newly added after the path to be processed, and improve the expandability of the system.
It should be emphasized that when the user opens the folder in which the target file is located, the system displays the file storage path to the user only to the folder in which the target file is stored. However, for each file in the folder, its corresponding path to be processed should also include the file name of the file. That is to say, the last path segment of the path to be processed, i.e. the path segment-6, according to the embodiment of the present invention is the name of the file.
S102: dividing the path to be processed into a plurality of path sections according to the path segmentation symbol, acquiring the marks of the path sections, and replacing the corresponding path sections with the marks to obtain and store the target path.
In the first embodiment of the present invention, the path segment-2 is taken as an example for explanation.
In practical applications, a user usually searches for corresponding files by level through searching for folders, and after finding suspected folders, clicks one by one to open the file search in the folders. If the number of pictures in the folder is large, or the data volume of the pictures is large, or the number of pages of the files is large, the opening speed is low when a user opens the files to check whether the files are the target files which the user wants to find; furthermore, if the content contained in the file is large, the user is hard to browse, so the existing file searching method is time-consuming. The method has the advantages that time waste caused by frequent file opening of a user is avoided, and the user can conveniently check and retrieve all folders; in the embodiment of the invention, each file is put in the file name in an abstract mode or a key content extracting mode, namely the content of the path segment-2 is formed; and simultaneously naming the folder according to the files contained in the folder and/or the abstracts or key contents of lower folders contained in the folder, so as to form a huge file storage tree with the hierarchy reaching tens of or even hundreds of levels, and splicing the contents of a plurality of similar path segments-2 according to the directory hierarchy, thereby obtaining the path to be processed. This may cause the total number of characters of the file name plus the file storage path to exceed the upper limit set by the system.
In order to solve the above problem, in the embodiment of the present invention, a second preset threshold character length is preset for each path segment, for example, 500 characters may be used, when the number of characters of the path segment-2 exceeds 500 characters, a keyword extraction algorithm is used to extract a keyword of the path segment-2, the keyword may be a term with a high occurrence frequency in a document, and the keyword may correspond to an abstract of the document or a transcription of an end point content in the document. These keywords are used as tags, then the contents of the path segment-2 are stored in the txt document, and the step S103 is performed to establish a mapping table of the contents of the path segment-2 in the txt document and the tags.
In a second specific implementation manner of the embodiment of the present invention, in order to save the length of the target path, in the process of extracting the keyword, the following processing is performed for each current path segment in the order from front to back:
and extracting the key words in the current path segment by using a key word extraction algorithm, or extracting the key words in each folder and/or file name in the directory tree of the hierarchy corresponding to the current path segment by using a key word extraction algorithm, or extracting the key words of all files in the directory tree of the hierarchy corresponding to the current path segment by using a key word extraction algorithm. Sorting according to the word frequency of the keywords to obtain a first word frequency sequence, and selecting the keywords corresponding to a set number of sequence orders from the first word frequency sequence as marks; then, each path segment is processed according to the method to obtain the corresponding mark of each path segment.
For example, when generating keywords for the path segment-2, the obtained keywords are A, B, C, D respectively, and then the keywords are sorted according to the word frequency, for example, the sorting result is BDCA; in the case where the value of the set number is 2, keywords B and D are taken as the labels of the path segment-2.
Furthermore, when a first word frequency sequence corresponding to the current path segment is obtained, the first word frequency sequence is removed from keywords appearing in the path segment before the current path segment to obtain a second word frequency sequence, and then the keywords corresponding to a set number of sequence orders are selected from the second word frequency sequence to serve as marks.
For example, when generating a keyword for a next path segment of path segment-2, such as path segment-3, path segment-2 is the last path segment of path segment-3. The generated first word frequency sequence aiming at the path segment-3 is ADESG; since the keyword D is already present in the first word-frequency sequence corresponding to the path segment-2, the keyword D is extracted from the first word-frequency sequence corresponding to the path segment-3, and the obtained second word-frequency sequence is AESG. And then using the first keywords A and E in the second word frequency sequence as the marks of the path segment-3. In practical applications, when the word frequency of the path segment-2 is counted, the word frequency of all folders and words contained in the files in the directory of the path segment-2 should be counted, instead of only considering the word frequency data of the files or keywords contained in one of the lower-level path segments, i.e., the path segment-3.
By applying the embodiment of the invention, when the keywords of the path to be processed are extracted, a certain keyword appears in the path segment of the upper level of the path, so that the same keyword appears in the head part of each path segment, the user can check the keywords more conveniently, and the user experience is improved.
Furthermore, in order to avoid repeated keywords and highlight key contents in the next path segment with emphasis, when the first word frequency sequence corresponding to the current path segment is obtained, the first word frequency sequence is removed from the keywords which are already present in the path segment before the current path segment and have the word frequency value lower than a third preset threshold value, a second word frequency sequence is obtained, and then the keywords corresponding to a set number of sequence orders are selected from the second word frequency sequence to serve as marks.
For example, where the generated first word frequency sequence for path segment-3 is ADEBSG, since keywords D and B have appeared in the label of path segment-2, value is removed from DB from the first word frequency sequence for path segment-3, and for each of keywords D and B, it is determined whether the word frequency value of the keyword is greater than a third preset threshold, such as 15. If the word frequency value of the keyword D is greater than or equal to 15 and the word frequency value of the keyword B is lower than 15, the keyword D is reserved in the first word frequency sequence of the path segment-3; keyword B is removed from the first word-frequency sequence of path segment-3. And then, the obtained second word frequency sequence corresponding to the path segment-3 is the ADESG, and then, keywords corresponding to a set number of sequence orders are screened out from the second word frequency sequence as the marks of the path segment-3 according to the method.
Furthermore, in order to dynamically adjust the total number of characters corresponding to the set number of keywords, i.e. the size of the second preset threshold, a formula may be utilized,
calculating the total number of characters corresponding to the set number of keywords, wherein,
k is a value of a set number; m is the sum of the number of characters in the path segment preceding the current path segment; m is the number of the keywords of which the word frequency values in the path to be processed are larger than a fourth preset threshold; l1 is the path depth of the current path segment; l2 is the maximum depth of the path to be processed where the current path segment is located; a is a preset adjustment coefficient, and a specific value of a positive integer which is greater than or equal to 20 and less than 1000 may be taken, and the value taking principle is generally that the more keywords repeatedly appearing in all path segments between current path segments, the larger the value is.
In the third specific implementation manner of the embodiment of the present invention, in order to further compress the length of the path to be processed, the path segment-2 may be processed by using a hash algorithm or an MD5 algorithm, and the like, and the processed character is used as a mark, and a corresponding mapping table is established.
Furthermore, in order to further reduce the length of the path to be processed, all the path segments may be processed according to the above method.
S103: the corresponding path segment is stored in a document and a mapping table is established for the tag and the path segment.
Illustratively, a mapping relationship between the current path segment and the corresponding mark is established, and then a mapping table is established according to the mapping relationship of a plurality of path segments.
By applying the embodiment of the invention, in the process of generating the path to be processed, the user or the system only considers which paragraphs or contents need to be placed in the path to be processed, and does not need to consider whether the total number of characters of the path to be processed exceeds the first preset threshold, so that the system automatically adjusts the total number of characters of the path to be processed, and the user experience is improved.
Example 2
On the basis of the embodiment 1 of the present invention, the embodiment 2 of the present invention further adds the following steps:
s104 (not shown in the figure): and acquiring a current path corresponding to the folder displayed to the user, judging whether the tail path segment in the current path is a mark, and if so, executing S105.
For example, the path corresponding to the folder opened by the user is:
c: -tag-1 \ tag-2 \ tag-3 \ tag-4. Then the last path segment in the current path is labeled-4.
When a user opens the folder, the system hides the contents of ' C: \ tag-1 \ tag-2 \ tag-3 \ by default, and only displays the position of ' tag-4 ' to the user; and judging whether the content of the mark-4 is a mark or not, if so, executing S105.
S105 (not shown): and inquiring corresponding target content according to the mark and a mapping table established in advance, and replacing the tail path segment with the target content for display.
And under the condition that the mark-4 is the mark, inquiring the corresponding target content from the mapping table, and displaying the content of the target content at the position of the mark-4.
Furthermore, after the content of the target content is shown to the user, if the content of the target content is more, the target content cannot be completely displayed in one row in the address bar, and in order to improve the user experience, when the user moves the mouse to the address bar, the address bar is pulled down to form a plurality of rows, and then the target content is displayed in rows.
Alternatively, when the user moves the mouse to the mark of the corresponding file or folder, the system pops up a window and displays the target content of the mark-4 corresponding to the mark in the window.
By applying the embodiment of the invention, the original content before the corresponding keyword is extracted, namely the target content, can be recovered from the mark.
Further, after the user opens the lower folder of the path where the target content is located, the target content is replaced with the end mark for display, and hiding processing is performed to make a display space for the next path segment mark-5 of the mark-4.
Example 3
Corresponding to embodiment 1 of the present invention, embodiment 2 further provides an intelligent storage device for an ultra-long path of a file system.
Fig. 2 is a schematic structural diagram of an intelligent storage device with an ultra-long path of a file system according to an embodiment of the present invention, and as shown in fig. 2, the device includes:
the judging module 201 is configured to obtain a length of a path to be processed, and judge whether the length of the path to be processed is greater than a first preset threshold;
an obtaining module 202, configured to, if a determination result of the determining module is yes, divide a path to be processed into a plurality of path segments according to the path segmentation symbol, obtain a label of the path segment, and replace the corresponding path segment with the label to obtain a target path and store the target path;
the establishing module 203 is configured to store the corresponding path segment in a document, and establish a mapping table for the tag and the path segment.
In a specific implementation manner of the embodiment of the present invention, the obtaining module 202 is configured to:
and aiming at the path segment, extracting keywords of the path segment by using a keyword extraction algorithm, and taking the keywords as marks.
In a specific implementation manner of the embodiment of the present invention, the obtaining module 202 is configured to:
judging whether the character length corresponding to the path segment exceeds a second preset threshold value or not;
if yes, extracting the keywords of the path segment by using a keyword extraction algorithm, and taking the keywords as marks.
In a specific implementation manner of the embodiment of the present invention, the first replacement module 204 (not shown in the figure) is configured to:
acquiring a current path corresponding to a folder displayed to a user, and judging whether a tail path segment in the current path is a mark or not;
if yes, inquiring corresponding target content according to the mark and a mapping table established in advance, and replacing the tail path segment with the target content for displaying.
In a specific implementation manner of the embodiment of the present invention, the first replacement module 205 (not shown in the figure) is configured to: and after the user opens the lower folder of the path of the target content, replacing the target content with the tail path segment for display.
The above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. An intelligent storage method for an ultra-long path of a file system is characterized by comprising the following steps:
acquiring the length of a path to be processed, and judging whether the length of the path to be processed is greater than a first preset threshold value or not;
if yes, dividing the path to be processed into a plurality of path sections according to the path section symbol, acquiring marks of the path sections, replacing the corresponding path sections with the marks, and acquiring and storing a target path;
the corresponding path segment is stored in a document and a mapping table is established for the tag and the path segment.
2. The method for intelligently storing the extra-long path of the file system according to claim 1, wherein the obtaining the mark of the path segment comprises:
and aiming at the path segment, extracting keywords of the path segment by using a keyword extraction algorithm, and taking the keywords as marks.
3. The method for intelligently storing the extra-long path of the file system according to claim 1, wherein the obtaining the mark of the path segment comprises:
judging whether the character length corresponding to the path segment exceeds a second preset threshold value or not;
if yes, extracting the keywords of the path segment by using a keyword extraction algorithm, and taking the keywords as marks.
4. The method for intelligently storing the extra-long path of the file system according to claim 1, wherein the obtaining the mark of the path segment comprises:
extracting keywords in the current path segment by using a keyword extraction algorithm, or extracting keywords in each folder and/or file name in the directory tree of the hierarchy corresponding to the current path segment by using a keyword extraction algorithm, or extracting keywords of all files in the directory tree of the hierarchy corresponding to the current path segment by using a keyword extraction algorithm;
and sequencing according to the word frequency of the keywords to obtain a first word frequency sequence, and selecting the keywords corresponding to a set number of sequence orders from the first word frequency sequence as marks.
5. The intelligent storage method for the very long path of the file system according to claim 4, wherein the selecting a set number of keywords corresponding to the sequence order from the first word frequency sequence as the label comprises:
when a first word frequency sequence corresponding to the current path segment is obtained, removing the first word frequency sequence from keywords appearing in the path segment before the current path segment to obtain a second word frequency sequence;
and selecting the keywords corresponding to the set number of sequence orders from the second word frequency sequence as marks.
6. The intelligent storage method for the ultra-long path of the file system according to claim 1, further comprising:
acquiring a current path corresponding to a folder displayed to a user, and judging whether a tail path segment in the current path is a mark or not;
if yes, inquiring corresponding target content according to the mark and a mapping table established in advance, and replacing the tail path segment with the target content for displaying.
7. The intelligent storage method for file system super long path according to claim 6, wherein after the target content is displayed in place of the last path segment, the method further comprises:
and after the user opens the lower folder of the path of the target content, replacing the target content with the tail path segment for display.
8. A file system ultra-long path intelligent storage device, the device comprising:
the judging module is used for acquiring the length of a path to be processed and judging whether the length of the path to be processed is greater than a first preset threshold value or not;
the acquisition module is used for dividing the path to be processed into a plurality of path sections according to the path section identifier under the condition that the judgment result of the judgment module is yes, acquiring the marks of the path sections, and replacing the corresponding path sections with the marks to obtain and store a target path;
and the establishing module is used for storing the corresponding path segment in the document and establishing a mapping table for the mark and the path segment.
9. The intelligent storage device for the very long path of the file system as claimed in claim 8, wherein the obtaining module is configured to:
and aiming at the path segment, extracting keywords of the path segment by using a keyword extraction algorithm, and taking the keywords as marks.
10. The intelligent storage device for the very long path of the file system as claimed in claim 8, wherein the obtaining module is configured to:
judging whether the character length corresponding to the path segment exceeds a second preset threshold value or not;
if yes, extracting the keywords of the path segment by using a keyword extraction algorithm, and taking the keywords as marks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110189781.3A CN112925755B (en) | 2021-02-18 | 2021-02-18 | File system ultra-long path intelligent storage method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110189781.3A CN112925755B (en) | 2021-02-18 | 2021-02-18 | File system ultra-long path intelligent storage method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112925755A true CN112925755A (en) | 2021-06-08 |
| CN112925755B CN112925755B (en) | 2024-08-27 |
Family
ID=76169855
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110189781.3A Active CN112925755B (en) | 2021-02-18 | 2021-02-18 | File system ultra-long path intelligent storage method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112925755B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20230053344A1 (en) * | 2020-02-21 | 2023-02-23 | Nec Corporation | Scenario generation apparatus, scenario generation method, and computer-readablerecording medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6249782B1 (en) * | 1998-12-17 | 2001-06-19 | Apple Computer, Inc. | System and method for reducing file name length and for retrieving the reduced file name entitled files |
| US20050125372A1 (en) * | 2003-12-09 | 2005-06-09 | International Business Machines Corporation | System and method for generating a unique, file system independent key from a URI (Universal Resource Identifier) for use in an index-less VoiceXML browser caching mechanism |
| CN101169796A (en) * | 2007-11-20 | 2008-04-30 | 中兴通讯股份有限公司 | Method for storing document name and judging file name overlength |
| CN103902632A (en) * | 2012-12-31 | 2014-07-02 | 华为技术有限公司 | File system building method and device in key-value storage system, and electronic device |
| KR101846347B1 (en) * | 2017-08-04 | 2018-04-06 | 주식회사 신영이에스디 | Method and apparatus for managing massive documents |
| CN109344125A (en) * | 2018-08-27 | 2019-02-15 | 维沃移动通信有限公司 | A kind of file name update method and terminal device |
| US20190087431A1 (en) * | 2017-09-21 | 2019-03-21 | Alibaba Group Holding Limited | Systems, methods, and apparatuses for simplifying filesystem operations utilizing a key-value storage system |
| CN109508557A (en) * | 2018-10-22 | 2019-03-22 | 中国科学院信息工程研究所 | A kind of file path keyword recognition method of association user privacy |
| CN111831208A (en) * | 2019-04-16 | 2020-10-27 | 中移(苏州)软件技术有限公司 | Information processing method and device, terminal equipment and storage medium |
| CN112181910A (en) * | 2020-09-25 | 2021-01-05 | 炬芯科技股份有限公司 | Extended short file name generation method, file access method and equipment |
-
2021
- 2021-02-18 CN CN202110189781.3A patent/CN112925755B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6249782B1 (en) * | 1998-12-17 | 2001-06-19 | Apple Computer, Inc. | System and method for reducing file name length and for retrieving the reduced file name entitled files |
| US20050125372A1 (en) * | 2003-12-09 | 2005-06-09 | International Business Machines Corporation | System and method for generating a unique, file system independent key from a URI (Universal Resource Identifier) for use in an index-less VoiceXML browser caching mechanism |
| CN101169796A (en) * | 2007-11-20 | 2008-04-30 | 中兴通讯股份有限公司 | Method for storing document name and judging file name overlength |
| CN103902632A (en) * | 2012-12-31 | 2014-07-02 | 华为技术有限公司 | File system building method and device in key-value storage system, and electronic device |
| KR101846347B1 (en) * | 2017-08-04 | 2018-04-06 | 주식회사 신영이에스디 | Method and apparatus for managing massive documents |
| US20190087431A1 (en) * | 2017-09-21 | 2019-03-21 | Alibaba Group Holding Limited | Systems, methods, and apparatuses for simplifying filesystem operations utilizing a key-value storage system |
| CN111108493A (en) * | 2017-09-21 | 2020-05-05 | 阿里巴巴集团控股有限公司 | System, method, and apparatus for simplifying file system operations using key-value storage systems |
| CN109344125A (en) * | 2018-08-27 | 2019-02-15 | 维沃移动通信有限公司 | A kind of file name update method and terminal device |
| CN109508557A (en) * | 2018-10-22 | 2019-03-22 | 中国科学院信息工程研究所 | A kind of file path keyword recognition method of association user privacy |
| CN111831208A (en) * | 2019-04-16 | 2020-10-27 | 中移(苏州)软件技术有限公司 | Information processing method and device, terminal equipment and storage medium |
| CN112181910A (en) * | 2020-09-25 | 2021-01-05 | 炬芯科技股份有限公司 | Extended short file name generation method, file access method and equipment |
Non-Patent Citations (1)
| Title |
|---|
| 缪嘉嘉;付印金;毛捍东;: "KingCloud:智能对象归档系统", 计算机科学, no. 2, 15 November 2016 (2016-11-15) * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20230053344A1 (en) * | 2020-02-21 | 2023-02-23 | Nec Corporation | Scenario generation apparatus, scenario generation method, and computer-readablerecording medium |
| US12039253B2 (en) * | 2020-02-21 | 2024-07-16 | Nec Corporation | Scenario generation apparatus, scenario generation method, and computer-readable recording medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112925755B (en) | 2024-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2851772C (en) | Method and apparatus for automatically summarizing the contents of electronic documents | |
| CN107085583B (en) | Electronic document management method and device based on content | |
| CN1378158A (en) | File classifying management system and method for operation system | |
| TW201013433A (en) | Filtering method for the same or similar documents | |
| EP1826692A2 (en) | Query correction using indexed content on a desktop indexer program. | |
| CN107844493B (en) | File association method and system | |
| US6694302B2 (en) | System, method and article of manufacture for personal catalog and knowledge management | |
| CN105589894B (en) | Document index establishing method and device and document retrieval method and device | |
| CN111381913B (en) | Front-end multilingual loading adaptation method, device, computer equipment and storage medium | |
| CN108388556B (en) | Method and system for mining homogeneous entity | |
| CN109408777A (en) | Document processing method, device and archive server based on fast browsing | |
| CN112925755B (en) | File system ultra-long path intelligent storage method and device | |
| CN114706938A (en) | Document tag determination method and device, electronic equipment and storage medium | |
| US20140136963A1 (en) | Intelligent information summarization and display | |
| US20110252313A1 (en) | Document information selection method and computer program product | |
| CN110059214A (en) | A kind of image resource processing method and processing device | |
| CN116450581B (en) | Local quick matching method and system for white list and electronic equipment | |
| CN110955855A (en) | Information interception method, device and terminal | |
| CN107590233A (en) | A kind of file management method and device | |
| US20090313558A1 (en) | Semantic Image Collection Visualization | |
| WO2020071252A1 (en) | Document search device, document search program, and document search method | |
| US10614102B2 (en) | Method and system for creating entity records using existing data sources | |
| US10380195B1 (en) | Grouping documents by content similarity | |
| JP3429225B2 (en) | Storage medium storing data search program | |
| CN111858476A (en) | File processing method and device, electronic equipment and computer readable storage medium |
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 | ||
| CB02 | Change of applicant information |
Address after: 10 / F, R & D building, Hefei Institute of technology innovation, Chinese Academy of Sciences, 2666 Xiyou Road, Hefei hi tech Zone, Hefei, Anhui 230000 Applicant after: Zhongke Meiluo Technology Co., Ltd. Address before: 10 / F, R & D building, Hefei Institute of technology innovation, Chinese Academy of Sciences, 2666 Xiyou Road, Hefei hi tech Zone, Hefei, Anhui 230000 Applicant before: ANHUI ZHONGKE MEILUO INFORMATION TECHNOLOGY CO.,LTD. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |