Enterprise data optimization management system and method based on big data
By recording file operation time in the enterprise file processing system, calculating processing cycles and intervals, and implementing customized saving strategies, the file loss and redundancy problems are solved, and storage management efficiency and security are improved.
Patent Information
- Application Number
- CN202411208362.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-30
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2044-08-30
AI Technical Summary
During the process of enterprise file processing, file loss and redundancy problems exist, resulting in low management efficiency and waste of storage space.
Through the first-level, second-level and third-level file entry ports, record the operation time of the file processor, calculate the processing cycle and interval, execute customized saving strategies, generate file copy sets, avoid redundancy and loss, and optimize storage.
Accurately calculate file processing time, avoid redundancy caused by misoperation, reasonably manage storage space, and ensure data security and efficiency.
Smart Images

Figure CN119003469A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of enterprise data optimization, and in particular to an enterprise data optimization management system and method based on big data. Background Art
[0002] Enterprise document processing and management is an important part of the enterprise information system, which is related to the effective transmission and storage of information. With the expansion of enterprise scale and the complexity of business processes, manual management of large numbers of documents has become cumbersome and error-prone. Therefore, modern enterprises are increasingly relying on technical means to optimize document management processes. Document management has functions such as document version control, permission management, automatic archiving, search and retrieval. Version control allows multiple users to edit and review documents at different time points, while retaining historical version records for easy backtracking and recovery. By setting different access rights, the security and controllability of sensitive information are ensured. Users can access specific files or perform specific operations according to the authorization level, effectively preventing data leakage. In summary, by utilizing modern information technology, enterprises can achieve more efficient and secure document processing and management, thereby improving work efficiency and corporate competitiveness.
[0003] Currently, when processing corporate files, if they are not saved in time, there is a risk of file loss. At the same time, considering the capacity of the memory, if too many highly repetitive files are saved, file redundancy will occur, which is not conducive to memory management.
[0004] This solution proposes to obtain the execution time point set according to the collection interval and the execution interval set, judge the size of the file at each time point, and execute different strategies according to the judgment result. Summary of the invention
[0005] The present invention provides an enterprise data optimization management system and method based on big data, which are used to promote the solution of the problems mentioned in the above background technology.
[0006] The present invention provides the following technical solution: a method for optimizing enterprise data management based on big data, comprising: Through the primary file input port: save the files processed by the primary file processor; Through the secondary file input port: save the files that the primary file processor has processed and submitted to the secondary file processor for review; Through the third-level file entry port: save the files submitted by the second-level file processor after review; For each file in the primary file entry port; Record the time when the primary file processor opens and closes the file each time, and obtain the processing time set; Execute the processing cycle calculation strategy to obtain the processing cycle; When a primary document processor processes a document: During the processing cycle; Set the threshold interval for judging whether the primary file handler has opened the file by mistake; According to the threshold interval, the preprocessing strategy is executed to obtain the execution interval set; Set the collection interval for automatic file saving; According to the execution interval set and the collection interval, a customized saving strategy is executed to save the files in the process, obtain the file copies, and form a file copy set; Each time the primary file processor closes a file, the primary file processor is asked whether to submit the file processed this time to the secondary file processor; If the primary file processor chooses to submit, the submission strategy is executed to process the file received by the secondary file processor.
[0007] Optionally, the execution processing cycle calculation strategy includes: The files in the third-level file input port are all files that have been processed; Get the total number of files that have been processed by the first-level file processor, which is recorded as the number of completions; When the number of completions ≧ 1: Obtain all the documents that have been processed by the first-level document processor; For each file: The time point when the file is first opened is recorded as the processing starting point; The last time the file was closed is recorded as the end point of processing; Calculate the interval between the processing start point and the processing end point of each file, and record them as the first interval, the second interval, ... the rth interval respectively; Calculate processing cycles; The processing cycle is calculated by the following formula: (first interval + second interval + ... + rth interval) ÷ r = processing period.
[0008] Optionally, the execution processing cycle calculation strategy includes: When the number of completions = 0: Obtain the processing cycles of all other first-level file processors, which are recorded as the first cycle, the second cycle, and so on the tth cycle; Calculate processing cycles; The processing cycle is calculated by the following formula: (First cycle + second cycle + … + tth cycle) ÷ t = the processing cycle of the first processing by the first-level file processor.
[0009] Optionally, executing a preprocessing strategy according to a threshold interval to obtain an execution interval set includes: In the processing time set: Calculate the interval between each file opening and the corresponding file closing, and record it as the processing interval; Get all processing intervals and compare them with the threshold interval: Get all processing intervals greater than the threshold interval to form an execution interval set.
[0010] Optionally, executing a customized saving strategy according to the execution interval set and the collection interval to save the files in the processing process and obtain a file copy set includes: Get any element in the execution interval set and record it as the marked interval; Execute the interval partitioning strategy to obtain the execution time point set; Get the size of the file corresponding to each time point in the execution time point set, record it as file storage data, and form a file storage data set in the order of appearance time from early to late; Set the threshold data for judging whether to save the file, the threshold data is greater than 0; Traverse each element in the file storage data set in the order of the time when the element appears: S1, obtaining an element in the file storage data set, recorded as the first marked data; S2, obtaining the next element adjacent to the first labeled data, and recording it as the second labeled data; S3, calculating the second labeled data minus the first labeled data, and recording the result as judgment data; S4. When the judgment data is greater than or equal to the threshold data, the file is saved at the time point corresponding to the second mark data to obtain a file copy; S5. When the judgment data is greater than zero and less than the threshold data: Obtain the next element adjacent to the second labeled data in the file storage data set, replace the current second labeled data, and repeat S3-S5; S6. When the judgment data is less than zero, a backtracking optimization strategy is executed on all file storage data before the second marking data.
[0011] Optionally, executing the backtracking optimization strategy on all file storage data before the second marking data includes: Acquire all file storage data before the second marked data to form a backtracking data set; Subtract the value of each element in the backtracking data set from the value of the second labeled data, and the results form a backtracking difference set; Traverse all elements in the backtracking difference set and obtain the largest element less than zero, which is recorded as the backtracking location difference; The time point at which the file storage data corresponding to the backtracking positioning difference appears is recorded as the backtracking positioning starting point; The time point corresponding to the second marked data is recorded as the end point of the backtracking positioning; Then, all the file copies saved from the backtracking positioning start point to the backtracking positioning end point are deleted from the file copy set; A copy of the file corresponding to the second markup data is saved.
[0012] Optionally, the execution interval division strategy is used to obtain an execution time point set, including: Get the start time of the marking interval; Get the end time point of the marking interval; The time point that is one sampling interval away from the start time is recorded as the first time point; The time point that is 2 sampling intervals away from the start time is recorded as the second time point; … The time point u collection intervals away from the start time is recorded as the u-th time point, where the u-th time point is less than or equal to the end time point; The start time point, the end time point, and all time points between the start time point and the end time point together constitute an execution time point set.
[0013] Optionally, the execution submission strategy includes: The secondary file processor receives the file sent by the primary file processor, which is recorded as received file: For all files in the secondary file entry port: If there is a file with the same file name as the received file, then the file is recorded as the first draft file; Replace the first draft file with the received file and store it in the secondary file input port; If there is no file with the same file name as the received file, traverse all files in the secondary file input port and compare them with the received file: Set the threshold duplication for judging whether a file is saved as the first version in the secondary file input port; If there is a file whose duplication degree with the received file is greater than the threshold duplication degree, the file is recorded as the second draft file; Replace the second draft file with the received file and store it in the secondary file input port; If there is no file whose duplication degree with the received file is greater than the threshold duplication degree, the received file will be stored in the secondary file input port.
[0014] A system for enterprise data optimization management method based on big data, comprising: Data collection module: primary file entry port, secondary file entry port and tertiary file entry port; For each file of the primary file input port, record the time when the primary file processor opens and closes the file each time to obtain a processing time set; Data processing module: executes the processing cycle calculation strategy to obtain the processing cycle; executes the preprocessing strategy according to the threshold interval to obtain the execution interval set; Execution module: Executes the customized preservation strategy according to the execution interval set and the collection interval to obtain the file copy set; when the primary file processor submits the file to the secondary file processor, the submission strategy is executed to process the file received by the secondary file processor.
[0015] The present invention has the following beneficial effects: 1. A method for optimizing enterprise data management based on big data. When the number of completions of a primary file processor is greater than or equal to 1, the processing start and end points of each file are obtained, the interval of each file processing is calculated, and the mean is calculated to obtain the processing cycle of the primary file processor. By recording the start and end time of each file, the actual time required to process each file can be accurately calculated. Calculating the processing cycle helps to evaluate the efficiency of the file processing process and find improvement points.
[0016] 2. An enterprise data optimization management method based on big data. When the number of completions of a first-level file processor is 0, it means that the first-level file processor is a newcomer. The processing cycles of all other first-level file processors are obtained, the average is calculated, and the processing cycle of the newcomer is obtained. The expected processing cycle is provided for the new first-level file processor to help set reasonable goals and expectations.
[0017] 3. A method for optimizing enterprise data management based on big data, which calculates the processing interval of files and compares it with the threshold interval, can avoid the redundancy of files caused by executing customized saving strategies in the corresponding processing interval due to mistakenly opening files, and save memory.
[0018] 4. A method for optimizing enterprise data management based on big data, which obtains the marking interval from the execution interval set, executes the interval division strategy, obtains the execution time point set, obtains the file size at each time point, and compares them. When the second marking data is greater than the first marking data, it indicates that the content of the file is added. If the judgment data is greater than the threshold data, the corresponding file of the second marking data is saved; if the judgment data is greater than 0 and less than the threshold data, the new second marking data is obtained and the judgment is repeated. By tracking the changes in file size, storage space can be effectively managed to avoid unnecessary data accumulation. Reasonable setting of thresholds can help determine when additional storage or backup is needed to ensure data security.
[0019] 5. An enterprise data optimization management method based on big data. When the data is judged to be less than the threshold data, it indicates that the first-level file processor has deleted the file. The value of the second marker data is calculated and the value of each element in the backtracking data set is subtracted respectively. The maximum element less than zero in the backtracking difference set is obtained to obtain the backtracking positioning difference. The file storage data corresponding to the backtracking positioning difference is the size of the file closest to the second marker data and larger than the second marker data, which means that the file corresponding to the backtracking positioning starting point and the file corresponding to the second marker data have the highest duplication, and all file copies saved from the backtracking positioning starting point to the backtracking positioning end point are redundant. By deleting useless file copies, the use of storage space and management complexity are reduced. Avoid retaining redundant data in the file processing system, thereby improving the operating efficiency of the system. Through accurate time point positioning, ensure that only relevant data is deleted and necessary historical records are retained.
[0020] 6. A method for optimizing enterprise data management based on big data, obtaining the start time point and end time point of the marked interval, obtaining multiple time points by separating different numbers of collection intervals from the start time point, and forming an execution time point set with the start time point and the end time point and all time points between the start time point and the end time point, and then executing subsequent customized preservation strategies. Systematic time point generation helps ensure the consistency and integrity of data collection. By setting time points, the efficiency of data processing and analysis can be optimized.
[0021] 7. A method for optimizing enterprise data management based on big data. When there is a file with the same file name as the received file in the secondary file input port, the first draft file is replaced by the received file and stored in the secondary file input port; otherwise, if there is a file with a duplication degree greater than the threshold duplication degree with the received file, it means that the received file is not the first version in the secondary file input port, and the second draft file is replaced by the received file and stored in the secondary file input port; if there is no file with a duplication degree greater than the threshold duplication degree with the received file, it means that the received file is the first version in the secondary file input port, and the received file is stored in the secondary file input port, and the file is updated in time to ensure the accuracy and latest of the information. By checking the duplication degree of files, storage resources can be effectively managed to avoid unnecessary data duplication. Storage space can be used rationally to reduce the accumulation of invalid or outdated information. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] Figure 1 Schematic diagram of the system of the present invention. DETAILED DESCRIPTION
[0023] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0024] Embodiment 1: through the primary file input port: saving the files processed by the primary file processor; Through the secondary file input port: save the files that the primary file processor has processed and submitted to the secondary file processor for review; Through the third-level file entry port: save the files submitted by the second-level file processor after review; For each file in the primary file entry port; Record the time when the primary file processor opens and closes the file each time, and obtain the processing time set; Execute the processing cycle calculation strategy to obtain the processing cycle; When a primary document processor processes a document: During the processing cycle; Set the threshold interval for judging whether the primary file handler has opened the file by mistake; According to the threshold interval, the preprocessing strategy is executed to obtain the execution interval set; Set the collection interval for automatic file saving; According to the execution interval set and the collection interval, a customized saving strategy is executed to save the files in the process, obtain the file copies, and form a file copy set; Each time the primary file processor closes a file, the primary file processor is asked whether to submit the file processed this time to the secondary file processor; If the primary file processor chooses to submit, the submission strategy is executed to process the file received by the secondary file processor.
[0025] The execution processing cycle calculation strategy includes: The files in the third-level file input port are all files that have been processed; Get the total number of files that have been processed by the first-level file processor, which is recorded as the number of completions; When the number of completions ≧ 1: Obtain all the documents that have been processed by the first-level document processor; For each file: The time point when the file is first opened is recorded as the processing starting point; The last time the file was closed is recorded as the end point of processing; Calculate the interval between the processing start point and the processing end point of each file, and record them as the first interval, the second interval, ... the rth interval respectively; Calculate processing cycles; The processing cycle is calculated by the following formula: (first interval + second interval + ... + rth interval) ÷ r = processing period.
[0026] In this embodiment, r=4; First interval = 4 days, second interval = 3 days, third interval = 5 days, fourth interval = 4; Calculate (first interval + second interval + ... + rth interval) ÷ r = (4 + 3 + 5 + 4) ÷ 4 = 4 days; When the number of completions of the primary file processor is greater than or equal to 1, obtain the processing start and end points of each file, calculate the interval of each file processing, calculate the average, and obtain the processing cycle of the primary file processor. By recording the start and end time of each file, the actual time required to process each file can be accurately calculated. Calculating the processing cycle helps evaluate the efficiency of the file processing process and find improvement points.
[0027] The execution processing cycle calculation strategy includes: When the number of completions = 0: Obtain the processing cycles of all other first-level file processors, which are recorded as the first cycle, the second cycle, and so on the tth cycle; Calculate processing cycles; The processing cycle is calculated by the following formula: (First cycle + second cycle + … + tth cycle) ÷ t = the processing cycle of the first processing by the first-level file processor.
[0028] In this embodiment, t=5; First cycle = 4 days, second cycle = 4 days, third cycle = 6 days, fourth cycle = 6 days, fifth cycle = 5 days; Calculate (first cycle + second cycle + … + tth cycle) ÷ t = (4 + 4 + 6 + 6 + 5) ÷ 5 = 5 days; When the number of completions of a first-level file processor is 0, it means that the first-level file processor is a newcomer. The processing cycles of all other first-level file processors are obtained, the average is calculated, and the processing cycle of the newcomer is obtained. The expected processing cycle is provided for the new first-level file processor to help set reasonable goals and expectations.
[0029] The step of executing the preprocessing strategy according to the threshold interval to obtain the execution interval set includes: In the processing time set: Calculate the interval between each file opening and the corresponding file closing, and record it as the processing interval; Get all processing intervals and compare them with the threshold interval: Get all processing intervals greater than the threshold interval to form an execution interval set.
[0030] Calculating the file processing interval and comparing it with the threshold interval can avoid executing customized saving strategies in the corresponding processing interval due to mistakenly opening files, which causes file redundancy and saves memory.
[0031] The method executes a customized saving strategy according to the execution interval set and the collection interval, saves the files in the processing process, and obtains a file copy set, including: Get any element in the execution interval set and record it as the marked interval; Execute the interval partitioning strategy to obtain the execution time point set; Get the size of the file corresponding to each time point in the execution time point set, record it as file storage data, and form a file storage data set in the order of appearance time from early to late; Set the threshold data for judging whether to save the file, the threshold data is greater than 0; Traverse each element in the file storage data set in the order of the time when the element appears: S1, obtaining an element in the file storage data set, recorded as the first marked data; S2, obtaining the next element adjacent to the first labeled data, and recording it as the second labeled data; S3, calculating the second labeled data minus the first labeled data, and recording the result as judgment data; S4. When the judgment data is greater than or equal to the threshold data, the file is saved at the time point corresponding to the second mark data to obtain a file copy; S5. When the judgment data is greater than zero and less than the threshold data: Obtain the next element adjacent to the second labeled data in the file storage data set, replace the current second labeled data, and repeat S3-S5; S6. When the judgment data is less than zero, a backtracking optimization strategy is executed on all file storage data before the second marking data.
[0032] In this embodiment, the files stored in the current file copy set are respectively a file copy at a first time point, a file copy at a second time point, and a file copy at a third time point; The second marking data is file storage data of the file copy at a fourth time point; The first marking data is file storage data of the file copy at a third time point; Calculate the judgment data, and the judgment data is less than 0; Get the marking interval from the execution interval set, execute the interval division strategy, get the execution time point set, get the file size at each time point, and compare them. When the second marking data is greater than the first marking data, it means that the content of the file is added. If the judgment data is greater than the threshold data, save the file corresponding to the second marking data; if the judgment data is greater than 0 and less than the threshold data, get the new second marking data and repeat the judgment. By tracking the changes in file size, you can effectively manage storage space and avoid unnecessary data accumulation. Reasonable setting of thresholds can help determine when additional storage or backup is needed to ensure data security.
[0033] The step of executing the backtracking optimization strategy on all file storage data before the second marking data includes: Acquire all file storage data before the second marked data to form a backtracking data set; Subtract the value of each element in the backtracking data set from the value of the second labeled data, and the results form a backtracking difference set; Traverse all elements in the backtracking difference set and obtain the largest element less than zero, which is recorded as the backtracking location difference; The time point at which the file storage data corresponding to the backtracking positioning difference appears is recorded as the backtracking positioning starting point; The time point corresponding to the second marked data is recorded as the end point of the backtracking positioning; Then, all the file copies saved from the backtracking positioning start point to the backtracking positioning end point are deleted from the file copy set; A copy of the file corresponding to the second markup data is saved.
[0034] Obtain the file storage data of the file copy at the first time point, which is equal to 10, the file storage data of the file copy at the second time point, which is equal to 20, and the file storage data of the file copy at the third time point, which is equal to 30, to form a backtracking data set; The second tag data is equal to 18; Subtract the value of each element in the traceback data set from the value of the second labeled data, and get the difference corresponding to the first time = 18-10 = 8; the difference corresponding to the second time = 18-20 = -2; the difference corresponding to the third time = 18-30 = -12; The largest element less than zero is the difference corresponding to the second time, then the start point of the backtracking positioning is the second time, and the end point of the backtracking positioning is the fourth time; The file copy saved from the backtracking positioning start point to the backtracking positioning end point is the file copy at the third time point; Deleting the file copy at the third time point from the file copy set; Save a copy of the file at the fourth point in time; The elements in the file copy set are a file copy at a first time point, a file copy at a second time point, and a file copy at a fourth time point; When the judgment data is less than the threshold data, it indicates that the first-level file processor has deleted the file. The value of the second marker data is calculated and subtracted from the value of each element in the backtracking data set, and the largest element less than zero in the backtracking difference set is obtained to obtain the backtracking positioning difference. The file storage data corresponding to the backtracking positioning difference is the size of the file closest to the second marker data and larger than the second marker data, which means that the file corresponding to the backtracking positioning starting point and the file corresponding to the second marker data have the highest duplication, and all file copies saved from the backtracking positioning starting point to the backtracking positioning end point are redundant. By deleting useless file copies, the use of storage space and management complexity are reduced. Avoid retaining redundant data in the file processing system, thereby improving the operating efficiency of the system. Through accurate time point positioning, ensure that only relevant data is deleted and necessary historical records are retained.
[0035] The execution interval division strategy is used to obtain a set of execution time points, including: Get the start time of the marking interval; Get the end time point of the marking interval; The time point that is one sampling interval away from the start time is recorded as the first time point; The time point that is 2 sampling intervals away from the start time is recorded as the second time point; … The time point u collection intervals away from the start time is recorded as the u-th time point, where the u-th time point is less than or equal to the end time point; The start time point, the end time point, and all time points between the start time point and the end time point together constitute an execution time point set.
[0036] Get the start time point and end time point of the marked interval, and get multiple time points from the start time point with different number of collection intervals. The start time point and the end time point and all time points between the start time point and the end time point together form an execution time point set, and then execute the subsequent customized preservation strategy. The systematic time point generation helps ensure the consistency and integrity of data collection. By setting time points, the efficiency of data processing and analysis can be optimized.
[0037] The execution submission strategy includes: The secondary file processor receives the file sent by the primary file processor, which is recorded as received file: For all files in the secondary file entry port: If there is a file with the same file name as the received file, then the file is recorded as the first draft file; Replace the first draft file with the received file and store it in the secondary file input port; If there is no file with the same file name as the received file, traverse all files in the secondary file input port and compare them with the received file: Set the threshold duplication for judging whether a file is saved as the first version in the secondary file input port; If there is a file whose duplication degree with the received file is greater than the threshold duplication degree, the file is recorded as the second draft file; Replace the second draft file with the received file and store it in the secondary file input port; If there is no file whose duplication degree with the received file is greater than the threshold duplication degree, the received file will be stored in the secondary file input port.
[0038] When there is a file with the same file name as the received file in the secondary file entry port, the received file replaces the first draft file and is stored in the secondary file entry port; otherwise, if there is a file with a duplication greater than the threshold duplication with the received file, it means that the received file is not the first version in the secondary file entry port, and the received file replaces the second draft file and is stored in the secondary file entry port; if there is no file with a duplication greater than the threshold duplication with the received file, it means that the received file is the first version in the secondary file entry port, and the received file is stored in the secondary file entry port, and the file is updated in time to ensure the accuracy and latest of the information. By checking the duplication of files, storage resources can be effectively managed to avoid unnecessary data duplication. Rationally use storage space to reduce the accumulation of invalid or outdated information.
[0039] Example 2, refer to Figure 1 , a system of enterprise data optimization management method based on big data, including: Data collection module: primary file entry port, secondary file entry port and tertiary file entry port; For each file of the primary file input port, record the time when the primary file processor opens and closes the file each time to obtain a processing time set; Data processing module: executes the processing cycle calculation strategy to obtain the processing cycle; executes the preprocessing strategy according to the threshold interval to obtain the execution interval set; Execution module: Executes the customized preservation strategy according to the execution interval set and the collection interval to obtain the file copy set; when the primary file processor submits the file to the secondary file processor, the submission strategy is executed to process the file received by the secondary file processor.
[0040] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.
[0041] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the technical principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
Claims
1. A method for optimizing enterprise data management based on big data. include: Through the primary file input port: save the files processed by the primary file processor; Through the secondary file input port: save the files that the primary file processor has processed and submitted to the secondary file processor for review; Through the third-level file entry port: save the files submitted by the second-level file processor after review; For each file in the primary file entry port; Record the time when the primary file processor opens and closes the file each time, and obtain the processing time set; Execute the processing cycle calculation strategy to obtain the processing cycle; When a primary document processor processes a document: During the processing cycle; Set the threshold interval for judging whether the primary file handler has opened the file by mistake; According to the threshold interval, the preprocessing strategy is executed to obtain the execution interval set; Set the collection interval for automatic file saving; According to the execution interval set and the collection interval, a customized saving strategy is executed to save the files in the process, obtain the file copies, and form a file copy set; Each time the primary file processor closes a file, the primary file processor is asked whether to submit the file processed this time to the secondary file processor; If the primary file processor chooses to submit, the submission strategy is executed to process the file received by the secondary file processor.
2. The enterprise data optimization management method based on big data according to claim 1, Features: The execution processing cycle calculation strategy includes: The files in the third-level file input port are all files that have been processed; Get the total number of files that have been processed by the first-level file processor, which is recorded as the number of completions; When the number of completions ≧ 1: Obtain all the documents that have been processed by the first-level document processor; For each file: The time point when the file is first opened is recorded as the processing starting point; The last time the file was closed is recorded as the end point of processing; Calculate the interval between the processing start point and the processing end point of each file, and record them as the first interval, the second interval, ... the rth interval respectively; Calculate processing cycles; The processing cycle is calculated by the following formula: (first interval + second interval + ... + rth interval) ÷ r = processing period.
3. The enterprise data optimization management method based on big data according to claim 2, Features: The execution processing cycle calculation strategy includes: When the number of completions = 0: Obtain the processing cycles of all other first-level file processors, which are recorded as the first cycle, the second cycle, and so on the tth cycle; Calculate processing cycles; The processing cycle is calculated by the following formula: (First cycle + second cycle + … + tth cycle) ÷ t = the processing cycle of the first processing by the first-level file processor.
4. The enterprise data optimization management method based on big data according to claim 1, Features: The step of executing the preprocessing strategy according to the threshold interval to obtain the execution interval set includes: In the processing time set: Calculate the interval between each file opening and the corresponding file closing, and record it as the processing interval; Get all processing intervals and compare them with the threshold interval: Get all processing intervals greater than the threshold interval to form an execution interval set.
5. The enterprise data optimization management method based on big data according to claim 1, Features: The method executes a customized saving strategy according to the execution interval set and the collection interval, saves the files in the processing process, and obtains a file copy set, including: Get any element in the execution interval set and record it as the marked interval; Execute the interval partitioning strategy to obtain the execution time point set; Get the size of the file corresponding to each time point in the execution time point set, record it as file storage data, and form a file storage data set in the order of appearance time from early to late; Set the threshold data for judging whether to save the file, the threshold data is greater than 0; Traverse each element in the file storage data set in the order of the time when the element appears: S1, obtaining an element in the file storage data set, recorded as the first marked data; S2, obtaining the next element adjacent to the first labeled data, and recording it as the second labeled data; S3, calculating the second labeled data minus the first labeled data, and recording the result as judgment data; S4. When the judgment data is greater than or equal to the threshold data, the file is saved at the time point corresponding to the second mark data to obtain a file copy; S5. When the judgment data is greater than zero and less than the threshold data: Obtain the next element adjacent to the second labeled data in the file storage data set, replace the current second labeled data, and repeat S3-S5; S6. When the judgment data is less than zero, a backtracking optimization strategy is executed on all file storage data before the second marking data.
6. The enterprise data optimization management method based on big data according to claim 5, Features: The step of executing the backtracking optimization strategy on all file storage data before the second marking data includes: Acquire all file storage data before the second marked data to form a backtracking data set; Subtract the value of each element in the backtracking data set from the value of the second labeled data, and the results form a backtracking difference set; Traverse all elements in the backtracking difference set and obtain the largest element less than zero, which is recorded as the backtracking location difference; The time point at which the file storage data corresponding to the backtracking positioning difference appears is recorded as the backtracking positioning starting point; The time point corresponding to the second marked data is recorded as the end point of the backtracking positioning; Then, all the file copies saved from the backtracking positioning start point to the backtracking positioning end point are deleted from the file copy set; A copy of the file corresponding to the second markup data is saved.
7. The enterprise data optimization management method based on big data according to claim 5, Features: The execution interval division strategy is used to obtain a set of execution time points, including: Get the start time of the marking interval; Get the end time point of the marking interval; The time point that is one sampling interval away from the start time is recorded as the first time point; The time point that is 2 sampling intervals away from the start time is recorded as the second time point; …… The time point u collection intervals away from the start time is recorded as the u-th time point, where the u-th time point is less than or equal to the end time point; The start time point, the end time point, and all time points between the start time point and the end time point together constitute an execution time point set.
8. The enterprise data optimization management method based on big data according to claim 1, Features: The execution submission strategy includes: The secondary file processor receives the file sent by the primary file processor, which is recorded as received file: For all files in the secondary file entry port: If there is a file with the same file name as the received file, then the file is recorded as the first draft file; Replace the first draft file with the received file and store it in the secondary file input port; If there is no file with the same file name as the received file, traverse all files in the secondary file input port and compare them with the received file: Set the threshold duplication for judging whether a file is saved as the first version in the secondary file input port; If there is a file whose duplication degree with the received file is greater than the threshold duplication degree, the file is recorded as the second draft file; Replace the second draft file with the received file and store it in the secondary file input port; If there is no file whose duplication degree with the received file is greater than the threshold duplication degree, the received file will be stored in the secondary file input port.
9. A system for implementing the enterprise data optimization management method based on big data as claimed in claim 1, include: Data collection module: primary file entry port, secondary file entry port and tertiary file entry port; For each file of the primary file input port, record the time when the primary file processor opens and closes the file each time to obtain a processing time set; Data processing module: executes the processing cycle calculation strategy to obtain the processing cycle; executes the preprocessing strategy according to the threshold interval to obtain the execution interval set; Execution module: Executes the customized preservation strategy according to the execution interval set and the collection interval to obtain the file copy set; when the primary file processor submits the file to the secondary file processor, the submission strategy is executed to process the file received by the secondary file processor.
Citation Information
Patent Citations
Method for presenting file when switching system states and portable terminal
CN102063447A
Document backup method and related equipment
CN111639338A
Smart versioning for files
CN111936987A
Electronic approval method and device, equipment and medium
CN114066425A
One-stop big data analysis and processing system
CN115934680A
