WO2020019436A1 - Procédé de fusion de journaux, appareil, dispositif électronique et support - Google Patents

Procédé de fusion de journaux, appareil, dispositif électronique et support Download PDF

Info

Publication number
WO2020019436A1
WO2020019436A1 PCT/CN2018/105540 CN2018105540W WO2020019436A1 WO 2020019436 A1 WO2020019436 A1 WO 2020019436A1 CN 2018105540 W CN2018105540 W CN 2018105540W WO 2020019436 A1 WO2020019436 A1 WO 2020019436A1
Authority
WO
WIPO (PCT)
Prior art keywords
file
data
log
time
log file
Prior art date
Application number
PCT/CN2018/105540
Other languages
English (en)
Chinese (zh)
Inventor
王倩
Original Assignee
平安科技（深圳）有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 平安科技（深圳）有限公司 filed Critical 平安科技（深圳）有限公司
Publication of WO2020019436A1 publication Critical patent/WO2020019436A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533—Hypervisors; Virtual machine monitors
    • G06F9/45558—Hypervisor-specific management and integration aspects
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Definitions

  • the present application belongs to the field of data processing, and particularly relates to a method, a device, an electronic device, and a medium for merging logs.
  • Container-based virtualization technology represented by Docker is a hot topic of current virtualization technology.
  • Container technology enables lightweight virtualization by isolating processes and resources.
  • the application is deployed.
  • Multiple Docker containers can be deployed on a physical machine. Each Docker container is isolated from each other. This physical machine is generally called the host machine.
  • Docker containers can also run across hosts. When a Docker container runs across hosts, the resulting logs may also be scattered across the hosts. If multiple logs generated by a container are stored in multiple hosts, it is not conducive for the engineering staff to fully understand the progress of the project.
  • the existing log merge schemes are generally simple to merge multiple log data, and then merge them. The log data is often disordered, and it is difficult for engineers to analyze it well. At the same time, there is a lack of research on the overall properties of log data in the process of log merging, which also causes the problem of low utilization of log data.
  • the current log merging scheme has the problems that the merged log data is messy and the data utilization rate is low.
  • the current log merging scheme has the problems that the merged log data is messy and the data utilization rate is low.
  • a first aspect of the embodiments of the present application provides a method for merging logs, including:
  • a log directory is created, and a log file generated by the target container in each host is stored in the log directory; according to the generation time of the data in the log file, the log file of each of the log files is modified.
  • File name sorting each of the log files according to the file name of the log file, and sequentially combining data in each of the log files according to the sorted order to generate a data merged file; calculating the total time complexity
  • the total time complexity is used to indicate the number of unit times required to generate the data merge file; an average value of differences is calculated, and the average value of the differences is used to indicate the amount of data between each of the log files
  • the difference in time adding the total time complexity and the difference average to the data merge file to generate a log merge file.
  • a second aspect of the embodiments of the present application provides a log merging device, including:
  • a storage module configured to create a log directory after determining a target container, and store a log file generated by the target container in each host under the log directory; and a modification module configured to Generate time, modify the file names of each of the log files; a merge module for sorting each of the log files according to the file names of the log files, and sequentially sort the Data is merged to generate a data merged file; a first calculation module is configured to calculate a total time complexity, the total time complexity is used to represent a number of unit times required to generate the data merged file; a second calculation A module for calculating an average value of differences, where the average value of differences is used to indicate a difference in data amount between each of the log files; and a generating module is configured to convert the total time complexity and the difference The average value is added to the data merge file to generate a log merge file.
  • a third aspect of the embodiments of the present application provides a log merging electronic device, including a memory and a processor.
  • the memory stores computer-readable instructions that can run on the processor, and the processor executes all When describing computer-readable instructions, the following steps are implemented:
  • a log directory is created, and a log file generated by the target container in each host is stored in the log directory; according to the generation time of the data in the log file, the File name; sorting each of the log files according to the file name of the log file, and sequentially combining data in each of the log files according to the sorted order to generate a data merged file; calculating the total time complexity
  • the total time complexity is used to indicate the number of unit times required to generate the data merge file; an average value of differences is calculated, and the average value of the differences is used to indicate the amount of data between each of the log files The difference in time; adding the total time complexity and the difference average to the data merge file to generate a log merge file.
  • a fourth aspect of the embodiments of the present application provides a computer-readable storage medium, where the computer-readable storage medium stores computer-readable instructions, and is characterized in that the computer-readable instructions are implemented when executed by at least one processor. The following steps:
  • a log directory is created, and a log file generated by the target container in each host is stored in the log directory; according to the generation time of the data in the log file, the log file of each of the log files is modified.
  • File name sorting each of the log files according to the file name of the log file, and sequentially combining data in each of the log files according to the sorted order to generate a data merged file; calculating the total time complexity
  • the total time complexity is used to indicate the number of unit times required to generate the data merge file; an average value of differences is calculated, and the average value of the differences is used to indicate the amount of data between each of the log files
  • the difference in time adding the total time complexity and the difference average to the data merge file to generate a log merge file.
  • FIG. 1 is an implementation flowchart of a method for merging logs provided by an embodiment of the present application
  • FIG. 2 is a detailed implementation flowchart of a log merging method S103 provided in an embodiment of the present application
  • FIG. 3 is a detailed implementation flowchart of a log merging method S104 according to an embodiment of the present application.
  • FIG. 4 is a structural block diagram of a log merging device according to an embodiment of the present application.
  • FIG. 5 is a schematic diagram of an electronic device according to an embodiment of the present application.
  • FIG. 1 shows an implementation flow of a log merging method provided by an embodiment of the present application, and the method flow includes steps S101 to S106.
  • the specific implementation principle of each step is as follows.
  • Container-based virtualization technology represented by Docker is a hot topic of current virtualization technology.
  • Current Docker is an open source application container engine.
  • the application container engine can control the operation of multiple Docker containers. Multiple Docker containers can be deployed in a host, and programs in a Docker container can also run in different hosts.
  • the target container selected by the user is determined by receiving the container IP input by the user. Then create a basedir directory, and according to the host list corresponding to the container ip of the target container, copy and store the log files stored in the host in the host list and generated by the target container under the basedir directory, so that each destination is The log files generated by the target container stored in the host are merged for the first time to provide data support for subsequent merging and analysis processes.
  • S102 Modify the file name of each log file according to the generation time of the data in the log file.
  • the log file since each row of data in each log file in the log directory needs to be sorted in the subsequent process, in order to reduce the time consumed during sorting, the log file needs to be stored in Modify the file name for each host.
  • the modifying the file name of each log file according to the generation time of the data in the log file includes:
  • the time corresponding to the timestamp of the first line of data in the log file is taken as the first time of the log file, and the timestamp is used to record the generation time of the data;
  • the time corresponding to the timestamp is taken as the second time of the log file; the first time and the second time are written to the end of the file name of the log file to modify the file name of the log file .
  • the file name of the modified log file is: A (20180101100333, 20180104090234).
  • S103 Sort each of the log files according to the file name of the log file, and sequentially combine the data in each of the log files according to the sorted order to generate a data merged file.
  • sorting is performed by the file names of the log files, and it is not necessary to analyze the timestamp of each row of data in each log file each time data is merged, which is beneficial to reducing the sorting and merging process. time consumed.
  • the above S103 includes:
  • S1031 Sort each of the log files according to the first time in the file name of the log file in ascending order.
  • the file name of one log file is: A (20180101100333, 20180104090234), and the file name of the other log file is: B (20180102000003, 20180105090001).
  • 20180101100333 And 20180102000003 sorts the two log files. Understandably, according to the sorting rules in the embodiment of the present application, log file A (20180101100333, 20180104090234) will be ranked before log file B (20180102000003, 20180105090001).
  • S1032 Mark the log files sorted at the first position as the first log file, and mark the log files sorted at the second position as the second log file.
  • the second-ranked log file is the initial second-log file. Since this embodiment provides a circular execution process, the second-log file is variable. After each round of calculation, the next log file of the current second log file in the log directory is used as a new second log file, and a new round of execution process is repeated according to the new second log file.
  • the embodiment of the present application is actually a process of gradually adding data to a data merge file.
  • S1034 Determine whether the first time in the file name of the second log file is later than the time corresponding to the time stamp of the last line of data in the data merge file.
  • the data merge file contains multiple lines of data, and each line of data has its corresponding time stamp.
  • each line of data contained in each log file is arranged from morning to night according to the time represented by the corresponding timestamp, and according to the following merge rules, each line of data in a data merge file is also The times represented by the corresponding timestamps are arranged from morning to night, so in the embodiment of the present application, it is determined whether the first time in the file name of the second log file is later than the data merged file.
  • the time corresponding to the time stamp of the last row of data can determine whether the generation time of all the data in the current second log file is later than the entire data in the current data merge file.
  • each line of data is sequentially used as the data to be inserted, and the data to be inserted is inserted into a specific area in the data merge file.
  • This specific The time corresponding to the time stamp of the previous line of data in the region is not later than the time corresponding to the time stamp of the data to be inserted, and the time corresponding to the time stamp of the next line of data in the specific region is not earlier than the time corresponding to the time stamp of the data to be inserted.
  • S1037 Mark the next log file next to the current second log file as a new second log file according to the order in which the log files in the log directory are sorted, and return to execute and judge the second log file. Whether the first time in the file name is later than the time corresponding to the time stamp of the last row of data in the data merge file, until the data in each of the log files in the log directory is stored in Describe the data merge files.
  • this embodiment provides a circular execution process, so the second log file is variable. After each round of calculation, the next log of the current second log file in the log directory will be changed. The file serves as a new second log file, and a new round of execution process is repeated according to the new second log file.
  • the number of times of time comparison of each line of data in the second log file when inserting the data merge file can be reduced; second, because the file name of each log file includes the first time and The second time, so the time of analyzing the timestamp can be shortened during the actual sorting, which is beneficial to improve the efficiency of the single time comparison.
  • the rows of data in multiple log files are arranged and integrated in an orderly manner, which is beneficial for users to browse. And analyze log file data.
  • the data merge file mentioned above integrates the data originally stored in various log files in different hosts, no new data or parameters are generated.
  • the data characteristics of the log file itself need to calculate the total time complexity, thereby improving the utilization of the data in the log file.
  • the above S104 includes:
  • the formula 1 is: Calculate the total time complexity, where Ticom represents the total time complexity, the num1 is the first quantity, the num2 is the second quantity, and the linum1 i represents the i-th occurrence of the The first time in the file name of the second log file is later than the number of the first data lines when the time corresponding to the time stamp of the last line of data in the data merge file, the linum2 i represents the i-th occurrence The first time in the file name of the second log file is not later than the number of the second data lines when the time corresponding to the time stamp of the last line of data in the data merge file.
  • the current data merge file is Multiple ordered data are composed, and the current second log file is also composed of multiple ordered data.
  • the calculation rule based on the time complexity of the ordered queue merge if there are two ordered queues, the data amount of an ordered queue is m, and the data amount of an ordered queue is n, the time complexity of the merge of the two is O (n + m), so in the embodiment of the present application, all cases where the first time in the file name of the second log file is not later than the time corresponding to the time stamp of the last row of data in the data merge file , The total time complexity is
  • formula 2 Calculate the average of the difference, the logsize i represents the data amount of the i-th log file from top to bottom according to the order, lognum is the total amount of the log file, and logmean is the average of the difference.
  • the total time complexity and the average value of the differences can be added to the first line of the data merge file to more clearly reflect the characteristics of the log file generated by the target container, and it is convenient for users to grasp the overall operation of the target container. happening.
  • log directory is created, and the log files generated by the target container in each host are stored in the log directory, and each of the modifications is modified according to the generation time of the data in the log file.
  • Log file file names and after sorting each log file based on the file names, combine the data in each log file to generate a data merge file, calculate the total time complexity in generating the data merge process, and The average value of the difference between the amount of data, and finally add the total time complexity and the average value of the difference to the data merge file to generate a log merge file to achieve reasonable integration of a large number of log files, making it easy for users to browse and find logs File information, and in the process of integration, the relevant parameters of the log file are calculated to improve data utilization.
  • FIG. 4 shows a structural block diagram of the log merging device provided in the embodiment of the present application.
  • the device includes:
  • the storage module 401 is configured to create a log directory after the target container is determined, and store a log file generated by the target container in each host under the log directory; and a modification module 402 is configured to store the log file according to the log file.
  • a merging module 403 is configured to sort each of the log files according to the file names of the log files, and sequentially sort each of the logs according to the sorted order The data in the files are merged to generate a data merged file.
  • the first calculation module 404 is configured to calculate a total time complexity, where the total time complexity is used to indicate the number of unit times required to generate the data merged file.
  • a second calculation module 405, configured to calculate an average value of the difference, the average value of the difference is used to indicate a difference in the amount of data between each of the log files; and a generation module 406 is used to complicate the total time Degree and the difference average value are added to the data merge file to generate a log merge file.
  • the modifying the file name of each log file according to the generation time of the data in the log file includes:
  • the time corresponding to the timestamp of the first line of data in the log file is taken as the first time of the log file, and the timestamp is used to record the generation time of the data;
  • the time corresponding to the timestamp is taken as the second time of the log file; the first time and the second time are written to the end of the file name of the log file to modify the file name of the log file.
  • sorting each of the log files according to the file name of the log file, and sequentially combining the data in each of the log files according to the sorted order to generate a data merged file includes: Sorting each of the log files according to the first time in the file name of the log file in ascending order; marking the log file ranked first as the first log file, and The second-ranked log file is marked as a second log file; the data in the first log file is stored in the data merge file; and the second log file in the file name of the second log file is judged. Whether a time is later than the time corresponding to the time stamp of the last line of data in the data merge file;
  • the calculating the total time complexity includes:
  • the time when the first time in the file name of the second log file appears later than the last line of data in the data merge file is counted The number of times corresponding to the timestamp is taken as the first number; in the process of sequentially merging data in each of the log files, the first time in the file name of the second log file appears Number of times later than the time corresponding to the time stamp of the last line of data in the data merge file, as the second number; when the first time in the file name of the second log file appears, the data merge is not later than the data
  • the time corresponding to the time stamp of the last line of data in the file is recorded, the current number of data lines in the second log file is recorded as the first data line number, and the current number of data lines in the data merge file is recorded as Number of second data rows; by formula: Calculate the total time complexity, where Ticom represents the total time complexity, the num1 is the first quantity, the num2 is the second quantity, and the linum1
  • the calculating the average of the difference includes:
  • logsize i represents the data amount of the i-th log file from top to bottom according to the order
  • lognum is the total amount of the log file
  • logmean is the average of the difference
  • FIG. 5 is a schematic diagram of an electronic device according to an embodiment of the present application.
  • the electronic device 5 of this embodiment includes: a processor 50, a memory 51, and computer-readable instructions 52 stored in the memory 51 and executable on the processor 50, such as a merge of logs. program.
  • the processor 50 executes the computer-readable instructions 52
  • the steps in the embodiment of the method for merging the above logs are implemented, for example, steps 101 to 106 shown in FIG.
  • the processor 50 executes the computer-readable instructions 52
  • the functions of the modules / units in the foregoing device embodiments are implemented, for example, the functions of the units 401 to 406 shown in FIG. 4.
  • the computer-readable instructions 52 may be divided into one or more modules / units, the one or more modules / units are stored in the memory 51 and executed by the processor 50, To complete this application.
  • the one or more modules / units may be a series of computer-readable instruction instruction segments capable of performing specific functions, and the instruction segments are used to describe the execution process of the computer-readable instructions 52 in the electronic device 5.
  • the electronic device 5 may be a computing device such as a desktop computer, a notebook, a palmtop computer, and a cloud server.
  • the electronic device may include, but is not limited to, a processor 50 and a memory 51.
  • FIG. 5 is only an example of the electronic device 5 and does not constitute a limitation on the electronic device 5. It may include more or fewer components than shown in the figure, or combine some components or different components.
  • the electronic device may further include an input / output device, a network access device, a bus, and the like.
  • the processor 50 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), Ready-made programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • a general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the memory 51 may be an internal storage unit of the electronic device 5, such as a hard disk or a memory of the electronic device 5.
  • the memory 51 may also be an external storage device of the electronic device 5, such as a plug-in hard disk, a Smart Media Card (SMC), and a Secure Digital (SD) provided on the electronic device 5. Card, flash card, etc. Further, the memory 51 may further include both an internal storage unit of the electronic device 5 and an external storage device.
  • the memory 51 is configured to store the computer-readable instructions and other programs and data required by the electronic device.
  • the memory 51 may also be used to temporarily store data that has been output or is to be output.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La présente invention est utilisée dans le domaine du traitement de données, et concerne un procédé de fusion de journaux, un appareil, un dispositif électronique et un support; après la détermination d'un contenant cible, un répertoire de journal est créé et des fichiers journaux générés par le contenant cible dans chaque machine hôte sont stockés dans ledit répertoire de journal; en fonction du temps de génération des données dans le fichier journal, le nom de fichier de chacun des fichiers journaux est modifié, et après le tri des fichiers journaux sur la base du nom de fichier, les données dans chaque fichier journal sont fusionnées pour générer un fichier de fusion de données; la complexité temporelle totale et la valeur moyenne des différences dans la quantité de données entre des fichiers journaux individuels pendant le processus de génération de fusion de données sont calculées; enfin, la complexité temporelle totale et la moyenne des différences sont ajoutées au fichier de fusion de données pour générer un fichier de fusion de journal; ainsi, l'intégration raisonnable d'un grand nombre de fichiers journaux est obtenue, ce qui permet à un utilisateur de parcourir et de trouver des informations de fichier journal; également, pendant le processus d'intégration, les paramètres pertinents du fichier journal sont calculés, augmentant ainsi l'utilisation des données.
PCT/CN2018/105540 2018-07-25 2018-09-13 Procédé de fusion de journaux, appareil, dispositif électronique et support WO2020019436A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810824218.7 2018-07-25
CN201810824218.7A CN109165201B (zh) 2018-07-25 2018-07-25 日志的归并方法及终端设备

Publications (1)

Publication Number Publication Date
WO2020019436A1 true WO2020019436A1 (fr) 2020-01-30

Family

ID=64898006

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/105540 WO2020019436A1 (fr) 2018-07-25 2018-09-13 Procédé de fusion de journaux, appareil, dispositif électronique et support

Country Status (2)

Country Link
CN (1) CN109165201B (fr)
WO (1) WO2020019436A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110032565A (zh) * 2019-03-26 2019-07-19 阿里巴巴集团控股有限公司 一种生成统计信息的方法、系统以及电子设备
CN113010607A (zh) * 2021-04-06 2021-06-22 工银科技有限公司 系统间数据同步方法、装置、计算机系统、存储介质
CN114584346B (zh) * 2022-01-28 2024-01-12 深圳融安网络科技有限公司 日志流的处理方法、系统、终端设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101605028A (zh) * 2009-02-17 2009-12-16 北京安天电子设备有限公司 一种日志记录合并方法和系统
US20100083046A1 (en) * 2008-09-30 2010-04-01 Fujitsu Limited Log management method and apparatus, information processing apparatus with log management apparatus and storage medium
CN107526674A (zh) * 2017-08-31 2017-12-29 郑州云海信息技术有限公司 一种嵌入式系统日志记录的方法与装置
CN107959587A (zh) * 2017-11-23 2018-04-24 上海斐讯数据通信技术有限公司 基于海量文件的处理结果日志合并装置及方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10311024B2 (en) * 2016-08-31 2019-06-04 Ca, Inc. Merging file storage directory structures through user interface visualization of refactoring decisions

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100083046A1 (en) * 2008-09-30 2010-04-01 Fujitsu Limited Log management method and apparatus, information processing apparatus with log management apparatus and storage medium
CN101605028A (zh) * 2009-02-17 2009-12-16 北京安天电子设备有限公司 一种日志记录合并方法和系统
CN107526674A (zh) * 2017-08-31 2017-12-29 郑州云海信息技术有限公司 一种嵌入式系统日志记录的方法与装置
CN107959587A (zh) * 2017-11-23 2018-04-24 上海斐讯数据通信技术有限公司 基于海量文件的处理结果日志合并装置及方法

Also Published As

Publication number Publication date
CN109165201B (zh) 2023-04-14
CN109165201A (zh) 2019-01-08

Similar Documents

Publication Publication Date Title
US11544623B2 (en) Consistent filtering of machine learning data
US20170212781A1 (en) Parallel execution of blockchain transactions
Liu et al. HSim: a MapReduce simulator in enabling cloud computing
US11100420B2 (en) Input processing for machine learning
WO2020019436A1 (fr) Procédé de fusion de journaux, appareil, dispositif électronique et support
US11182691B1 (en) Category-based sampling of machine learning data
CN109471890A (zh) 报表文件的生成方法、终端设备及介质
US9996394B2 (en) Scheduling accelerator tasks on accelerators using graphs
WO2022156574A1 (fr) Procédé et appareil basés sur une chaîne de blocs pour traitement de données, dispositif et support de stockage lisible
WO2021164231A1 (fr) Procédé et appareil d'extraction d'extrait de document officiel, dispositif, et support de stockage lisible par ordinateur
WO2019161645A1 (fr) Procédé d'extraction de données basé sur shell, terminal, dispositif et support de stockage
CN109145051A (zh) 分布式数据库的数据汇总方法及装置和电子设备
US10885085B2 (en) System to organize search and display unstructured data
CN109815234A (zh) 一种流式计算模型下的多重布谷鸟过滤器
WO2021057482A1 (fr) Procédé et dispositif de génération d'un filtre de bloom dans une chaîne de blocs
CN110502583A (zh) 分布式数据同步方法、装置、设备及可读存储介质
Bala et al. Big-ETL: extracting-transforming-loading approach for Big Data
Balduini et al. A Restful Interface for RDF Stream Processors.
CN109542657A (zh) 系统异常的处理方法及服务器
WO2024032781A1 (fr) Procédé et appareil de test d'algorithme, et support de stockage
Khan Hadoop performance modeling and job optimization for big data analytics
TWI777319B (zh) 幹細胞密度確定方法、裝置、電腦裝置及儲存介質
CN113641705A (zh) 一种基于计算引擎的营销处置规则引擎方法
CN112764935A (zh) 大数据处理方法、装置、电子设备及存储介质
CN112783775A (zh) 特殊字符输入测试方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18927586

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18927586

Country of ref document: EP

Kind code of ref document: A1