Data retrieval methods, devices, electronic equipment and storage media

CN117971879BActive Publication Date: 2026-08-14GUANGZHOU AUTOMOBILE GROUP CO LTD
View PDF 1 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-12-25
Publication Date
2026-08-14

AI Technical Summary

Technical Problem

但在数组存储方案中,空间复杂度较高,且占用存储空间较大

Benefits of technology

[0014]The solution provided in this application first converts the search keyword into an integer to obtain the target original integer corresponding to the search keyword. Then, it converts the target original integer into a target stored integer smaller than the target original integer. Finally, it determines the target data corresponding to the search keyword in the storage array based on the target stored integer. Since the stored integer corresponding to each position in the storage array is a smaller number than the original integer corresponding to each position after conversion by the target conversion rule, and the original integer corresponding to each position is the original integer corresponding to the keyword associated with the data stored at each position, the conversion of the target original integer into a stored integer smaller than the target original integer and the mapping of the stored integer to the storage position in the storage array during data storage compresses the storage space of the storage array, avoiding the space waste caused by the traditional storage array storage method. Moreover, when searching for the target data of the search keyword, it is only necessary to convert the original integer corresponding to the search keyword into the corresponding stored integer, thus improving the efficiency of data retrieval.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117971879B_ABST
    Figure CN117971879B_ABST
Patent Text Reader

Abstract

This application discloses a data search method, apparatus, electronic device, and storage medium. The data search method includes: obtaining a target raw integer corresponding to a keyword to be searched; converting the target raw integer into a target stored integer according to a target conversion rule; and determining the data stored at the location of the target stored integer in a storage array as the target data corresponding to the keyword to be searched. This method compresses the storage space of the storage array by converting the target raw integer into a stored integer smaller than the target raw integer during the data storage process and mapping the stored integer to the storage location of the storage array, thus avoiding the space waste caused by the traditional storage array storage method.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of data processing technology, and more specifically, to a data retrieval method, apparatus, electronic device, and storage medium. Background Technology

[0002] In current embedded software development for connected vehicles, the input scenarios are typically limited and repetitive. For such scenarios, array storage can achieve faster data retrieval. However, array storage has high space complexity and occupies a large amount of storage space. Summary of the Invention

[0003] In view of the above problems, this application proposes a data retrieval method, apparatus, electronic device and storage medium.

[0004] In a first aspect, embodiments of this application provide a data search method, the method comprising: obtaining a target raw integer corresponding to a keyword to be searched; converting the target raw integer into a target stored integer according to a target conversion rule, wherein different raw integers result in different stored integers after conversion by the target conversion rule, and the stored integer obtained after conversion by the target conversion rule is less than the raw integer; determining the data stored at the location of the target stored integer from a storage array as the target data corresponding to the keyword to be searched, wherein the stored integer corresponding to each position in the storage array is obtained by converting the raw integer corresponding to each position according to the target conversion rule, and the raw integer corresponding to each position is the raw integer corresponding to the keyword associated with the data stored at each position.

[0005] In an optional embodiment, converting the target raw integer to a target stored integer according to a target conversion rule includes: obtaining a first conversion parameter, wherein the first conversion parameter is used to convert the raw integers corresponding to different positions in the storage array into stored integers, and the stored integers obtained by converting the raw integers corresponding to different positions in the storage array through the first conversion parameter are different; if the first conversion parameter is a power of 2, obtaining the binary data corresponding to the target raw integer as the first data; obtaining the data located at the 1st to (M-1)th position from right to left in the first data as the second data, wherein M is the number of bits of the binary data corresponding to the first conversion parameter; converting the second data into decimal data to obtain the target stored integer.

[0006] In an optional embodiment, the step of converting the target raw integer to a target stored integer according to the target conversion rule includes: if the first conversion parameter is not a power of 2, obtaining a second conversion parameter, the second conversion parameter being used to convert the first conversion parameter to a power of 2; obtaining a third conversion parameter based on the power of 2 corresponding to the product of the second conversion parameter and the first conversion parameter; and obtaining the target stored integer corresponding to the target raw integer based on the first conversion parameter, the second conversion parameter, and the third conversion parameter.

[0007] In one optional embodiment, obtaining the target raw integer corresponding to the search keyword includes: if the data type corresponding to the search keyword is an integer type, then determining the target raw integer corresponding to the search keyword as the search keyword; if the data type corresponding to the search keyword is a non-integer type, obtaining the integer value corresponding to the search keyword according to a data table, wherein the data table includes multiple non-integer type data and the integer value corresponding to each non-integer type data; and performing hash processing on the integer value according to the conversion radix of the hash algorithm to obtain the hash value corresponding to the search keyword, which is used as the target raw integer corresponding to the search keyword.

[0008] In one optional embodiment, the establishment of the storage array includes: obtaining multiple keywords and data corresponding to each keyword; obtaining the original integer corresponding to each keyword; converting the original integer corresponding to each keyword into a storage integer according to the target conversion rule to obtain multiple distinct storage integers, each of the multiple storage integers corresponding to an original integer; establishing a storage array including multiple positions according to the number of the multiple storage integers, the multiple positions corresponding one-to-one with the multiple storage integers; and storing the data corresponding to each keyword into the corresponding position in the storage array according to the correspondence between the original integer corresponding to each keyword and the storage integer.

[0009] In one optional embodiment, the step of converting the original integer corresponding to each keyword into a stored integer according to the target conversion rule to obtain multiple distinct stored integers includes: determining a first conversion parameter based on the original integer corresponding to each keyword, wherein the first conversion parameter is used to convert the original integer corresponding to each keyword into a stored integer, and different original integers are converted into different stored integers by the first conversion parameter; and converting the original integer corresponding to each keyword into a stored integer according to the first conversion parameter to obtain multiple distinct stored integers.

[0010] In an optional embodiment, the step of converting the original integer corresponding to each keyword into a stored integer according to the first conversion parameter to obtain a plurality of distinct stored integers includes: if the first conversion parameter is a power of 2, then converting the original integer corresponding to each keyword into a stored integer according to the first conversion parameter to obtain a plurality of distinct stored integers; if the first conversion parameter is not a power of 2, then obtaining the largest original integer among the original integers corresponding to the plurality of keywords; determining a second conversion parameter to convert the first conversion parameter into a power of 2 according to the largest original integer and the first conversion parameter; converting the first conversion parameter into a power of 2 according to the second conversion parameter to obtain a third conversion parameter; and converting the original integer corresponding to each keyword into a stored integer according to the first conversion parameter, the second conversion parameter, and the third conversion parameter to obtain a plurality of distinct stored integers.

[0011] Secondly, embodiments of this application provide a data search device, the device comprising: a raw integer acquisition module, used to acquire a target raw integer corresponding to a keyword to be searched; a stored integer conversion module, used to convert the target raw integer into a target stored integer according to a target conversion rule, wherein different raw integers result in different stored integers after conversion by the target conversion rule, and the stored integer obtained after conversion by the target conversion rule is less than the raw integer; and a target data acquisition module, used to determine the data stored at the location of the target stored integer from a storage array as the target data corresponding to the keyword to be searched, wherein the stored integer corresponding to each position in the storage array is obtained by converting the raw integer corresponding to each position according to the target conversion rule, and the raw integer corresponding to each position is the raw integer corresponding to the keyword associated with the data stored at each position.

[0012] Thirdly, embodiments of this application provide an electronic device, including: one or more processors; a memory; and one or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the one or more processors, and the one or more application programs are configured to perform the data lookup method provided in the first aspect above.

[0013] Fourthly, embodiments of this application provide a computer-readable storage medium storing program code, which can be invoked by a processor to execute the data search method provided in the first aspect above.

[0014] The solution provided in this application first converts the search keyword into an integer to obtain the target original integer corresponding to the search keyword. Then, it converts the target original integer into a target stored integer smaller than the target original integer. Finally, it determines the target data corresponding to the search keyword in the storage array based on the target stored integer. Since the stored integer corresponding to each position in the storage array is a smaller number than the original integer corresponding to each position after conversion by the target conversion rule, and the original integer corresponding to each position is the original integer corresponding to the keyword associated with the data stored at each position, the conversion of the target original integer into a stored integer smaller than the target original integer and the mapping of the stored integer to the storage position in the storage array during data storage compresses the storage space of the storage array, avoiding the space waste caused by the traditional storage array storage method. Moreover, when searching for the target data of the search keyword, it is only necessary to convert the original integer corresponding to the search keyword into the corresponding stored integer, thus improving the efficiency of data retrieval. Attached Figure Description

[0015] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0016] Figure 1 A schematic flowchart of a data search method provided in an embodiment of this application is shown.

[0017] Figure 2 A flowchart illustrating a data retrieval method provided in another embodiment of this application is shown.

[0018] Figure 3 A flowchart illustrating a data retrieval method provided in another embodiment of this application is shown.

[0019] Figure 4 A structural block diagram of a data retrieval device provided in an embodiment of this application is shown.

[0020] Figure 5 A structural block diagram of an electronic device for performing a data lookup method according to an embodiment of the present application is shown. Detailed Implementation

[0021] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings.

[0022] The inventors further investigated array storage schemes and discovered that for complex data types, array storage increases space complexity and resource consumption, leading to reduced data retrieval efficiency. Furthermore, when creating storage locations for multiple keys, arrays allocate multiple consecutive locations based on the numerical values ​​of the keys, with the number of locations equal to the value of the key with the largest value. In finite and repetitive scenarios, only a very small number of storage locations are actually needed for data storage. Therefore, array storage schemes in related technologies, by creating too many storage locations, easily waste storage space. Moreover, searching for data within these storage locations involves a traversal search method; too many storage locations increase data retrieval time and reduce data interpolation efficiency.

[0023] For example, the keywords-data to be stored are 3:12; 4:800; 80000:200. The keywords are 3, 4, and 80000 respectively. If an array storage scheme is used, an array of length 80001 needs to be created, storing 80000 locations. Location 3 stores 12, location 4 stores 800, and location 80000 stores 200. To find the data corresponding to location 3, you only need to search that location. However, to find the data corresponding to location 800000, you need to traverse all 80000 locations until you find the data corresponding to location 80000. In this method, only 3 of the 80000 locations are actually used, resulting in a significant waste of storage space.

[0024] To address the background technology and the aforementioned technical problems, the inventors have proposed a data retrieval method, apparatus, electronic device, and storage medium. This method involves first converting the keyword to be searched into an integer to obtain the target original integer corresponding to the keyword. Then, the target original integer is converted into a target stored integer smaller than the original integer. Finally, the target data corresponding to the keyword in the storage array is determined based on the target stored integer. Since the stored integer at each position in the storage array is a smaller value than the original integer at each position after conversion according to the target conversion rules, and the original integer at each position corresponds to the keyword associated with the data stored at that position, the data storage process involves converting the target original integer into a smaller stored integer and mapping the stored integer to the storage position in the storage array. This compresses the storage space of the storage array, avoiding the space waste associated with traditional storage array methods. Furthermore, when searching for the target data corresponding to the keyword, only the original integer corresponding to the keyword needs to be converted into the corresponding stored integer, thus improving the efficiency of data retrieval.

[0025] Please see Figure 1 , Figure 1 A flowchart illustrating a data retrieval method according to an embodiment of this application is shown. In a specific embodiment, the data retrieval method is applied to, for example... Figure 4 The data lookup device 200 shown and the electronic device equipped with the data lookup device 200.

[0026] The following will address... Figure 1 The process shown will be described in detail. The data retrieval method may specifically include the following steps:

[0027] Step S110: Obtain the target raw integer corresponding to the keyword to be searched.

[0028] Since there is a one-to-one correspondence between keywords and data, when searching for target data, it is only necessary to obtain the keyword corresponding to the target data to obtain the target data. The keyword to be searched can be determined by the user through input on the terminal device (mobile terminal or server terminal), or by the user selecting multiple keywords stored on the terminal device by clicking or long-pressing. There are no specific limitations on the determination of the keyword to be searched here.

[0029] In array storage schemes, an array can only store data of one data type at a time. To facilitate data storage, the keywords corresponding to the data to be stored need to be uniformly converted. During storage, the array establishes storage locations for the data corresponding to the keywords, and these locations correspond to the keywords. Therefore, to facilitate the array in establishing storage locations corresponding to keywords during data storage, keywords are typically uniformly converted to integers. Therefore, in this embodiment, the keyword to be searched is converted to an integer. Obtaining the target original integer of the keyword to be searched can be done by searching a table containing the keywords and their corresponding original integers. Alternatively, the target original integer can be obtained by first determining the data type of the keyword. If the data type is integer, the target original integer is the keyword itself. If the data type is not integer, the keyword is converted according to integer conversion rules to obtain its corresponding original integer. Integer data conversion rules can be ASCII code conversion rules, which record uppercase and lowercase English letters and the integer corresponding to each letter. Using ASCII code conversion rules, the search keyword (English letters) is converted into integer data to obtain the target original integer.

[0030] Step S120: According to the target conversion rule, the target original integer is converted into a target stored integer. Different original integers will result in different stored integers after conversion by the target conversion rule, and the stored integers after conversion by the target conversion rule will be smaller than the original integers.

[0031] In array storage, storage space is allocated consecutively for data based on the values ​​of the original integers corresponding to the keys in the array, and the data corresponding to the keys is stored in the array positions corresponding to the original integers. If the values ​​of the original integers corresponding to the keys in the array differ significantly, there will be many blank spaces between the storage positions corresponding to two adjacent keys in the array, resulting in high memory consumption. The target transformation rule is used to convert multiple original integers into smaller and distinct data, thereby ensuring that there are no blank storage spaces or very few blank storage spaces between the storage positions allocated for data storage in the array, thus achieving the purpose of compressing the array's storage space.

[0032] The target conversion rule can be a rule specifying the corresponding stored integer for the original integer. After obtaining the target original integer corresponding to the keyword to be searched, the target stored integer corresponding to the target original integer is determined according to the target conversion rule. The target conversion rule can also specify the conversion method and / or calculation rules for converting the original integer to a stored integer, thereby converting the original integer to a stored integer according to the conversion method and / or calculation rules in the target conversion rule. The specific rules and / or specific calculation methods of the target conversion rule are not limited here. The target conversion rule can be a modulo rule, which means using a modulo algorithm to find the remainder of the original integer as the corresponding stored integer. It should be noted that the remainder obtained by the modulo rule is different for different original integers. The target conversion rule can also be a data correspondence rule, which specifies different stored integers corresponding to each different original integer, and each stored integer is less than the corresponding original integer.

[0033] Step S130: Determine the data stored at the location of the target stored integer from the storage array, and use it as the target data corresponding to the keyword to be searched. The stored integer corresponding to each position in the storage array is obtained by converting the original integer corresponding to each position according to the target conversion rule. The original integer corresponding to each position is the original integer corresponding to the keyword associated with the data stored at each position.

[0034] In this embodiment, since the location of the stored data corresponds to a stored integer, and each location stores the data corresponding to the keyword, the location of the data corresponding to the keyword in the storage array can be determined based on the conversion relationship between the keyword and the stored integer. After determining the target stored integer corresponding to the target original integer of the keyword to be searched, the storage location of the data corresponding to the keyword to be searched in the storage array is determined based on the target stored integer, thereby obtaining the target data corresponding to the keyword to be searched.

[0035] The data retrieval method provided in this application first converts the keyword to be searched into an integer to obtain the target original integer corresponding to the keyword. Then, it converts the target original integer into a target stored integer smaller than the target original integer. Finally, it determines the target data corresponding to the keyword in the storage array based on the target stored integer. Since the stored integer corresponding to each position in the storage array is the data smaller than the original integer corresponding to each position after conversion by the target conversion rule, and the original integer corresponding to each position is the original integer corresponding to the keyword associated with the data stored at each position, during the data storage process, the target original integer is converted into a stored integer smaller than the target original integer, and the stored integer is mapped to the storage position in the storage array. This compresses the storage space of the storage array and avoids the space waste caused by the traditional storage array storage method. Moreover, when searching for the target data of the keyword, it is only necessary to convert the original integer corresponding to the keyword to be searched into the corresponding stored integer, which improves the efficiency of data retrieval.

[0036] Please see Figure 2 , Figure 2 A flowchart illustrating a data retrieval method according to another embodiment of this application is shown. The following will focus on... Figure 2 The process shown will be described in detail. The data retrieval method may specifically include the following steps:

[0037] Step S201: Obtain the data type corresponding to the key to be searched.

[0038] Step S202: If the data type corresponding to the keyword to be searched is an integer type, then the target raw integer corresponding to the keyword to be searched is determined as the keyword to be searched.

[0039] In this embodiment, when the data type of the keyword to be searched is integer, the target original integer corresponding to the keyword to be searched is the keyword itself. Determining the target original integer of the keyword to be searched as the keyword itself reduces the computational effort required for converting the keyword to an integer type and improves the conversion efficiency from integer to stored integer.

[0040] Step S203: If the data type corresponding to the keyword to be searched is a non-integer type, obtain the integer value corresponding to the keyword to be searched according to the data table. The data table includes multiple non-integer type data and the integer value corresponding to each non-integer type data.

[0041] Non-integer types include, but are not limited to, string types, floating-point types, and many other types.

[0042] The data table includes multiple non-integer data types and their corresponding integer values. The data table can be an ASCII table, containing all uppercase and lowercase letters and their corresponding integer values. Alternatively, the data table can be created by the user-defined mapping between data and integers. No specific limitations are imposed on the content of the data table.

[0043] For example, let's take the keyword to be searched as the string "APC" and the data table as an ASCII code table. "APC" is a string type. We search for the integer values ​​corresponding to "A", "P" and "C" in the ASCII code table respectively. The integer values ​​are 65 for "A", 87 for "P" and 67 for "C".

[0044] Step S204: Hash the integer value according to the transformation radix of the hash algorithm to obtain the hash value corresponding to the keyword to be searched, which is used as the target original integer corresponding to the keyword to be searched.

[0045] A hash algorithm is a function that transforms data of arbitrary length into a string of fixed length. In this embodiment, a hash algorithm is used to transform one or more integer values ​​into another integer value. The transformation radix refers to the base of the function in the hash algorithm. It is important to note that the transformation radix in a hash algorithm is usually a prime number to reduce the probability of collisions after hashing.

[0046] For example, continuing with the keyword to be searched as the string "APC", the conversion base is 31. Based on the conversion base and the integer values ​​"65", "80" and "67" corresponding to "APC", hash processing is performed to obtain the hash value corresponding to "APC".

[0047] The hashing process can be implemented using the following code:

[0048]

[0049] Here, res is a variable in the calculation process. for v in ['A','P',C'] means that the variable v takes the corresponding integer values ​​in ['A','P',C'] sequentially. res*=31 means that the integer value multiplied by the conversion base equals the next integer value. res+=ord(v) means that the next integer value is added to the variable v to get the next integer value. res&=0xffffffff means that if the integer value exceeds 32 bits, only 32 bits are retained for calculation.

[0050] The process of obtaining the hash value corresponding to "APC" is as follows: First, obtain the integer value of variable v as the integer value of "A", which is 65. Then, multiply res = 0 by 31 to get 0, and add the resulting 0 to 65, making res = 65. Next, set the integer value of variable v to 80, multiply res = 65 by 31 to get 2015, and add 2015 to 80, making res = 2095. Finally, set the integer value of variable v to 67, multiply res = 2095 by 31 to get 64945, and add 64945 to 67 to obtain the final hash value of 65012. 65012 is then determined as the original integer corresponding to the string data "APC".

[0051] Step S205: Obtain a first conversion parameter, which is used to convert the original integers corresponding to different positions in the storage array into stored integers, and the stored integers obtained by converting the original integers corresponding to different positions in the storage array through the first conversion parameter are different.

[0052] The first conversion parameter is determined by the original integer values ​​of the multiple keys corresponding to the data stored in the storage array. Different data in the storage array corresponds to different keys, resulting in different original integer values ​​for each key, and thus different first conversion parameters. The first conversion parameter is used to convert multiple original integer values ​​into distinct stored integer values, where the stored integer value is smaller than the original integer value, thereby compressing the storage space of the storage array. Since each storage array can correspond to multiple conversion parameters for converting original integer values ​​to stored integer values, the first conversion parameter can be the smallest among these parameters, or it can be a user-specified conversion parameter. The determination of the first conversion parameter is not specifically limited here.

[0053] Step S206: If the first conversion parameter is a power of 2, obtain the binary data corresponding to the target original integer as the first data.

[0054] Step S207: Obtain the data from the first position to the (M-1)th position from right to left in the first data as the second data, where M is the number of bits of the binary data corresponding to the first conversion parameter.

[0055] Step S208: Convert the second data into decimal data to obtain the target stored integer.

[0056] In this embodiment of the application, since the data is stored in binary form in the electronic device, when the first conversion parameter is a power of 2, the number of bits of the binary data corresponding to the first conversion parameter is the power of 2 plus 1.

[0057] Since data in electronic devices is represented in binary form, the target conversion rule can be used to convert binary data, thereby improving the conversion efficiency of the original integer to the stored integer.

[0058] In this embodiment, the target conversion rule is preferably a modulo rule. The first conversion parameter is the modulus in the modulo rule. When performing a modulo operation on binary data, the solution can be optimized based on whether the first conversion parameter is a power of 2. When the first conversion parameter is a power of 2, formula (1) is satisfied:

[0059] x%(2) n )=x&(2 n -1) (1)

[0060] Where x is a primitive integer, 2 n The first conversion parameter is , where % represents the modulo operator, and & represents the AND operator.

[0061] Formula (1) means that when the original integer is moduloed by a power of 2, it is equivalent to performing a bitwise AND operation between the binary data of the original integer and the binary data corresponding to the difference between the power of 2 and 1. The result is 1 when both are 1, and 0 in all other cases.

[0062] For example, continuing with the case where the key to be searched is the original integer "65012" corresponding to the string "APC", the first conversion parameter is 16, which means the first conversion parameter is 2. 4 The binary data corresponding to 65012 is 1111110111110100, and the binary data corresponding to the difference between the first conversion parameter and 1 is 1111. Performing a right-to-left AND operation between 1111110111110100 and 1111 yields the binary data of 100. Converting 100 to decimal data gives the original integer value, which is 4.

[0063] From another perspective, the binary data corresponding to 2n-1 is all 1s. This is equivalent to performing a bitwise AND operation between the binary data of the original integer and the binary data of all 1s. That is, the data after the Mth bit from right to left in the binary data of the original integer is used as the stored integer corresponding to the original integer. Furthermore, the number of bits corresponding to the data after the Mth bit is the same as the number of bits in the binary data of 2n-1. In other words, the value of M is the same as the number of bits in the binary data of 2n.

[0064] Continuing the example above, the first conversion parameter is 24, and the corresponding binary data is 10000, meaning M is 5. The last four bits of the binary data corresponding to 65012 are used as the stored integer, i.e., 0100. The decimal data corresponding to 0100 is 4.

[0065] Step S209: If the first conversion parameter is not a power of 2, obtain the second conversion parameter, which is used to convert the first conversion parameter into a power of 2.

[0066] Step S210: Obtain the third conversion parameter based on the power of 2 corresponding to the product of the second conversion parameter and the first conversion parameter.

[0067] Step S211: Obtain the target stored integer corresponding to the target original integer based on the first conversion parameter, the second conversion parameter, and the third conversion parameter.

[0068] In the embodiments of this application, when the first conversion parameter corresponding to the storage array is not a power of 2, the second conversion parameter in the storage array can be obtained. The product of the second conversion parameter and the first conversion parameter is a power of 2, and the converted power of 2 is used as the third conversion parameter. Thus, based on the first conversion parameter, the second conversion parameter, and the third conversion parameter, the stored integer corresponding to the original integer is obtained.

[0069] Based on the first conversion parameter, the second conversion parameter, and the third conversion parameter, the original integer is obtained, and the corresponding stored integer satisfies the following formula:

[0070] x-((x*m)>>r)*mod (2)

[0071] Here, >> represents the sign for shifting binary data to the right, and >>r represents shifting binary data to the right by r bits.

[0072] From formula (2), we can deduce that the original integer minus the integer and the first conversion parameter yields the corresponding stored integer. Furthermore, in the formula, (x*m) >> r represents the integer obtained by shifting a number to the right by r positions. It should be noted that the first, second, and third conversion parameters are related to the storage array; different storage arrays correspond to different keys, and therefore different first, second, and third conversion parameters.

[0073] For example, continuing with the original integer 65012, the first conversion parameter is 5, the second conversion parameter is 225179981368525, and the third conversion parameter is 2. 50 Among them, 5*225179981368525≈2 50 The integer value corresponding to 65012 is 65012-((65012*225179981368525)>>50)*5=2.

[0074] By converting the original integers into binary data using multiplication, bitwise AND, and bitwise shift operations, the energy consumption of data conversion can be reduced, thus optimizing the conversion process. For example, a typical modulo operation requires 60 CPU cycles, integer multiplication requires 8 CPU cycles, bitwise shifting requires 1 CPU cycle, and bitwise AND operation requires 6 CPU cycles. Even when multiplication, bitwise shifting, and bitwise AND operations are used simultaneously during the data conversion process, the number of instruction cycles required is still significantly less than that of a modulo operation, demonstrating the optimization of computational power by the target conversion rule.

[0075] Step S212: Determine the data stored at the location of the target stored integer from the storage array, and use it as the target data corresponding to the keyword to be searched. The stored integer corresponding to each position in the storage array is obtained by converting the original integer corresponding to each position according to the target conversion rule. The original integer corresponding to each position is the original integer corresponding to the keyword associated with the data stored at each position.

[0076] For a detailed explanation of step S212, please refer to the detailed explanation of step S130 in the foregoing embodiment, which will not be repeated here.

[0077] The data retrieval method provided in this application optimizes the conversion process of original integers to stored integers based on the characteristics of binary data, since the data in electronic devices is binary data. This improves the conversion efficiency of original integers to stored integers.

[0078] Please see Figure 3 , Figure 3 A flowchart illustrating a data retrieval method according to another embodiment of this application is shown. The following will focus on... Figure 3 The process shown will be described in detail. The data retrieval method may specifically include the following steps:

[0079] Step S310: Obtain multiple keywords and the data corresponding to each keyword.

[0080] Step S320: Obtain the original integer corresponding to each keyword.

[0081] Step S330: According to the target conversion rule, convert the original integer corresponding to each keyword into a stored integer to obtain multiple distinct stored integers, each of which corresponds to an original integer.

[0082] In this embodiment, different keywords correspond to different original integers, and the resulting stored integers obtained from these original integers differ. Before searching for data based on the stored integers corresponding to the original integers, the data currently in use needs to be stored according to the stored integers. The keywords can be specified by the user or can be all the keywords currently involved; no specific limitation is made to the keywords here.

[0083] For details on how to obtain the original integer corresponding to each keyword and how to obtain the stored integer corresponding to the original integer of each keyword according to the target conversion rule, please refer to the specific description in the foregoing embodiments, which will not be repeated here.

[0084] In some implementations, according to the target conversion rule, the original integer corresponding to each keyword is converted into a stored integer, resulting in multiple distinct stored integers. Specifically, this includes: determining a first conversion parameter based on the original integer corresponding to each keyword. The first conversion parameter is used to convert the original integer corresponding to each keyword into a stored integer, and different original integers converted using the first conversion parameter result in different stored integers. Based on the first conversion parameter, the original integer corresponding to each keyword is converted into a stored integer, resulting in multiple distinct stored integers.

[0085] Since the keywords change according to user needs, and the first conversion parameter is determined by the original integer corresponding to the chosen keyword, the first conversion parameter is determined based on the original integer corresponding to the keyword after the keyword is determined. This allows the stored integer corresponding to the original integer to be directly obtained when searching for data using the keyword.

[0086] For example, taking the target transformation rule as a modulo rule, to ensure that the stored integers corresponding to the original integers of multiple keywords are different, the modulus in the target transformation rule can be determined as a conflict-free modulus. To further save computational power, the modulus is determined as the minimum conflict-free modulus.

[0087] In the specific implementation process, based on the first conversion parameter, the original integer corresponding to each keyword is converted into a stored integer, resulting in multiple distinct stored integers. This includes: if the first conversion parameter is a power of 2, then the original integer corresponding to each keyword is converted into a stored integer based on the first conversion parameter, resulting in multiple distinct stored integers. If the first conversion parameter is not a power of 2, then the largest original integer among the original integers corresponding to the multiple keywords is obtained. Based on the largest original integer and the first conversion parameter, a second conversion parameter is determined to convert the first conversion parameter into a power of 2. Based on the second conversion parameter, the first conversion parameter is converted into a power of 2, resulting in a third conversion parameter. Based on the first conversion parameter, the second conversion parameter, and the third conversion parameter, the original integer corresponding to each keyword is converted into a stored integer, resulting in multiple distinct stored integers.

[0088] When the first conversion parameter is a power of 2, the specific steps for converting the original integer to the stored integer are described in the foregoing embodiments and will not be repeated here.

[0089] In this embodiment, since the binary representation of an integer in an electronic device is 32 bits, exceeding 32 bits will result in numerical overflow, leading to inaccurate data calculations. To ensure data accuracy, the largest original integer among the multiple keywords should be less than 2. 64 Furthermore, since the second conversion parameter will convert the first conversion parameter into a power of 2, the exponent of the power of 2 obtained by converting the first conversion parameter with the second conversion parameter is less than 64.

[0090] The first conversion parameter is transformed into a power of 2 using the second conversion parameter. This transformation can be achieved through multiplication, division, addition, or a combination of algorithms. In this embodiment, multiplication is used, in which case the product of the second and first conversion parameters is less than 2. 64 After determining the second and third transformation parameters, they need to be verified to ensure their accuracy.

[0091] The formula for obtaining the third transformation parameter is as follows:

[0092] m*mod=2 r (3)

[0093] x max *m<2 64 (4)

[0094] Where m is the second transformation parameter, mod is the first transformation parameter, and 2 r The third transformation parameter is r. The second and third transformation parameters are both positive integers, and the third transformation parameter r < 64.

[0095] It is important to note that when the first conversion parameter is not a power of 2, the third conversion parameter cannot divide either the first or second conversion parameter. Therefore, in determining the second conversion parameter based on multiple original integers, the second conversion parameter needs to be rounded down. Since the result of x*m (a positive decimal) is (2... r In the case of multiples of ), if the second conversion parameter is rounded down, it will result in ((x*m) / / (2) r The result is too small, resulting in error. This solution is not feasible. Therefore, the second conversion parameter is rounded up. This rounding process will introduce some error. To avoid the impact of this error, the following condition should be met:

[0096]

[0097] In formula (5) x 误差 ∈(0,1), x is the primitive integer corresponding to each key.

[0098] From formula (5), we can see that x 误差 To ensure that the original integer corresponding to each keyword is as small as possible, we need to ensure that the original integer is less than 1.

[0099] According to formulas (3), (4), and (5), the second and third transformation parameters can be determined together.

[0100] For example, taking the target transformation rule as the modulo rule, the modulo rule satisfies:

[0101] x%mod=x-((x*m)>>r)*mod (6)

[0102] The integer modulo operation is used to round the second transformation parameter. According to formulas (3), (4), (5), and (6), we obtain:

[0103] x%mod=x-(x / / mod)*mod=x-(x / / ((2^r) / m))*mod=x-((x*m) / / (2^r))*mod=x-((x*m)>>r)*mod

[0104] If the first conversion parameter is 5, and the original integer parameter is 65012, then 65012 corresponds to 2 stored integers, the original integer is 66, 66 corresponds to 1 stored integer, the original integer is 15, 15 corresponds to 0 stored integers, and the original integer is 128, 128 corresponds to 3 stored integers. Multiple sets of second and third conversion parameters can be determined. To save computational resources, the set with the smallest third conversion parameter is selected. That is, the second conversion parameter is 225179981368525, and the third conversion parameter is 50.

[0105] The verification is performed based on the original integer and the corresponding second and third conversion parameters of the stored integer. As follows:

[0106] 65012-((65012*225179981368525)>>50)*5=2=65012%5

[0107] 66 - ((66*225179981368525)>>50)*5=1=66%5

[0108] 15 - ((15*225179981368525)>>50)*5=0=15%5

[0109] 128 - ((128*225179981368525)>>50)*5=3=128%5

[0110] Verification has shown that the second and third conversion parameters are reasonably determined.

[0111] When the first conversion parameter is not a power of 2, the second and third conversion parameters are determined based on the original integer corresponding to the keyword and the first conversion parameter. Then, the original integer corresponding to each keyword is converted to a storage integer based on the first, second, and third conversion parameters. For the specific steps of converting the original integer corresponding to each keyword to a storage integer based on the first, second, and third conversion parameters, please refer to the specific steps in the foregoing embodiments, which will not be repeated here.

[0112] Step S340: Based on the number of the plurality of stored integers, establish a storage array including multiple positions, wherein each of the multiple positions corresponds one-to-one with the plurality of stored integers.

[0113] Step S350: Based on the correspondence between the original integer and the stored integer corresponding to each keyword, store the data corresponding to each keyword in the corresponding position in the storage array.

[0114] In this embodiment, to ensure that the data corresponding to each keyword is stored in the corresponding position in the storage array, the number of positions in the storage array needs to be determined based on the number of stored integers. Then, based on the correspondence between the stored integers and their positions, and the correspondence between the original integer corresponding to each keyword and the stored integer, the data corresponding to the keyword is stored so that the corresponding data can be retrieved using the stored integer obtained by converting the original integer of the keyword.

[0115] Step S360: Obtain the target raw integer corresponding to the keyword to be searched.

[0116] Step S370: According to the target conversion rule, the target original integer is converted into a target stored integer. Different original integers will result in different stored integers after conversion by the target conversion rule, and the stored integers after conversion by the target conversion rule will be smaller than the original integers.

[0117] Step S380: Determine the data stored at the location of the target stored integer from the storage array, and use it as the target data corresponding to the keyword to be searched. The stored integer corresponding to each position in the storage array is obtained by converting the original integer corresponding to each position according to the target conversion rule. The original integer corresponding to each position is the original integer corresponding to the keyword associated with the data stored at each position.

[0118] For a detailed description of steps S360 to S380, please refer to steps S110 to S130 of the aforementioned embodiment, which will not be repeated here.

[0119] The data retrieval method provided in this application converts the original integers corresponding to multiple keywords into multiple stored integers that are smaller and different from the original integers through target conversion rules. A storage array is then established based on the values ​​of the stored integers, containing a number of positions corresponding to those positions. Based on the correspondence between positions and stored integers, as well as the correspondence between the original integers of the keywords and the stored integers, the data corresponding to the keywords is stored at the corresponding positions of the stored integers. This facilitates data retrieval after converting the original integers of the keywords into stored integers. The storage array, established using the values ​​of the stored integers, compresses the storage space of the array and avoids space waste caused by large differences in the original integer values ​​of the keywords.

[0120] Please see Figure 4This document illustrates a structural block diagram of a data search device 200 provided in an embodiment of this application. The data search device 200 is applied to an electronic device and includes: a raw integer acquisition module 210, used to acquire a target raw integer corresponding to a keyword to be searched; a stored integer conversion module 220, used to convert the target raw integer into a target stored integer according to a target conversion rule, wherein different raw integers result in different stored integers after conversion by the target conversion rule, and the stored integer obtained after conversion by the target conversion rule is smaller than the raw integer; and a target data acquisition module 230, used to determine the data stored at the location of the target stored integer from a storage array, as the target data corresponding to the keyword to be searched, wherein the stored integer corresponding to each position in the storage array is obtained by converting the raw integer corresponding to each position according to the target conversion rule, and the raw integer corresponding to each position is the raw integer corresponding to the keyword associated with the data stored at each position.

[0121] In some embodiments of this application, the storage integer conversion module 220 includes: a first conversion parameter acquisition unit, used to acquire a first conversion parameter, the first conversion parameter being used to convert the original integers corresponding to different positions in the storage array into storage integers, and the storage integers obtained by converting the original integers corresponding to different positions in the storage array through the first conversion parameter are different; a first data acquisition unit, used to acquire binary data corresponding to the target original integer if the first conversion parameter is a power of 2, as first data; a second data acquisition unit, used to acquire data located from the 1st position to the (M-1)th position from right to left in the first data, as second data, wherein M is the number of bits of the binary data corresponding to the first conversion parameter; and a first target storage integer acquisition unit, used to convert the second data into decimal data to obtain the target storage integer.

[0122] In some embodiments of this application, the storage integer conversion module 220 further includes: a second conversion parameter acquisition unit, configured to acquire a second conversion parameter if the first conversion parameter is not a power of 2, wherein the second conversion parameter is used to convert the first conversion parameter into a power of 2; a third conversion parameter acquisition unit, configured to acquire a third conversion parameter based on a power of 2 corresponding to the product of the second conversion parameter and the first conversion parameter; and a second target storage integer acquisition unit, configured to obtain a target storage integer corresponding to the target original integer based on the first conversion parameter, the second conversion parameter, and the third conversion parameter.

[0123] In some embodiments of this application, the raw integer acquisition module 210 includes: a target raw integer acquisition unit for integer type data, configured to determine the target raw integer corresponding to the search keyword as the search keyword if the data type corresponding to the search keyword is an integer type; an integer value acquisition unit for non-integer type data, configured to acquire the integer value corresponding to the search keyword according to a data table if the data type corresponding to the search keyword is a non-integer type, wherein the data table includes multiple non-integer type data and the integer value corresponding to each non-integer type data; and a hash processing unit, configured to perform hash processing on the integer value according to the conversion radix of the hash algorithm to obtain the hash value corresponding to the search keyword, which is used as the target raw integer corresponding to the search keyword.

[0124] In some embodiments of this application, the data retrieval device 200 includes a storage array establishment module, comprising: a data acquisition unit, configured to acquire multiple keywords and data corresponding to each keyword; an original integer acquisition unit, configured to convert the original integer corresponding to each keyword into a storage integer according to the target conversion rule, resulting in multiple distinct storage integers, each of the multiple storage integers corresponding to one original integer; an empty storage array establishment unit, configured to establish a storage array including multiple positions according to the number of the multiple storage integers, the multiple positions corresponding one-to-one with the multiple storage integers; and a data storage unit in the storage array, configured to store the data corresponding to each keyword in the corresponding position in the storage array according to the correspondence between the original integer corresponding to each keyword and the storage integer.

[0125] In some embodiments of this application, the storage integer acquisition unit includes: a first conversion parameter determination subunit, configured to determine a first conversion parameter based on the original integer corresponding to each keyword, wherein the first conversion parameter is used to convert the original integer corresponding to each keyword into a storage integer, and different original integers are converted into different storage integers by the first conversion parameter; and a storage integer conversion subunit, configured to convert the original integer corresponding to each keyword into a storage integer based on the first conversion parameter, thereby obtaining multiple different storage integers.

[0126] In some embodiments of this application, the storage integer conversion subunit includes: a first conversion microunit, configured to convert the original integer corresponding to each keyword into a storage integer according to the first conversion parameter if the first conversion parameter is a power of 2, thereby obtaining multiple distinct storage integers; a maximum original integer acquisition microunit, configured to acquire the maximum original integer among the multiple original integers corresponding to the keywords if the first conversion parameter is not a power of 2; a second conversion parameter determination microunit, configured to determine a second conversion parameter to convert the first conversion parameter into a power of 2 according to the maximum original integer and the first conversion parameter; a converted first conversion parameter acquisition microunit, configured to convert the first conversion parameter into a power of 2 according to the second conversion parameter, thereby obtaining a third conversion parameter; and a second conversion microunit, configured to convert the original integer corresponding to each keyword into a storage integer according to the first conversion parameter, the second conversion parameter, and the third conversion parameter, thereby obtaining multiple distinct storage integers.

[0127] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working process of the above-described device and module can be referred to the corresponding process in the foregoing method embodiments, and will not be repeated here.

[0128] In the several embodiments provided in this application, the coupling between modules can be electrical, mechanical, or other forms of coupling.

[0129] Furthermore, the functional modules in the various embodiments of this application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0130] Please refer to Figure 5 The diagram illustrates a structural block diagram of an electronic device provided in an embodiment of this application. The electronic device 100 in this application may include one or more of the following components: a processor 110, a memory 120, and one or more application programs, wherein the one or more application programs may be stored in the memory 120 and configured to be executed by one or more processors 110, and the one or more programs are configured to perform the methods described in the foregoing method embodiments.

[0131] Processor 110 may include one or more processing cores. Processor 110 connects to various parts within the electronic device 100 using various interfaces and lines, and performs various functions and processes data of the electronic device 100 by running or executing instructions, programs, code sets, or instruction sets stored in memory 120, and by calling data stored in memory 120. Optionally, processor 110 may be implemented using at least one hardware form of Digital Signal Processing (DSP), Field-Programmable Gate Array (FPGA), or Programmable Logic Array (PLA). Processor 110 may integrate one or a combination of several of the following: Central Processing Unit (CPU), Graphics Processing Unit (GPU), and modem. The CPU primarily handles the operating system, user interface, and applications; the GPU is responsible for rendering and drawing the displayed content; and the modem handles wireless communication. It is understood that the modem may also not be integrated into processor 110 and may be implemented separately using a communication chip.

[0132] The memory 120 may include random access memory (RAM) or read-only memory (ROM). The memory 120 can be used to store instructions, programs, code, code sets, or instruction sets. The memory 120 may include a program storage area and a data storage area. The program storage area may store instructions for implementing an operating system, instructions for implementing at least one function (such as touch functionality, sound playback functionality, image playback functionality, etc.), and instructions for implementing the various method embodiments described below. The data storage area may also store data created by the electronic device 100 during use (such as phonebook data, audio and video data, chat log data, etc.).

[0133] This application also provides a computer-readable storage medium storing program code, which can be called by a processor to execute the methods described in the above method embodiments.

[0134] Computer-readable storage media can be electronic storage devices such as flash memory, EEPROM (Electrically Erasable Programmable Read-Only Memory), EPROM, hard disk, or ROM. Optionally, computer-readable storage media includes non-transitory computer-readable storage medium. The computer-readable storage medium has storage space for program code that performs any of the method steps described above. This program code can be read from or written to one or more computer program products. The program code can be compressed, for example, in a suitable form.

[0135] In summary, the solution provided in this application first converts the search keyword into an integer to obtain the target original integer corresponding to the search keyword, then converts the target original integer into a target stored integer smaller than the target original integer, and finally determines the target data corresponding to the search keyword in the storage array based on the target stored integer. Since the stored integer corresponding to each position in the storage array is the data smaller than the original integer corresponding to each position after being converted by the target conversion rule, and the original integer corresponding to each position is the original integer corresponding to the keyword associated with the data stored at each position, this data storage method of storage array compresses the storage space of the storage array, avoiding the space waste caused by the traditional storage array storage method. Moreover, when searching for the target data of the search keyword, it is only necessary to convert the original integer corresponding to the search keyword into the corresponding stored integer, which improves the efficiency of data search.

[0136] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit them. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of this application.

Claims

1. A data retrieval method, characterized in that, The method includes: Obtain the target raw integer corresponding to the keyword to be searched, wherein the target raw integer is the integer corresponding to the entire keyword to be searched; According to the target conversion rule, the target original integer is converted into a target stored integer. Different original integers are converted into different stored integers after the target conversion rule, and the stored integers after the target conversion rule are smaller than the original integers. This is to ensure that there are no blank storage positions between the storage locations allocated for data storage in the storage array. The number of positions in the storage array is determined according to the number of stored integers, and the positions included in the storage array correspond one-to-one with the stored integers. The data stored at the storage location corresponding to the target stored integer in the storage array is determined as the target data corresponding to the keyword to be searched. The stored integer corresponding to each position in the storage array is obtained by converting the original integer corresponding to each position according to the target conversion rule. The original integer corresponding to each position is the original integer corresponding to the keyword associated with the data stored at each position.

2. The method as described in claim 1, characterized in that, The step of converting the target original integer to the target stored integer according to the target conversion rule includes: Obtain a first conversion parameter, which is used to convert the original integers corresponding to different positions in the storage array into stored integers, and the stored integers obtained by converting the original integers corresponding to different positions in the storage array through the first conversion parameter are different; If the first conversion parameter is a power of 2, obtain the binary data corresponding to the original target integer as the first data; The data from the first position to the (M-1)th position from right to left in the first data is obtained as the second data, where M is the number of bits of the binary data corresponding to the first conversion parameter; The second data is converted into decimal data to obtain the target stored integer.

3. The method as described in claim 2, characterized in that, The step of converting the target original integer to the target stored integer according to the target conversion rule includes: If the first conversion parameter is not a power of 2, obtain the second conversion parameter, which is used to convert the first conversion parameter into a power of 2. The third conversion parameter is obtained by power of 2 corresponding to the product of the second conversion parameter and the first conversion parameter; Based on the first conversion parameter, the second conversion parameter, and the third conversion parameter, the target stored integer corresponding to the target original integer is obtained.

4. The method as described in claim 1, characterized in that, The step of obtaining the target raw integer corresponding to the keyword to be searched includes: If the data type corresponding to the keyword to be searched is an integer, then the target raw integer corresponding to the keyword to be searched is determined as the keyword to be searched. If the data type corresponding to the keyword to be searched is a non-integer type, the integer value corresponding to the keyword to be searched is obtained according to the data table, which includes multiple non-integer type data and the integer value corresponding to each non-integer type data. The integer value is hashed according to the transformation radix of the hash algorithm to obtain the hash value corresponding to the keyword to be searched, which is used as the target original integer corresponding to the keyword to be searched.

5. The method according to any one of claims 1-4, characterized in that, The establishment of the storage array includes: Retrieve multiple keywords and the data corresponding to each keyword; Obtain the original integer corresponding to each keyword; According to the target conversion rule, the original integer corresponding to each keyword is converted into a stored integer, resulting in multiple distinct stored integers, each of which corresponds to an original integer. Based on the number of the plurality of stored integers, a storage array including multiple positions is established, wherein each of the multiple positions corresponds one-to-one with the plurality of stored integers; Based on the correspondence between the original integer and the stored integer corresponding to each keyword, the data corresponding to each keyword is stored in the corresponding position in the storage array.

6. The method as described in claim 5, characterized in that, The step of converting the original integer corresponding to each keyword into a stored integer according to the target conversion rule, resulting in multiple distinct stored integers, includes: Based on the original integer corresponding to each keyword, a first conversion parameter is determined. The first conversion parameter is used to convert the original integer corresponding to each keyword into a stored integer, and different original integers are converted into different stored integers by the first conversion parameter. Based on the first conversion parameter, the original integer corresponding to each keyword is converted into a stored integer, resulting in multiple distinct stored integers.

7. The method as described in claim 6, characterized in that, The step of converting the original integer corresponding to each keyword into a stored integer according to the first conversion parameter to obtain multiple distinct stored integers includes: If the first conversion parameter is a power of 2, then the original integer corresponding to each keyword is converted into a stored integer according to the first conversion parameter, resulting in multiple different stored integers; If the first conversion parameter is not a power of 2, then obtain the largest original integer among the original integers corresponding to the plurality of keywords; Based on the maximum original integer and the first conversion parameter, determine a second conversion parameter that converts the first conversion parameter into a power of 2; Based on the second conversion parameter, the first conversion parameter is converted into a power of 2 to obtain the third conversion parameter; Based on the first conversion parameter, the second conversion parameter, and the third conversion parameter, the original integer corresponding to each keyword is converted into a stored integer, resulting in multiple distinct stored integers.

8. A data retrieval device, characterized in that, include: The raw integer acquisition module is used to acquire the target raw integer corresponding to the keyword to be searched, wherein the target raw integer is the integer corresponding to the entire keyword to be searched; The storage integer conversion module is used to convert the target original integer into a target stored integer according to the target conversion rule. Different original integers are converted into different stored integers after the target conversion rule, and the stored integers after the target conversion rule are smaller than the original integers. This ensures that there are no blank storage positions between the storage locations allocated for data storage in the storage array. The number of positions in the storage array is determined according to the number of stored integers, and the positions included in the storage array correspond one-to-one with the stored integers. The target data acquisition module is used to determine the data stored at the storage location corresponding to the target stored integer from the storage array, as the target data corresponding to the keyword to be searched. The stored integer corresponding to each position in the storage array is obtained by converting the original integer corresponding to each position according to the target conversion rule. The original integer corresponding to each position is the original integer corresponding to the keyword associated with the data stored at each position.

9. An electronic device, characterized in that, include: One or more processors; Memory; One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, the one or more applications being configured to perform the method as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium contains program code that can be invoked by a processor to execute the method as described in any one of claims 1-7.

Citation Information

Patent Citations

  • Preheat data processing method and device and computer readable storage medium

    CN113918541A