Intelligent file management method and system based on microservice and cloud native architecture

Abstract

The application relates to the technical field of intelligent file management, in particular to a file intelligent management method and system based on microservices and a cloud native architecture, which comprises the following steps: acquiring file access records and constructing an access path, counting the frequency and sequence of authority nodes to generate a sorting list, dividing a processing interval to form a sequence mapping, identifying continuous operations to generate a continuation path, and integrating the path and the authority sequence to generate a management list. The application constructs an access track by extracting the access identifier and the file location identifier, generates a sorting result in combination with the time sequence and frequency of the authority nodes, divides a processing interval to determine the front-back relationship, associates operation behaviors such as reading, modifying and closing to form an access link, realizes the unified organization of the authority check sequence and the access path, improves the path coordination and processing continuity, reduces the fragmentation between the authority check and the file operation, and enhances the process adaptation capability and scheduling stability in a complex access scenario.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of file intelligent management, and in particular to a file intelligent management method and system based on microservices and cloud native architecture. BACKGROUND

[0002] The technical field of file intelligent management includes systematic, automated and intelligent management of various electronic files in the whole process of generation, classification, storage, calling, sharing, retrieval, archiving, etc. The core content is to identify and manage the structure, attributes, content and metadata of files based on digital information processing technology, covering document lifecycle management, distributed storage, access permission control, full-text retrieval, version tracking, operation audit and content intelligent analysis, etc. The overall technical system relies on the capabilities of computing resource pooling, data interface standardization, process automation and security policy systematization to provide cross-platform, multi-terminal and high-concurrency file management support for enterprises and institutions.

[0003] Among them, the file intelligent management method based on microservices and cloud native architecture refers to decoupling system functions into independent deployment, elastic scaling microservice units, realizing automatic scheduling, containerized operation and service interconnection control in cloud native infrastructure. It mainly covers communication between services through unified interface protocol, node discovery and governance through service registration mechanism, parameter centralized management through configuration center, high-concurrency request handling through load balancing mechanism, and fast horizontal expansion through stateless services. The overall architecture splits specific tasks such as file uploading, parsing, storage, retrieval, and permission verification into independent service units, enabling flexible combination and independent evolution of each link to adapt to changes in business size and processing capacity.

[0004] The prior art does not involve structural optimization of permission node sequence in the permission control process, lacks the ability to build a path model based on access behavior, and has fixed configuration of permission verification steps, making it difficult to adapt to continuous change scenarios of access behavior, causing delay in permission processing timing response and scattered execution logic. In addition, the file operation process lacks path aggregation and sequence recognition mechanisms for each action behavior, and does not have the ability to recognize the path of continuous access behavior, such as read and modify operations that cannot be processed as a whole link, limiting the structural optimization space of access paths, reducing processing efficiency and increasing the coordination pressure caused by process separation. SUMMARY

[0005] To solve the technical problems existing in the prior art, the present application embodiment provides a file intelligent management method and system based on microservices and cloud native architecture. The technical solution is as follows:

[0006] The file intelligent management method based on microservices and cloud native architecture comprises the following steps:

[0007] S1: Obtain the access record generated in the micro-service environment, extract the access initiator and target file location identifier, time-sort the permission links appearing in the same access in turn, establish a continuous path track after excluding duplicates, and generate a file access path list;

[0008] S2: Based on the file access path list, count the number of times each permission check link appears in the path, record its average position in the path, merge and sort according to the cumulative frequency and average position order, and generate a file permission check sorting list;

[0009] S3: According to the file permission check sorting list, set the sorting limit to divide the front links into access pre-processing, and divide the rest into access delay processing, mark the processing position and order label, and generate a file permission processing order mapping table;

[0010] S4: Call the file access path list, compare the multiple access paths of the same initiator, sort the order of file opening, reading and modifying, filter out the repeated structure path for merging processing, and generate a file access continuation path set.

[0011] As a further scheme of the application, the file access path list includes access initiator identification information, file storage location identification information, permission check node sequence, access behavior time label, the file permission check sorting list includes permission node appearance frequency value, node order position information, node weight score, and permission set sorting result, the file permission processing order mapping table includes pre-processing node identifier, delay processing node identifier, processing order correspondence relationship, and processing interval division result, and the file access continuation path set includes continuous access behavior sequence, repeated path connection mode, operation behavior connection structure, and path stability characteristics.

[0012] As a further scheme of the application, the S1 acquisition step is:

[0013] S101: Obtain the continuously generated file access data frame in the micro-service environment, and extract the access initiator identifier, access trigger timestamp and file storage location identifier therefrom, call the access trigger timestamp as a sequence reference, combine the corresponding relationship between the access initiator identifier and the file storage location identifier, separate multiple groups of continuous access actions in the data frame, and generate a file access action sequence set;

[0014] S102: Based on each group of data frames in the file access action sequence set, call the permission check identifier and execution time parameter contained in the permission check field, linearly arrange the permission check identifier according to the order of the execution time parameter, and organize each permission identifier node in time sequence to generate a permission check time sequence chain group.

[0015] S103: According to the permission check timing chain group, the permission identifier combination contained in each timing chain is removed, the unique combination structure is retained, and the retained permission identifier is sequentially concatenated to form a directed path topology, and a file access path list is generated.

[0016] As a further scheme of the application, the process of acquiring the continuously generated file access data frames in the micro-service environment is limited to only processing file access data frames that appear more than a set judgment reference in a unit time interval; in the process of extracting the access trigger timestamp as a sequence reference and combining the corresponding relationship of the access initiator identifier and the file storage location identifier, only the access actions that meet the continuity requirement of the access trigger timestamp are retained for generating a file access action sequence set; in the process of organizing each permission identifier node in chronological order, the arrangement relationship between the permission check identifiers is subjected to a sequential continuity restriction to ensure that each permission identifier node in the generated permission check timing chain group has relevance; in the process of concatenating the permission identifier sequence to form a directed path topology, the retained permission identifier combination structure is filtered using a topology path integrity rule.

[0017] As a further scheme of the application, the acquisition step S2 is:

[0018] S201: Based on the file access path list, the permission check node identifier appearing in each access track is extracted, the frequency of the appearance of the permission check node in different access tracks is detected, the frequency results are centrally organized according to the node identifier consistency, and a frequency statistical form distinguished by nodes is formed, and a permission node appearance times set is generated;

[0019] S202: According to the permission node appearance times set, the position index of each permission check node in the access track in the file access path list is extracted, the node frequency result is called as a weight reference, the position index and the corresponding weight are weighted and synthesized, the corresponding order weight expression of each permission check node is output, and a node order weight value set is generated;

[0020] S203: Based on the node order weight value set, the permission check nodes are sequentially organized according to the size relationship between the weight expressions, and a unified permission check order expression is formed according to the sequence result, and a file permission check sorting list is generated.

[0021] As a further scheme of the application, the acquisition step S3 is:

[0022] S301: According to the file permission check sorting list, the relative position number of each permission verification node in sequence is read in turn, the distribution state of each group number in the sorting range is detected, the position interval threshold is set according to the number increasing relationship, and all numbers are divided into two sets according to the interval boundary, and the permission node interval grouping set is generated;

[0023] S302: The number set in the permission node interval grouping set is called, the corresponding permission node identifier in the access track is matched according to the front segment set of the number interval, the nodes of this kind are uniformly marked as access front processing, and the node identifiers in the rear segment set are uniformly marked as access delay processing, and the permission node processing annotation set is generated;

[0024] S303: Based on the permission node processing annotation set, the order of each front processing node and delay processing node in the access path is extracted, whether the node identifier corresponding position has a corresponding relationship in the same track is detected, and the node mapping index data is generated according to the detection result, and the file permission processing order mapping table is generated.

[0025] As a further scheme of the application, the S4 acquisition step is:

[0026] S401: Calling the file access path list, for multiple continuous file operation paths associated with the same access initiator identifier, judging the operation trigger time stamp in the path according to the order relationship, and performing continuity determination on adjacent path paragraphs, obtaining the operation connection state formed by the same access initiator, generating the access initiator continuous path group;

[0027] S402: Based on the access initiator continuous path group, detecting the file operation type identifier appearing in each path, taking the file opening identifier as the starting node, judging the order association between the subsequent read identifier, modification identifier and close identifier in turn, and extracting the operation sequence that satisfies the order consistency to form a sequence unit, generating the file operation order sequence set;

[0028] S403: According to the file operation order sequence set, performing consistency judgment on the operation sequence unit repeatedly appearing in different access paths, and uniformly numbering and associating the consistent sequence, completing the expression of the coherent relationship between paths, generating the file access continuation path set.

[0029] As a further scheme of the application, the method further comprises:

[0030] S5: According to the file access continuation path set, combining the front and rear processing structure in the file permission processing order mapping table, the operation steps required for current access are sequentially arranged and merged, and the file intelligent management execution list is generated;

[0031] The file intelligent management execution list includes an access path combination structure, an execution order of permission checking, an arrangement of file processing actions, and a mapping rule of execution strategy.

[0032] As a further scheme of the present application, the obtaining step of S5 is:

[0033] S501: According to each access path data frame in the file access continuation path set, corresponding file operation actions and access initiator identifiers are extracted in sequence, and permission checking nodes and file processing nodes nested in the access behavior are extracted from the path segment, all node names are spliced in sequence according to the action triggering order, and an access action node order sequence string is generated;

[0034] S502: The access action node order sequence string and the front and rear processing label data in the file permission processing order mapping table are called, the order label positions corresponding to each permission node and processing node in the sequence string are detected, and the node arrangement direction is uniformly adjusted according to the label content, a node sequence set with consistent order is formed, and an access path order mapping set is generated;

[0035] S503: Based on the node distribution state of each sequence in the access path order mapping set, the permission checking segment and the file operation segment in each access path are extracted and attributed to the same access structure, the paths are aggregated according to the access initiator identifier, all aggregated access structures are uniformly summarized and output, and a file intelligent management execution list is generated.

[0036] The file intelligent management system based on microservices and cloud native architecture includes:

[0037] An access trajectory acquisition module acquires access initiator identifier codes, file storage location addresses, and permission numbers in microservice logs, arranges the permission numbers in ascending order according to timestamps and removes duplicates, combines the processed permission order and the access identifier, and generates a file access path list;

[0038] A permission set statistical module, according to the file access path list, counts the number of occurrences of each permission number and the path index position, calculates the weighted values and sorts them, extracts the permission number sequence in the sorted structure, and generates a file permission checking sorting list;

[0039] A processing order mapping module calls the file permission checking sorting list, divides the front and rear permission numbers according to their positions in the sequence, and establishes a mapping correspondence, and generates a file permission processing order mapping table;

[0040] A path coherence construction module, based on the file access path list, compares the operation order in the continuous path under the same access initiator, classifies the frequently occurring operation structure combinations, and arranges them into continuous access sequences, and generates a file access continuation path set;

[0041] The intelligent execution list module inserts the permission processing sequence into the file operation structure according to the file access continuation path set, integrates the path sequence according to the initiator, and generates a file intelligent management execution list.

[0042] The technical scheme provided by the embodiment of the present application has at least the following beneficial effects:

[0043] In the present application, the continuous access trajectory is constructed by extracting the visitor identifier and the file location identifier, the sorting result is formed by combining the time sequence and the occurrence frequency of the permission node, the relationship before and after the permission processing is divided according to the sorting interval, and the coherent access link is formed by associating the read, modification and close operation behaviors, so that the permission check sequence and the access behavior path are uniformly organized, the overall coordination degree and the processing coherence of the access path are improved, the split state between the permission processing and the file operation is reduced, and the process adaptation capability and the scheduling stability in the complex access scenario are enhanced. BRIEF DESCRIPTION OF DRAWINGS

[0044] Figure 1 The method flowchart of the present application is shown in the following figure:

[0045] Figure 2 The acquisition flowchart of S1 of the present application is shown in the following figure:

[0046] Figure 3 The acquisition flowchart of S2 of the present application is shown in the following figure:

[0047] Figure 4 The acquisition flowchart of S3 of the present application is shown in the following figure:

[0048] Figure 5 The acquisition flowchart of S4 of the present application is shown in the following figure:

[0049] Figure 6 The acquisition flowchart of S5 of the present application is shown in the following figure. DETAILED DESCRIPTION

[0050] The technical scheme in the present application will be described below with reference to the accompanying drawings.

[0051] In the embodiments of the present application, the words such as "example", "for example" and the like are used to represent an example, illustration or description. Any embodiment or design scheme described as "example" in the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. In fact, the word "example" is intended to present the concept in a specific way. In addition, in the embodiments of the present application, the meaning expressed by "and / or" can be both, or can be one of the two.

[0052] In the embodiments of the present application, "image" and "picture" can be used interchangeably, and it should be pointed out that the meanings expressed are consistent when the distinction is not emphasized.

[0053] In the embodiments of the present application, sometimes the subscript such as W1 can be written in the form of non-subscript such as W1, and the meanings expressed are consistent when the distinction is not emphasized.

[0054] In order to make the technical problems, technical solutions and advantages to be solved by the present application more clear, the following will be described in detail in conjunction with the drawings and specific embodiments.

[0055] Please refer to Figure 1 The present application provides a technical solution: a file intelligent management method based on microservices and cloud native architecture, comprising the following steps:

[0056] S1: Obtain the continuously generated file access records in the microservice environment, extract the access initiator identifier and file storage location identifier, sequentially compare the permission check links appearing in the same file access, arrange the continuous triggering sequence according to the time sequence, form a non-repeated access track, and generate a file access path list;

[0057] S2: Based on the file access path list, count the cumulative number of times each permission check link appears in different access tracks, record the position sequence of each link in the track, weight and combine the appearance number and position sequence and sort, complete the concentration arrangement in the file permission verification process, and generate a file permission check sorting list;

[0058] S3: According to the file permission check sorting list, position interval division is performed on the sorting result, the check links in the previous interval are marked as access pre-processing, and the check links in the post-interval are marked as access delayed processing, the corresponding relationship of the two types of processing sequence is arranged, and a file permission processing sequence mapping table is generated;

[0059] S4: Call the file access path list, compare the path formed by the continuous file operations of the same access initiator, identify the read-modify-close sequence appearing in sequence after the file is opened, arrange and summarize the repeated connection sequence, complete the path coherent relationship arrangement, and generate a file access continuation path set;

[0060] S5: Based on the set of file access continuation paths and the file permission processing order mapping table, the permission checks and file processing actions to be performed in a single file access are arranged in order. The arranged access paths and processing order are integrated and summarized to generate a file intelligent management execution list.

[0061] The file access path list includes access initiator identification information, file storage location identification information, permission check node sequence, and access behavior time tag. The file permission check sorting list includes permission node occurrence frequency value, node order position information, node weight score, and permission centralized sorting result. The file permission processing order mapping table includes pre-processing node identifier, post-processing node identifier, processing order correspondence, and processing interval division result. The file access continuation path set includes continuous access behavior sequence, repeated path connection pattern, operation behavior connection structure, and path stability characteristics. The file intelligent management execution list includes access path combination structure, permission check execution order, file processing action arrangement, and execution strategy mapping rules.

[0062] Please see Figure 2 The steps to obtain S1 are as follows:

[0063] S101: Obtain continuously generated file access data frames in the microservice environment, and extract the access initiator identifier, access trigger timestamp and file storage location identifier from them. Use the access trigger timestamp as the sequence base, and combine the correspondence between the access initiator identifier and the file storage location identifier to separate multiple sets of continuous access actions in the data frames and generate a file access action sequence set.

[0064] The file access data frames continuously generated in the micro-service environment are acquired. First, the record set with access frequency exceeding 5 times in a time interval is screened in the file access record, each record at least including an access identifier field, a file location identifier field and an access timestamp field. The access frequency data is extracted in a sliding manner with a unit of minute. The access frequency judgment reference value is set to 5. The access times of each file location by each access in each minute window are calculated. If the access times are greater than 5, the current data frame is retained. Subsequently, the access initiator identifier field in the data frame is extracted and subjected to string standardization processing. Invalid characters are removed and converted into a unified format, for example, into a lower case letter form. The timestamp field is extracted and converted into a standard integer format with a conversion granularity of seconds, so as to be used for sorting and subsequent difference calculation. The file location identifier field is extracted and grouped according to the access and file identifier. The continuous actions of the same access to the same file are sorted according to the timestamp. The time interval between adjacent records is calculated. The access time interval threshold is set to 20 seconds. If the time difference between two adjacent accesses is less than or equal to 20 seconds, the continuous access action is judged. If the time difference is greater than the threshold, the current sequence is terminated and a new sequence assembly is started. Each valid sequence includes at least two or more actions. In the example, user A continuously accesses file X at 15:01:10, 15:01:25 and 15:01:38, with interval times of 15 seconds and 13 seconds, which meets the set threshold, that is, a set of continuous access actions is formed. The sequence is generated as: [accessor A, file X, 15:01:10→15:01:25→15:01:38]. All sequences meeting the access frequency reference and time continuity judgment are integrated into a file access action sequence set.

[0065] S102: Based on each group of data frames in the file access action sequence set, the permission check identifier and the execution time parameter contained in the permission check field are called. The permission check identifier is linearly arranged according to the order of the execution time parameter, and each permission identifier node is organized in time sequence to generate a permission check time sequence chain group.

[0066] Based on each group of data frames in the file access action sequence set, the permission check field carried by each access action is extracted, the permission check identifier and the execution time parameter are obtained through field analysis, for example, the permission identifier is in the form of "read", "write", "delete", the execution time parameter is the second-level timestamp when the operation occurs, all permission identifiers in the same group are arranged in ascending order according to the timestamp value, a preliminary permission arrangement chain is formed, the minimum interval of the execution time is set to 1 second, only the arrangement combination with the interval between the permission identifiers less than or equal to 1 second in the continuous time is reserved, if the time interval exceeds 1 second, it is considered that the permission identifiers are not associated, the current arrangement relationship is discarded, only the permission identifier node combination meeting the continuity requirement is reserved, for each sequence corresponding to the access visitor and the file position, the permission identifier node chain arranged in time sequence is constructed in turn, for example, the visitor A accesses the file X in turn calls the read and write permissions, the execution time is 10:02:11 and 10:02:12 respectively, the permission check time sequence chain [read→write] is formed, if the third permission delete is triggered at 10:02:30, it is not included in the chain due to exceeding the set time interval, finally, the effective permission check time sequence chain group is formed.

[0067] S103: According to the permission identifier combination contained in each time sequence chain in the permission check time sequence chain group, the permission node combination repeatedly appearing in different access actions is removed, the unique combination structure is reserved, and the reserved permission identifiers are sequentially connected to form a directed path topology, and a file access path list is generated;

[0068] For each permission check timing chain, first count all the access sequence of the combination of the permission identifier, by judging the order of the same group of permission identifier, remove the repeated combination, set the judgment standard as the order of the same group of permission identifier and the same access and file identifier, for example, there are three sequences respectively [read→write], [read→write], [read→write→delete], only keep two unique combinations: [read→write] and [read→write→delete], for the remaining combination, according to the order of the permission sequence, the directed path is formed, the permission identifier is regarded as the path node, and the permission path chain is generated by connecting in chain mode, such as "read→write→delete", which means that the access user executes three permission operations in sequence during the process of accessing the file, forming a complete access path, for each path, the path integrity rule is used for judgment, the shortest length of the path is set as 2 and the longest length is set as 5, if the number of nodes in the path does not meet the range or there is an isolated permission identifier node, that is, the node is not connected to the previous step or the next step, the path combination is removed, for example, the path [read→write→delete→share→update→remove] exceeds 5 nodes, which is judged as unqualified path and discarded, finally, the file access path list is formed.

[0069] Please refer to Figure 3 , the acquisition step S2 is:

[0070] S201: based on the file access path list, the permission check node identifier appearing in each access track is extracted, the frequency of the permission check node appearing in different access tracks is detected, the frequency result is centralized and arranged according to the consistency of the node identifier, and the frequency statistics form is formed according to the node, and the permission node appearance times set is generated;

[0071] The permission check node identifier field in each path is extracted from the file access path list, each path is processed as an independent access track set, and each permission identifier in each access track is extracted and sorted one by one. For example, path A is [read→write→delete], and path B is [read→update→delete]. The read, write, and delete permission node identifiers are extracted from path A, and the read, update, and delete node identifiers are extracted from path B. Then, all extracted node identifiers are classified and counted. The number of times the same permission identifier appears in all path tracks is added up, for example, read appears in both path A and path B, with a frequency of 2, and delete also appears in both paths, with a frequency of 2. Write appears only once in path A, with a frequency of 1. The above node identifiers and their corresponding frequencies are established in the form of a key-value pair statistical table to form an intermediate statistical data set. Then, the statistical results are sorted in ascending order according to the node identifier, and a frequency summary table is established after distinguishing the unique identifier name of each node. The frequency results are then sorted and archived according to the node identifier, for example, the frequency of all read permission identifiers is summarized and classified as [read:2], the frequency of write is [write:1], the frequency of delete is [delete:2], and the frequency of update is [update:1]. When multiple path tracks appear, the frequency of each node appearing in each path track is accumulated and identified according to the corresponding path number. Finally, the permission node appearance frequency set is generated by one-to-one correspondence between the node identifier and the frequency result.

[0072] S202: According to the permission node appearance frequency set, the position index of each permission check node in the file access path list is extracted, the node frequency result is called as a weight reference, the position index and the corresponding weight are weighted and synthesized, the corresponding order weight expression of each permission check node is output, and the node order weight value set is generated;

[0073] According to the number of occurrence of the permission node set, each path in the file access path list is read in turn and the position index number of each permission check node in the path is recorded, for example, the path C is [read→write→delete], the position index of read is 1, the position index of write is 2, and the position index of delete is 3, the number of occurrence of the node in the aforementioned frequency set is called as a weight reference value, for example, the frequency of read is 2, the frequency of write is 1, and the frequency of delete is 2, in the processing process, the product of the node index position and the corresponding frequency is calculated to obtain the weight value, for example, the weighted value of the read node is 1*2=2, the weighted value of the write node is 2*1=2, and the weighted value of the delete node is 3*2=6, in the execution process, the weighted values in the path of each node are merged and stored, all path trajectories are traversed to calculate the weighted values of the same nodes, for example, if read appears at the position index 2 in another path, the weighted value of read is 2*2=4, and the cumulative weight of read after the summation is 2+4=6, the weighted values are classified into the weight value set of the corresponding node, the weight classification interval is set, for example, 0-3 is a low weight, 4-6 is a medium weight, and 7 and above is a high weight, through the classification standard, it can be judged that the current read is a medium weight node, the delete is a high weight node, and the write is a low weight node, through the construction process of the weight value set, the comprehensive position weight performance of each node can be obtained, and finally a node order weight value set is formed.

[0074] S203: Based on the node order weight value set, the permission check nodes are sequentially organized according to the size relationship between the weight expressions, and a unified permission check order expression is formed according to the sequence result, and a file permission check sorting list is generated;

[0075] Based on the node order weight value set, first, the weight value entries corresponding to all nodes are read, and sorting operation is performed according to the numerical value, the sorting order from large to small is set, and all nodes are arranged in descending order of weight value, for example, the delete weight is 8, the read weight is 6, and the write weight is 3, and the sorting is [delete→read→write], when there are multiple nodes with the same weight value, the average value of the position index in the path is used for auxiliary sorting, if the average index is small, it is arranged in front, for example, the read and write weight values are the same and are both 6, but the average index of read is 1.5 and the average index of write is 2.0, so the read is arranged before the write, after the execution of all node weight sorting and position order adjustment, a unified permission order expression is formed in turn, and finally a complete permission check order list is constructed as the final output.

[0076] Please refer to Figure 4 , the acquisition step of S3 is:

[0077] S301: According to the file permission check sorting list, read the relative position number of each permission verification node in sequence, detect the distribution state of each group number in the sorting range, set the position interval threshold according to the increasing relationship of the number, and divide all numbers into two sets according to the interval boundary, and generate the permission node interval grouping set;

[0078] Read the arrangement order of all permission verification nodes in the file permission check sorting list in sequence, and assign a relative position number to each node, for example, the order is [read, verify, write, delete], and the number is 1, 2, 3, 4 in turn, store the number as an integer list after obtaining it, analyze the number list, calculate the difference between the numbers and record the trend, and judge whether it has a monotonic increasing relationship. If there is a change in the order of the number that violates this trend, mark the abnormal number group. In the ideal case, the number should show a stable increasing state. According to the length of the overall number sequence, set the position interval threshold, set the threshold to determine the boundary, for example, there are 4 nodes in the current order, and the position interval threshold is set to the second number, that is, the value is 2. Further, the number sequence is divided into two sets according to this threshold. The numbers less than or equal to the threshold are classified into the front set, and the numbers greater than the threshold are classified into the rear set. For example, the number sequence is [1, 2, 3, 4], then the numbers 1 and 2 are classified into the front set, and the numbers 3 and 4 are classified into the rear set. When performing the division action, it is necessary to ensure that each number is unique and not repeated and is completely allocated. After the division is completed, two sets of numbers are formed, and the sets are bound and stored with the corresponding permission nodes to construct the interval grouping mapping set, and finally the permission node interval grouping set is generated.

[0079] S302: Call the number set in the permission node interval grouping set, match the corresponding permission node identifier in the access track according to the front set of the number interval, uniformly mark this type of node as access pre-processing, and uniformly mark the node identifier in the rear set as access delayed processing, generate the permission node processing annotation set;

[0080] The number set in the permission node interval grouping set is called first to read the permission identifier content corresponding to the front number set, and all numbers in the set are classified as access pre-processing. For example, the number set [1, 2] corresponds to the permission node [read, verify], and read and verify are marked with "pre-processing" identifier. Similarly, the number set [3, 4] corresponds to the permission node [write, delete], and it is uniformly marked as "delayed processing". After completing the processing classification and marking of the front and rear sections, the permission identifier in the access track is matched. The permission nodes in each access path are compared with the pre-processing and delayed processing identifier, and the corresponding matched nodes are marked with the processing identifier. For example, path A is [read, write, delete], in which read hits the pre-set, write and delete hit the post-set, and the path A node processing mark is [read-pre, write-delay, delete-delay]. The process depends on the one-to-one comparison of the nodes in the path with the nodes in the annotation set. Those who are completely consistent are considered to be a successful match. After matching, each node is attached with a processing type attribute field. The marking process is repeated until all path tracks are marked. Finally, the permission node processing annotation set is generated.

[0081] S303: Based on the permission node processing annotation set, extract the pairing combination of each pre-processing node and delayed processing node in the access path, detect whether the node identifier corresponding position has a corresponding relationship in the same track, and generate node mapping index data according to the detection result to generate a file permission processing order mapping table;

[0082] The annotated set is processed based on the permission node. First, nodes marked as pre-processing and nodes marked as post-processing in all access paths are extracted, and the relative positions of each node in the path are recorded, for example, path B is [read-pre, verify-pre, write-post, delete-post], then read and verify belong to the pre-processing set, and write and delete belong to the post-processing set, then the two-by-two combination pairing between the pre- and post-nodes is performed in units of paths, each pre-node is combined with each node in the post-section, for example, read and write form a group, read and delete form a group, verify and write form a group, and verify and delete form a group, a total of four pairing combinations, after performing the pairing combination, the specific sequence position number of each node in the path is obtained, the number is read, and the position is compared, if the pre-node number is less than the post-node number, it is marked as a valid pairing, otherwise it is regarded as an abnormal combination and is removed, the pairing and position judgment action is continued to be performed on all paths, the node pair name and corresponding position number of all valid pairing combinations are recorded, the mapping entry structure is constructed, the node pairing index structure is organized according to the path, and all valid pairing sets are combined to form a complete data mapping set, and finally the file permission processing order mapping table is output and generated.

[0083] Please refer to Figure 5 , the acquisition step of S4 is:

[0084] S401: Call the file access path list, associate multiple continuous file operation paths for the same access initiator, judge the precedence relationship according to the operation trigger timestamp in the path, and perform continuity determination on adjacent path paragraphs, obtain the operation connection state formed by the same access initiator, and generate the access initiator continuous path group;

[0085] According to the access initiator identification field recorded in each path in the file access path list, all paths are grouped, paths of the same access initiator are classified into the same set, the operation trigger timestamp field of each path in each set is extracted and converted into a uniform numerical time format for sorting, the time sorting granularity is set to seconds, the timestamp difference between adjacent paths in the sorted path sequence is compared, the continuity determination time threshold is set to 300 seconds, if the trigger time difference between two paths is less than or equal to the threshold, the two paths are regarded as continuous path segments, otherwise, the two paths are regarded as independent segments, for example, user X triggers three paths, the timestamps are 1000, 1250 and 1600 seconds respectively, the time difference between path 1 and path 2 is 250 seconds, which satisfies the continuity, the time difference between path 2 and path 3 is 350 seconds, which exceeds the set threshold, therefore, path 3 is regarded as a new starting segment, finally, user X has two continuous path groups, which are [path 1, path 2] and [path 3], repeat the operation to process all path sets corresponding to the access initiator identification, analyze the time difference and mark the path group number of each set, mark the continuous path grouping identification field of all paths, and finally generate the access initiator continuous path group.

[0086] S402: Based on the access initiator continuous path group, the file operation type identification appearing in each path is detected, the file opening identification is taken as the starting node, the order relationship between the subsequent read identification, modification identification and close identification is judged in sequence, and the operation sequence satisfying the order consistency is extracted to form a sequence unit, and a file operation order sequence set is generated.

[0087] Based on the access initiator continuous path group, first read the file operation type identification field carried in each path, common operation types include open, read, write, close, etc. Arrange the operations in the path in chronological order, identify the operation sequence with open operation as the first node, then read the next operation type one by one and judge whether it is read or write, judge whether the order meets the standard process of "open→read→write→close", if the order deviates from the standard mode in the path, for example, write appears before read or close appears before write, it is considered not to meet the sequence consistency and is excluded. The sequence consistency judgment rule is that the node type must strictly follow open first, followed by read and write (the order can be exchanged), and finally close. Any missing node is marked as an incomplete sequence and skipped. If all requirements are met, the operation sequence is extracted and recorded, including the original path number, time node and operation type in the operation sequence, a standard operation sequence unit structure is constructed, and after all paths are executed, the operation sequences that meet the conditions are stored in the sequence set. For example, the operation sequence of path A is [open, read, write, close], which is considered as a valid operation sequence unit. The operation of path B is [open, write, close], which also meets the standard order and is considered as another operation unit. Finally, the file operation order sequence set is generated.

[0088] S403: According to the file operation order sequence set, the consistency of the operation sequence units repeatedly appearing in different access paths is judged, and the consistent sequences are uniformly numbered and associated. The expression of the coherent relationship between the paths is completed, and the file access continuation path set is generated.

[0089] According to the file operation order sequence set, first, the operation type composition and sequence structure of each sequence unit are extracted, a mapping index with operation type string as the key is constructed, for example, sequence [open, read, write, close] is converted into operation key "open-read-write-close", and sequence [open, write, close] is converted into "open-write-close"; then, all sequence keys are scanned for duplication, the repeatedly appearing sequence keys are found and the appearance path number list is counted, for the sequence keys appearing more than once, a uniform number identification is given, for example, number S01 corresponds to "open-read-write-close", and number S02 corresponds to "open-write-close"; all sequence units with the same operation order are aggregated and classified and marked with a uniform number, at the same time, the path number corresponding to each number is recorded, the corresponding arrangement of operation behaviors between different paths is completed, for the sequence keys not appearing repeatedly, an independent number is given to ensure the integrity of the identification, finally, the path coherent structure is constructed through the bidirectional index relationship between the number and the path, the corresponding expression of the operation behaviors across the paths is realized, and finally, the file access continuation path set is generated.

[0090] Please refer to Figure 6 The acquisition step S5 is:

[0091] S501: According to the file access continuation path set, the corresponding file operation action and access initiator identification are extracted from each access path data frame in turn, and the permission verification node and file processing node embedded in the access behavior are extracted from the path segment, all node names are spliced in turn according to the action trigger sequence, and the access action node order sequence list is generated;

[0092] According to the access path data frames in the file access continuation path set, first, the file operation action field and the access initiator identification field in the path data frame are extracted, the file operation action is standardized, the operation field in the original log record is uniformly mapped to a standard operation identification, for example, "open_file", "openDoc" and the like are all classified as "open", the trigger sequence of the operation action in each path is extracted, and the trigger time is sorted in ascending order to ensure that the operation actions are arranged in chronological order. Then, the nested fields in each path segment are read to obtain the names of the permission verification nodes and the file processing nodes. If there are multiple nested levels in the permission node field, the permission identification of each level is extracted in turn to ensure that there is no missing. The processing nodes such as read-write cache and file lock operation also need to extract the complete identification content. For example, in the path segment, the node sequence is detected as "open→auth_check→read→buffer_write→close", and then the operation action "open", the permission node "auth_check", the processing node "buffer_write", the operation action "read" and "close" are recorded in turn. Then, all the node names are spliced according to the operation action trigger sequence. The connection sequence is completely based on the arrangement of the timestamp field from early to late, and the original sequence cannot be changed. Finally, a complete access action node sequence list is obtained. For example, in the above example, the generated list is [open, auth_check, read, buffer_write, close]. Each path corresponds to a list, and the list content is achieved by traversing the node field and splicing the node name.

[0093] S502: Call the access action node sequence list and the front and rear processing label data in the file permission processing sequence mapping table, detect the sequence label position corresponding to each permission node and processing node in the list, and uniformly adjust the node arrangement direction according to the label content to form a node sequence set with consistent sequence and generate an access path sequence mapping set;

[0094] The access action node sequence list and the pre-processing and post-processing label data in the file permission processing sequence mapping table are called. First, the node name list in each sequence and its corresponding position index are read, and then the processing label corresponding to each node is retrieved from the mapping table. The label value is "pre" or "delay". A one-to-one correspondence table of processing labels and node positions is constructed, and then all nodes in the sequence are compared for processing labels. If there is a case where the node position sequence does not match the label type, for example, a pre-label node is arranged after a delay-label node, the position of the pre-label node in the sequence needs to be adjusted. The adjustment rule is to move the pre-label node to before all delay nodes, keeping the original order of pre-nodes unchanged. Similarly, the delay nodes also keep the relative order unchanged, only the order between the two categories is reorganized. For example, if the original order of a sequence is [auth_check (delay), open (pre), read (pre), write (delay)], the adjusted order should be [open, read, auth_check, write]. When sorting, the label data needs to be called and the node labels are clustered. First, sort the pre-group and then splice the delay group. Finally, form a node sequence with consistent order. Record the node sequence after processing as the adjusted sequence. Each original sequence and its adjusted sequence form a mapping entry. After repeating the processing of all path sequences, all adjustment results are summarized to generate an access path sequence mapping set.

[0095] S503: Based on the node distribution state of each sequence in the access path sequence mapping set, extract the permission verification segment and the file operation segment in each access path and classify them into the same access structure. The paths are aggregated according to the access initiator identifier. All access structures collected are uniformly summarized and output to generate a file intelligent management execution list;

[0096] Based on the node distribution state of each sequence in the access path order mapping set, first, the permission check section and the file operation section in each node sequence are partitioned and labeled, and the judgment standard is set as the classification of the node name containing auth, verify, check and other keywords as the permission check section, and the name containing open, read, write, close and other keywords as the file operation section. The nodes are classified and labeled in this way, and then the node sequence of each path is executed for segmentation operation. The classified permission nodes and operation nodes are extracted to form two sub-sequences, which are included in the same access structure record. The access initiator identifier is taken as the aggregation basis, and the access structures of the same access are combined and stored to form a structure mapping group with the access as the key. For example, user A has three paths, which correspond to three permission and operation section combinations respectively. Then the three groups of sub-sequences are combined under the name of user A to ensure that the original path source number and time sequence are retained during the aggregation process, avoid node information loss or repetition, and finally the structure groups of all access are output in a centralized manner to generate a file intelligent management execution list.

[0097] The file intelligent management system based on microservices and cloud native architecture includes:

[0098] An access trajectory acquisition module acquires the access initiator identifier code, file storage location address and permission number in the microservice log, arranges the permission numbers in ascending order according to the timestamp and removes the duplicates, combines the processed permission order and the access identifier, and generates a file access path list.

[0099] A permission centralized statistical module, according to the file access path list, counts the number of occurrences of each permission number and the path index position, calculates the weighted values and sorts them, extracts the permission number sequence in the sorted structure, and generates a file permission check sorting list.

[0100] A processing order mapping module calls the file permission check sorting list, divides the preceding and delayed permission numbers according to their positions in the sequence, and establishes a mapping and comparison relationship to generate a file permission processing order mapping table.

[0101] A path coherence construction module, based on the file access path list, compares the operation order in the continuous paths of the same access initiator, classifies the frequently occurring operation structure combinations, and arranges them into continuous access sequences to generate a file access continuation path set.

[0102] An intelligent execution list module, according to the file access continuation path set, calls the file permission processing order mapping table, inserts the permission processing order into the file operation structure, groups and integrates the path order according to the initiator, and generates a file intelligent management execution list.

[0103] The above merely illustrates the specific embodiments of the present application, but the protection scope of the present application is not limited thereto, any person skilled in the art can easily think of the changes or replacements within the technical range disclosed by the present application, which should be covered in the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A file intelligent management method based on microservices and cloud-native architecture, characterized in that, Includes the following steps: S1: Obtain access records generated in the microservice environment, extract the access initiator and target file location identifier, sort the permission steps that appear sequentially in the same access by time, eliminate duplicates and establish a continuous path trajectory to generate a file access path list; the file access path list includes access initiator identifier information, file storage location identifier information, permission check node sequence, and access behavior time tag. S2: Based on the file access path list, count the number of times each permission check step appears in the path, record its average position in the path, merge and sort according to cumulative frequency and average position, and generate a file permission check sorting list. The file permission check and sorting list includes the frequency value of permission nodes, node order position information, node weight score, and permission centralized sorting result; S3: Based on the file permission check and sorting list, set sorting boundaries to classify the earlier steps into pre-access processing and the rest into post-access processing, mark each processing position and order label, and generate a file permission processing order mapping table; the file permission processing order mapping table includes pre-access processing node identifiers, post-access processing node identifiers, processing order correspondence, and processing interval division results. S4: Call the file access path list, compare multiple access paths of the same initiator, sort out the order of opening, reading and modifying files, filter out duplicate structure paths and merge them to generate a set of file access continuation paths; the set of file access continuation paths includes continuous access behavior sequence, duplicate path connection pattern, operation behavior connection structure and path stability characteristics. S5: Based on the set of file access continuation paths and the pre- and post-processing structures in the file permission processing order mapping table, the operation steps required for the current access are sequentially organized and merged to generate a file intelligent management execution list; the file intelligent management execution list includes the access path combination structure, permission check execution order, file processing action arrangement, and execution strategy mapping rules. The steps for obtaining S5 are as follows: S501: Based on the data frames of each access path in the file access continuation path set, extract the corresponding file operation actions and access initiator identifiers in sequence, extract the permission verification nodes and file processing nodes nested in the access behavior from the path segment, and concatenate all node names in the order of action triggering to generate an access action node sequence string. S502: Call the preceding and following processing tag data in the mapping table between the access action node sequence and the file permission processing sequence, detect the sequence tag position of each permission node and processing node in the sequence, and adjust the node arrangement direction uniformly according to the tag content to form a node sequence set with consistent order, and generate an access path sequence mapping set. S503: Based on the node distribution status of each sequence in the access path sequence mapping set, extract the permission verification segment and file operation segment in each access path and classify them into the same access structure. Aggregate the paths according to the access initiator identifier, and output all the aggregated access structures in a unified manner to generate a file intelligent management execution list.

2. The intelligent file management method based on microservices and cloud-native architecture according to claim 1, characterized in that, The steps for obtaining S1 are as follows: S101: Obtain continuously generated file access data frames in the microservice environment, and extract the access initiator identifier, access trigger timestamp and file storage location identifier from them. Use the access trigger timestamp as the sequence base, and combine the correspondence between the access initiator identifier and the file storage location identifier to separate multiple sets of continuous access actions in the data frames and generate a file access action sequence set. S102: Based on each set of data frames in the file access action sequence set, call the permission verification identifier and execution time parameter contained in the permission check field, arrange the permission verification identifiers linearly according to the order of the execution time parameters, and organize each permission identifier node in chronological order to generate a permission verification time sequence chain group. S103: Based on the permission identifier combinations contained in each time chain of the permission verification time chain group, remove the permission node combinations that appear repeatedly in different access actions, retain the unique combination structure, and sequentially concatenate the retained permission identifiers to form a directed path topology, generating a file access path list.

3. The intelligent file management method based on microservices and cloud-native architecture according to claim 2, characterized in that: The process of obtaining continuously generated file access data frames in the microservice environment is limited to processing only file access data frames that appear more frequently than a set judgment benchmark within a unit time interval. In the process of extracting the access trigger timestamp as the sequence reference and combining it with the correspondence between the access initiator identifier and the file storage location identifier, only the access actions that meet the access trigger timestamp continuity requirement are retained to generate the file access action sequence set. In the process of organizing the permission identifier nodes in chronological order, a sequential continuity restriction is imposed on the arrangement relationship between permission verification identifiers to ensure that the permission identifier nodes in the generated permission verification chronological chain group are related. In the process of sequentially concatenating permission identifiers to form a directed path topology, topology path integrity rules are used to filter the retained permission identifier combination structure.

4. The intelligent file management method based on microservices and cloud-native architecture according to claim 1, characterized in that, The steps for obtaining S2 are as follows: S201: Based on the file access path list, extract the permission verification node identifiers that appear in each access path, detect the frequency of the permission verification nodes in different access paths, organize the frequency results in a centralized manner according to the consistency of the node identifiers, and form a frequency statistics form distinguished by nodes to generate a set of permission node occurrence times. S202: Based on the set of occurrence times of the permission nodes, extract the position index of each permission verification node in the access trajectory in the file access path list, call the node frequency result as the weight benchmark, weight the position index and the corresponding weight, output the sequential weight expression of each permission verification node, and generate a set of node sequential weight values. S203: Based on the node order weight value set, the permission verification nodes are serialized and organized according to the size relationship between the weight expressions, and a unified permission verification order expression is formed according to the sequence result to generate a file permission check sorting list.

5. The intelligent file management method based on microservices and cloud-native architecture according to claim 1, characterized in that, The steps for obtaining S3 are as follows: S301: According to the file permission check sorting list, read the relative position number of each permission verification node in the sequence in turn, detect the distribution status of each group of numbers in the sorting range, set the position interval threshold according to the number increment relationship, and divide all numbers into two sets according to the interval boundary to generate permission node interval grouping set; S302: Call the set of numbers in the grouping set of the permission node interval, match the corresponding permission node identifier in the access trajectory according to the first part of the number interval set, uniformly mark such nodes as access pre-processing, and uniformly mark the node identifiers in the second part set as access deferred processing, and generate a permission node processing annotation set. S303: Based on the permission node processing annotation set, extract the sequential pairing combination of each pre-processing node and post-processing node in the access path, detect whether the corresponding positions of the node identifiers have a corresponding relationship in the same trajectory, and generate node mapping index data according to the detection results to generate a file permission processing order mapping table.

6. The intelligent file management method based on microservices and cloud-native architecture according to claim 1, characterized in that, The steps for obtaining S4 are as follows: S401: Call the file access path list, for multiple consecutive file operation paths associated with the same access initiator identifier, perform a sequential relationship judgment based on the operation trigger timestamp in the path, and perform a continuity judgment on adjacent path segments to obtain the operation connection status formed by the same access initiator, and generate a continuous path group of access initiators. S402: Based on the continuous path group of the access initiator, detect the file operation type identifiers appearing in each path, take the file open identifier as the starting node, sequentially determine the sequential association between the subsequent read identifier, modify identifier and close identifier, and extract the operation sequence that satisfies the sequential consistency to form a sequence unit, and generate a file operation sequence set; S403: Based on the file operation sequence set, perform consistency judgment on the operation sequence units that appear repeatedly in different access paths, and uniformly number and associate the consistent sequences to complete the expression of the coherent relationship between paths and generate a set of file access continuation paths.

7. A file intelligent management system based on microservices and cloud-native architecture, characterized in that: The system is used in the file intelligent management method based on microservices and cloud-native architecture as described in any one of claims 1-6, and the system comprises: The access trajectory collection module obtains the access initiator identifier, file storage location address and permission number from the microservice logs, sorts the permission numbers in ascending order by timestamp and removes duplicates, and combines the processed permission order with the access identifier to generate a list of file access paths. The permission centralized statistics module counts the number of occurrences of each permission number and the path index position based on the file access path list, calculates the weighted value of the two and sorts them, extracts the permission number sequence in the sorted structure, and generates a file permission check sorted list. The processing sequence mapping module calls the file permission check sorting list, divides the preceding and following permission numbers according to their positions in the sequence, establishes a mapping relationship, and generates a file permission processing sequence mapping table. The path coherence construction module, based on the file access path list, compares the operation order in consecutive paths under the same access initiator, classifies frequently occurring operation structure combinations, organizes them into consecutive access sequences, and generates a set of file access continuation paths. The intelligent execution list module, based on the set of file access continuation paths, calls the file permission processing order mapping table, inserts the permission processing order into the file operation structure, integrates the path order by initiator, and generates a file intelligent management execution list.

Images