CN109033189B - Compression method and device of link structure log, server and readable storage medium - Google Patents
Compression method and device of link structure log, server and readable storage medium Download PDFInfo
- Publication number
- CN109033189B CN109033189B CN201810681474.5A CN201810681474A CN109033189B CN 109033189 B CN109033189 B CN 109033189B CN 201810681474 A CN201810681474 A CN 201810681474A CN 109033189 B CN109033189 B CN 109033189B
- Authority
- CN
- China
- Prior art keywords
- node
- link structure
- common prefix
- log
- original link
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
Images
Landscapes
- Debugging And Monitoring (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a compression method of a link structure log, which comprises the steps of obtaining an original link structure log generated by one-time calling; extracting node pairs with the maximum common prefix from the original link structure logs, and selecting one node from the node pairs with the maximum common prefix as a main node; acquiring a common prefix of each other node except the main node and the main node in the original link structure log; and compressing the obtained common prefix of each other node and the main node, so that all contents of the main node and contents of each other node except the common prefix corresponding to the node are not compressed, and the compressed link structure log has readability under the condition of ensuring a certain compression ratio.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a method and an apparatus for compressing a link structure log, a server, and a readable storage medium.
Background
The existing link structure log compression method generally includes obtaining an original link structure log, and then compressing the original link structure log into a bit (byte) stream, where the compression method may be, for example, gzip; the compressed bitstream is encoded again, for example, in a manner of base64, and the encoded log is a compressed log, which has a large compression ratio but is not readable.
Disclosure of Invention
The invention provides a compression method, a compression device, a server and a readable storage medium of a link structure log, which can ensure readability under the condition of ensuring a certain compression ratio.
The first aspect of the present application provides a method for compressing a link structure log, including:
acquiring an original link structure log generated by one-time calling, wherein the original link structure log comprises node information of a plurality of nodes;
extracting node pairs with the maximum common prefix from the original link structure logs, and selecting one node from the node pairs with the maximum common prefix as a main node;
acquiring a common prefix of each other node except the main node and the main node in the original link structure log;
and compressing the obtained common prefix of each other node and the main node to obtain a compressed link structure log.
The second aspect of the present application further provides a link structure log compression apparatus, including:
the system comprises an original log obtaining unit, a link structure log generating unit and a processing unit, wherein the original log obtaining unit is used for obtaining an original link structure log generated by one-time calling, and the original link structure log comprises node information of a plurality of nodes;
a master node selecting unit, configured to extract a node pair with a largest common prefix from the original link structure log, and select a node from the node pair with the largest common prefix as a master node;
a common prefix obtaining unit, configured to obtain a common prefix between each other node in the original link structure log, except for the master node, and the master node;
and the compression unit is used for compressing the obtained common prefix of each other node and the main node to obtain a compressed link structure log.
The third aspect of the present application further provides a server, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the program, the steps of the above method for compressing a link structure log are implemented.
The fourth aspect of the present application also provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor, implements the steps of the above-described method for compressing a link structure log.
The invention has the following beneficial effects:
based on the technical scheme, only the common prefix of each other node and the main node is compressed, and all contents of the main node and contents of each other node except the common prefix corresponding to the node are not compressed, so that the contents of the main node and the contents of each other node except the common prefix corresponding to the node can be read from the compressed link structure log, and readability can be achieved under the condition that a certain compression ratio is ensured.
Drawings
FIG. 1 is a flow chart of a method for compressing a link structure log according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of a link structure log compression apparatus according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a server in an embodiment of the present specification.
Detailed Description
In order to better understand the technical solutions, the technical solutions of the embodiments of the present specification are described in detail below with reference to the drawings and specific embodiments, and it should be understood that the specific features of the embodiments and embodiments of the present specification are detailed descriptions of the technical solutions of the embodiments of the present specification, and are not limitations of the technical solutions of the present specification, and the technical features of the embodiments and embodiments of the present specification may be combined with each other without conflict.
In a first aspect, as shown in fig. 1, an embodiment of the present specification provides a method for compressing a link structure log, including the following steps:
s102, obtaining an original link structure log generated by one-time calling, wherein the original link structure log comprises node information of a plurality of nodes;
specifically, the system automatically generates an original link structure log at each call, and thus the original link structure log generated by one call of the system can be obtained by reading or receiving and the like, wherein the original link structure log includes node information of a plurality of nodes, the node information of each other node includes a number of the node and called interface information, the number of the node is used for identifying the position of the node in the link structure log, and the interface information may include one or more information of called packet name, class name, number of method parameters and the like. Preferably, the interface information includes a called package name, a class name, and a number of method parameters.
Specifically, the original link structure log is generated by one-time calling, so that any one node in the original link structure log and other nodes all have a common prefix.
For example, the obtained original link structure log specifically includes the following:
0,com.alipay.pcardcore.common.util.cache.Cachemanger.getKeyStrategy(1)
0.1,com.alipay.pcardcore.common.util.drm.manager.DrmResourceManager.findResourceByName(2)
0.1.1,com.alipay.imock.core.pool.contorller.EnvContorller.isProd()
0.2,com.alipay.pcardcore.common.util.cache.Cachemanger.getobject(3)
as can be seen from the above description, the original link structure log includes node information of 4 nodes, i.e., node 0, node 0.1, node 0.1.1, and node 0.2, and any one of the 4 nodes has a common prefix with other nodes.
S104, extracting node pairs with the maximum common prefix from the original link structure logs, and selecting one node from the node pairs with the maximum common prefix as a main node;
in an optional implementation manner, node contents of every two nodes in the original link structure log may be compared to obtain a comparison result; and extracting node pairs with the maximum common prefix according to the comparison result, and then selecting one node from the node pairs as the main node. The node may be randomly selected from the node pair with the largest common prefix as the master node, or a node meeting the condition may be selected from the node pair with the largest common prefix as the master node according to a preset condition, which is not limited in this application. The preset condition may be that a node with a large length or a node with a small length is used as the master node, or that a node before the node is used as the master node, which is not limited in this application.
For example, 4 nodes, 0,0.1, 0.1.1 and 0.2, are taken as examples, and the comparison result obtained by comparing 0 with 3 nodes, 0.1 and 0.2 respectively, shows that (0,0.1) has a common prefix length of 33, (0,0.1.1) has a common prefix length of 11, and (0,0.2) has a common prefix length of 55, since 55>33>11, the node pair with the largest common prefix can be extracted as (0,0.2) according to the comparison result, and then 0.2 is randomly selected from (0,0.2) as the master node.
In the embodiment of the present application, each node pair includes two nodes.
In another alternative embodiment, the original link structure log may be sorted according to method signatures; and extracting node pairs with the maximum common prefix from the sorted original link structure logs, and selecting one node from the node pairs with the maximum common prefix as a main node.
Specifically, after the original link structure logs are sorted according to the method signatures, two nodes sorted at the top have the maximum common prefix, so that the two nodes sorted at the top can be node pairs with the maximum common prefix, then one node is selected from the node pair as a master node, and the node sorted at the top is usually selected from the node pair with the maximum common prefix as the master node; of course, the nodes ranked after the node pair with the largest common prefix may also be selected as the master node, and the application is not particularly limited. In the following, the node with the largest common prefix is selected as the node with the highest rank as the master node.
For example, the nodes in the original link structure log are arranged in the order as follows:
0,com.alipay.pcardcore.common.util.cache.Cachemanger.getKeyStrategy(1)
0.2,com.alipay.pcardcore.common.util.cache.Cachemanger.getobject(3)
0.1,com.alipay.pcardcore.common.util.drm.manager.DrmResourceManager.findResourceByName(2)
0.1.1,com.alipay.imock.core.pool.contorller.EnvContorller.isProd()
as can be seen from the above, the pair of nodes sorted in the first two nodes (0,0.2) contains a common prefix of "com.alicay.pcardcore.common.util.cache.cacheanger.get" for 55 characters, and the pair of nodes (0,0.1) contains a common prefix of "com.alicay.pcardcore.common.util.33 characters; and (0,0.1.1) the pair of nodes contains 11 characters with common prefix "com.alipay." and since 55>33>11, the node pair with the largest common prefix can be extracted as (0,0.2), and since node 0 is ranked in the front in (0,0.2), 0 is selected as the master node.
S106, acquiring a common prefix of each other node except the main node and the main node in the original link structure log;
specifically, after the master node is acquired through step S104, prefix matching is then performed on each of the other nodes in the original link structure log, except for the master node, with the master node, and a common prefix of each of the other nodes with the master node is acquired.
For example, after randomly selecting 0.2 from (0,0.2) as the master node, prefix matching is performed on 3 nodes of 0,0.1, 0.1.1 and 0.2, to obtain 55 characters in total of a common prefix included in the pair of nodes of (0.2,0) and 33 characters in total of a common prefix included in the pair of nodes of (0.2, 0.1); and (0.2,0.1.1) the pair of nodes contains a common prefix of "com.
In an optional implementation manner of the present application, after the original link structure log is sorted according to the method signature, a common prefix of every two adjacent nodes in the sorted original link structure log is obtained, and therefore, the common prefix of every two adjacent nodes can also be obtained as a common prefix of a node and the master node that are sorted in the two adjacent nodes.
For example, the nodes in the original link structure log are arranged after being sequenced to obtain 55 characters in total, where a common prefix included in the adjacent node (0,0.2) is "com.alipay.pcardcore.common.util.cache.cachenger.get", and since 0.2 is sequenced later and 0 is a master node, it can be determined that the common prefix of (0,0.2) is the above 55 characters; accordingly, the adjacent node (0.2,0.1) includes 33 characters with a common prefix "com.alipay.pcardcore.common.util.", and since 0.1 is ordered later and 0 is the master node, it can be determined that the common prefix of (0,0.1) is the above 33 characters; and the adjacent node (0.1,0.1.1) contains 11 characters of common prefix "com.alipay.", and based on the same reason, the common prefix of (0,0.1.1) can be determined to be the 11 characters.
S108, compressing the obtained common prefix of each other node and the main node to obtain a compressed link structure log.
Specifically, the obtained common prefix of each other node and the master node can be compressed in a gzip compression mode or the like, so that a compressed link structure log is obtained; because only the common prefix of each other node and the main node is compressed, but the content of the main node and each other node except the common prefix corresponding to the node is not compressed, the content of the main node and each other node except the common prefix corresponding to the node can be obtained from the compressed link structure log; that is, in the compressed link structure log, all contents of the master node and contents other than the common prefix corresponding to each other node are in an uncompressed state.
In an optional implementation manner, when compressing the common prefix, which is obtained by compressing the common prefix that each other node except the master node and the master node have, the content of the common prefix that each other node and the master node have may be compressed to a length value of the common prefix corresponding to the node.
For example, the common prefixes of 3 pairs of nodes are respectively 55>33>11, and thus, the node pair with the largest common prefix is selected as the node pair (0,0.2) corresponding to 55, and 0 or 0.2 is used as the master node; if 0 is taken as the main node, compressing the common prefixes corresponding to 0.1,0.1.1 and 0.2, so that the content compression of the common prefix corresponding to 0.1 is 33 of the length of the common prefix of (0, 0.1); the content of the common prefix corresponding to 0.1.1 is compressed into (0,0.1.1), and the length of the common prefix is 11; the content of the common prefix corresponding to 0.1 is compressed into the length of the common prefix of (0,0.2) which is 55; the compressed link structure log is specifically as follows:
0,com.alipay.pcardcore.common.util.cache.Cachemanger.getKeyStrategy(1)
0.2,{55}Cachemanger.getobject(3)
0.1,{33}drm.manager.DrmResourceManager.findResourceByName(2)
0.1.1,{11}imock.core.pool.contorller.EnvContorller.isProd()
as can be seen from the above, since the content of the common prefix of each other node and the master node is compressed to the length value of the common prefix corresponding to the node, all the content of each other node is restored through the compressed length value and the master node.
For example, taking 0.2 in the compressed link structure log as an example, since the compressed content of the common prefix corresponding to 0.2 is 55, the content of the first 55 characters is selected from the content of the master node 0 and is filled into the content of 0.2, so that 0.2, {55} cachenger. getobject (3) is reduced to 0.2, com.alipay. pcardcore. common. u.u.u.he. cachemanger. getobject (3), and the above operation is performed on each other node except the master node in the compressed link structure log, so that all the content of each other node can be reduced; therefore, the compressed link structure log can be read while ensuring a certain compression ratio.
In a second aspect, based on the same inventive concept, an embodiment of this specification provides an apparatus for compressing a link structure log, please refer to fig. 2, including:
an original log obtaining unit 201, configured to obtain an original link structure log generated by one-time invocation, where the original link structure log includes node information of multiple nodes;
a master node selecting unit 202, configured to extract a node pair with a largest common prefix from the original link structure log, and select a node from the node pair with the largest common prefix as a master node;
a common prefix obtaining unit 203, configured to obtain a common prefix between each other node in the original link structure log, except for the master node, and the master node;
a compressing unit 204, configured to compress the obtained common prefix between each other node and the master node, so as to obtain a compressed link structure log.
In an optional manner, the master node selecting unit 202 is further configured to sort the original link structure logs according to the method signatures, and obtain two top nodes in the sorted original link structure logs as the node pair with the largest common prefix.
In an optional manner, the master node selecting unit 202 is further configured to select a node ranked before from the ranked original link structure logs as the master node.
In an optional manner, the master node selecting unit 202 is further configured to compare node contents of every two nodes in the original link structure log during processing of each task of the current batch processing by executing all threads, so as to obtain a comparison result; and extracting the node pairs with the maximum common prefix according to the comparison result.
In an optional manner, the compressing unit 204 is further configured to compress the content of the common prefix that each other node has with the master node to the length value of the common prefix corresponding to the node.
In a third aspect, based on the same inventive concept as the method for compressing the link structure log in the foregoing embodiment, the present invention further provides a server, as shown in fig. 3, including a memory 304, a processor 302, and a computer program stored on the memory 304 and executable on the processor 302, wherein the processor 302 executes the program to implement the steps of any one of the methods for processing the batch processing task described above.
Where in fig. 3 a bus architecture (represented by bus 300), bus 300 may include any number of interconnected buses and bridges, bus 300 linking together various circuits including one or more processors, represented by processor 302, and memory, represented by memory 304. The bus 300 may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. Bus interface 305305 provides an interface between bus 300 and receiver 301 and transmitter 303. The receiver 301 and the transmitter 303 may be the same element, i.e., a transceiver, providing a means for communicating with various other apparatus over a transmission medium. The processor 302 is responsible for managing the bus 300 and general processing, and the memory 304 may be used for storing data used by the processor 302 in performing operations.
In a fourth aspect, based on the inventive concept of the compression method of the link structure log as in the previous embodiments, the present invention further provides a computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, realizes the steps of any one of the methods of the compression method of the link structure log as described above.
The description has been presented with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the description. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present specification have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all changes and modifications that fall within the scope of the specification.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present specification without departing from the spirit and scope of the specification. Thus, if such modifications and variations of the present specification fall within the scope of the claims of the present specification and their equivalents, the specification is intended to include such modifications and variations.
Claims (12)
1. A method for compressing a link structure log, comprising:
acquiring an original link structure log generated by one-time calling, wherein the original link structure log comprises node information of a plurality of nodes;
extracting node pairs with the maximum common prefix from the original link structure logs, and selecting one node from the node pairs with the maximum common prefix as a main node;
acquiring a common prefix of each other node except the main node and the main node in the original link structure log;
and compressing the obtained common prefix of each other node and the main node to obtain a compressed link structure log, wherein in the compressed link structure log, all contents of the main node and contents except the common prefix corresponding to each other node are in an uncompressed state.
2. The compression method of claim 1, wherein the extracting the node pair with the largest common prefix from the original link structure log comprises:
sequencing the original link structure logs according to the method signatures;
and acquiring the first two nodes in the sorted original link structure logs as the node pair with the maximum common prefix.
3. The compression method of claim 2, wherein selecting one node from the pair of nodes having the largest common prefix as the master node comprises:
and selecting the node which is sequenced at the front from the sequenced original link structure logs as the main node.
4. The compression method of claim 1, wherein during each task of the current batch process by executing all threads, the method further comprises:
comparing the node contents of every two nodes in the original link structure log to obtain a comparison result;
and extracting the node pairs with the maximum common prefix according to the comparison result.
5. The compression method according to any one of claims 1 to 4, wherein the compressing the obtained common prefix of each other node and the master node specifically comprises:
compressing the content of the common prefix of each other node and the main node into the length value of the common prefix corresponding to the node.
6. An apparatus for compressing a link structure log, comprising:
the system comprises an original log obtaining unit, a link structure log generating unit and a processing unit, wherein the original log obtaining unit is used for obtaining an original link structure log generated by one-time calling, and the original link structure log comprises node information of a plurality of nodes;
a master node selecting unit, configured to extract a node pair with a largest common prefix from the original link structure log, and select a node from the node pair with the largest common prefix as a master node;
a common prefix obtaining unit, configured to obtain a common prefix between each other node in the original link structure log, except for the master node, and the master node;
and a compressing unit, configured to compress the obtained common prefix, which is between each of the other nodes and the master node, to obtain a compressed link structure log, where all contents of the master node and contents, except for the common prefix, corresponding to each of the other nodes are in an uncompressed state in the compressed link structure log.
7. The compression apparatus as claimed in claim 6, wherein the master node selecting unit is further configured to sort the original link structure logs according to method signatures, and obtain two first nodes in the sorted original link structure logs as the node pair having the largest common prefix.
8. The compression apparatus as claimed in claim 7, wherein the master node selecting unit is further configured to select a node ranked before as the master node from the ranked original link structure logs.
9. The compression apparatus as claimed in claim 6, wherein the master node selecting unit is further configured to compare node contents of every two nodes in the original link structure log during processing of each task of the current batch processing by executing all threads, so as to obtain a comparison result; and extracting the node pairs with the maximum common prefix according to the comparison result.
10. The compression apparatus according to any one of claims 6 to 9, wherein the compression unit is further configured to compress the content of the common prefix that each other node has with the master node to a length value of the common prefix corresponding to the node.
11. A server comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method of any one of claims 1 to 5 when executing the program.
12. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810681474.5A CN109033189B (en) | 2018-06-27 | 2018-06-27 | Compression method and device of link structure log, server and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810681474.5A CN109033189B (en) | 2018-06-27 | 2018-06-27 | Compression method and device of link structure log, server and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109033189A CN109033189A (en) | 2018-12-18 |
| CN109033189B true CN109033189B (en) | 2021-08-24 |
Family
ID=65520536
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810681474.5A Active CN109033189B (en) | 2018-06-27 | 2018-06-27 | Compression method and device of link structure log, server and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109033189B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113934701A (en) * | 2021-10-12 | 2022-01-14 | 网易（杭州）网络有限公司 | Log processing method, device, server and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101667843A (en) * | 2009-09-22 | 2010-03-10 | 中兴通讯股份有限公司 | Methods and devices for compressing and uncompressing data of embedded system |
| CN102196478A (en) * | 2010-03-01 | 2011-09-21 | 中兴通讯股份有限公司 | Diagnosis method and system for failure of network management system |
| CN102289507A (en) * | 2011-08-30 | 2011-12-21 | 王洁 | Method for mining data flow weighted frequent mode based on sliding window |
| CN102831020A (en) * | 2012-07-26 | 2012-12-19 | 中国科学院信息工程研究所 | Log detection method and system |
| CN104244320A (en) * | 2014-09-01 | 2014-12-24 | 上海大唐移动通信设备有限公司 | Log uploading method and device in automatic road testing system |
| CN104917591A (en) * | 2015-06-11 | 2015-09-16 | 中国电子科技集团公司第五十四研究所 | Satellite network data package compression method suitable for uni-directional lossy link |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6434139B1 (en) * | 1999-08-10 | 2002-08-13 | Lucent Technologies Inc. | Method for optimizing mobile wireless communications routed across plural interconnected networks |
| US20050071336A1 (en) * | 2003-09-30 | 2005-03-31 | Microsoft Corporation | Systems and methods for logging and recovering updates to data structures |
| US8090709B2 (en) * | 2007-06-28 | 2012-01-03 | Microsoft Corporation | Representing queries and determining similarity based on an ARIMA model |
| US7609179B2 (en) * | 2008-01-08 | 2009-10-27 | International Business Machines Corporation | Method for compressed data with reduced dictionary sizes by coding value prefixes |
| CN101610185B (en) * | 2009-06-23 | 2011-08-24 | 中兴通讯股份有限公司 | Compression method and compression device of alarm mask data |
| US8635195B2 (en) * | 2011-05-19 | 2014-01-21 | International Business Machines Corporation | Index compression in a database system |
| KR101624711B1 (en) * | 2013-12-24 | 2016-05-26 | (주)에프씨아이 | Method And Apparatus For Compressing/Decompressing Data By Using Floating Point |
-
2018
- 2018-06-27 CN CN201810681474.5A patent/CN109033189B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101667843A (en) * | 2009-09-22 | 2010-03-10 | 中兴通讯股份有限公司 | Methods and devices for compressing and uncompressing data of embedded system |
| CN102196478A (en) * | 2010-03-01 | 2011-09-21 | 中兴通讯股份有限公司 | Diagnosis method and system for failure of network management system |
| CN102289507A (en) * | 2011-08-30 | 2011-12-21 | 王洁 | Method for mining data flow weighted frequent mode based on sliding window |
| CN102831020A (en) * | 2012-07-26 | 2012-12-19 | 中国科学院信息工程研究所 | Log detection method and system |
| CN104244320A (en) * | 2014-09-01 | 2014-12-24 | 上海大唐移动通信设备有限公司 | Log uploading method and device in automatic road testing system |
| CN104917591A (en) * | 2015-06-11 | 2015-09-16 | 中国电子科技集团公司第五十四研究所 | Satellite network data package compression method suitable for uni-directional lossy link |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109033189A (en) | 2018-12-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111008075B (en) | Load balancing system, method, device, equipment and medium | |
| CN107920094B (en) | Data acquisition method and device, server and network equipment | |
| CN110661829B (en) | File downloading method and device, client and computer readable storage medium | |
| CN109254854A (en) | Asynchronous invoking method, computer installation and storage medium | |
| CN110659905A (en) | Transaction verification method, device, terminal equipment and storage medium | |
| CN111273891A (en) | Business decision method and device based on rule engine and terminal equipment | |
| CN108399574B (en) | Claim data acquisition method, butt-joint claim subsystem, medium and electronic equipment | |
| CN109710502B (en) | Log transmission method, device and storage medium | |
| CN109033189B (en) | Compression method and device of link structure log, server and readable storage medium | |
| CN105550179A (en) | Webpage collection method and browser plug-in | |
| CN111210826A (en) | Voice information processing method and device, storage medium and intelligent terminal | |
| CN110930253A (en) | Intelligent contract internal main key generation method and device, computer equipment and storage medium | |
| CN111193631A (en) | Information processing method, system, and computer-readable storage medium | |
| CN115269117A (en) | Resource creating method and device, computer equipment and storage medium | |
| CN106156169B (en) | Discrete data processing method and device | |
| CN110266814B (en) | Transmission method and transmission device | |
| CN112597119A (en) | Method and device for generating processing log and storage medium | |
| CN110264383B (en) | Electronic contract filing method and device, readable storage medium and server | |
| CN111163123A (en) | Service request processing method and device | |
| CN113342647A (en) | Test data generation method and device | |
| CN111475291A (en) | Data processing method, system, server and medium | |
| CN113282384A (en) | Cooperative office management method and device based on Internet and cooperative management platform | |
| CN106484725B (en) | A kind of data processing method, device and system | |
| CN106815238B (en) | Serialization and deserialization method and device for structured data | |
| CN110457323A (en) | The processing method and processing device of tables of data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200923 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Innovative advanced technology Co.,Ltd. Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant before: Advanced innovation technology Co.,Ltd. Effective date of registration: 20200923 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Advanced innovation technology Co.,Ltd. Address before: A four-storey 847 mailbox in Grand Cayman Capital Building, British Cayman Islands Applicant before: Alibaba Group Holding Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |