CN109189728B - Intelligent hardware device, disk data processing method and storage medium - Google Patents

Abstract

The invention discloses an intelligent hardware device, a disk data processing method and a storage medium. The present invention scans the file directory of the data file; extracts one or more directory labels from the scanned file directory; associates and maps each data file under each file directory with the corresponding directory label, and establishes a corresponding relationship; After a file query request with a directory tag sent by a user terminal, determine the preset type file information of each data file corresponding to the directory tag in the query request according to the corresponding relationship data, and generate and feed back the file query result corresponding to the query request. to the user terminal. Compared with the prior art, the present invention improves the efficiency and accuracy of file query, and has simple operation.

Description

Intelligent hardware device, disk data processing method and storage medium

technical field

The present invention relates to the technical field of intelligent hardware, in particular to an intelligent hardware device, a disk data processing method and a storage medium.

Background technique

With the improvement of people's living standards, people's intelligent hardware (intelligent hardware refers to the transformation of traditional equipment through the combination of software and hardware, so that it has intelligent functions, after intelligent, the hardware has the ability to connect, To realize the loading of Internet services, with added value such as big data, for example, the demand for smart phones, smart watches, smart TVs, smart bracelets, etc. is becoming stronger and stronger. One of the most convenient functions that smart hardware provides users is the ability to remotely control smart hardware through remote access. For example, in a communication system architecture consisting of intelligent hardware devices, servers, and user terminals, user terminals often need to perform data interaction with the intelligent hardware devices (eg, file query, storage, deletion, etc.).

However, in the disks of existing smart hardware devices, data files are usually managed in the form of file directories (for example, file query, storage, deletion, etc.). volatile storage, such as a hard disk) for file lookups. The usual query methods include: Method 1. Find the required data files based on the disk directory structure. The disadvantage is that this method requires users to be very familiar with the directory structure of their own disks, organize their own disk directories, and categorize them by themselves, so as to quickly It is tedious and error-prone to find what you want. Method 2: Find the required data file by searching keywords. This method requires the user to know the file name or keyword of the data file they want. method to search, and the speed is slow.

Therefore, how to quickly and accurately query the desired data file after importing the data file into the disk storage has become an urgent technical problem to be solved.

SUMMARY OF THE INVENTION

The main purpose of the present invention is to provide an intelligent hardware device, a disk data processing method and a storage medium, aiming at solving the problem of how to quickly and accurately query the desired data file after importing the data file into the disk for storage.

In order to achieve the above object, the present invention proposes an intelligent hardware device, the intelligent hardware device includes a first memory and a processor, and the first memory stores a disk data processing program that can run on the processor, so When the disk data processing program is executed by the processor, the following steps are implemented:

Scanning step: real-time or timing, or after receiving the classification and storage instruction, scan the file directory of the data file, and the data file is stored in the electronic device communicatively connected to the intelligent hardware device;

Extraction step: extracting one or more directory labels from the scanned file directory according to a predetermined label extraction rule;

The mapping establishment step: respectively associate and map each data file under each described file directory with the corresponding catalog label, and establish the corresponding relationship between the preset type file information of each data file and the catalog label associated with the mapping;

Storage step: storing the corresponding relationship data;

Querying step: after the corresponding user terminal sends a file query request with a directory tag, determine the preset type file information of each data file corresponding to the directory tag in the query request according to the corresponding relationship data, and based on the determined preset file information type file information, generate a file query result corresponding to the query request, and feed back the generated file query result to the user terminal.

Preferably, the electronic device communicatively connected to the intelligent hardware device includes a first storage area and a second storage area, the data file and the file directory of the data file are stored in the first storage area, and the corresponding data file is stored in the first storage area. Relational data is stored in the second storage area.

Preferably, the processor executes the disk data processing program, and after the extraction step, the following steps are also implemented:

Establish associations between individual catalog labels.

Preferably, the predetermined label extraction rule is:

A node tree is established for each directory node of the file directory, the node tree includes a plurality of directory node branches, each directory node branch includes a main directory node and a subdirectory node, and each upper-level directory node is a subordinate directory node. home directory node;

Determine the lowest-level shared directory node in each directory node branch, and the lowest-level shared directory node of a directory node branch refers to all lower-level subdirectory nodes shared with other directory node branches and corresponding to the directory node branch Neither is a directory node that shares a directory node;

Respectively combine the node names of the lowest-level shared directory node and all corresponding upper-level directory nodes of each directory node branch, and combine them together in the order of the positions of the corresponding directory node branches to generate a combined name, and the combined name is The directory label of the corresponding directory node branch.

Preferably, the predetermined label extraction rule is:

Establish a node tree for each directory node of the file directory, the node tree includes a plurality of directory node branches, each directory node branch includes a main directory node and a subdirectory node, and each upper-level directory node is the main directory of its lower-level directory node. node;

Determine the i-th level directory node in each directory node branch respectively, where i is a positive integer greater than 1;

Respectively combine the i-th level directory node of each directory node branch and the node names of all corresponding upper-level directory nodes, according to the position order of the corresponding directory node branch, to generate a combined name, and the combined name is The directory label of the corresponding directory node branch.

Preferably, the processor executes the disk data processing program, and before the storing step, further implements the following steps:

Determine the number of data files corresponding to each directory label respectively;

Sort each directory label according to the size order of the number of corresponding data files;

When the size order is from large to small, the preset number of directory labels sorted in the front are retained, and other directory labels other than the reserved directory labels are deleted, or, when the size order is from small to large When ordering, keep the preset number of catalog labels sorted after, and delete the catalog labels other than the reserved catalog labels.

Preferably, the processor executes the disk data processing program, and before the storing step, further implements the following steps:

Determine the number of data files corresponding to each directory label respectively;

When the number of data files corresponding to the directory label is less than the preset threshold, the directory label is deleted.

In addition, in order to achieve the above object, the present invention also proposes an intelligent hardware device, the intelligent hardware device includes a second memory and a processor, and the second memory stores disk data processing that can run on the processor. The program, when the disk data processing program is executed by the processor, implements the following steps:

Scanning step: real-time or timing, or after receiving the classification and storage instruction, scan the file directory of the data file, and the data file is stored in the second memory;

Extraction step: extracting one or more directory labels from the scanned file directory according to a predetermined label extraction rule;

The mapping establishment step: respectively associate and map each data file under each described file directory with the corresponding catalog label, and establish the corresponding relationship between the preset type file information of each data file and the catalog label associated with the mapping;

Storage step: storing the corresponding relationship data to;

Querying step: responding to a file query request with a directory tag sent by a user terminal, determining the preset type file information of each data file corresponding to the directory tag in the query request according to the corresponding relationship data, and based on the determined preset type file information, generate a file query result corresponding to the query request, and feed back the generated file query result to the user terminal.

Preferably, the second memory further includes a first storage area and a second storage area, the data file and the file directory of the data file are stored in the first storage area, and the corresponding relationship data is stored in the first storage area. in the second storage area.

Preferably, the processor executes the disk data processing program, and after the extraction step, the following steps are also implemented:

Establish associations between individual catalog labels.

Preferably, the predetermined label extraction rule is:

A node tree is established for each directory node of the file directory, the node tree includes a plurality of directory node branches, each directory node branch includes a main directory node and a subdirectory node, and each upper-level directory node is a subordinate directory node. home directory node;

Determine the lowest-level shared directory node in each directory node branch, and the lowest-level shared directory node of a directory node branch refers to all lower-level subdirectory nodes shared with other directory node branches and corresponding to the directory node branch Neither is a directory node that shares a directory node;

Respectively combine the node names of the lowest-level shared directory node and all corresponding upper-level directory nodes of each directory node branch, and combine them together in the order of the positions of the corresponding directory node branches to generate a combined name, and the combined name is The directory label of the corresponding directory node branch.

Preferably, the predetermined label extraction rule is:

Establish a node tree for each directory node of the file directory, the node tree includes a plurality of directory node branches, each directory node branch includes a main directory node and a subdirectory node, and each upper-level directory node is the main directory of its lower-level directory node. node;

Determine the i-th level directory node in each directory node branch respectively, where i is a positive integer greater than 1;

Respectively combine the i-th level directory node of each directory node branch and the node names of all corresponding upper-level directory nodes, according to the position order of the corresponding directory node branch, to generate a combined name, and the combined name is The directory label of the corresponding directory node branch.

Preferably, the processor executes the disk data processing program, and before the storing step, further implements the following steps:

Determine the number of data files corresponding to each directory label respectively;

Sort each directory label according to the size order of the number of corresponding data files;

When the size order is from large to small, the preset number of directory labels sorted in the front are retained, and other directory labels other than the reserved directory labels are deleted, or, when the size order is from small to large When ordering, keep the preset number of catalog labels sorted after, and delete the catalog labels other than the reserved catalog labels.

Preferably, the processor executes the disk data processing program, and before the storing step, further implements the following steps:

Determine the number of data files corresponding to each directory label respectively;

When the number of data files corresponding to the directory label is less than the preset threshold, the directory label is deleted.

In addition, in order to achieve the above object, the present invention also proposes a disk data processing method, which is applicable to intelligent hardware devices that store data files, or to intelligent hardware devices that are communicatively connected to electronic devices that store the data files. equipment, characterized in that the method includes the steps:

Scanning step: scan the file directory of the data file in real time or timed, or after receiving the classification and storage instruction;

Extraction step: extracting one or more directory labels from the scanned file directory according to a predetermined label extraction rule;

The mapping establishment step: respectively associate and map each data file under each described file directory with the corresponding catalog label, and establish the corresponding relationship between the preset type file information of each data file and the catalog label associated with the mapping;

Storage step: storing the corresponding relationship data;

Querying step: responding to a file query request with a directory tag sent by a user terminal, determining the preset type file information of each data file corresponding to the directory tag in the query request according to the corresponding relationship data, and based on the determined preset type file information, generate a file query result corresponding to the query request, and feed back the generated file query result to the user terminal.

Preferably, after the extracting step, the method further comprises:

Establish associations between individual catalog labels.

Preferably, the predetermined label extraction rule is:

A node tree is established for each directory node of the file directory, the node tree includes a plurality of directory node branches, each directory node branch includes a main directory node and a subdirectory node, and each upper-level directory node is a subordinate directory node. home directory node;

Determine the lowest-level shared directory node in each directory node branch, and the lowest-level shared directory node of a directory node branch refers to all lower-level subdirectory nodes shared with other directory node branches and corresponding to the directory node branch Neither is a directory node that shares a directory node;

Respectively combine the node names of the lowest-level shared directory node and all corresponding upper-level directory nodes of each directory node branch, and combine them together in the order of the positions of the corresponding directory node branches to generate a combined name, and the combined name is The directory label of the corresponding directory node branch.

Preferably, the predetermined label extraction rule is:

Establish a node tree for each directory node of the file directory, the node tree includes a plurality of directory node branches, each directory node branch includes a main directory node and a subdirectory node, and each upper-level directory node is the main directory of its lower-level directory node. node;

Determine the i-th level directory node in each directory node branch respectively, where i is a positive integer greater than 1;

Respectively combine the i-th level directory node of each directory node branch and the node names of all corresponding upper-level directory nodes, according to the position order of the corresponding directory node branch, to generate a combined name, and the combined name is The directory label of the corresponding directory node branch.

Preferably, before the storing step, the method further comprises:

Determine the number of data files corresponding to each directory label respectively;

Sort each directory label according to the size order of the number of corresponding data files;

When the size order is from large to small, the preset number of directory labels sorted in the front are retained, and other directory labels other than the reserved directory labels are deleted, or, when the size order is from small to large When ordering, keep the preset number of catalog labels sorted after, and delete the catalog labels other than the reserved catalog labels.

Preferably, before the storing step, the method further comprises:

Determine the number of data files corresponding to each directory label respectively;

When the number of data files corresponding to the directory label is less than the preset threshold, the directory label is deleted.

In addition, in order to achieve the above object, the present invention also provides a computer-readable storage medium, the computer-readable storage medium stores a disk data processing program, and the disk data processing program can be executed by at least one processor, so that all The at least one processor executes the steps of the disk data processing method according to any one of the above.

The present invention scans the file directory of the data file; extracts one or more directory labels from the scanned file directory; associates and maps each data file under each file directory with the corresponding directory label, and establishes a corresponding relationship; After a file query request with a directory tag sent by a user terminal, determine the preset type file information of each data file corresponding to the directory tag in the query request according to the corresponding relationship data, and generate and feed back the file query result corresponding to the query request. to the user terminal. Compared with the prior art, the present invention establishes a mapping relationship between the directory label extracted from the file directory and the data file. When performing file query, only the user terminal needs to provide the directory label, and the corresponding data can be quickly and accurately queried. file, the efficiency and accuracy of file query are improved, and the operation is simple.

Description of drawings

In order to explain the embodiments of the present invention or the technical solutions in the prior art more clearly, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some embodiments of the present invention, and for those of ordinary skill in the art, other drawings can also be obtained according to the structures shown in these drawings without creative efforts.

1 is a schematic diagram of an optional operating environment of the first, second, and third embodiments of a disk data processing program according to the present invention;

2 is a schematic diagram of another optional operating environment of the first, second, and third embodiments of the disk data processing program of the present invention;

3 is a program module diagram of the first and second embodiments of the disk data processing program of the present invention;

4 is a schematic diagram of a node tree of a file directory;

Fig. 5 is the program module diagram of the third embodiment of the disk data processing program of the present invention;

FIG. 6 is a schematic flowchart of the first embodiment of the disk data processing method of the present invention;

7 is a schematic flowchart of a second embodiment of a disk data processing method according to the present invention;

FIG. 8 is a schematic flowchart of a third embodiment of a method for processing disk data according to the present invention.

The realization, functional characteristics and advantages of the present invention will be further described with reference to the accompanying drawings in conjunction with the embodiments.

Detailed ways

The principles and features of the present invention will be described below with reference to the accompanying drawings. The examples are only used to explain the present invention, but not to limit the scope of the present invention.

The invention provides a disk data processing program.

Please refer to FIG. 1 , which is a schematic diagram of an optional operating environment of the first, second, and third embodiments of the disk data processing program 10 of the present invention.

In this embodiment, the present invention can be applied to an application environment including, but not limited to, an intelligent hardware device 1 and a user terminal 2 . The intelligent hardware device 1 is in communication connection with the user terminal 2 .

The intelligent hardware device 1 is configured to receive and respond to a service request (eg, a file query request, etc.) sent by the user terminal 2 , and feed back the processing result of the service request to the user terminal 2 .

The user terminal 2 is configured to send a service request to the intelligent hardware device 1 and receive the service request processing result fed back by the intelligent hardware device 1 .

In this embodiment, the disk data processing program 10 is installed and run in the intelligent hardware device 1 . The intelligent hardware device 1 may be a computing device such as a desktop computer, a notebook, a palmtop computer, and a server. The intelligent hardware device 1 may include, but is not limited to, a memory 11 , a processor 12 and a display 13 . Figure 2 only shows the intelligent hardware device 1 with components 11-13, but it should be understood that implementation of all shown components is not required, and more or fewer components may be implemented instead.

The memory 11 may be an internal storage unit of the intelligent hardware device 1 in some embodiments, such as a hard disk or a memory of the intelligent hardware device 1 . The memory 11 may also be an external storage device of the smart hardware device 1 in other embodiments, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, flash memory card (Flash Card), etc. Further, the memory 11 may also include both an internal storage unit of the intelligent hardware device 1 and an external storage device. The memory 11 is used for storing application software and various types of data installed in the intelligent hardware device 1 , such as program codes of the disk data processing program 10 , and the like. The memory 11 may also be used to temporarily store data that has been output or is to be output. In this embodiment, the above-mentioned memory 11 includes a first storage area 111 (eg, a local database) and a second storage area 112, and the first storage area 111 is used for storing data files.

The processor 12 may be a central processing unit (Central Processing Unit, CPU), a microprocessor or other data processing chips in some embodiments, and is used to execute program codes or process data stored in the memory 11, for example, to perform disk data processing Procedure 10 et al.

In some embodiments, the display 13 may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode, organic light-emitting diode) touch device, and the like. The display 13 is used for displaying information processed in the intelligent hardware device 1 and for displaying a visual user interface. The components 11-13 of the intelligent hardware device 1 communicate with each other via a program bus.

Please refer to FIG. 2 , which is a schematic diagram of another optional operating environment of the first, second, and third embodiments of the disk data processing program 10 of the present invention.

In this embodiment, the present invention can also be applied to an application environment including, but not limited to, an intelligent hardware device 1 , a user terminal 2 , and an electronic device 3 . The intelligent hardware device 1 is in communication connection with the user terminal 2 and the electronic device 3 respectively.

The difference between FIG. 2 and FIG. 1 is that the first storage area 111 and the second storage area 112 are provided in the electronic device 3 (eg, personal computer, plug-in hard disk, smart memory card, etc.) that is communicatively connected to the intelligent hardware device 1 .

It should be noted that, the above-mentioned second storage area 112 may also be provided in any other applicable device or device except the intelligent hardware device 1 and the electronic device 3 .

Please refer to FIG. 3 , which is a program module diagram of the first and second embodiments of the disk data processing program 10 of the present invention. In this embodiment, the disk data processing program 10 can be divided into one or more modules, and one or more modules are stored in the memory 11 and executed by one or more processors (the processor 12 in this embodiment) performed to complete the present invention. For example, in FIG. 3 , the disk data processing program 10 can be divided into a scanning module 101 , an extraction module 102 , a mapping establishment module 103 , a storage module 104 and a query module 105 . The modules referred to in the present invention refer to a series of computer program instruction segments capable of completing specific functions, and are more suitable for describing the execution process of the disk data processing program 10 in the intelligent hardware device 1 than programs, wherein:

The scanning module 101 is configured to scan the file directory of the data file in real time or timing, or after receiving the classification and storage instruction.

The above-mentioned data file can be stored in the above-mentioned first storage area 111 , and the file directory of the data file can be stored in the above-mentioned second storage area 112 . The extraction module 102 is configured to extract one or more directory tags from the scanned file directory according to a predetermined tag extraction rule.

Specifically, taking the file directory D:\PDF\Setup Files as an example, label extraction is performed on the file directory to generate directory labels "D" and "PDF".

Preferably, in this embodiment, the above-mentioned predetermined label extraction rules may refer to the following two schemes:

Option One:

First, a node tree is established for each directory node of the file directory, and the node tree includes a plurality of directory node branches (for example, the directory node branches "X1-X2-X3-X4", "X1-X2- X5-X6", "X1-X2-X5-X7", "X1-Z1-Z2-Z3", "X1-Y1-Y2", etc.). Each directory node branch includes a main directory node and a sub-directory node, and each upper-level directory node is the main directory node of its subordinate directory node. For example, node X1 is the main directory node of nodes X1, Z1, and Y1, and node X2 is a node. The home directory node of X3 and X5.

Then, the lowest-level shared directory node in each directory node branch is determined, and the lowest-level shared directory node of a directory node branch refers to all subordinate children shared with other directory node branches and corresponding to the directory node branch None of the directory nodes are directory nodes that share a directory node. For example, the lowest-level shared directory node corresponding to the directory node branch "X1-X2-X3-X4" is node X2, and the lowest-level shared directory corresponding to "X1-X2-X5-X6" and "X1-X2-X5-X7" The nodes are all node X5.

Finally, the lowermost common directory node of each determined directory node branch and the node names of all corresponding upper-level directory nodes are combined together according to the position sequence of the corresponding directory node branch to generate a combined name. The combination name is the directory label of the corresponding directory node branch, for example, the directory label corresponding to the directory node branch "X1-X2-X3-X4" is "X1-X2".

Option II:

First, a node tree is built for each directory node of the file directory, and the node tree includes a plurality of directory node branches (for example, the directory node branches "X1-X2-X3-X4", "X1-X2-X5- X6", "X1-X2-X5-X7", "X1-Z1-Z2-Z3", "X1-Y1-Y2", etc.). Each directory node branch includes a main directory node and a sub-directory node, and each upper-level directory node is the main directory node of its subordinate directory node. For example, node X1 is the main directory node of nodes X1, Z1, and Y1, and node X2 is a node. The home directory node of X3 and X5.

Then, determine the i-th level directory node in each directory node branch respectively, i is a positive integer greater than 1, for example, i can be 2, and the directory node branch "X1-X2-X3-X4" level 2 directory node is "X2".

Finally, the determined i-th level directory node of each directory node branch and the node names of all corresponding upper-level directory nodes are combined together according to the position sequence of the corresponding directory node branch to generate a combined name. The combination name is the directory label of the corresponding directory node branch, for example, the directory label corresponding to the directory node branch "X1-X2-X3-X4" is "X1-X2".

The mapping establishment module 103 is used to associate and map each data file under each described file directory with the corresponding catalog label, and establish the corresponding relationship between the preset type file information of each data file and the catalog label associated with the mapping .

Specifically, each data file under each of the file directories is marked with a corresponding directory label. For example, if the directory label corresponding to the file directory A1 is a1, and the directory label corresponding to the file directory A2 is a2. Each data file under the file directory A1 is associated and mapped with the directory label a1, and each data file under the file directory A2 is associated and mapped with the directory label a2. A corresponding relationship is established between the preset type file information of each data file and the directory label associated with the mapping.

The above-mentioned preset type file information includes storage path information, file name, and the like.

The storage module 104 is configured to store the corresponding relationship data. For example, the storage module 104 stores the corresponding relationship data in the second storage area 112 .

The query module 105 is configured to respond to the file query request with the directory label sent by the user terminal, determine the preset type file information of each data file corresponding to the directory label in the query request according to the corresponding relationship data, and based on the determined Preset type file information, generate a file query result (eg, a file query list) corresponding to the query request, and feed back the generated file query result to the user terminal.

This embodiment scans the file directory of the data file; extracts one or more directory labels from the scanned file directory; associates and maps each data file under each file directory with the corresponding directory label, and establishes a corresponding relationship; After a file query request with a directory tag sent by a user terminal, determine the preset file information of each data file corresponding to the directory tag in the query request according to the corresponding relationship data, and generate and feed back the file query corresponding to the query request. result to the user terminal. Compared with the prior art, in this embodiment, a mapping relationship is established between the directory labels extracted from the file directory and the data files. When performing file query, only the user terminal needs to provide the directory label to quickly and accurately query the corresponding data files. The data file improves the efficiency and accuracy of file query, and the operation is simple.

Referring to FIG. 3 again, in the second embodiment of the disk data processing program 10 of the present invention, on the basis of the first embodiment, the mapping establishment module 103 is further configured to establish an association relationship between each directory label.

For example, the directory level: /photo/shenzheng/nanshan/dsc_001.jpg, two directory labels can be proposed according to the upper two-level directory name of this dsc_001.jpg file: shenzheng, nanshan, and when opening the directory label of shenzheng, Also shows an associated directory label associated with it: nanshan.

There are several ways to associate a tag scene:

Method 1. The two tags are in the relationship between the upper and lower layers. As in the previous example, the two tags of shenzheng and Nanshan belong to the upper and lower relationship, and there is the same file dsc_001.jpg under the two tags, so they are associated tags.

Method 2. Both tags are associated with the A file. If the user manually adds a "landscape" label to the /photo/shenzheng/nanshan/dsc_001.jpg file, the labels "shenzheng", "nanshan", and "landscape" are all associated labels. The Associated Labels column of both displays the other two associated labels.

Method 3. Labels with the same name: According to the /photo/shenzheng/nanshan/dsc_001.jpg file, you can extract: two labels: shenzheng, nanshan, according to /video/shenzheng/DJI_002.MOV, you can also extract: video, shenzheng two labels, The shenzheng tag already exists, so the shenzheng tag is associated with the dsc_001.jpg and DJI_002.MOV files, and nanshan and video are also associated with these two files, so: shenzheng, Nanshan, and video are all associated tags.

This embodiment can further improve the response accuracy of the user's file query request and effectively improve the query efficiency by establishing an association relationship between each directory label.

As shown in FIG. 5, FIG. 5 is a program module diagram of the third embodiment of the disk data processing program 10 of the present invention.

On the basis of the first and second embodiments, this embodiment further includes a deletion module 106, and the deletion module 106 is used for:

First, the number of data files corresponding to each directory label is determined respectively.

Then, when the number of data files corresponding to the directory label is less than the preset threshold, the directory label is deleted.

In this embodiment, the above-mentioned deletion module 106 is also used for:

First, the number of data files corresponding to each directory label is determined respectively.

Then, sort each directory label according to the size order of the number of corresponding data files. For example, sort from largest to smallest or smallest to largest.

Finally, when the size order is from the largest to the smallest, the preset number of catalog labels in the first order are retained, and other catalog labels other than the reserved catalog labels are deleted. Or, if the size order is from small to large, the preset number of catalog labels that are sorted later are reserved, and other catalog labels other than the reserved catalog labels are deleted.

Deleting part of the target tags in this embodiment is beneficial to reduce the occupancy rate of the storage space.

In addition, the present invention provides a disk data processing method.

As shown in FIG. 6 , FIG. 6 is a schematic flowchart of the first embodiment of the disk data processing method according to the present invention.

In this embodiment, the method is applicable to an intelligent hardware device that stores a data file (for example, an intelligent hardware device configured with a first storage area and a second storage area), or to an electronic device that stores the data file. A device (eg, an electronic device configured with a first storage area and a second storage area) is an intelligent hardware device communicatively connected, the method comprising:

In step S10, the file directory of the data file is scanned in real time or timing, or after receiving the classification and storage instruction.

The data file may be stored in the first storage area, and the file directory of the data file may be stored in the second storage area. In other embodiments than this embodiment, the file directory of the data file may also be stored in any other applicable device or device except the intelligent hardware device and the electronic device.

Step S20: Extract one or more directory labels from the scanned file directory according to a predetermined label extraction rule.

Specifically, taking the file directory D:\PDF\Setup Files as an example, label extraction is performed on the file directory to generate directory labels "D" and "PDF".

Preferably, in this embodiment, the above-mentioned predetermined label extraction rules may refer to the following two schemes:

Option One:

First, a node tree is established for each directory node of the file directory, and the node tree includes a plurality of directory node branches (for example, the directory node branches "X1-X2-X3-X4", "X1-X2- X5-X6", "X1-X2-X5-X7", "X1-Z1-Z2-Z3", "X1-Y1-Y2", etc.). Each directory node branch includes a main directory node and a sub-directory node, and each upper-level directory node is the main directory node of its subordinate directory node. For example, node X1 is the main directory node of nodes X1, Z1, and Y1, and node X2 is a node. The home directory node of X3 and X5.

Then, the lowest-level shared directory node in each directory node branch is determined, and the lowest-level shared directory node of a directory node branch refers to all subordinate children shared with other directory node branches and corresponding to the directory node branch None of the directory nodes are directory nodes that share a directory node. For example, the lowest-level shared directory node corresponding to the directory node branch "X1-X2-X3-X4" is node X2, and the lowest-level shared directory corresponding to "X1-X2-X5-X6" and "X1-X2-X5-X7" The nodes are all node X5.

Finally, the lowermost common directory node of each determined directory node branch and the node names of all corresponding upper-level directory nodes are combined together according to the position sequence of the corresponding directory node branch to generate a combined name. The combination name is the directory label of the corresponding directory node branch, for example, the directory label corresponding to the directory node branch "X1-X2-X3-X4" is "X1-X2".

Option II:

First, a node tree is built for each directory node of the file directory, and the node tree includes a plurality of directory node branches (for example, the directory node branches "X1-X2-X3-X4", "X1-X2-X5- X6", "X1-X2-X5-X7", "X1-Z1-Z2-Z3", "X1-Y1-Y2", etc.). Each directory node branch includes a main directory node and a sub-directory node, and each upper-level directory node is the main directory node of its subordinate directory node. For example, node X1 is the main directory node of nodes X1, Z1, and Y1, and node X2 is a node. The home directory node of X3 and X5.

Then, determine the i-th level directory node in each directory node branch respectively, i is a positive integer greater than 1, for example, i can be 2, and the directory node branch "X1-X2-X3-X4" level 2 directory node is "X2".

Finally, the determined i-th level directory node of each directory node branch and the node names of all corresponding upper-level directory nodes are combined together according to the position sequence of the corresponding directory node branch to generate a combined name. The combination name is the directory label of the corresponding directory node branch, for example, the directory label corresponding to the directory node branch "X1-X2-X3-X4" is "X1-X2".

Step S30 , associate and map each data file under each of the file directories with the corresponding directory label, and establish a corresponding relationship between the preset type file information of each data file and the associated mapped directory label.

Specifically, each data file under each of the file directories is marked with a corresponding directory label. For example, if the directory label corresponding to the file directory A1 is a1, and the directory label corresponding to the file directory A2 is a2. Each data file under the file directory A1 is associated and mapped with the directory label a1, and each data file under the file directory A2 is associated and mapped with the directory label a2. A corresponding relationship is established between the preset type file information of each data file and the directory label associated with the mapping.

The above-mentioned preset type file information includes storage path information, file name, and the like.

Step S40, storing the corresponding relationship data. For example, the corresponding relationship data is stored in the second storage area.

Step S50, after responding to the file query request with the directory tag sent by the user terminal, determine the preset type file information of each data file corresponding to the directory tag in the query request according to the corresponding relationship data, based on the determined preset file information. type file information, generate a file query result (eg, a file query list) corresponding to the query request, and feed back the generated file query result to the user terminal.

This embodiment scans the file directory of the data file; extracts one or more directory labels from the scanned file directory; associates and maps each data file under each file directory with the corresponding directory label, and establishes a corresponding relationship; After a file query request with a directory tag sent by a user terminal, determine the preset file information of each data file corresponding to the directory tag in the query request according to the corresponding relationship data, and generate and feed back the file query corresponding to the query request. result to the user terminal. Compared with the prior art, in this embodiment, a mapping relationship is established between the directory labels extracted from the file directory and the data files. When performing file query, only the user terminal needs to provide the directory label to quickly and accurately query the corresponding data files. The data file improves the efficiency and accuracy of file query, and the operation is simple.

As shown in FIG. 7 , FIG. 7 is a schematic flowchart of a second embodiment of a disk data processing method according to the present invention.

This embodiment is based on the first embodiment, after step S20, the method further includes:

Step S60, establishing an association relationship between each directory label.

For example, the directory level: /photo/shenzhen/nanshan/dsc_001.jpg, two directory labels can be proposed according to the upper two-level directory name of the dsc_001.jpg file: shenzhen, nanshan, and when opening the directory label of shenzhen, Also shows an associated directory label associated with it: nanshan.

There are several ways to associate a tag scene:

Method 1. The two tags are in the relationship between the upper and lower layers. For example, in the previous example, the two tags shenzhen and nanshan belong to the upper and lower relationship. There is the same file dsc_001.jpg under both tags, so they are associated tags.

Method 2. Both tags are associated with the A file. If the user manually adds a "landscape" label to the /photo/shenzhen/nanshan/dsc_001.jpg file, the labels "shenzhen", "nanshan", and "landscape" are all associated labels. The Associated Labels column of both displays the other two associated labels.

Method 3. Labels with the same name: According to the /photo/shenzhen/nanshan/dsc_001.jpg file, you can extract: two labels: shenzhen, nanshan, according to /video/shenzhen/DJI_002.MOV, you can also extract: video, shenzhen two labels, The shenzhen tag already exists, so the shenzhen tag is associated with the dsc_001.jpg and DJI_002.MOV files, and nanshan and video are also associated with these two files, so: shenzhen, nanshan, and video are all associated tags.

This embodiment can further improve the response accuracy of the user's file query request and effectively improve the query efficiency by establishing an association relationship between each directory label.

As shown in FIG. 8 , FIG. 8 is a schematic flowchart of a third embodiment of a method for processing disk data according to the present invention.

In this embodiment, on the basis of the first and second embodiments, before step S40, the method further includes:

Step S70, respectively determining the number of data files corresponding to each directory label.

Step S80, when the number of data files corresponding to the directory label is less than a preset threshold, delete the directory label.

In this embodiment, the above steps S70 and S80 can be replaced by the following steps:

First, the number of data files corresponding to each directory label is determined respectively.

Then, sort each directory label according to the size order of the number of corresponding data files. For example, sort from largest to smallest or smallest to largest.

Finally, when the size order is from the largest to the smallest, the preset number of catalog labels in the first order are retained, and other catalog labels other than the reserved catalog labels are deleted. Or, if the size order is from small to large, the preset number of catalog labels that are sorted later are reserved, and other catalog labels other than the reserved catalog labels are deleted.

Deleting part of the target tags in this embodiment is beneficial to reduce the occupancy rate of the storage space.

Further, the present invention also provides a computer-readable storage medium, the computer-readable storage medium stores a disk data processing program, and the disk data processing program can be executed by at least one processor, so that the at least one process The processor executes the disk data processing method in any of the above embodiments.

The above descriptions are only the preferred embodiments of the present invention, and are not intended to limit the scope of the present invention. Under the inventive concept of the present invention, the equivalent structural transformations made by the contents of the description and drawings of the present invention, or the direct/indirect application Other related technical fields are included in the scope of patent protection of the present invention.

Claims (14)

1. An intelligent hardware device, comprising a first memory and a processor, wherein the first memory stores a disk data processing program operable on the processor, and the disk data processing program, when executed by the processor, implements the steps of:

a scanning step: scanning a file directory of data files in real time or at regular time or after receiving a classifying and storing instruction, wherein the data files are stored in electronic equipment in communication connection with the intelligent hardware equipment;

the extraction step comprises: extracting one or more directory tags from the scanned file directory according to a predetermined tag extraction rule that: establishing a node tree for each directory node of the file directory, wherein the node tree comprises a plurality of directory node branches, each directory node branch comprises a main directory node and a subdirectory node, and each superior directory node is a main directory node of a subordinate directory node of the superior directory node; determining the lowest common directory node in each directory node branch, wherein the lowest common directory node of one directory node branch refers to a directory node which is shared by other directory node branches and all corresponding lower subdirectory nodes in the directory node branches are not common directory nodes; respectively combining the determined lowest common directory node of each directory node branch and the node names of all the corresponding upper directory nodes according to the position sequence of the corresponding directory node branch to generate a combined name, wherein the combined name is the directory label of the corresponding directory node branch;

a mapping establishing step: respectively associating and mapping each data file under each file directory with a corresponding directory label, and establishing a corresponding relation between preset type file information of each data file and the directory label associated and mapped, wherein the preset type file information comprises storage path information and a file name;

a storage step: storing the corresponding relation data;

and (3) query step: responding to a file query request with a directory tag sent by a user terminal, determining preset type file information of each data file corresponding to the directory tag in the query request according to the corresponding relation data, generating a file query result corresponding to the query request based on the determined preset type file information, and feeding the generated file query result back to the user terminal.

2. The intelligent hardware device of claim 1, wherein the electronic device communicatively coupled to the intelligent hardware device comprises a first storage area and a second storage area, wherein the data files and file directories of the data files are stored in the first storage area, and wherein the correspondence data is stored in the second storage area.

3. The intelligent hardware device of claim 1, wherein said processor executes said disk data handler, and after said extracting step, further performs the steps of:

and establishing an association relation among the directory labels.

4. The intelligent hardware device of any of claims 1-3, wherein the predetermined tag extraction rule is:

establishing a node tree for each directory node of a file directory, wherein the node tree comprises a plurality of directory node branches, each directory node branch comprises a main directory node and a subdirectory node, and each superior directory node is a main directory node of a subordinate directory node of the superior directory node;

respectively determining the ith-level directory node in each directory node branch, wherein i is a positive integer greater than 1;

and respectively combining the determined ith-level directory node of each directory node branch and the node names of all the corresponding upper-level directory nodes according to the position sequence of the corresponding directory node branch to generate a combined name, wherein the combined name is the directory label of the corresponding directory node branch.

5. The intelligent hardware device according to any of claims 1 to 3, wherein the processor executes the disk data handler, further implementing, prior to the storing step, the steps of:

respectively determining the number of data files corresponding to each directory label;

sequencing the directory labels according to the size sequence of the number of the corresponding data files;

when the size sequence is from large to small, the preset number of directory tags in the front are reserved, and the other directory tags except the reserved directory tags are deleted, or when the size sequence is from small to large, the preset number of directory tags in the back are reserved, and the other directory tags except the reserved directory tags are deleted.

6. The intelligent hardware device according to any of claims 1 to 3, wherein the processor executes the disk data handler, further implementing, prior to the storing step, the steps of:

respectively determining the number of data files corresponding to each directory label;

and deleting the directory label when the number of the data files corresponding to the directory label is smaller than a preset threshold value.

7. An intelligent hardware device, comprising a second memory and a processor, wherein the second memory stores a disk data processing program operable on the processor, and the disk data processing program, when executed by the processor, implements the steps of:

a scanning step: scanning a file directory of data files in real time or at regular time or after receiving a classifying and storing instruction, wherein the data files are stored in the second memory;

the extraction step comprises: extracting one or more directory tags from the scanned file directory according to a predetermined tag extraction rule that: establishing a node tree for each directory node of the file directory, wherein the node tree comprises a plurality of directory node branches, each directory node branch comprises a main directory node and a subdirectory node, and each higher-level directory node is a main directory node of a lower-level directory node of the higher-level directory node; determining the lowest common directory node in each directory node branch, wherein the lowest common directory node of one directory node branch refers to a directory node which is shared by other directory node branches and all corresponding lower subdirectory nodes in the directory node branches are not common directory nodes; respectively combining the determined lowest common directory node of each directory node branch and the node names of all the corresponding upper directory nodes according to the position sequence of the corresponding directory node branch to generate a combined name, wherein the combined name is the directory label of the corresponding directory node branch;

a mapping establishing step: respectively associating and mapping each data file under each file directory with a corresponding directory label, and establishing a corresponding relation between preset type file information of each data file and the directory label associated and mapped, wherein the preset type file information comprises storage path information and a file name;

a storage step: storing the corresponding relation data;

and (3) query step: responding to a file query request with a directory tag sent by a user terminal, determining preset type file information of each data file corresponding to the directory tag in the query request according to the corresponding relation data, generating a file query result corresponding to the query request based on the determined preset type file information, and feeding the generated file query result back to the user terminal.

8. The intelligent hardware device of claim 7, wherein the second memory further comprises a first storage area and a second storage area, the data files and a file directory of the data files are stored in the first storage area, and the correspondence data is stored in the second storage area.

9. A disk data processing method is suitable for an intelligent hardware device with a data file stored therein or an intelligent hardware device in communication connection with an electronic device with the data file stored therein, and is characterized by comprising the following steps:

a scanning step: scanning a file directory of the data file in real time or at regular time or after receiving a classifying and storing instruction;

the extraction step comprises: extracting one or more directory tags from the scanned file directory according to predetermined tag extraction rules, the predetermined tag extraction rules being: establishing a node tree for each directory node of the file directory, wherein the node tree comprises a plurality of directory node branches, each directory node branch comprises a main directory node and a subdirectory node, and each superior directory node is a main directory node of a subordinate directory node of the superior directory node; determining the lowest common directory node in each directory node branch, wherein the lowest common directory node of one directory node branch refers to a directory node which is shared by other directory node branches and all corresponding lower subdirectory nodes in the directory node branches are not common directory nodes; respectively combining the determined lowest common directory node of each directory node branch and the node names of all the corresponding upper directory nodes according to the position sequence of the corresponding directory node branch to generate a combined name, wherein the combined name is the directory label of the corresponding directory node branch;

a mapping establishing step: respectively associating and mapping each data file under each file directory with a corresponding directory label, and establishing a corresponding relation between preset type file information of each data file and the directory label associated and mapped, wherein the preset type file information comprises storage path information and a file name;

a storage step: storing the corresponding relation data;

and (3) query step: responding to a file query request with a directory tag sent by a user terminal, determining preset type file information of each data file corresponding to the directory tag in the query request according to the corresponding relation data, generating a file query result corresponding to the query request based on the determined preset type file information, and feeding the generated file query result back to the user terminal.

10. The disk data processing method of claim 9, wherein after the extracting step, the method further comprises:

and establishing an association relation among the directory labels.

11. The magnetic disk data processing method according to claim 9 or 10, wherein the predetermined tag extraction rule is:

establishing a node tree for each directory node of a file directory, wherein the node tree comprises a plurality of directory node branches, each directory node branch comprises a main directory node and a subdirectory node, and each superior directory node is a main directory node of a subordinate directory node of the superior directory node;

respectively determining the ith-level directory node in each directory node branch, wherein i is a positive integer greater than 1;

and respectively combining the determined ith-level directory node of each directory node branch and the node names of all the corresponding upper-level directory nodes according to the position sequence of the corresponding directory node branch to generate a combined name, wherein the combined name is the directory label of the corresponding directory node branch.

12. A method of processing disc data according to claim 9 or 10, wherein prior to said storing step, the method further comprises:

respectively determining the number of data files corresponding to each directory label;

sequencing the directory labels according to the size sequence of the number of the corresponding data files;

when the size sequence is from large to small, the preset number of directory tags in the front are reserved, and the other directory tags except the reserved directory tags are deleted, or when the size sequence is from small to large, the preset number of directory tags in the back are reserved, and the other directory tags except the reserved directory tags are deleted.

13. A method of processing disc data according to claim 9 or 10, wherein prior to said storing step, the method further comprises:

respectively determining the number of data files corresponding to each directory label;

and deleting the directory label when the number of the data files corresponding to the directory label is smaller than a preset threshold value.

14. A computer-readable storage medium storing a disk data processing program executable by at least one processor to cause the at least one processor to perform the steps of the disk data processing method according to any one of claims 9 to 13.

Images