WO2024001630A1 - Information storage method and device, information reading method, and device and storage medium - Google Patents

Abstract

Provided in the embodiments of the present application are an information storage method and device, an information reading method, and a device and a storage medium. The information storage method comprises: acquiring traceable information, wherein the traceable information comprises a procedure call series (S1000); constructing a multi-level hash table, wherein a bit division array is set according to the procedure call series, and the number of buckets of each level of hash table is set according to the corresponding procedure call series (S2000); storing the traceable information in the multi-level hash table according to the procedure call series, wherein the same traceable information is stored only once in each level of hash table (S3000); and returning a traceable information index (S4000).

Description

Information storage, reading methods, equipment and storage media

Cross-references to related applications

This application is filed based on a Chinese patent application with application number 202210741922.2 and a filing date of June 28, 2022, and claims the priority of the Chinese patent application. The entire content of the Chinese patent application is hereby incorporated into this application as a reference.

Technical field

This application relates to the field of information processing technology, especially an information storage and reading method, device and storage medium.

Background technique

With the development of communication technology, the complexity of embedded systems continues to increase. In order to accurately locate system problems and ensure product quality, it is necessary to add records of traceable information when the system is running. In embedded systems, traceability information refers to information that describes the sequence of procedure calls. Based on this information, the running process of the system can be traced back.

In related technologies, there is a large amount of duplicate content in the storage of traceable information, which takes up a lot of storage space in embedded devices. Not only does it have high requirements on the storage space of the device, but it also wastes the storage space of the device. There are also related technologies that use compression saving methods to reduce the memory occupied by traceable information, but this method introduces additional compression and decompression overhead. How to reduce the use of device storage space on the basis of reducing the introduction overhead is an issue that needs to be solved urgently.

Contents of the invention

Embodiments of the present application provide an information storage and reading method, device and storage medium.

In a first aspect, embodiments of the present application provide an information storage method, including: obtaining traceable information, wherein the traceable information includes a process call series; constructing a multi-level hash table, wherein the bit-divided array is divided according to the The process call level is set, and the number of buckets in each level of the hash table is set according to the corresponding process call level; the traceable information is stored in the multi-level hash table according to the process call level, where each level The same traceable information in the hash table is stored only once; the traceable information index is returned.

In a second aspect, embodiments of the present application provide an information reading method, including: obtaining a traceable information index, wherein the traceable information index is obtained according to the information storage method in the first aspect; according to the traceable information index , decode to obtain the hash index of each level; read the corresponding information from the multi-level hash table according to each level of hash index; obtain traceable information.

In a third aspect, embodiments of the present application provide an information storage device, including: an acquisition module configured to acquire traceable information, wherein the traceable information includes a process call level; a processing module, the The processing module is configured to build a multi-level hash table, wherein the bit division array is set according to the number of process call levels, and the number of buckets in each level of the hash table is set according to the corresponding number of process call levels; the processing module is also configured to The traceable information is stored in the multi-level hash table according to the process call level, wherein the same traceable information in each level hash table is only stored once; a feedback module, the feedback module is set to Returns the traceable information index.

In a fourth aspect, embodiments of the present application provide an electronic device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the first The information storage method in the second aspect, or implement the information reading method in the second aspect.

In a fifth aspect, embodiments of the present application provide a computer-readable storage medium. The computer-readable storage medium stores computer-executable instructions. When the computer can execute the computer program, the information storage in the first aspect is implemented. square method, or the information reading method in the second aspect.

Description of drawings

Figure 1 is a system architecture diagram provided by an embodiment of the present application;

Figure 2 is a flow chart of an information storage method provided by an embodiment of the present application;

Figure 3 is a flow chart of the storage process of a multi-level hash table provided by an embodiment of the present application;

Figure 4 is a flow chart of an information reading method provided by an embodiment of the present application;

Figure 5 is a flow chart of the query process of a multi-level hash table provided by an embodiment of the present application;

Figure 6 is a schematic structural diagram of an information storage device provided by an embodiment of the present application;

Figure 7 is a schematic structural diagram of an information reading device provided by an embodiment of the present application;

FIG. 8 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.

Detailed ways

In order to make the purpose, technical methods and advantages of the present application clearer, the present application will be further described in detail below with reference to the drawings and embodiments. It should be understood that the embodiments described here are only used to explain the present application and are not used to limit the present application.

It should be noted that although a logical sequence is shown in the flowchart, in some cases, the steps shown or described may be performed in an order different from that in the flowchart. The terms "first", "second", etc. in the description, claims, and above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific sequence or sequence.

In the description of the embodiments of this application, unless otherwise explicitly limited, words such as setting, installation, and connection should be understood in a broad sense. Those skilled in the art can reasonably determine the meaning of the above words in the embodiments of this application based on the content of the technical solution. . In the embodiments of this application, words such as "further", "exemplarily" or "optionally" are used as examples, illustrations or illustrations, and should not be interpreted as being more preferable or better than other embodiments or designs. Advantages. The use of the words "further," "exemplarily," or "optionally" is intended to present relevant concepts.

Embodiments of the present application can be applied to various embedded devices or communication devices, such as mobile phones, tablets, computers, laptops, wearable devices, vehicle-mounted devices, base stations, network element equipment, drones, etc. The embodiments of this application are not limiting.

With the development of science and technology, the complexity of embedded systems continues to increase. In order to accurately locate system problems and ensure product quality, it is necessary to add records of traceable information when the system is running. At the same time, the communication field has extremely high requirements for the real-time performance of the system. However, the memory of embedded devices is limited. How to ensure that traceable information is recorded while meeting the low memory overhead requirements of embedded devices and ensuring the real-time nature of the system has become an issue that cannot be ignored to enhance product competitiveness. is the key and is in line with the technological development in the fields of communication and real-time systems.

Traceability information in embedded systems refers to information describing the sequence of procedure calls, based on which the runtime process of the system can be traced back. The traceable information stored in embedded devices usually contains a large amount of duplicate content, which can cause a huge waste of device storage in application scenarios where device storage space is limited. In addition, traceable information needs to be accessed quickly in actual application scenarios. Although using the compression saving method can reduce the memory footprint of traceable information, it will introduce additional compression and decompression overhead.

Embodiments of the present application provide an information storage and reading method, device and storage medium, aiming to reduce the cost of device storage space without introducing the overhead of compression and decompression algorithms, and meet the requirements of real-time performance. The list stores traceable information and merges the same traceable information to reduce memory usage; without introducing the overhead of compression algorithm, it reduces the storage space overhead of traceable information. The more the same traceable information, the less storage space it takes up. . At the same time, this The application information storage and reading process does not require a compression algorithm for compression and decompression. It is stored and read directly based on the multi-level hash table. The time complexity is not affected by the algorithm, is deterministic, and can meet the requirements of real-time systems.

The embodiments of the present application will be further described below with reference to the accompanying drawings.

Figure 1 is a system architecture diagram of an information storage method provided by an embodiment of the present application. As shown in Figure 1, the system architecture includes an acquisition module 100, a processing module 200 and a feedback module 300. It is understandable that the system architecture can be deployed as a whole in the data processing center of an embedded system or communication system, or as a whole deployed at a certain node of an embedded system or a certain communication network architecture. In a certain node of the system, each module can also be deployed in different nodes of an embedded system or communication system, and each module interacts with each other through communication connections.

The acquisition module 100 may be configured to acquire traceable information, where the traceable information includes a process call level;

The processing module 200 is configured to construct a multi-level hash table, in which the bit division array is set according to the procedure call level, and the number of buckets in each level of the hash table is set according to the corresponding procedure call level; The traceable information is stored in the multi-level hash table respectively according to the process call level, wherein the same traceable information in each level hash table is only stored once;

The feedback module 300 is configured to return the traceable information index.

In some embodiments, the system architecture diagram of Figure 1 can also be used for the information reading method. It can be understood that the information reading method is the reverse process of the information storage method. As shown in Figure 1, the acquisition module 100 can also be used to obtain the traceable information index; the processing module 200 can also be used to decode the hash index of each level according to the traceable information index obtained through the acquisition module 100, Corresponding information is read from the multi-level hash table according to each level of hash index; the feedback module 300 can also be used to feed back the traceable information obtained through the processing module 200.

The solution of this embodiment is based on the fact that there are a large number of identical and adjacent procedure call addresses in embedded application scenarios or communication scenarios. The same procedure call addresses are merged through a multi-level hash table to reduce the amount of traceable information without introducing a compression algorithm. Storage space occupied. At the same time, high-performance query of traceable information is realized to meet the real-time requirements of embedded systems.

Figure 2 is a flow chart of an information storage method provided by an embodiment of the present application. As shown in Figure 2, this information processing method can be used for terminals or servers. In the embodiment of FIG. 2 , the information processing method may include but is not limited to step S1000, step S2000, step S3000 and step S4000.

Step S1000: Obtain traceable information, where the traceable information includes the procedure call level.

In embedded systems or communication systems, in order to facilitate later system maintenance, alarm traceability, etc., information that can represent the flow of each node involved in a certain call of the system is generated, that is, traceable information. A traceable information generally consists of multiple levels. Call information composition.

In some implementations, a piece of traceability information is a set of hierarchically related procedure call address arrays. The procedure call address array includes at least one procedure call address with a call hierarchy relationship; where the call hierarchy is the process call series. In some embodiments, the procedure call address array has the highest level, that is, the most upstream in the call corresponds to the first level. As the calling process goes downstream, the number of procedure call levels increases in sequence.

In some embodiments, assuming a procedure call address array whose traceability information is {A, B, C, D, E}, and its calling process is A→B→C→D→E, then the procedure call level and address The correspondence relationship is as follows: A procedure call address corresponds to the first level, B procedure call address corresponds to the second level, C procedure call address corresponds to the third level, D procedure call address corresponds to the fourth level, and E procedure call address corresponds to Level 5.

Step S2000: Construct a multi-level hash table, in which the bit division array is set according to the procedure call level, and the number of buckets in each level hash table is set according to the corresponding procedure call level.

Each level of the hash table in the multi-level hash table corresponds to the sequence of the procedure call series; in actual application scenarios, the closer the series are to The probability of repeating traceable information corresponding to the previous procedure call level, that is, the higher the procedure call address, the greater the probability that the same address is the same. There is no need for more hash table buckets. The later the procedure call level, the higher the probability of repeating the traceable information. The repetition probability of the traceable information corresponding to the number, that is, the lower the level of the process, the lower the probability of having the same call address, which requires a larger number of hash table buckets; therefore, the number of buckets of each level of hash table is based on its corresponding process. Set the calling level. The lower the corresponding procedure calling level is in the hash table, the more buckets are set. It is conceivable that the multi-level hash table can be pre-built based on expert experience and traceable information analysis of actual application scenarios.

Step S3000: Store the traceable information into multi-level hash tables according to the process call levels, where the same traceable information in each level hash table is only stored once.

Part of the traceable information corresponding to each level of procedure call series is stored in a hash table corresponding to the series and the process call series of this level. In each level of the hash table, when multiple identical traceable information are stored, the hash table will only put the traceable information stored for the first time. When the same traceable information is stored in the subsequent hash tables, only the return of the hash table will be triggered. Hash index without actually storing the same traceable information into the hash table.

In some implementations, step S3000 may also include but is not limited to the following steps:

Perform a hash operation on each level of procedure call address in the procedure call address array to obtain a hash index;

Save the procedure call address of each level to the hash table of the corresponding level according to the hash index, and return the corresponding hash index.

Among them, the number of bits of the hash index is preset according to the corresponding procedure call level when constructing the multi-level hash table. Since the information with the earlier procedure call level in the traceable information has a greater repetition rate, the corresponding The hash table with a higher level needs to store less content, the lower the number of buckets it needs, and the lower the complexity of storing the content. Therefore, the corresponding procedure calls the bits of the hash index returned by the hash table with a higher level. The number of bits at each level is smaller; the number of bits at each level can be configured according to the needs of the hash table of the corresponding level and the traceability information of the corresponding level.

In some embodiments, after performing a hash operation on each level of procedure call address in the procedure call address array and obtaining the hash index, it is queried whether the hash index already exists in the hash table of the corresponding level; if it exists, , increase the count corresponding to the hash index, and return the corresponding hash index; if it does not exist, save the corresponding procedure call address to the hash table of the corresponding series according to the hash index and return the corresponding hash index.

The procedure call addresses of each level of traceable information are stored in the hash table of the corresponding level according to the process call level. Among them, the same process call addresses are merged, that is, only the first one of the same process call addresses is merged. The procedure call address saved once is stored in the hash table of the corresponding series. The same procedure call address is not repeatedly stored in the hash table to occupy the number of buckets and memory, and the count of the hash index corresponding to the procedure call address is increased.

Step S4000: Return the traceable information index.

After the traceable information is stored in the multi-level hash table according to the process call level, each level of hash table will return a corresponding hash index. According to the traceable information, the hash index of each level returned by the multi-level hash table is stored. Obtain the traceable information index corresponding to the traceable information.

In some implementations, the hash index returned by each level of hash table corresponding to the traceable information can be merged into the traceable information index of the traceable information through coding.

In some implementations, assuming that the traceable information index is ks and the hash index is lidx, the traceable information index can be obtained by the following formula:
ks＝(ks<<x _i )|lidx

Among them, x _i is the number of bits of the hash table index corresponding to the i-th procedure call level, and each operator in the formula is a C language operator.

Taking the traceable information of a four-level call as an example, the traceable information is divided into four levels through the process call series. The process call address corresponding to the first-level process call level is hashed and stored in the first-level hash table. , get the lidx returned by the first-level hash table, execute ks=(ks<<x ₁ )|lidx; repeat the above operation until the procedure call address corresponding to each level of procedure call level has completed the hash operation, and finally get the Traceable information index for traceable information for layer four calls.

Figure 3 is a flow chart of a multi-level hash table storage process provided by an embodiment of the present application. The following is an overall description of the information storage method according to the embodiment of the present application with reference to FIG. 3 .

Step 1. Construct a traceable information storage data structure.

The traceable information is a set of procedure call address arrays with hierarchical relationships, and the process call level n is determined. For example, when the traceable information is a set of procedure call address arrays with seven levels of call relationships, n is 7, and the number of process call levels is 1. Seven levels to 7. Determine the bit division array X _n ={x ₁ , x ₂ ,..., x _n }. x _n describes the number of bits in the hash table index corresponding to the n-th level procedure call address, and 2 ^{x n} corresponds to the number of buckets in the n-th level hash table. In actual application scenarios, the higher the probability of the process call addresses being the same, the higher the probability of having the same hash table buckets, and the lower the probability of having the same process call addresses, which requires more hash table buckets. The number of buckets in the hash table. Through the above settings, the number of buckets in the hash table corresponding to the process call address at each level can be flexibly set based on the actual application scenario.

Step 2: Storage of traceable information.

The second step is mainly to obtain the encoded traceable information index ks, as shown in Figure 3.

1) Enter the procedure call address array C _n = {c ₁ , c ₂ ,..., c _n } to trace back the information, and c _n represents the nth level procedure call address of the traceable information;

2) Perform a hash operation on the i-th level process call address c _i , and query whether the hash index exists in the i-th level hash table h _i . If it does not exist, save the process call address corresponding to the hash index to this level. in the hash table; if present, increment the count corresponding to the hash index. Among them, i=1,2,...,n.

3) Both paths in 2) above will get a hash index lidx corresponding to the i-th level, let ks=(ks<<x _i )|lidx, and encode the hash index corresponding to the i-th level procedure call address. .

4) Let i=i+1, return to step 2), that is, store the next-level procedure call address c _i+1 .

5) Execute 2) to 4) in a loop until the hash operation of each level of procedure call address is completed, the stored procedure is completed, that is, i>n, and finally the traceable information index ks is returned to the user.

Figure 4 is a flow chart of an information reading method provided by an embodiment of the present application. As shown in Figure 4, this information processing method can be used for terminals or servers. In the embodiment of FIG. 4 , the information processing method may include but is not limited to step S5000, step S6000, step S7000 and step S8000.

Step S5000: Obtain a traceable information index, where the traceable information index is obtained according to the information storage method provided in any embodiment.

Step S6000: According to the traceable information index, decode to obtain the hash index of each level.

Step S7000: Read corresponding information from the multi-level hash table according to each level of hash index.

Step S8000: Obtain traceable information.

It can be understood that the information reading method of the present application is the reverse process of the information storage method provided in any of the above embodiments. After obtaining the traceable information index through the information storage method provided in any of the above embodiments, when it is necessary to extract the traceable information that has been stored in the multi-level hash table, obtain the traceable information index corresponding to the traceable information; The backtracking information index is decoded, and the decoding method corresponds to the encoding method in the information storage method to obtain the hash index corresponding to each level of procedure call level; according to each level of hash index, each level from the multi-level hash table Reading the corresponding series in the hash table can be traced back information, and finally summarize the part of the traceable information corresponding to all levels to obtain the traceable information corresponding to the traceable information index.

In some feasible implementations, the previously stored traceable information is a set of hierarchical procedure call address arrays. Step S7000 may include but is not limited to: according to each level of hash index, from the multi-level hash table Read the corresponding procedure call address; step S8000 may include but is not limited to: obtaining an array of procedure call addresses based on the procedure call address of each level. After decoding the hash index of each level according to the corresponding traceable information index, the corresponding procedure call address of each level is read from each level of the multi-level hash table, and the obtained procedure call address is divided into levels. Number, that is, after sorting the call hierarchical relationship, the corresponding process call address array with hierarchical relationship is obtained, that is, the corresponding traceable information.

In some feasible implementations, assuming that the traceable information index is ks and the hash index is lidx, the hash index can be obtained by the following formula:
lidx _j+1 =ks&(1<<x _nj -1)
ks＝ks>>x _nj

Among them, lidx _j+1 is the hash index corresponding to the j+1th level procedure call level, x _nj is the number of bits of the hash table index corresponding to the njth level procedure call level, where j=n-1,... ,2,1,0, where each operator in the formula is a C language operator.

Take the traceable information of a four-layer call as an example. Obtain the traceable information index ks corresponding to the traceable information of the four-layer call. It can be seen that n=4, j=3,2,1,0. First, take j=3, and according to lidx ₃₊₁ =ks&(1<<x _4-3 -1), find the hash index lidx ₄ corresponding to the fourth level procedure call series, and then let ks=ks>> x _4-3 for the next iteration operation; take j=2, and according to lidx ₂₊₁ =ks&(1<<x _4-2 -1), find the hash index corresponding to the third-level procedure call series lidx ₃ , and then let ks=ks>>x _4-2 ; take j=1, and according to lidx ₁₊₁ =ks&(1<<x _4-1 -1), find the second-level procedure call series corresponding to Hash index lidx ₂ , and then let ks=ks>>x _4-1 ; take j=0, and obtain the first-level procedure call level according to lidx ₀₊₁ =ks&(1<<x _4-0 -1) The hash index lidx ₁ corresponding to the number, and then let ks=ks>>x _4-0 . After obtaining the hash index of each level, query the hash table corresponding to the procedure call level, obtain the corresponding procedure call address c _j+1 , and finally obtain the procedure call address array C ₄ = {c ₁ , c ₂ , c ₃ , c ₄ }, that is, the traceable information of the above four layers of calls.

FIG. 5 is a flow chart of a multi-level hash table query process provided by an embodiment of the present application. The following is an overall description of the information reading method according to the embodiment of the present application with reference to FIG. 5 .

It can be understood that the traceable information query process of the multi-level hash table is the reverse process of the storage process of the multi-level hash table.

1) Enter the traceable information index ks; among them, the traceable information index ks is returned after storing the traceable information into a multi-level hash table using the method shown in Figure 3.

2) Let j=n; where n is the procedure call level of the traceable information corresponding to the traceable information index ks. For example, the traceable information corresponding to ks is a four-level call, that is, there are 4 levels of process call levels in total. This When n=4.

3) After setting j=j-1, determine whether j is greater than or equal to 0, which corresponds to "--j≥0?" in Figure 5; in the case of j≥0, perform step 4); in the case of j<0 Next, output the procedure call address array C _n .

4) Through lidx _j+1 =ks&(1<<x _nj -1), decode and calculate ks to obtain the hash index lidx _j+1 corresponding to the j+1th level.

5) Let ks=ks>>x _nj for the next iteration operation.

6) Query the hash table h j _{+1 corresponding to the j} +1th level, and obtain the procedure call address c _j+1 corresponding to the j+1th level.

7) Loop through steps 3) to 6) until the complete procedure call address array C _n = {c ₁ , c ₂ , c ₃ ,..., c _j+1 } is obtained.

Figure 6 is a schematic structural diagram of an information storage device provided by an embodiment of the present application. As shown in Figure 6, the information storage device provided by the embodiment of the present application can execute the information storage method provided by the embodiment of the present application, and has the corresponding functional modules and technical effects of the execution method. The device can be implemented through software, hardware, or a combination of software and hardware, and includes: a first acquisition module 400, a first processing module 500, and a first feedback module 600.

The first acquisition module 400 is configured to acquire traceable information, where the traceable information includes a process call level.

The first processing module 500 is configured to at least one of the following: construct a multi-level hash table, wherein the bit division array is set according to the procedure call level, and the number of buckets in each level of the hash table is set according to the corresponding procedure call level; The traceable information is stored in the multi-level hash table respectively according to the process call level, wherein the same traceable information in each level hash table is only stored once.

The first feedback module 600 is configured to return a traceable information index.

Figure 7 is a schematic structural diagram of an information reading device provided by an embodiment of the present application. As shown in Figure 7, the information reading device provided by the embodiment of the present application can execute the information reading method provided by the embodiment of the present application, and has the corresponding functional modules and technical effects of the execution method. The device can be implemented by software, hardware, or a combination of software and hardware, and includes: a second acquisition module 700, a second processing module 800, and a second feedback module 900.

The second acquisition module 700 is configured to acquire a traceable information index, where the traceable information index is obtained according to the information storage method provided by any embodiment of the present application.

The second processing module 800 is configured to be at least one of the following: decode to obtain the hash index of each level according to the traceable information index; read corresponding information from the multi-level hash table according to the hash index of each level.

The second feedback module 900 is configured to feed back the obtained traceable information to the user.

FIG. 8 is a schematic structural diagram of an electronic device provided by an embodiment of the present application. As shown in Figure 8, the device includes a memory 1100, a processor 1200, and a communication device 1300. The number of memories 1100 and processors 1200 can be one or more. In Figure 8, one memory 1100 and one processor 1200 are taken as an example. The memory 1100 and processor 1200 in the device can be connected through a bus or other means. In Figure 8 Take the example of connecting via a bus.

As a computer-readable storage medium, the memory 1100 can be used to store software programs, computer-executable programs and modules, such as program instructions/modules corresponding to the information storage method and/or the information reading method provided in any embodiment of the present application. The processor 1200 implements the above information storage method and/or information reading method by running software programs, instructions and modules stored in the memory 1110 .

The memory 1100 may mainly include a program storage area and a data storage area, where the program storage area may store an operating system and at least one application program required for a function. In addition, the memory 1100 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some examples, memory 1100 may include memory located remotely from processor 1200, and these remote memories may be connected to the device through a network. Examples of the above-mentioned networks include but are not limited to the Internet, intranets, local area networks, mobile communication networks and combinations thereof.

The communication device 1300 is configured to perform information transceiver communication according to the control of the processor 1200 .

In an embodiment, the communication device 1300 includes a receiver 1310 and a transmitter 1320. The receiver 1310 is a module or device combination in an electronic device that receives data. The transmitter 1320 is a module or device combination in an electronic device that transmits data.

An embodiment of the present application also provides a computer-readable storage medium that stores computer-executable instructions. The computer-executable instructions are used to execute the information storage method and/or the information reading method provided by any embodiment of the present application. .

The system architecture and application scenarios described in the embodiments of this application are for the purpose of explaining the technical solutions of the embodiments of this application more clearly, and do not constitute a limitation on the technical solutions provided by the embodiments of this application. Those skilled in the art will know that with the system architecture With the evolution of technology and the emergence of new application scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

Those of ordinary skill in the art can understand that all or some of the steps, systems, and equipment in the methods disclosed above The functional modules/units may be implemented as software, firmware, hardware and appropriate combinations thereof.

In hardware implementations, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may consist of several physical components. Components execute cooperatively. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit . Such software may be distributed on computer-readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). As is known to those of ordinary skill in the art, the term computer storage media includes volatile and nonvolatile media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. removable, removable and non-removable media. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disk (DVD) or other optical disk storage, magnetic cassettes, tapes, disk storage or other magnetic storage devices, or may Any other medium used to store the desired information and that can be accessed by a computer. Additionally, it is known to those of ordinary skill in the art that communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media .

The terms "component", "module", "system", etc. used in this specification are used to refer to computer-related entities, hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to, a process, processor, object, executable file, thread of execution, program or computer running on a processor. Through the illustrations, both applications running on the computing device and the computing device may be components. One or more components can reside in a process or thread of execution, and the component can be localized on one computer or distributed between 2 or more computers. Additionally, these components can execute from various computer-readable media having various data structures stored thereon. A component may, for example, be based on a signal having one or more data packets (eg, data from two components interacting with another component, such as a local system, a distributed system, or a network, such as the Internet, which interacts with other systems via signals) Communicate through local or remote processes.

Some embodiments of the present application have been described above with reference to the accompanying drawings, but the scope of rights of the present application is not thereby limited. Any modifications, equivalent substitutions and improvements made by those skilled in the art without departing from the scope and essence of this application shall be within the scope of rights of this application.

Claims (11)

An information storage method that includes: Obtain traceable information, wherein the traceable information includes a process call level; Constructing a multi-level hash table, wherein the bit division array is set according to the procedure call level, and the number of buckets in each level hash table is set according to the corresponding procedure call level; Store the traceable information in the multi-level hash table according to the process call level, wherein the same traceable information in each level hash table is only stored once; Returns the traceable information index. The method according to claim 1, wherein the traceability information is an array of procedure call addresses with a hierarchical relationship. The method according to claim 2, wherein storing the traceable information in the multi-level hash table according to the procedure call level includes: Perform a hash operation on each level of procedure call address in the procedure call address array to obtain a hash index; The procedure call address of each level is saved into the hash table of the corresponding level according to the hash index, and the corresponding hash index is returned. The method according to claim 3, wherein said saving the procedure call address of each level into a hash table of a corresponding level according to the hash index and returning the corresponding hash index includes: Query whether the hash index already exists in the hash table of the corresponding series; If it exists, increase the count corresponding to the hash index and return the corresponding hash index; If it does not exist, the corresponding procedure call address is saved into the hash table of the corresponding level according to the hash index and the corresponding hash index is returned. The method according to claim 3 or 4, wherein the number of bits of the hash index of each level is preset according to the corresponding procedure call level. The method according to claim 3 or 4, wherein the returning traceable information index includes: The hash index of each level is encoded to obtain the traceable information index. An information reading method including: Obtain a traceable information index, wherein the traceable information index is obtained according to the information storage method according to any one of claims 1 to 6; According to the traceable information index, decode to obtain the hash index of each level; Read the corresponding information from the multi-level hash table according to each level of hash index; Obtain traceable information. The method according to claim 7, wherein reading corresponding information from a multi-level hash table according to each level of hash index includes: According to each level of hash index, read the corresponding procedure call address from the multi-level hash table; The traceable information obtained includes: According to the procedure call address of each level, an array of procedure call addresses is obtained. An information storage device including: Acquisition module, the acquisition module is configured to acquire traceable information, wherein the traceable information includes process adjustment Use series; A processing module, the processing module is configured to construct a multi-level hash table, wherein the bit division array is set according to the procedure call level, and the number of buckets in each level of the hash table is set according to the corresponding procedure call level; The processing module is also configured to store the traceable information in the multi-level hash table according to the process call level, wherein the same traceable information in each level hash table is only stored once; A feedback module configured to return a traceable information index. An electronic device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the method of any one of claims 1 to 6 is implemented. information storage method, or implement the information reading method as described in any one of claims 7 to 8. A computer-readable storage medium that stores computer-executable instructions. When the computer can execute the computer program, the information storage method as described in any one of claims 1 to 6 is implemented, or The information reading method according to any one of claims 7 to 8.