CN113127519A

CN113127519A - File query method and device, computer equipment and storage medium

Info

Publication number: CN113127519A
Application number: CN202110482669.9A
Authority: CN
Inventors: 冯辉
Original assignee: Ping An Puhui Enterprise Management Co Ltd
Current assignee: Ping An Puhui Enterprise Management Co Ltd
Priority date: 2021-04-30
Filing date: 2021-04-30
Publication date: 2021-07-16
Anticipated expiration: 2041-04-30
Also published as: CN113127519B

Abstract

The application relates to the technical field of data processing, and discloses a file query method, which comprises the following steps: analyzing in advance to obtain content information of files in each layer of directory, and extracting a first keyword to generate directory information; extracting a second keyword from the file access request; searching a first keyword matched with the second keyword from the directory information corresponding to the initial layer directory to search whether a target file exists in the directory corresponding to the directory information; when the target file is not inquired in the current directory, detecting whether the directory hierarchy corresponding to the current directory belongs to the upper-level directory hierarchy of a preset hierarchy, if so, entering the next-level directory to inquire the target file, and otherwise, judging that the target file is unsuccessfully inquired; and when the target file is obtained through query, decompressing the target file into a cache. The application also relates to blockchain techniques. The application also discloses a file query device, computer equipment and a computer readable storage medium. The file query method and the file query device improve the efficiency of file query.

Description

File query method and device, computer equipment and storage medium

Technical Field

The present application relates to the field of data processing technologies, and in particular, to a file query method, a file query apparatus, a computer device, and a computer-readable storage medium.

Background

At present, a general file storage system organizes metadata in a traditional directory tree form, and when a certain level of file needs to be searched, all directory levels need to be listed, and searching layer by layer is very time-consuming. When the client file data information is matched with the client personal specific information, a large amount of data information needs to be extracted layer by layer, decompressed layer by layer, and traversed layer by layer to search and match. Therefore, the file query efficiency is low, a large amount of system resources are occupied, and even system breakdown and downtime are caused seriously.

The above is only for the purpose of assisting understanding of the technical solutions of the present application, and does not represent an admission that the above is prior art.

Disclosure of Invention

The present application mainly aims to provide a file query method, a file query apparatus, a computer device, and a computer-readable storage medium, and aims to solve the problem of how to improve the efficiency of querying files while avoiding an excessive system data processing pressure.

In order to achieve the above object, the present application provides a file query method, including the following steps:

analyzing each file in each layer of directory to obtain each content information corresponding to each file, extracting a first keyword corresponding to each file from each content information, and generating each directory information corresponding to each layer of directory according to each first keyword; the first keyword is preset key information in the content information;

when a file access request is received, extracting second keywords from the file access request, and inquiring first keywords matched with the second keywords from the directory information corresponding to the initial layer directory;

when the first keyword is obtained through query, taking a file corresponding to the first keyword obtained through query as a target file for the file access request, and decompressing the target file into a cache;

when the first keyword is not inquired, judging that a target file aimed at by the file access request does not exist in a current directory corresponding to the directory information inquired currently, and detecting whether a directory hierarchy corresponding to the current directory belongs to a higher directory hierarchy of a preset hierarchy or not;

when detecting that the directory hierarchy corresponding to the current directory does not belong to the upper-level directory hierarchy of the preset hierarchy, judging that the target file query fails;

and when detecting that the directory hierarchy corresponding to the current directory belongs to the upper-level directory hierarchy of the preset hierarchy, entering a next-level directory of the current directory to inquire a first keyword matched with the second keyword.

Further, after the step of extracting the second keyword from the file access request, the method further includes:

when a plurality of second keywords are extracted, determining the priority corresponding to each second keyword;

selecting the second keyword with the highest priority as a target keyword;

and executing the step of searching the first keyword matched with the second keyword from the directory information corresponding to the initial layer directory based on the target keyword.

Further, after the step of executing the step of querying the first keyword matching the second keyword from the directory information corresponding to the initial layer directory based on the target keyword, the method further includes:

when the target file is detected to be failed to be queried, determining the next priority of the priorities corresponding to the target keywords, and updating the target keywords according to second keywords corresponding to the next priority;

and returning to the step of executing the directory information corresponding to the initial layer directory and searching the first keyword matched with the second keyword based on the updated target keyword.

Further, after the step of determining that the target file query fails when it is detected that the directory hierarchy corresponding to the current directory does not belong to the upper directory hierarchy of the preset hierarchy, the method further includes:

detecting whether an idle processing thread exists currently;

if yes, inquiring the target file in a directory corresponding to a lower directory level of the preset level;

if not, generating prompt information according to the preset level, wherein the prompt information is used for prompting a user to inquire the target file in a directory corresponding to a lower directory level of the preset level.

sending the second keyword to a storage server so that the storage server feeds back the target file based on the second keyword, wherein the storage server stores each file in each layer of directory in advance in a block-chained account book;

and when the target file fed back by the storage server is received, decompressing the target file into a cache.

Further, after the step of decompressing the target file into the cache, the method further includes:

and when detecting that a file access task initiated based on the file access request is closed, deleting cache data corresponding to the target file from the cache.

Further, before the step of detecting whether the directory hierarchy corresponding to the current directory belongs to a higher directory hierarchy of a preset hierarchy, the method further includes:

acquiring a data processing capacity parameter, and determining the busy degree of a system according to the data processing capacity parameter;

and determining the preset level according to the busy degree of the system, wherein the higher the busy degree of the system is, the lower the preset level is determined to be.

In order to achieve the above object, the present application further provides a file query apparatus, including:

the processing module is used for analyzing each file in each layer of directory to obtain each content information corresponding to each file, extracting a first keyword corresponding to each file from each content information, and generating each directory information corresponding to each layer of directory according to each first keyword; each first keyword is preset key information in each content information;

the first query module is used for extracting a second keyword from the file access request when the file access request is received, and querying a first keyword matched with the second keyword from the directory information corresponding to the initial layer directory;

the decompression module is used for taking the file corresponding to the first keyword obtained by query as a target file for the file access request when the first keyword is obtained by query, and decompressing the target file into a cache;

the detection module is used for judging that a target file for the file access request does not exist in a current directory corresponding to the directory information queried currently when the first keyword is not queried, and detecting whether a directory hierarchy corresponding to the current directory belongs to a higher directory hierarchy of a preset hierarchy or not;

the judging module is used for judging that the target file query fails when detecting that the directory hierarchy corresponding to the current directory does not belong to the upper directory hierarchy of the preset hierarchy;

and the second query module is used for entering a next-layer directory of the current directory to query the first keyword matched with the second keyword when detecting that the directory hierarchy corresponding to the current directory belongs to the upper-layer directory hierarchy of the preset hierarchy.

To achieve the above object, the present application also provides a computer device, comprising:

the computer device comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the computer program realizes the steps of the query method of the file when being executed by the processor.

To achieve the above object, the present application further provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the query method for the above-mentioned document.

According to the file query method, the file query device, the computer equipment and the computer readable storage medium, the directory information is generated by extracting the keywords corresponding to the content information of the directory file, when a file access request is received, the target file is queried by the directory layer by layer based on the keywords and the directory information, all files do not need to be decompressed to a cache one by one and then queried, and therefore data processing pressure of a system is relieved, file query efficiency is improved, and the files are queried only within a preset hierarchy by setting directory hierarchy query limits, and data processing pressure is further relieved.

Drawings

FIG. 1 is a diagram illustrating steps of a document query method according to an embodiment of the present application;

FIG. 2 is a block diagram of a file query device according to an embodiment of the present application;

fig. 3 is a block diagram illustrating a structure of a computer device according to an embodiment of the present application.

The implementation, functional features and advantages of the objectives of the present application will be further explained with reference to the accompanying drawings.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

Referring to fig. 1, in an embodiment, the file query method includes:

step S10, analyzing each file in each layer of directory to obtain each content information corresponding to each file, extracting a first keyword corresponding to each file from each content information, and generating each directory information corresponding to each layer of directory according to each first keyword; the first keyword is preset key information in the content information;

step S20, when a file access request is received, extracting a second keyword from the file access request, and searching a first keyword matched with the second keyword from the directory information corresponding to the initial layer directory;

step S30, when the first keyword is obtained through query, taking the file corresponding to the first keyword obtained through query as a target file for the file access request, and decompressing the target file to a cache;

step S40, when the first keyword is not obtained by the query, determining that the target file for the file access request does not exist in the current directory corresponding to the currently queried directory information, and detecting whether the directory hierarchy corresponding to the current directory belongs to a higher directory hierarchy of a preset hierarchy;

step S50, when detecting that the directory hierarchy corresponding to the current directory does not belong to the upper directory hierarchy of the preset hierarchy, judging that the target file query fails;

and step S60, entering the next-layer directory of the current directory to inquire a first keyword matched with the second keyword when detecting that the directory hierarchy corresponding to the current directory belongs to the upper-layer directory hierarchy of the preset hierarchy.

In this embodiment, the terminal in this embodiment may be a computer device, or may be a file query device. The computer device may be a file storage system, or may be a control device of the file storage system, and the following description will take a terminal as the file storage system as an example.

Files stored in the file storage system are classified into multi-level directory storage.

As set forth in step S10: the terminal may analyze each file stored in each layer of directory in advance to obtain content information corresponding to each file. When the file is stored in the form of a compressed file, the terminal analyzes the file in a manner of decompressing the file, and reads content information in the file after the decompressed file is obtained; when the file is stored in a picture format or a PDF format, the terminal may recognize text information therein based on an OCR (Optical Character Recognition) technique to obtain content information of the file.

Optionally, the terminal is trained with a neural network model in advance, and the neural network model is obtained based on a plurality of training samples. Each training sample is a piece of content information, and the content information is marked with preset key information; the preset key information can be a user name, a user address, an identification card number, a telephone number, a capital account number, a business order number and the like. It should be understood that the number of training samples is sufficiently large, for example, greater than ten thousand.

When the terminal receives a plurality of training samples which are input by an engineer and marked with preset key information, the training samples are input into the neural network model for training, and the training neural network model recognizes and extracts the preset key information marked in the training samples as a first keyword. After the neural network model is subjected to repeated iterative training, when the terminal detects that the model reaches convergence, the training of the neural network model is judged to be finished.

Optionally, when the terminal analyzes and obtains content information corresponding to each file in each layer of directory, the content information is sequentially input into the neural network model for analysis, so that preset key information corresponding to each file is extracted from the content information corresponding to each file by using the neural network model as a first key word.

Or the terminal sets a retrieval rule of the regular expression in advance according to the format or the style of the preset key information, when the terminal analyzes and obtains the content information corresponding to each file in each layer of directory, the regular expression is used for extracting the preset key information from the content information corresponding to each file, and the extracted preset key information is used as the first key word corresponding to each file.

Further, when the terminal obtains the first keyword corresponding to each file in each layer of directory, the directory information corresponding to each layer of directory is generated based on the first keyword. The directory information corresponding to each layer of directory may be a first key corresponding to all files on the layer of directory recorded in a configuration table.

As set forth in step S20: the file storage system or the sending end of the file access request is provided with a file query interface, a search term input field and/or a search term option are/is arranged in the file query interface, and after a user inputs a search term based on the search term input field and/or the search term option, the file storage system or the sending end can generate the file access request based on the input search term.

Optionally, when the file storage system has a file access request generated, or the sending end sends the file access request to the file storage system, the terminal determines that the file access request is received, and extracts a search term from the file access request as the second keyword.

Optionally, after obtaining the second keyword, the terminal queries, according to the second keyword, a target file for which the file access request is directed from the initial layer directory. When the terminal queries the target file in any layer of directory, whether the directory information has the first keyword matched with the second keyword is queried in the directory information corresponding to the layer of directory, so as to query whether the directory corresponding to the directory information has the target file for the file access request.

It should be noted that the initial layer directory is defined as a previous layer directory of the second layer directory, the second layer directory is defined as a previous layer directory of the third layer directory (i.e., the third layer directory is a next layer directory of the second layer directory), and so on.

Optionally, when the terminal detects that the first keyword matched with the second keyword exists in any directory information, it is determined that the target file for the file access request exists in the directory corresponding to the directory information.

Optionally, when the terminal detects that the first keyword matched with the second keyword does not exist in any directory information, it is determined that the target file for the file access request does not exist in the directory corresponding to the directory information.

And defining the directory corresponding to the directory information to be queried currently as a current directory, and defining the directory hierarchy corresponding to the current directory as a current directory hierarchy. It should be understood that, if the currently queried directory information is directory information corresponding to an initial layer directory, the current directory corresponding to the currently queried directory information is marked as the initial layer directory, that is, when the directory information is initially queried, the current directory must be the initial layer directory; and when the target file cannot be inquired in the initial layer subsequently and the step of returning and executing the inquiry is carried out in the directory corresponding to the lower directory hierarchy, the current directory is not the initial layer directory any more.

As set forth in step S30: when the terminal detects that the first keyword matched with the second keyword exists in the directory information inquired currently, the terminal judges that the target file exists in the current directory corresponding to the directory information, and inquires the file corresponding to the first keyword matched with the second keyword in the current directory as the target file.

Optionally, when the terminal queries and obtains the target file, the terminal obtains the target file from the directory where the target file is located, and decompresses the obtained target file into the cache, so that the user can access the target file.

Meanwhile, the terminal can also store the file storage path of the target file and the second keyword corresponding to the file access request in an associated manner, so that when the file access request is received later, the efficiency of inquiring the target file can be improved. After the terminal extracts the second keyword from the file access request, whether a file saving path associated with the second keyword exists or not can be detected; when the terminal detects that a file saving path associated with the second keyword exists, directly acquiring a target file for the file access request according to the file saving path; and when the terminal detects that the file saving path associated with the second keyword does not exist, the terminal executes the step of searching the first keyword matched with the second keyword from the directory information corresponding to the initial layer directory.

As set forth in step S40: and when the terminal does not inquire the first keyword matched with the second keyword in the directory information corresponding to the current directory, judging that the target file aimed by the file access request does not exist in the current directory corresponding to the currently inquired directory information.

Optionally, when the terminal does not query the current directory to obtain the target file, it is detected whether a directory hierarchy corresponding to the current directory (i.e., the current directory hierarchy) belongs to a higher directory hierarchy of the preset hierarchy (i.e., it is detected whether the current directory is located at an upper layer of a directory corresponding to the preset hierarchy). It should be understood that all directories at the upper layer of the directory corresponding to the preset hierarchy have corresponding directory hierarchies belonging to the upper directory hierarchy of the preset hierarchy. For example, the initial layer directory and the second layer directory are both located at the upper layer of the third layer directory, and then the directory hierarchies corresponding to the initial layer directory and the second layer directory both belong to the upper layer directory hierarchy of the directory hierarchies corresponding to the third layer directory; and the third layer directory and the second layer directory are both positioned at the lower layer of the initial layer directory, so that the directory hierarchies corresponding to the third layer directory and the second layer directory all belong to the lower directory hierarchies of the directory hierarchies corresponding to the initial layer directory.

Alternatively, the predetermined hierarchy may be predetermined, such as being set to 3-5 levels.

Alternatively, the preset hierarchy may be determined in real time according to the attribute of the second keyword. The terminal can divide preset key information into a plurality of attributes in advance, and the preset key information with different attributes is configured with corresponding preset levels. And after the terminal obtains the second keyword, determining a preset level according to the attribute of the preset key information to which the second keyword belongs. For example, for conventional information such as user name, user address, phone number, etc., a higher hierarchy may be set for a preset hierarchy corresponding to the attribute thereof; for special information such as the identity card number, the capital account number, the business order number and the like, a lower level can be set for a preset level corresponding to the attribute of the special information.

As set forth in step S50: optionally, when the terminal does not query the current directory to obtain the target file and detects that the directory hierarchy corresponding to the current directory does not belong to a higher directory hierarchy of a preset hierarchy (that is, the current directory hierarchy is equal to the preset hierarchy, or the current directory hierarchy belongs to a lower directory hierarchy of the preset hierarchy), it is determined that the query of the target file fails.

Optionally, when the terminal determines that the target file is unsuccessfully queried, the terminal may stop to continue querying the target file, and/or generate a prompt message for switching to manual query according to a preset level, where the prompt message is used to prompt a user to query the target file in a directory level other than the preset level (i.e., a lower directory level of the preset level). And then the terminal outputs prompt information to prompt a user to manually inquire the target file in the directory corresponding to the directory hierarchy outside the preset hierarchy. Therefore, the data processing pressure of the system is reduced, and the efficiency of inquiring files by a user is improved to a certain extent.

As set forth in step S60: optionally, when the terminal does not query the current directory to obtain the target file, and detects that the directory hierarchy corresponding to the current directory belongs to the upper directory hierarchy of the preset hierarchy, the terminal enters the next-layer directory of the current directory, and queries whether the first keyword corresponding to the second keyword exists in the directory information corresponding to the next-layer directory, so as to query the target file in the directory. And if the terminal cannot inquire the target file again (that is, the directory information corresponding to the currently entered directory does not inquire to obtain the first keyword corresponding to the second keyword), the step of detecting whether the current directory hierarchy belongs to the upper directory hierarchy of the preset hierarchy is executed again, and when the current directory hierarchy is detected to belong to the upper directory hierarchy of the preset hierarchy, the next directory of the current directory is entered again to continuously inquire the target file (of course, if the current directory hierarchy is detected not to belong to the lower directory hierarchy of the preset hierarchy, the target file is judged to be unsuccessfully inquired, and the target file does not need to be continuously inquired again).

Optionally, when the terminal queries the directory information corresponding to the currently entered directory to obtain the first keyword corresponding to the second keyword, it is determined that the target file for which the file access request is directed exists in the directory corresponding to the directory information (i.e., the currently entered directory), and a file corresponding to the queried first keyword is obtained as the target file. Of course, when the terminal queries that the directory information corresponding to any directory has the first keyword matched with the second keyword, it is determined that the target file targeted by the file access request exists in the directory corresponding to the directory information, that is, it is determined that the target file is obtained by querying.

And/or after the terminal enters the step of inquiring the target file in the next-layer directory when the current directory hierarchy is detected to belong to the upper-layer directory hierarchy of the preset hierarchy, when the terminal inquires that the directory information corresponding to any directory has the first keyword matched with the second keyword, judging that the target file for the file access request exists in the directory corresponding to the directory information, namely judging that the target file is obtained by inquiry.

Or, when the terminal has inquired the target file in the current directory, it can also detect whether the directory hierarchy corresponding to the current directory belongs to the upper directory hierarchy of the preset hierarchy; when detecting that the directory hierarchy corresponding to the current directory belongs to the upper-level directory hierarchy of the preset hierarchy, the next-level directory of the current directory can be entered, and whether the first keyword corresponding to the second keyword exists or not is inquired in the directory information corresponding to the next-level directory, so that the target file is inquired in the directory. Thus, when a plurality of target documents corresponding to the same second keyword exist, the terminal may query all the target documents. Of course, if the terminal detects that the directory hierarchy corresponding to the current directory does not belong to the upper directory hierarchy of the preset hierarchy, the terminal does not need to enter the next directory of the current directory to query the target file, and only needs to decompress the target file obtained by the previous query to the cache.

Or, the terminal may also directly search through the directories information of the directories in the directories corresponding to the preset hierarchy and the directories corresponding to all the upper directory hierarchies of the preset hierarchy to determine whether the first keyword corresponding to the second keyword exists in the directories, so as to determine whether the target file exists in the directories. If the terminal queries at least one target file in the directories, decompressing each target file to a cache; and if the terminal does not inquire the target file in the directories, judging that the target file inquiry fails.

In one embodiment, the directory information is generated by extracting keywords corresponding to the content information of the directory file, when a file access request is received, the target file is queried in the directory layer by layer based on the keywords and the directory information, all files do not need to be decompressed to a cache one by one and then queried, and therefore data processing pressure of a system is reduced, efficiency of querying the file is improved, and the data processing pressure is further reduced by setting directory hierarchy query limits and querying the file only within a preset hierarchy.

In an embodiment, on the basis of the above embodiment, after the step of extracting the second keyword from the file access request, the method further includes:

step S70, when a plurality of second keywords are extracted, determining the priority corresponding to each second keyword;

step S71, selecting the second keyword with the highest priority as a target keyword;

step S72, based on the target keyword, executing the step of querying the first keyword matching the second keyword, starting from the directory information corresponding to the initial layer directory.

In this embodiment, the terminal assigns corresponding priorities to the key information with different attributes in advance. The level corresponding to the priority may be related to the ease of querying the key information, and if the corresponding key information is easier to query, the priority assigned to the second keyword corresponding to the key information is higher, for example, the priority may be set according to a field length corresponding to the key information, and the smaller the field length, the higher the priority; or the level corresponding to the priority may be related to the complexity of the key information, and if the complexity of the corresponding key information is higher, the priority assigned to the second keyword corresponding to the key information is higher, for example, the priority corresponding to the mobile phone number as the key information is higher than the priority corresponding to the user name as the key information.

When the terminal extracts a plurality of second keywords from the file access request, determining the priority corresponding to the key information to which each second keyword belongs according to the preset attribute of the key information to which each second keyword belongs, and taking the determined priority as the priority corresponding to the second keyword. And then the terminal selects the corresponding second keyword with the highest priority as the target keyword.

Optionally, after the terminal obtains the target keyword, based on the target keyword, the terminal executes the step of querying the first keyword matched with the second keyword from the directory information corresponding to the initial layer directory, that is, based on the target keyword, searching the target file for which the file access request is directed from the initial layer directory layer by layer. Whether a first keyword matched with a target keyword exists in the directory information is inquired in the directory information corresponding to each layer of directory, so that whether a target file targeted by the file access request exists in the directory corresponding to the directory information is inquired, that is, the target keyword is used as a second keyword for inquiring the target file.

Optionally, the terminal may also directly search, in the directories corresponding to the preset hierarchy and the directories corresponding to all the upper directory hierarchies of the preset hierarchy, whether the directory information of the directories includes the first keyword corresponding to the target keyword through traversal, so as to search whether the directories include the target file.

If the terminal obtains a plurality of target files by inquiring in the directories based on the current target keywords, determining the next priority of the priorities corresponding to the target keywords, updating the target keywords according to the second keywords corresponding to the next priority, and then inquiring whether the first keywords corresponding to the target files are matched with the updated target keywords. If the first keyword corresponding to only one target file is obtained through query and is matched with the updated target keyword, the target file is used as the target file obtained through final query and is decompressed into a cache; if first keywords corresponding to a plurality of target files are obtained through query and are matched with the updated target keywords, the next priority of the priority corresponding to the current target keywords is continuously determined, the target keywords are updated according to second keywords corresponding to the next priority, and then whether the corresponding first keywords are matched with the target keywords obtained through latest update in the target files matched with the target keywords before the current update is queried based on the updated target keywords; and repeating the steps until the query obtains only one target file matched with a plurality of second keywords (or all the second keywords).

Therefore, the sequence of querying the files based on the second keywords is determined according to the corresponding priorities of different second keywords, so that the second keywords which are easy to query are queried preferentially, and the efficiency of querying the files is improved.

In an embodiment, on the basis of the above embodiment, after the step of executing the step of querying, starting from the directory information corresponding to the initial layer directory, the first keyword matching the second keyword based on the target keyword, the method further includes:

step S80, when the target file is detected to be unsuccessfully queried, determining the next priority of the priorities corresponding to the target keywords, and updating the target keywords according to the second keywords corresponding to the next priority;

step S81, based on the updated target keyword, returning to the step of executing the directory information corresponding to the initial layer directory, and querying the first keyword matched with the second keyword.

In this embodiment, when the terminal fails to query the target file based on the target keyword, it is further detected whether a second keyword having a lower priority than the target keyword exists.

Optionally, when the terminal detects that a second keyword with a lower priority than the priority corresponding to the current target keyword exists, the terminal determines a next priority of the priority corresponding to the target keyword, and updates the second keyword corresponding to the next priority to a new target keyword. Then, the terminal returns to the step of executing the directory information corresponding to the initial layer directory and querying the first keyword matched with the second keyword based on the updated target keyword, namely, the terminal searches the target file for the file access request layer by layer from the initial layer directory based on the updated target keyword. Whether a first keyword matched with a target keyword exists in the directory information is inquired in the directory information corresponding to each layer of directory, so that whether a target file targeted by the file access request exists in the directory corresponding to the directory information is inquired, that is, the target keyword is used as a second keyword for inquiring the target file.

Optionally, when the terminal detects that there is no second keyword with a lower priority than that corresponding to the current target keyword, the terminal may stop querying the target file, and generate a prompt message for switching to manual query according to the preset hierarchy, where the prompt message is used to prompt the user to query the target file in a directory corresponding to a directory hierarchy other than the preset hierarchy.

Therefore, the sequence of inquiring the files based on the second keywords is determined according to the corresponding priorities of different second keywords, so that the second keywords which are easy to inquire are inquired in a priority mode, and when the target files cannot be inquired by the second keywords with high priorities, the target files are inquired by the second keywords with low priorities, and therefore the efficiency of inquiring the files is improved.

In an embodiment, on the basis of the above embodiment, after the step of determining that the target file query fails when the directory hierarchy corresponding to the current directory is detected not to belong to the upper directory hierarchy of the preset hierarchy, the method further includes:

step S90, detecting whether an idle processing thread exists currently;

step S91, if yes, inquiring the target file in a directory corresponding to a lower directory level of the preset level;

and step S92, if not, generating prompt information according to the preset hierarchy, wherein the prompt information is used for prompting a user to inquire the target file in a directory corresponding to a lower directory hierarchy of the preset hierarchy.

In this embodiment, when the terminal determines that the query of the target file in the directory in the preset hierarchy fails, it may first detect whether the system currently has an idle processing thread.

Optionally, when the terminal detects that the system currently has an idle processing thread, continuing to query the target file by using a second keyword in a directory corresponding to a lower directory hierarchy of a preset hierarchy until the target file is obtained by querying; or until the directory information corresponding to all directories is not queried to obtain the first keyword matched with the second keyword, determining that the target file is failed to be queried, and outputting corresponding file query failure information.

Optionally, when the terminal detects that the system does not currently have an idle processing thread, stopping continuously querying the target file, and generating a prompt message for switching to manual query according to a preset level, where the prompt message is used to prompt a user to query the target file in a lower directory level of the preset level. And then the terminal outputs prompt information to prompt a user to manually inquire the target file in the directory corresponding to the directory hierarchy outside the preset hierarchy. Therefore, the data processing pressure of the system is reduced, and the efficiency of inquiring files by a user is improved to a certain extent.

Therefore, when the target file cannot be inquired in the directory in the preset level, the target file is continuously inquired in the directory outside the preset level only when an idle processing thread exists in the system, otherwise, the target file is manually inquired, so that the problem that the data processing pressure of the system is too large is avoided, and the file inquiring efficiency of a user is improved to a certain extent.

step S100, sending the second keyword to a storage server so that the storage server feeds back the target file based on the second keyword, wherein the storage server stores each file in each layer of directory in advance in a block-chained account book;

and S101, when the target file fed back by the storage server is received, decompressing the target file into a cache.

In this embodiment, the terminal establishes a communication connection with a storage server constructed based on a block chain technology, the terminal sends files in each layer of directory to the storage server in advance, and when the storage server receives the files in each layer of directory sent by the terminal, the files are stored in a block chain type account book (leader).

Note that the ledger is a general term for a blockchain (also referred to as ledger data) and a state database synchronized with the blockchain. Wherein, the blockchain records the transaction in the form of a file in a file system; the state database records the transactions in the blockchain in the form of different types of Key (Key) Value pairs for supporting fast query of the transactions in the blockchain.

Of course, when storing files in a block-chained account book, the storage server may parse the files, obtain first keywords corresponding to the files, and then generate key value pairs corresponding to the files based on the first keywords.

The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product services layer, and an application services layer.

The block chain underlying platform can comprise processing modules such as user management, basic service, intelligent contract and operation monitoring. The user management module is responsible for identity information management of all blockchain participants, and comprises public and private key generation maintenance (account management), key management, user real identity and blockchain address corresponding relation maintenance (authority management) and the like, and under the authorization condition, the user management module supervises and audits the transaction condition of certain real identities and provides rule configuration (wind control audit) of risk control; the basic service module is deployed on all block chain node equipment and used for verifying the validity of the service request, recording the service request to storage after consensus on the valid request is completed, for a new service request, the basic service firstly performs interface adaptation analysis and authentication processing (interface adaptation), then encrypts service information (consensus management) through a consensus algorithm, transmits the service information to a shared account (network communication) completely and consistently after encryption, and performs recording and storage; the intelligent contract module is responsible for registering and issuing contracts, triggering the contracts and executing the contracts, developers can define contract logics through a certain programming language, issue the contract logics to a block chain (contract registration), call keys or other event triggering and executing according to the logics of contract clauses, complete the contract logics and simultaneously provide the function of upgrading and canceling the contracts; the operation monitoring module is mainly responsible for deployment, configuration modification, contract setting, cloud adaptation in the product release process and visual output of real-time states in product operation, such as: alarm, monitoring network conditions, monitoring node equipment health status, and the like.

Optionally, when the terminal cannot query the current directory to obtain the target file and detects that the directory hierarchy corresponding to the current directory does not belong to the upper directory hierarchy of the preset hierarchy, it is determined that the query of the target file in the directory in the preset hierarchy fails, and then the terminal may send the second keyword to the storage server.

When the storage server receives a second keyword sent by the terminal, the storage server queries a key value pair matched with the second keyword (namely, queries a first keyword matched with the second keyword) from the block chain network according to the second keyword, then further acquires a file corresponding to the second keyword as a target file on the basis, and feeds the target file back to the terminal.

Optionally, when the terminal receives the target file fed back by the storage server, the target file is decompressed into the cache, so that the user can access the target file.

Therefore, the safety of storing the backup file is improved, and meanwhile, when the terminal cannot quickly inquire the target file locally, the target file is fed back through the storage server, so that the pressure of local data processing can be relieved, and the user can be ensured to finally obtain the target file.

In an embodiment, on the basis of the above embodiment, after the step of decompressing the target file into the cache, the method further includes:

step S110, when detecting that the file access task initiated based on the file access request is closed, deleting the cache data corresponding to the target file from the cache.

In this embodiment, the file storage system may be provided with a file access page, and when the terminal queries and obtains a target file, a file access task initiated based on a file access request is generated, and the target file is decompressed into a cache, so as to generate cache data corresponding to the target file, so that a user can query the cache data. At this time, the user can view the content information of the target file through the file access page.

Optionally, when the terminal detects that the user actively closes the file access page, it is determined that the current file access task is closed; or, when the file access request is sent by a sending end, and when the terminal sends the cache data corresponding to the target file in the cache to the sending end, it is determined that the file access task is closed.

Optionally, when the terminal detects that the file access task is closed, the cache data corresponding to the target file is deleted from the cache.

In this way, the occupation of the data processing resources of the system can be reduced.

In an embodiment, on the basis of the above embodiment, before the step of detecting whether the directory hierarchy corresponding to the current directory belongs to an upper directory hierarchy of a preset hierarchy, the method further includes:

step S120, acquiring a data processing capacity parameter, and determining the busy degree of the system according to the data processing capacity parameter;

step S121, determining the preset level according to the busy degree of the system, wherein the higher the busy degree of the system is, the lower the obtained preset level is determined to be.

In this embodiment, the preset hierarchy may be set in real time according to a real-time system busy level of the terminal.

Optionally, before the step of detecting whether the directory hierarchy corresponding to the current directory belongs to the upper directory hierarchy of the preset hierarchy is executed, the terminal may obtain a local data processing capability parameter of the terminal, and determine the busy degree of the system according to the data processing capability parameter. The data processing capability parameter includes at least one of the number of idle threads (i.e. the number of idle processing threads) of the system, the remaining cache space, and the remaining memory of the processor.

And the terminal prestores the system busy degree corresponding to the data processing capacity parameters with different numerical values, and the terminal can determine the system busy degree matched with the data capacity parameters through the data processing capacity parameters obtained by current detection. It should be understood that a higher degree of busyness of the system means that the system is busyness and the corresponding data processing pressure is greater.

Further, the terminal further determines a preset level according to the determined system busy degree, wherein the higher the system busy degree is, the lower the obtained preset level is determined to be; the corresponding linear relation between the specific system busy degree and the preset hierarchy can be set according to the actual situation. Of course, the final predetermined level is determined to be not lower than 1 level and not higher than the highest directory level.

Therefore, the preset hierarchy is updated and determined in real time according to the local real-time system busy degree of the terminal, when the system busy degree is high, the lower preset hierarchy is correspondingly determined, otherwise, the higher preset hierarchy is determined, so that the data processing resources of the query target file are reasonably distributed, and the data processing pressure of the system is avoided being too high.

Referring to fig. 2, an embodiment of the present application further provides a file querying apparatus 10, including:

the processing module 11 is configured to analyze each file in each layer of directory to obtain each content information corresponding to each file, extract a first keyword corresponding to each file from each content information, and generate each directory information corresponding to each layer of directory according to each first keyword; each first keyword is preset key information in each content information;

the first query module 12 is configured to, when receiving a file access request, extract a second keyword from the file access request, and query, starting from the directory information corresponding to the initial-layer directory, a first keyword matched with the second keyword;

the decompression module 13 is configured to, when the first keyword is obtained through query, take a file corresponding to the first keyword obtained through query as a target file for the file access request, and decompress the target file into a cache;

the detection module 14 is configured to, when the first keyword is not obtained through query, determine that a target file targeted by the file access request does not exist in a current directory corresponding to the currently queried directory information, and detect whether a directory hierarchy corresponding to the current directory belongs to a higher directory hierarchy of a preset hierarchy;

the judging module 15 is configured to, when it is detected that the directory hierarchy corresponding to the current directory does not belong to the upper directory hierarchy of the preset hierarchy, judge that the target file query fails;

and the second query module 16 is configured to enter a next-layer directory of the current directory to query for the first keyword matched with the second keyword when it is detected that the directory hierarchy corresponding to the current directory belongs to the upper-layer directory hierarchy of the preset hierarchy.

Referring to fig. 3, a computer device, which may be a server and whose internal structure may be as shown in fig. 3, is also provided in the embodiment of the present application. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing relevant data of the query method of the file. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of querying a file.

Those skilled in the art will appreciate that the architecture shown in fig. 3 is only a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects may be applied.

Furthermore, the present application also proposes a computer-readable storage medium comprising a computer program which, when executed by a processor, implements the steps of the file query method as described in the above embodiments. It is to be understood that the computer-readable storage medium in the present embodiment may be a volatile-readable storage medium or a non-volatile-readable storage medium.

In summary, in the file query method, the file query apparatus, the computer device, and the storage medium provided in the embodiments of the present application, the directory information is generated by extracting the keyword corresponding to the content information of the directory file, and when a file access request is received, the target file is queried in the directory layer by layer based on the keyword and the directory information, and it is not necessary to decompress all files one by one to the cache for query, so that the data processing pressure of the system is reduced, and the efficiency of querying the file is improved.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium provided herein and used in the examples may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), double-rate SDRAM (SSRSDRAM), Enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, apparatus, article, or method that includes the element.

The above description is only for the preferred embodiment of the present application and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application, or which are directly or indirectly applied to other related technical fields, are intended to be included within the scope of the present application.

Claims

1. A file query method is characterized by comprising the following steps:

2. The method for querying a file according to claim 1, wherein the step of extracting the second keyword from the file access request is followed by further comprising:

selecting the second keyword with the highest priority as a target keyword;

3. The method for searching for a file according to claim 2, wherein after the step of executing the step of searching for the first keyword matching the second keyword starting from the directory information corresponding to the initial layer directory based on the target keyword, further comprises:

4. The method for querying files according to claim 1, wherein after the step of determining that the query of the target file fails when it is detected that the directory hierarchy corresponding to the current directory does not belong to an upper directory hierarchy of the preset hierarchy, the method further comprises:

detecting whether an idle processing thread exists currently;

5. The method for querying files according to claim 1, wherein after the step of determining that the query of the target file fails when it is detected that the directory hierarchy corresponding to the current directory does not belong to an upper directory hierarchy of the preset hierarchy, the method further comprises:

6. The method for querying a file according to claim 1 or 5, wherein after the step of decompressing the target file into the cache, the method further comprises:

7. The method for querying files according to any one of claims 1 to 5, wherein before the step of detecting whether the directory hierarchy corresponding to the current directory belongs to a higher directory hierarchy of a preset hierarchy, the method further comprises:

8. An apparatus for querying a file, comprising:

9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the computer program, when executed by the processor, implementing the steps of the method of querying a file according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, which computer program, when being executed by a processor, carries out the steps of the method of querying a file according to any one of claims 1 to 7.