Method and device for parsing stdf file, and storage medium
Patent Information
- Application Number
- CN202511786474.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2025-12-01
- Publication Date
- 2026-02-24
- Estimated Expiration
- 2045-12-01
AI Technical Summary
当前由于芯片的面积不断增大、功能不断增多,导致测试项增多、测试数据变大(例如通常超过1G~10G),因此解析STDF文件时,对计算机运行内存的大小有较高的要求,这导致经常出现卡顿、死机的情况
[0034]如上所述,本申请对STDF数据流进行分段,再对分段得到的各个数据段基于PIR和PRR数据类型进行压合数据的划分,从而将连续数据流精确划分多个逻辑层次的小块数据,解析小块数据所需的运行内存较小,基于计算机多核运算将压合数据和多个小块数据进行并行解析提升解析效率;并且,每解析完成一数据包的压合数据,即将解析结果转存至硬件存储设备,可以释放所占据的运行内存,以利于后续数据包的解析,避免出现卡顿、死机的情况;另外,将测试工位、测试项及其测试结果在内的解析结果采用多线程嵌套字典进行保存,相当于建立了各颗芯片与测试项及其测试结果的映射关系,可以精确检索单颗芯片的各个测试项的测试结果,利于测试人员对失效的单颗芯片进行分析。
Smart Images

Figure CN121233342B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of semiconductor testing technology, specifically to a method, device, and storage medium for parsing STDF (Standard Test Data Format) files. Background Technology
[0002] Chips, including SOCs (system-on-chip), require testing during production. The test data generated during this process is typically saved as STDF files, which are binary data. Therefore, these binary STDF files need to be converted into directly readable data—a process known in the art as STDF file parsing. Currently, due to the increasing size and functionality of chips, the number of test items and test data has increased (e.g., typically exceeding 1GB to 10GB). This places high demands on the computer's RAM when parsing STDF files, frequently leading to lag and crashes. To avoid this problem and to quickly parse STDF files, existing technologies omit the precise parsing of individual chip test results. However, this results in the lack of ability to pinpoint the test results of individual chips, hindering testers from analyzing failed individual chips. In addition, STDF files are streaming data. Directly parsing this streaming data makes it impossible to locate which chip the current data corresponds to, making it difficult to locate the test content of a single chip. Ultimately, the test results of individual chips cannot be correlated with each other, which is not conducive to the analysis of failed individual chips by testers. Summary of the Invention
[0003] In view of this, this application provides a method, device, and storage medium for parsing STDF files, which can at least improve the problems of large memory usage for parsing STDF files and difficulty in tracing the test results of a single chip (e.g., the result of a certain test item).
[0004] This application provides a method for parsing STDF files, including:
[0005] S1. Create an STDF class library, which defines the data types involved in the test, the test items contained in the data types, their test stations, and the character types corresponding to the test results;
[0006] S2. Read the STDF data stream and segment the STDF data stream to obtain multiple data segments, each data segment corresponding to a complete data of a data type;
[0007] S3. Identify PIR data type and PRR data type from each data segment, and record the first mark corresponding to the PIR data type and the second mark corresponding to the PRR data type, wherein the first mark and its next nearest second mark constitute a compressed data;
[0008] S4. When the first mark accumulates to a preset value, the accumulated data is packaged into a data packet, and multiple compressed data are divided from the data packet based on the first mark and the second mark;
[0009] S5. Parse each compression data in parallel using the STDF class library;
[0010] S6. From the parsing results of each pressing data, identify the test station and test item and their test results corresponding to each pressing data, and construct a multi-threaded nested dictionary accordingly.
[0011] S7. Transfer the multi-threaded nested dictionary from the running memory to the hardware storage device, and clear the cached data generated during the parsing process from the running memory;
[0012] Repeat steps S2 through S7 until the parsing of the STDF file is complete.
[0013] Optionally, S5 includes:
[0014] The compressed data is divided into multiple sub-packages according to the number of data segments;
[0015] The STDF class library is used to parse each sub-package in parallel.
[0016] Based on the parsing results, a multi-threaded dictionary is constructed with the number of times the compression data is applied as an index, which serves as the parsing result for each compression data.
[0017] Optionally, S5 further includes:
[0018] The data contained in the multi-threaded dictionary is cleaned, and only the test station, test item and test result corresponding to each pressing data are retained as the parsing result of each pressing data.
[0019] Optionally, segmenting the STDF data stream to obtain multiple data segments includes:
[0020] The format of each data type is determined, wherein the first byte and the second byte of any data type together represent the length n of the data type, and the n consecutive bytes after the second byte together with the first byte and the second byte form the complete data of a data type;
[0021] The STDF data stream is segmented based on the data type format to obtain multiple data segments.
[0022] Optionally, the step of dividing the compressed data into multiple sub-packages according to the number of data segments includes:
[0023] The format of each data type is determined, wherein the first byte and the second byte of any data type together represent the length n of the data type, and the n consecutive bytes after the second byte together with the first byte and the second byte form the complete data of a data type;
[0024] The compressed data is divided into multiple data segments based on the data type format, with each data segment serving as a sub-package.
[0025] Optionally, S7 includes:
[0026] The multi-threaded nested dictionary is converted into a data grid table, and the data grid table is transferred from the running memory to the hardware storage device in a compressed columnar storage manner.
[0027] Optionally, between S3 and S5, the method further includes:
[0028] When multiple data segments have been read, if the cumulative value of the first marker is less than a preset value, then multiple compressed data are divided from the cumulative data based on the first marker and the second marker.
[0029] Optionally, when the first marker accumulates to less than a preset value, after step S7, the method further includes: transferring the data grid table from the running memory to a hardware storage device in CSV format.
[0030] Optionally, after S7, the following may also be included:
[0031] The compressed columnar storage data obtained according to the compressed columnar storage method will be merged.
[0032] This application provides a parsing device, including a processor and a memory, wherein the memory stores a parsing program, and when the parsing program is executed by the processor, it implements the steps of any of the above-described STDF file parsing methods.
[0033] This application provides a storage medium storing a computer program, which, when executed by a processor, implements the steps of any of the above-described STDF file parsing methods.
[0034] As described above, this application segments the STDF data stream and then divides each segmented data segment into compressed data based on PIR and PRR data types. This accurately divides the continuous data stream into small blocks of data at multiple logical levels. The memory required for parsing these small blocks is relatively small. By leveraging multi-core computing, the compressed data and multiple small blocks are parsed in parallel, improving parsing efficiency. Furthermore, after parsing the compressed data of each data packet, the parsing result is transferred to a hardware storage device, releasing the occupied memory to facilitate the parsing of subsequent data packets and preventing lag or crashes. In addition, the parsing results, including test stations, test items, and their test results, are stored using a multi-threaded nested dictionary. This establishes a mapping relationship between each chip and the test items and their test results, allowing for precise retrieval of the test results for each test item of a single chip, which is beneficial for testers to analyze failed individual chips. Attached Figure Description
[0035] Figure 1 This is a flowchart illustrating a method for parsing STDF files provided in an embodiment of this application;
[0036] Figure 2 This is a flowchart illustrating another method for parsing STDF files provided in an embodiment of this application;
[0037] Figure 3 This is a schematic diagram of the structure of a parsing device provided in an embodiment of this application. Detailed Implementation
[0038] To address the aforementioned problems in the prior art, this application provides a method, apparatus, and storage medium for parsing STDF files. These protection subjects are based on the same concept, and their problem-solving principles are essentially the same or similar. The implementation methods of each protection subject can be referred to mutually, and repeated details will not be elaborated.
[0039] In this application's solution, the STDF data stream is segmented, and then each segmented data segment is further divided into compressed data based on PIR and PRR data types. This divides the continuous data stream into small blocks of data at multiple logical levels. The computer uses multi-core parallel parsing to reduce memory requirements and improve parsing efficiency. Furthermore, after parsing the compressed data of each data packet, the parsing result is transferred to hardware storage, releasing memory and further reducing memory requirements. In addition, the parsing results, including test stations, test items, and their test results, are stored using a multi-threaded nested dictionary. This establishes a mapping relationship between each chip and the test items and their test results, allowing for precise retrieval of the test results for each test item of a single chip, which is beneficial for testers to analyze failed single chips.
[0040] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions of this application will be clearly described below in conjunction with specific embodiments and corresponding drawings. Obviously, the embodiments described below are only a part of the embodiments of this application, and not all of them. Unless otherwise specified, the following embodiments and their technical features can be combined with each other, and also belong to the technical solutions of this application.
[0041] Figure 1 This is a flowchart illustrating an STDF file parsing method provided in an embodiment of this application. The STDF file parsing method can also be referred to as a "method" or "parsing method," and the executing entity for each step can be a suitable STDF file parsing device, a computer performing the parsing, or a storage medium, processor, controller, etc., with STDF parsing functionality.
[0042] Combined Figure 1 and Figure 2 As shown, the method includes at least the following steps S1 to S7.
[0043] S1. Create an STDF class library, which defines the data types involved in the test, the test items contained in the data types, their test positions, and the character types corresponding to the test results.
[0044] The core function of the STDF library is to provide the correspondence between binary data and directly readable data in STDF files. Computers can then parse STDF files based on this library. In one example, this application uses CSharp to compile and create the STDF library. This STDF library defines data types involved in testing, including but not limited to PIR (PartInformation Record), PRR (Part Result Record), FTR (Functional Test Record), PTR (Parametric Test Record), and MPR (Multi-Purpose Register). Test items, their corresponding test stations, and test results can be considered as subtype dictionaries defined by the STDF library for each data type. These subtype dictionaries contain the characters corresponding to the test items, test stations, and test results, and also define the corresponding character types. For example, in the FTR data type, the character type corresponding to the test station (SITE_NUMBER) of a certain test item is a byte integer.
[0045] This application uses CSharp to compile and create an STDF class library. During the parsing of STDF files, a data dictionary is built, and the STDF file is subsequently divided to avoid repeated data reading, thereby reducing the computer's memory usage and effectively improving file processing efficiency.
[0046] S2. Read the STDF data stream and segment the STDF data stream to obtain multiple data segments, each data segment corresponding to a complete data of a data type.
[0047] An STDF file is represented as a binary data stream, referred to as an STDF data stream. This application can read the entire STDF data stream at once. After obtaining the STDF data stream, it needs to be segmented to clarify the data structure. In one example, the segmentation is performed as follows: First, the format of each data type is determined, where the first and second bytes of any data type together represent the length n of that data type, and the next n bytes after the second byte, together with the first and second bytes, form the complete data of a data type; then, the STDF data stream is segmented based on the data type format to obtain multiple data segments.
[0048] For any of the data types PIR, PRR, FTR, PTR, and MPR, the first byte (byte0) and the second byte (byte1) together represent the data length n of that data type. The next n bytes constitute a data segment {byte1 + ... + byten}, which is called C data. C data can be considered as valid data of that data type. Based on this data structure, each segment is cut and extracted to obtain a complete unit of {data length information n + C data}, which can then be used as each data segment. Furthermore, the read position of each data segment is recorded, and the read position of each data segment and the C data are cached in the source data list to facilitate the subsequent location of the parsing result corresponding to each compressed data.
[0049] S3. Identify the PIR data type and PRR data type from each data segment, and record the first mark corresponding to the PIR data type and the second mark corresponding to the PRR data type, wherein the first mark and its next nearest second mark constitute a compressed data.
[0050] For any given data segment, the first and second bytes of the C data jointly identify the data type. Based on this, PIR and PRR data types can be identified from each data segment. Optionally, the corresponding position information is recorded to generate a list of first marker A and second marker B. Then, the lists of first marker A and second marker B are sorted according to the order of reading positions. In the sorted list, first marker A and second marker B appear alternately. Any first marker A and its nearest subsequent second marker B represent a complete touch-down (TD) data, also known as touch-down test data. The touch-down data refers to a data packet generated during the testing process where the test arm simultaneously grasps multiple chips and places them in a designated test fixture, connecting the chip pins (also known as chip leads) to the test machine channel for multi-chip synchronous testing. The test results contained in the touch-down data are still presented as binary data.
[0051] The segmented data processing architecture based on PIR and PRR precisely divides the continuous data stream into multiple logical layers, resulting in a more explicit data structure for subsequent storage, retrieval, and analysis.
[0052] S4. When the first marker accumulates to a preset value, the accumulated data is packaged into a data packet, and multiple compressed data are divided from the data packet based on the first and second markers.
[0053] In one example, when the cumulative number of the first tag A is a preset value H, the data read up to the current time is packaged into a data packet A0. Then, the data in the data packet A0 is organized and a clear data structure is defined. That is, based on the fact that the data between the first tag A and the second tag B is a compressed data, the list of the first tag A and the second tag B is read one by one to divide each compressed data. Then, the data in the data packet A0 is sorted according to the order of appearance of the compressed data.
[0054] In another example, this application also considers the case where the cumulative number of the first marker A does not reach a preset value H. Therefore, the method further includes: when multiple data segments have been read and the cumulative number of the first marker A is less than the preset value H, then multiple compressed data are divided from the cumulative data based on the first marker A and the second marker B, and these compressed data are sorted according to their order of appearance. Then, step S5 is performed to parse each compressed data.
[0055] S5. Parse each compression data in parallel using the STDF class library.
[0056] The computer utilizes its internal multi-core processor for parallel parsing, converting binary data into a specified character type. This parsing process transforms the binary data contained in each compressed data set into directly readable data. The resulting directly readable data includes at least the test station, test item, and the corresponding test result for each test item.
[0057] S6. From the parsing results of each pressing data, identify the test station, test item and test result corresponding to each pressing data, and construct a multi-threaded nested dictionary accordingly.
[0058] In one example, the name of each pressing data is used as the outer dictionary, and each test station in each pressing data, the test item executed at that test station, and the test result corresponding to each test item are used as the inner dictionary, thereby establishing a multi-threaded nested dictionary. The specific method and principle for establishing the multi-threaded nested dictionary can be found in existing technologies in this field, and will not be described in detail here.
[0059] S7. Transfer the multi-threaded nested dictionary from the runtime memory to the hardware storage device, and clear the cached data generated during the parsing process from the runtime memory.
[0060] In one example, this application can convert the multi-threaded nested dictionary into a data grid table. In a practical scenario, compression tests are obtained sequentially based on the multi-threaded nested dictionary. The number of compression data entries is converted into separate data columns. The row position for data entry is located according to the test station, and the column position is the name of the test item. Each item is entered into the data grid table to obtain the final data grid table. Then, the data grid table is stored in a compressed columnar storage method in a file E with a specified address and corresponding name, and then transferred from RAM to hardware storage. Compared to the multi-threaded nested dictionary, the data in the data grid table is easier to read and transfer later.
[0061] Repeat steps S2 through S7 until the parsing of the STDF file is complete.
[0062] When the data volume is large, repeating step S7 above will generate multiple files E with different names. This application can merge these multiple files E, that is, merge the compressed columnar storage data obtained according to the described compressed columnar storage method, and then transfer the merged data from the running memory to the hardware storage device in CSV (Comma-Separated Values) format. This CSV format facilitates subsequent data analysis and visualization. Since the data merging performance of compressed columnar storage is stronger than that of CSV data merging, compressed columnar storage is used to merge the data first before converting it to CSV data.
[0063] When the amount of data is small, that is, when the first marker A is less than the preset value H, after S7, this application will not generate multiple files E with different names. The data grid table can be directly converted into CSV format and transferred from the running memory to the hardware storage device in CSV format.
[0064] As described above, this application segments the STDF data stream and then compresses each segment based on PIR and PRR data types, thereby accurately dividing the continuous data stream into small blocks of data at multiple logical levels. This results in less memory required for parsing these small blocks, and less overall memory usage when the computer performs parallel parsing using multiple cores. This parallel parsing fully utilizes the parallel computing capabilities of the multi-core processing modules in the computer (or personal computer), achieving efficient use of computing resources and improving the response speed of the entire parsing system. Furthermore, after parsing the compressed data of each data packet, the parsing result is transferred to a hardware storage device, releasing the occupied memory to facilitate the parsing of subsequent data packets and preventing lag or crashes. Additionally, the parsing results, including test stations, test items, and their test results, are stored using a multi-threaded nested dictionary, effectively establishing a mapping relationship between each chip and the test items and their results. This allows for precise retrieval of the test results for each test item of a single chip, facilitating accurate tracing and efficient troubleshooting of problematic chips by testers.
[0065] In short, this application enables rapid parsing of large STDF files and accurate retrieval of test data for a single chip even when the computer is offline.
[0066] Please continue to refer to this as well. Figure 1 and Figure 2 As shown, in the aforementioned S5, the data within data packet A0 also needs to be processed. Because the complexity of test items varies across different chips, there may be situations where a single compressed data set contains many test items. Even with a large data volume, this will still place a significant demand on runtime memory for parsing. Therefore, this portion of the data needs to be further divided according to the specified number of test items, and then parsed in parallel. In one example, the aforementioned S5 may further include: S51, dividing the compressed data into multiple sub-packets based on the number of data segments; S52, parsing each sub-packet in parallel using the STDF library; and S53, constructing a multi-threaded dictionary indexed by the number of times the compressed data is compressed, as the parsing result for each compressed data set.
[0067] The method for S51 to divide the data into multiple sub-packets is as follows: First, the format of each data type is determined, wherein the first and second bytes of any data type together represent the length n of the data type, and the n consecutive bytes after the second byte, together with the first and second bytes, form the complete data of a data type; then, based on the format of the data types, the compressed data is divided into multiple data segments, each data segment being a sub-packet. Specifically, the number of data types in the compressed data is determined according to the format of the data types, and then the compressed data is divided into the same number of sub-packets.
[0068] Following step S53, this application can further clean the data contained in the multi-threaded dictionary, retaining only the test station, test item, and test results corresponding to each pressing data, as the parsing results for each pressing data. In practical scenarios, the multi-threaded dictionary contains all configuration information for the test items, requiring the removal of irrelevant test information and the retention of only key parameter information from the tests, such as the test station, test item, and the test results corresponding to each test item; then, a nested multi-threaded dictionary is constructed through step S6.
[0069] This application embodiment also provides a storage medium storing a parsing program, which is essentially a computer program, and when executed by a processor, the parsing program implements the steps of the STDF file parsing method as in any example.
[0070] The storage medium includes, but is not limited to, any one of read-only memory (ROM), random access memory (RAM), magnetic disk, and optical disk.
[0071] Since the parsing program stored in the storage medium can execute the steps in the STDF file parsing method of any embodiment provided in this application, the beneficial effects that the STDF file parsing method of any of the foregoing embodiments can achieve can be realized, as detailed in the foregoing embodiments, which will not be repeated here.
[0072] This application also provides a parsing device or chip, including a memory and a processor. The memory stores a parsing program, which, when executed by the processor, implements the steps of the STDF file parsing method of any of the foregoing embodiments; and / or, the parsing device or chip is provided with a storage medium as shown in the above example, and the processor loads the storage medium to execute the steps of the STDF file parsing method, thereby achieving the beneficial effects that the STDF file parsing method of the corresponding embodiment can achieve.
[0073] Figure 3This is a schematic diagram of the structure of a parsing device provided in an embodiment of this application. For example... Figure 3 As shown, the parsing device 30, also known as the STDF file parsing device 30, includes:
[0074] Module 31 is created to create an STDF class library, which defines the data types involved in the test, the test items contained in the data types, their test stations, and the character types corresponding to the test results.
[0075] The reading module 32 is used to read the STDF data stream and segment the STDF data stream to obtain multiple data segments, each data segment corresponding to a complete data of a data type;
[0076] The first identification module 33 is used to identify PIR data type and PRR data type from each data segment, and record the first mark corresponding to the PIR data type and the second mark corresponding to the PRR data type, wherein the first mark and its next nearest second mark constitute a compressed data;
[0077] The partitioning module 34 is used to package the accumulated data into a data packet when the first mark reaches a preset value, and to partition multiple compressed data from the data packet based on the first mark and the second mark;
[0078] Parsing module 35 is used to parse each compression data in parallel using the STDF class library;
[0079] The second identification module 36 is used to identify the test station and test item and their test results corresponding to each pressing data from the parsing results of each pressing data, and construct a multi-threaded nested dictionary accordingly; and to transfer the multi-threaded nested dictionary from the running memory to the hardware storage device, and clear the cached data generated during the parsing process from the running memory.
[0080] Through the cooperation of the above modules, the parsing of the STDF file is completed.
[0081] It should be understood that the various modules of the parsing device 30 described above can be represented as physical devices or virtual modules (i.e., commonly referred to as logical modules) in actual scenarios. A single module can be implemented by a single physical device or by two or more physical devices working together. Similarly, the function performed by a single module can be implemented by a single physical device or by two or more physical devices working together. Furthermore, the functions corresponding to each module can be implemented by the corresponding steps of the STDF file parsing method of any of the aforementioned embodiments.
[0082] The above are only some embodiments of this application and do not limit the patent scope of this application. For those skilled in the art, any equivalent structural transformations made using the content of this specification and drawings are similarly included within the patent protection scope of this application.
[0083] The use of step designations such as S1 and S2 in this document is intended to more clearly and concisely describe the corresponding content and does not constitute a substantial restriction on the order. In specific implementation, those skilled in the art may execute S2 first and then S1, etc., but these should all be within the protection scope of this application.
[0084] Although this document uses terms such as "first," "second," etc., to describe various types of information, this information should not be limited to these terms. These terms are only used to distinguish information of the same type from one another. Furthermore, the singular forms "a," "an," and "the" are intended to also include the plural forms. The terms "or" and "and / or" are interpreted as inclusive, or meaning either one or any combination thereof. Exceptions to this definition only arise when combinations of elements, functions, steps, or operations are inherently mutually exclusive in some way.
Claims
1. A method for parsing STDF files, characterized in that, include: S1. Create an STDF class library, which defines the data types involved in the test, the test items contained in the data types, their test stations, and the character types corresponding to the test results; S2. Read the STDF data stream and segment the STDF data stream to obtain multiple data segments, each data segment corresponding to a complete data of a data type; S3. Identify PIR data type and PRR data type from each data segment, and record the first mark corresponding to the PIR data type and the second mark corresponding to the PRR data type, wherein the first mark and its next nearest second mark constitute a compressed data; S4. When the first mark accumulates to a preset value, the accumulated data is packaged into a data packet, and multiple compressed data are divided from the data packet based on the first mark and the second mark; S5. Parse each compression data in parallel using the STDF class library; S6. From the parsing results of each pressing data, identify the test station and test item and their test results corresponding to each pressing data, and construct a multi-threaded nested dictionary accordingly. S7. Transfer the multi-threaded nested dictionary from the runtime memory to the hardware storage device, and clear the cached data generated during the parsing process from the runtime memory; Repeat steps S2 through S7 until the parsing of the STDF file is complete.
2. The method according to claim 1, characterized in that, S5 includes: The compressed data is divided into multiple sub-packages according to the number of data segments; The STDF class library is used to parse each sub-package in parallel. Based on the parsing results, a multi-threaded dictionary is constructed with the number of times the compression data is applied as an index, which serves as the parsing result for each compression data.
3. The method according to claim 2, characterized in that, The S5 also includes: The data contained in the multi-threaded dictionary is cleaned, and only the test station, test item and test result corresponding to each pressing data are retained as the parsing result of each pressing data.
4. The method according to claim 2, characterized in that, The segmentation of the STDF data stream to obtain multiple data segments includes: The format of each data type is determined, wherein the first byte and the second byte of any data type together represent the length n of the data type, and the n consecutive bytes after the second byte together with the first byte and the second byte form the complete data of a data type; The STDF data stream is segmented based on the data type format to obtain multiple data segments; The step of dividing the compressed data into multiple sub-packages according to the number of data segments includes: The format of each data type is determined, wherein the first byte and the second byte of any data type together represent the length n of the data type, and the n consecutive bytes after the second byte together with the first byte and the second byte form the complete data of a data type; The compressed data is divided into multiple data segments based on the data type format, with each data segment serving as a sub-package.
5. The method according to claim 1, characterized in that, S7 includes: The multi-threaded nested dictionary is converted into a data grid table, and the data grid table is transferred from the running memory to the hardware storage device in a compressed columnar storage manner.
6. The method according to claim 1, characterized in that, Between S3 and S5, there is also: When multiple data segments have been read, if the cumulative value of the first marker is less than a preset value, then multiple compressed data are divided from the cumulative data based on the first marker and the second marker.
7. The method according to claim 5, characterized in that, When the cumulative value of the first marker is less than a preset value, after step S7, the method further includes: The data grid table is transferred from running memory to hardware storage device in CSV format.
8. The method according to claim 5, characterized in that, Following S7, it also includes: The compressed columnar storage data obtained according to the compressed columnar storage method will be merged.
9. A parsing device, characterized in that, It includes a processor and a memory, wherein the memory stores a parsing program, and when the parsing program is executed by the processor, it implements the steps of the STDF file parsing method as described in any one of claims 1 to 8.
10. A storage medium, characterized in that, The device contains a computer program that, when executed by a processor, implements the steps of the STDF file parsing method as described in any one of claims 1 to 8.
Citation Information
Patent Citations
Method and equipment for quickly and fully analyzing STDF file
CN113468124A
STDF file parsing method, device, equipment, and medium
CN119759850A