CN112579003A - Key value pair adjustment method, key value pair adjustment device, storage medium and electronic device - Google Patents

Key value pair adjustment method, key value pair adjustment device, storage medium and electronic device Download PDF

Info

Publication number
CN112579003A
CN112579003A CN202011477420.0A CN202011477420A CN112579003A CN 112579003 A CN112579003 A CN 112579003A CN 202011477420 A CN202011477420 A CN 202011477420A CN 112579003 A CN112579003 A CN 112579003A
Authority
CN
China
Prior art keywords
target
index table
key
storage area
storage
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202011477420.0A
Other languages
Chinese (zh)
Other versions
CN112579003B (en
Inventor
王鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang Dahua Technology Co Ltd
Original Assignee
Zhejiang Dahua Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang Dahua Technology Co Ltd filed Critical Zhejiang Dahua Technology Co Ltd
Priority to CN202011477420.0A priority Critical patent/CN112579003B/en
Publication of CN112579003A publication Critical patent/CN112579003A/en
Application granted granted Critical
Publication of CN112579003B publication Critical patent/CN112579003B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614Improving the reliability of storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0673Single storage device
    • G06F3/0679Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The embodiment of the invention provides a key value pair adjusting method, a key value pair adjusting device, a storage medium and an electronic device, wherein the method comprises the following steps: the method comprises the steps of obtaining a message for adjusting key value pairs stored in a target storage area, wherein index table entries used for indicating the corresponding relation between storage addresses of key names and storage addresses of key values included in the key value pairs are also stored in the target storage area, the index table entries are stored in the target storage area according to a second sequence, the first sequence and the second sequence are opposite, determining the target index table entries corresponding to target adjustment messages, sequentially searching whether target index table entries exist in the stored index table entries according to the first sequence, and storing the target index table entries in the target storage area according to the second sequence under the condition that the target index table entries do not exist.

Description

Key value pair adjustment method, key value pair adjustment device, storage medium and electronic device
Technical Field
The embodiment of the invention relates to the field of communication, in particular to a key value pair adjusting method, a key value pair adjusting device, a storage medium and an electronic device.
Background
In the related art at present, data can be permanently saved using a FLASH memory device. Due to the characteristics of the FLASH device, only the bit is rewritten from 1 to 0, but not from 0 to 1. Therefore, when the FLASH device performs the write operation, the erase operation is always performed first, and then the write operation is performed, which causes a great loss to the FLASH device because frequent erase and write operations are required.
Because the FLASH erasing is erased according to the block, all data of the block where the write address is located are read integrally before the FLASH writing operation is carried out, then the data are modified, the checksum is calculated, then the block is erased, and finally the data are written integrally. If an accident occurs in the process, such as power failure, the data may be lost or damaged, and other data associated with the memory block may be damaged, which causes a technical problem of reducing the reliability of the system.
Aiming at the technical problems of low system reliability and complex scheme for adjusting the data stored in the storage block in the related technology, no effective solution is provided at present.
Disclosure of Invention
Embodiments of the present invention provide a key value pair adjustment method, device, storage medium, and electronic device, so as to at least solve the technical problems of low system reliability and complex scheme for adjusting stored data in a storage block in the related art.
According to an embodiment of the present invention, there is provided a key-value pair adjustment method, including: acquiring a target adjustment message, wherein the target adjustment message is used for adjusting key value pairs stored in a target storage area, the key value pairs are stored in the target storage area according to a first sequence, the target storage area is also stored with an index table entry for indicating a corresponding relation between storage addresses of key names and storage addresses of key values included in the key value pairs, the index table entry is stored in the target storage area according to a second sequence, and the first sequence and the second sequence are opposite; determining a target index table entry corresponding to the target adjustment message, wherein the target index table entry is used for indicating a key name and an address of the key value included in a target key value pair indicated by the target adjustment message and an adjustment type indicated by the target adjustment message; sequentially searching whether the target index table entries exist in the stored index table entries according to the first sequence; and under the condition that the target index table entries do not exist, storing the target index table entries in the target storage area according to the second sequence.
According to another embodiment of the present invention, there is provided a key-value pair adjustment apparatus including: an obtaining module, configured to obtain a target adjustment message, where the target adjustment message is used to adjust key value pairs stored in a target storage area, the key value pairs are stored in the target storage area according to a first sequence, the target storage area further stores an index table entry used to indicate a correspondence between storage addresses of key names and storage addresses of key values included in the key value pairs, the index table entry is stored in the target storage area according to a second sequence, and the first sequence and the second sequence are in an opposite sequence; a determining module, configured to determine a target index table entry corresponding to the target adjustment message, where the target index table entry is used to indicate a key name and an address of the key value included in a target key value pair adjusted by the target adjustment message, and an adjustment type indicated by the target adjustment message; the searching module is used for sequentially searching whether the target index table entries exist in the stored index table entries according to the first sequence; and the storage module is used for storing the target index table entries in the target storage area according to the second sequence under the condition that the target index table entries do not exist.
According to yet another embodiment of the invention, a computer-readable storage medium is also provided, in which a computer program is stored, wherein the computer program, when executed by a processor, performs the steps in any of the above method embodiments.
According to yet another embodiment of the present invention, there is also provided an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps in any of the above method embodiments when executing the computer program.
By the invention, because the message for adjusting the key value pairs stored in the target storage area is obtained, the target storage area also stores the index table entries for indicating the corresponding relation between the storage addresses of the key names and the storage addresses of the key values included in the key value pairs, the index table entries are stored in the target storage area according to the second sequence, the first sequence and the second sequence are opposite sequences, the target index table entries corresponding to the target adjustment message are determined, whether the target index table entries exist in the stored index table entries is sequentially searched according to the first sequence, and the target index table entries are stored in the target storage area according to the second sequence under the condition that the target index table entries do not exist, the technical problems that the system reliability is lower and the scheme for adjusting the data stored in the storage block is more complex in the related technology can be solved, the technical effects of improving the reliability of the system and simplifying the scheme of adjusting the stored data in the storage area are achieved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:
fig. 1 is a block diagram of a hardware configuration of a mobile terminal according to an alternative key-value pair adjustment method according to an embodiment of the present invention;
FIG. 2 is a flow chart illustrating an alternative key-value pair adjustment method according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating an alternative key-value pair adjustment method according to an embodiment of the invention;
FIG. 4 is a schematic diagram of an alternative key-value pair adjustment method according to an embodiment of the invention;
fig. 5 is a block diagram of an alternative key-value pair adjustment apparatus according to an embodiment of the present invention.
Detailed Description
Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings in conjunction with the embodiments.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
The method embodiments provided in the embodiments of the present application may be executed in a mobile terminal, a computer terminal, or a similar computing device. Taking the example of the method running on the mobile terminal, fig. 1 is a hardware structure block diagram of the mobile terminal of the key value pair adjustment method according to the embodiment of the present invention. As shown in fig. 1, the mobile terminal may include one or more (only one shown in fig. 1) processors 102 (the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA), and a memory 104 for storing data, wherein the mobile terminal may further include a transmission device 106 for communication functions and an input-output device 108. It will be understood by those skilled in the art that the structure shown in fig. 1 is only an illustration, and does not limit the structure of the mobile terminal. For example, the mobile terminal may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1.
The memory 104 may be used to store a computer program, for example, a software program and a module of application software, such as a computer program corresponding to the key-value pair adjustment method in the embodiment of the present invention, and the processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, so as to implement the method described above. The memory 104 may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory located remotely from the processor 102, which may be connected to the mobile terminal over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission device 106 is used for receiving or transmitting data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the mobile terminal. In one example, the transmission device 106 includes a Network adapter (NIC), which can be connected to other Network devices through a base station so as to communicate with the internet. In one example, the transmission device 106 may be a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
In this embodiment, a method for adjusting key-value pairs running on a mobile terminal, a computer terminal or a similar computing device is provided, and fig. 2 is a schematic flow chart of an optional method for adjusting key-value pairs according to an embodiment of the present invention, as shown in fig. 2, the flow chart includes the following steps:
s202, acquiring a target adjustment message, wherein the target adjustment message is used for adjusting key value pairs stored in a target storage area, the key value pairs are stored in the target storage area according to a first sequence, index table entries used for indicating the corresponding relation between the storage addresses of the key names and the storage addresses of the key values included in the key value pairs are also stored in the target storage area, the index table entries are stored in the target storage area according to a second sequence, and the first sequence and the second sequence are opposite;
s204, determining a target index table entry corresponding to the target adjustment message, wherein the target index table entry is used for indicating a key name and an address of the key value included in a target key value pair indicated by the target adjustment message and an adjustment type indicated by the target adjustment message;
s206, sequentially searching whether a target index table entry exists in the stored index table entries according to a first sequence;
s208, under the condition that the target index table entries do not exist, storing the target index table entries in the target storage area according to a second sequence.
Optionally, in this embodiment, the target adjustment message may include, but is not limited to, a message for adjusting an association relationship of the corresponding key-value pair, the key-value pair may include, but is not limited to, a key value and a key name composed of a sequence of character strings, and the association relationship of the key-value pair may be represented by, but is not limited to, an environment variable. The target adjustment message may include, but is not limited to, a corresponding relationship between an indication modification key name and a key value, a corresponding relationship between an indication deletion key name and a key value, a corresponding relationship between an indication query key name and a key value, and a corresponding relationship between an indication addition key name and a key value, and the target storage area may include, but is not limited to, one or more memory devices, such as a flash memory, a NAND flash memory, a NOR flash memory, and the like.
Optionally, in this embodiment, the first order or the second order may include, but is not limited to, an order from one end of the target storage area to the other end, for example, in a continuous storage area, the storage area is stored inward by a boundary of the storage area, the first order and the second order are opposite, for example, the target key value pair and the target index table entry are stored at two ends of the target storage area according to the first order and the second order, respectively, and are stored inward respectively.
The above is only an example, in this embodiment, only the target key-value pair and the target index table entry need to be stored inward from two ends of the target storage area, and the embodiment does not make any specific limitation on specific storage of the target key-value pair in the head of the target storage area or specific storage of the target index table entry in the head of the target storage area.
Optionally, in this embodiment, the target index table entry records an association relationship, a precedence relationship, and the like between a key name and a key value, and the target index table entry may be composed of a key name address and a key value address, and may further include, but is not limited to, other data such as the key name address, the key value address, and an index number.
Optionally, in this embodiment, the key-value pairs are stored in the target storage area according to a first order, and the index table entries are stored in the target storage area according to a second order, which may include, but is not limited to, establishing a stack top pointer at the top and at the tail of the target storage area, where one stack top pointer is a string sequence pointer, called sptr, and the other is an index table pointer, called iptr. When the storage area is empty, the sptr and the iptr are the head address and the tail address of the storage area. When the storage area is not empty, 0xFF will not appear because the string sequence is visible letters and \ x 00. And the index table entries do not have the condition that all the single entries are 0xFF, and the positions of sptr and iptr can be determined only by finding continuous 0xFF in the middle of the storage area, wherein the number of the minimum continuous 0xFF is not less than the length of the single entry of the index table.
Through the embodiment, because the message for adjusting the key value pairs stored in the target storage area is obtained, the target storage area also stores the index table entries for indicating the corresponding relation between the storage addresses of the key names and the storage addresses of the key values included in the key value pairs, the index table entries are stored in the target storage area according to the second sequence, the first sequence and the second sequence are opposite sequences, the target index table entries corresponding to the target adjustment message are determined, whether the target index table entries exist in the stored index table entries is sequentially searched according to the first sequence, and the target index table entries are stored in the target storage area according to the second sequence under the condition that the target index table entries do not exist, the technical problems that the system reliability is low and the scheme for adjusting the data stored in the storage block is complex in the related technology can be solved, the technical effects of improving the reliability of the system and simplifying the scheme of adjusting the stored data in the storage area are achieved.
In an optional embodiment, before obtaining the target adjustment message, the method further includes: storing the target key-value pairs into the target storage area from a first storage entry in the first order; and storing the index table entries into the target storage area from a second storage entry according to the second sequence, wherein the first storage entry and the second storage entry are different storage entries.
Optionally, in this embodiment, the first storage entry may include, but is not limited to, a top or a tail of the target storage area, and the second storage entry may include, but is not limited to, a top or a tail different from the first storage entry, for example, when the first storage entry is set as the top of the target storage area, the second storage entry is the tail of the target storage area, and when the first storage entry is set as the tail of the target storage area, the second storage entry is the top of the target storage area.
In an alternative embodiment, storing the target key-value pairs in the target storage area by a first storage entry in the first order comprises: acquiring a first character string, wherein the first character string is used for representing a key name included in the target key-value pair; storing the first character string in the target storage area by a first storage inlet according to the first sequence; acquiring a second character string, wherein the second character string is used for representing a key value included in the target key value pair; and storing the second character string in the target storage area by a second storage inlet according to the first sequence.
Optionally, in this embodiment, the first character string may include, but is not limited to, a character string for representing a key-value-to-key name, for example, a name of a registry entry in a registry.
Optionally, in this embodiment, the second character string may include, but is not limited to, a character string used for representing key values of key values, for example, a value corresponding to a registry entry in a registry.
Optionally, in this embodiment, the first order may include, but is not limited to, an order from the top to the end of the target storage area, and the second order may include, but is not limited to, an order from the end to the top of the target storage area.
The above is merely an example, and the present embodiment is not limited in any way.
In an optional embodiment, storing the index table entries in the target storage area from a second storage entry in the second order comprises: acquiring a first storage address of the first character string stored in the target storage area and a second storage address of the second character string stored in the target storage area; and determining the index table entries based on the first storage address and the second storage address, and storing the index table entries into the target storage area from the second storage entry according to the second sequence.
Optionally, in this embodiment, the first storage address and the second storage address may include, but are not limited to, storage addresses preset in a flash memory device, and may include, but is not limited to, storage addresses recorded after being stored from the top to the tail of the target storage area according to the first order, and the storage addresses of the index table entry may include, but is not limited to, storage addresses preset in the flash memory device, and may include, but is not limited to, storage addresses recorded after being stored from the tail to the top of the target storage area according to the second order.
In an alternative embodiment, storing the target key-value pairs in the target storage area by a first storage entry in the first order comprises: acquiring address information indicated by a first top pointer, wherein the first top pointer is established at the first storage entrance in advance and indicates unoccupied addresses in the target storage area according to the first sequence; storing the target key-value pair in the address indicated by the first top pointer; storing the index table entries into the target storage area from a second storage entry according to the second order comprises: acquiring address information indicated by a second top pointer, wherein the second top pointer is established at the second storage entrance in advance and indicates an unoccupied address in the target storage area according to the second sequence; and storing the index table entry into the address indicated by the second top pointer.
Optionally, in this embodiment, the address indicated by the first top pointer may include, but is not limited to, traversing from a first storage entry to the inside of a storage area, and when an unoccupied address is obtained, indicate that the address is the address of the first top pointer, and the address indicated by the second top pointer may include, but is not limited to, traversing from a second storage entry to the inside of the storage area, and when an unoccupied address is obtained, indicate that the address is the address of the second top pointer.
For example, FIG. 3 is a schematic diagram of an alternative key-value pair adjustment method according to an embodiment of the present invention, as shown in fig. 3, the first top pointer 304 is set in a first memory entry 302, the second top pointer 308 is set in a second memory entry 306, during the storage process, by continuously storing the content to be stored in the address 310 indicated by the first top-of-stack pointer 304, by the second top pointer 308 being stored at its indicated address 312, to effect storage of the target key-value pairs from the first storage entry into the target storage area in the first order, furthermore, the technical problems that the reliability of the system is low and the scheme for adjusting the data stored in the storage block is complex in the related technology are solved, and the technical effects of improving the reliability of the system and simplifying the scheme for adjusting the data stored in the storage block are achieved.
In an alternative embodiment, storing the target key-value pair to the address indicated by the first top pointer comprises: storing the target key-value pair in the address indicated by the first top pointer if it is determined that the difference between the first top pointer and the second top pointer is greater than a first predetermined threshold.
Optionally, in this embodiment, determining that the difference between the first top pointer and the second top pointer is greater than the first predetermined threshold may include, but is not limited to, that the difference between the sequence numbers of the addresses indicated by the first top pointer and the second top pointer is greater than the first predetermined threshold, for example, the first predetermined threshold may be set to the length of a single entry in the target index table entry. It may further include, but is not limited to, determining that there is a continuous 0xFF area in the middle of the target storage area if the difference between the first and second top pointers is greater than a first predetermined threshold to indicate that there is room available for storage in the target storage area, and therefore, that the target key-value pair can be stored in the address indicated by the first top pointer.
In an alternative embodiment, storing the index table entry to the address indicated by the second top of stack pointer comprises: storing the index table entry into an address indicated by the second top pointer if it is determined that the difference between the first top pointer and the second top pointer is greater than a second predetermined threshold.
Optionally, in this embodiment, determining that the difference between the first top pointer and the second top pointer is greater than the second predetermined threshold may include, but is not limited to, that the difference between the sequence numbers of the addresses indicated by the first top pointer and the second top pointer is greater than the second predetermined threshold, for example, the second predetermined threshold may be set to the length of a single entry in the target index table entry. It may further include, but is not limited to, determining that there is a continuous 0xFF area in the middle of the target storage area if the difference between the first and second top pointers is greater than a first predetermined threshold to indicate that there is room available for storage in the target storage area, and therefore, that the target key-value pair can be stored in the address indicated by the second top pointer.
In an optional embodiment, in a case that the adjustment type indicated by the target adjustment message is the newly added target key-value pair, after storing the target index table entries in the target storage area according to the second order, the method further includes: storing the target key values into a target storage area according to a first sequence; determining a target index table entry corresponding to the target adjustment message when the adjustment type indicated by the target adjustment message is the deleted target key-value pair comprises: determining the storage address of the key name included in the target key value pair and an address pair formed by the target storage address as a target index table item; in a case that the adjustment type indicated by the target adjustment message is to modify the target key-value pair, determining the target index table entry corresponding to the target adjustment message includes: and determining an address pair formed by the storage address of the key name included in the target key value pair and the storage address of the key value included in the target key value pair as a target index table entry.
Optionally, in this embodiment, the target key values may be stored in the target storage area in the first order by, but not limited to, the following manners:
acquiring a first target character string, wherein the first target character string is used for representing a key name of a target key-value pair; under the condition that the first target character string is not stored in the target storage area, storing the first target character string into the target storage area according to a first sequence to obtain a third address; acquiring a second target character string, wherein the first target character string is used for representing a key value of a target key value pair; under the condition that the second target character string is not stored in the target storage area, storing the second target character string into the target storage area according to the first sequence to obtain a fourth address; generating a second index table entry based on the third address and the fourth address, wherein the second index table entry is used for representing the corresponding relation between the first target character string and the second target character string; storing the second index table entries in the target storage area according to a second sequence; and updating the index form according to the second index table entry.
Optionally, in this embodiment, an address pair formed by the storage address of the key name included in the target key-value pair and the target storage address may be determined as the target index table entry by, but is not limited to, the following manners:
acquiring a third target character string, wherein the third target character string is used for representing the key name of the target key-value pair; under the condition that a third target character string is stored in the target storage area, updating an address of a fourth target character string corresponding to the third target character string recorded in the index form into a target address, wherein the character string stored in the target address represents that a key value is the maximum number, and the fourth target character string is used for representing the key value of the target key value pair; generating a third index table entry based on the address corresponding to the third target character string and the target address, wherein the third index table entry is used for indicating that no target character string having an association relationship with the third target character string exists in the target storage area; and updating the index table according to the third index table entry.
Optionally, in this embodiment, an address pair formed by the storage address of the key name included in the target key-value pair and the storage address of the key value included in the target key-value pair may be determined as the target index entry by, but is not limited to, the following manners:
acquiring a fifth target character string, wherein the fifth target character string is used for representing the key name of the target key-value pair; under the condition that a fifth target character string is stored in the target storage area, acquiring a sixth target character string, wherein the sixth target character string is used for representing a key value of the target key value pair; under the condition that the sixth target character string is stored in the target storage area, determining a character string corresponding to the fifth target character string in the index form as the sixth target character string; under the condition that the sixth target character string is not stored in the target storage area, storing the sixth target character string into the target storage area according to the first sequence; generating a fourth index table entry based on the address corresponding to the fifth target character string and the address corresponding to the sixth target character string, wherein the fourth index table entry is used for indicating the corresponding relation between the fifth target character string and the sixth target character string; and storing the fourth index table entries in the target storage area according to the second sequence, and updating the index table.
Optionally, in this embodiment, the data stored in the target storage area may be queried by means including, but not limited to, the following: acquiring a seventh target character string, wherein the seventh target character string is used for representing the key name of the target key-value pair; under the condition that the seventh target character string is stored in the target storage area, determining an address corresponding to the seventh target character string; determining a fifth index table entry in the index table according to the first sequence, wherein the first address is an address corresponding to the seventh target character string; and determining an address corresponding to an eighth target character string based on the fifth index table entry, wherein the eighth target character string is used for representing a key value of the target key-value pair.
The invention is further illustrated below with reference to specific examples:
in an alternative embodiment, relational data refers to data having relationships between them. Such as precedence and association. For example, the environment variable is an association relationship of a key-value pair. In this embodiment, the data and the relationship are respectively stored at two ends of the storage area and are respectively increased inwards, so as to solve the technical problems of low system reliability and complex scheme for adjusting the data stored in the storage block in the related art, and achieve the technical effects of improving the system reliability and simplifying the scheme for adjusting the data stored in the storage area.
Taking the environment variable as an example, the environment variable includes, but is not limited to, a key-value pair, and both the key name and the key value are character strings. Therefore, the paired relationship of the character strings can be described by continuously tiling the character strings in the storage area and additionally establishing an index table, wherein each index table entry consists of a key name address and a key value address. On a continuous storage area, one end stores character string sequence and the other end stores index table. The two ends are stored towards the middle in opposite directions.
First, a stack top pointer is established at the top and the tail of the storage area respectively, one is a character string sequence pointer called sptr, and the other is an index table pointer called iptr. When the storage area is empty, the sptr and the iptr are the head address and the tail address of the storage area. When the storage area is not empty, 0xFF will not appear because the string sequence is visible letters and \ x 00. The index table does not have the condition that all single table entries are 0xFF, and the positions of the sptr and the iptr can be determined only by finding the continuous 0xFF in the middle of the storage area. Wherein the number of the minimum continuous 0xFF is not less than the length of a single table entry of the index table.
Optionally, in this embodiment, the following methods, including but not limited to, may also be used to perform the addition, deletion, and modification:
when key value pairs need to be added, key names of the key values to be added are searched in the character string sequence, if the key names are found, an address N is recorded, if the key names are not found, the key names are pushed at sptr, and the address N is equal to sptr; and searching key value pair key values to be added in the character string sequence, if the key value pair key values are found, recording an address V, if the key value pair key values are not found, pushing the key values at sptr, and pushing the index table entries (N, V) at iptr, wherein the address V is sptr.
When key value pairs need to be deleted, key names of key values to be deleted are searched in a character string sequence, if the key names are found, an address N is recorded, if the key names are not found, the fact that the original environment variables do not have the variables is indicated, deletion fails, and if the key names are found, the table entries (N, M) of the index table are pushed at an iptr, wherein M is the maximum number. For example, for a 4 byte address scheme, M is 0 XFFFFFFFFF. This is an unreachable maximum number.
When the key value pair is required to be inquired, the key name of the key value pair to be inquired is searched in the character string sequence, and if the key name is found, the address N is recorded; if not, the query fails; and searching a table entry with a first key name address equal to N from the stack top to the stack bottom in the index table to obtain a corresponding key value address V, and reading out the key value character string from the address V.
When key value pairs need to be modified, searching key names of the key values to be modified in the character string sequence, and if the key names are found, recording an address N; if not, the modification fails; searching key value pair key value to be modified in the character string sequence, and if the key value pair key value is found, recording an address V; if not found, pushing the key value to be modified at the sptr, and enabling V to be equal to sptr; the index table entry (N, V) is pushed at the iptr.
And the size of the residual storage space of the target storage area is the difference between the two stack top pointers, when the two stack top pointers are respectively equal to the two stack bottom pointers, the target storage area is determined as a blank storage area, and when the residual size of the storage area is 0 or less than the length of the table entries of the index table, the target storage area is determined as a full storage area.
When the target storage area is full, the target storage area can be increased again after being erased, so that the times of erasing the storage area are greatly reduced, and the stability of the system can be improved.
The number of entries of the index table is set as a, the number of key names is set as B, when B/a is smaller than a certain value, the storage can be increased again after being erased, through an adjustment mode different from the prior art for the target storage area, as shown in fig. 4, the character string sequence is increased from a low address to a high address, the index table is increased from the high address to the low address, and only the key values and the key names are modified without modifying the original addresses (entries). Therefore, the probability of erasing is reduced, so that the probability of just powering off during erasing is reduced, and the stability of the system can be improved.
The storage structure using the environment variable can be loaded into a memory for use, such as a linked list, a hash table and other containers for cooperation. Only one status bit needs to be added into the node of each container. A typical status bit is LAMD, for example:
l: the node data is loaded from the memory without modification;
a: the node data is newly added;
m: the node data is modified;
d: the node data is to be deleted.
When the nodes are permanently stored in the target storage area, the storage state of the nodes is determined, the nodes corresponding to A are added, the nodes corresponding to D are deleted, and the steps corresponding to M are modified.
Through the embodiment, when loading, the two stack item pointers in the above are determined, then all the table items are read in from the index table, and the key value closest to the stack top is selected for the key names with the same name in the table items, so that the method is not only suitable for the environment variable, but also suitable for all the homogeneous container structures, and can be unified into the data structure of the homogeneous container, thereby achieving the technical effects of reducing the probability of mutual influence among data in the FLASH equipment, improving the reliability of the embedded software system, further reducing the FLASH erasing frequency, reducing the partition size for storing the environment variable, and improving the speed for storing the environment variable.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
In this embodiment, a key value pair adjusting device is further provided, and the key value pair adjusting device is used to implement the foregoing embodiments and preferred embodiments, which have already been described and are not described again. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
Fig. 5 is a block diagram of an alternative key-value pair adjustment apparatus according to an embodiment of the present invention, as shown in fig. 5, the apparatus includes:
an obtaining module 502, configured to obtain a target adjustment message, where the target adjustment message is used to adjust key value pairs stored in a target storage area, the key value pairs are stored in the target storage area according to a first sequence, the target storage area further stores an index table entry used for indicating a correspondence between a storage address of a key name and a storage address of a key value included in the key value pair, the index table entry is stored in the target storage area according to a second sequence, and the first sequence and the second sequence are in an opposite sequence;
a determining module 504, configured to determine a target index table entry corresponding to the target adjustment message, where the target index table entry is used to indicate a key name and an address of a key value included in a target key value pair adjusted by the target adjustment message, and an adjustment type indicated by the target adjustment message;
a searching module 506, configured to sequentially search whether the target index table entry exists in the stored index table entries according to the first order;
a storage module 508, configured to store the target index table entries in the target storage area according to the second order if it is determined that the target index table entries do not exist.
In an optional embodiment, the apparatus is further configured to: before acquiring a target adjustment message, storing the target key value pairs into the target storage area from a first storage inlet according to the first sequence; and storing the index table entries into the target storage area from a second storage entry according to the second sequence, wherein the first storage entry and the second storage entry are different storage entries.
In an alternative embodiment, the apparatus is further configured to store the target key-value pairs from the first storage entry into the target storage area in the first order by: acquiring a first character string, wherein the first character string is used for representing a key name included in the target key-value pair; storing the first character string in the target storage area by a first storage inlet according to the first sequence; acquiring a second character string, wherein the second character string is used for representing a key value included in the target key value pair; and storing the second character string in the target storage area by a second storage inlet according to the first sequence.
In an alternative embodiment, the apparatus is further configured to store the index table entries in the target storage area from the second storage entry in the second order by: acquiring a first storage address of the first character string stored in the target storage area and a second storage address of the second character string stored in the target storage area; and determining the index table entries based on the first storage address and the second storage address, and storing the index table entries into the target storage area from the second storage entry according to the second sequence.
In an alternative embodiment, the apparatus is further configured to store the target key-value pairs from the first storage entry into the target storage area in the first order by: acquiring address information indicated by a first top pointer, wherein the first top pointer is established at the first storage entrance in advance and indicates unoccupied addresses in the target storage area according to the first sequence; storing the target key-value pair in the address indicated by the first top pointer; storing the index table entries into the target storage area from a second storage entry according to the second order comprises: acquiring address information indicated by a second top pointer, wherein the second top pointer is established at the second storage entrance in advance and indicates an unoccupied address in the target storage area according to the second sequence; and storing the index table entry into the address indicated by the second top pointer.
In an alternative embodiment, the apparatus is further configured to store the target key-value pair at the address indicated by the first top pointer by: storing the target key-value pair in the address indicated by the first top pointer if it is determined that the difference between the first top pointer and the second top pointer is greater than a first predetermined threshold.
In an alternative embodiment, the apparatus is further configured to store the index table entry to the address indicated by the second top of stack pointer by: storing the index table entry into an address indicated by the second top pointer if it is determined that the difference between the first top pointer and the second top pointer is greater than a second predetermined threshold.
In an optional embodiment, the apparatus is further configured to: under the condition that the adjustment type indicated by the target adjustment message is the newly added target key value pair, after the target index table entries are stored in the target storage area according to the second sequence, the target key values are stored in the target storage area according to the first sequence; determining a target index table entry corresponding to the target adjustment message when the adjustment type indicated by the target adjustment message is the deleted target key-value pair comprises: determining an address pair consisting of a storage address of a key name included in the target key value pair and a target storage address as the target index table item; determining a target index table entry corresponding to the target adjustment message if the adjustment type indicated by the target adjustment message is to modify the target key-value pair comprises: and determining an address pair formed by the storage address of the key name included in the target key value pair and the storage address of the key value included in the target key value pair as the target index table entry.
It should be noted that, the above modules may be implemented by software or hardware, and for the latter, the following may be implemented, but not limited to: the modules are all positioned in the same processor; alternatively, the modules are respectively located in different processors in any combination.
Embodiments of the present invention also provide a computer-readable storage medium having a computer program stored thereon, wherein the computer program is arranged to perform the steps of any of the above-mentioned method embodiments when executed.
In the present embodiment, the above-mentioned computer-readable storage medium may be configured to store a computer program for executing the steps of:
s1, acquiring a target adjustment message, wherein the target adjustment message is used for adjusting key value pairs stored in a target storage area, the key value pairs are stored in the target storage area according to a first sequence, the target storage area is also stored with an index table entry for indicating the corresponding relation between the storage address of the key name and the storage address of the key value included in the key value pair, the index table entry is stored in the target storage area according to a second sequence, and the first sequence and the second sequence are opposite;
s2, determining a target index table entry corresponding to the target adjustment message, wherein the target index table entry is used for indicating a key name and an address of the key value included in the target key value pair indicated by the target adjustment message and an adjustment type indicated by the target adjustment message;
s3, whether a target index table entry exists in the stored index table entries is sequentially searched according to the first sequence;
s4, in the event that it is determined that the target index table entries do not exist, storing the target index table entries in the target storage area in the second order.
The computer readable storage medium is further arranged to store a computer program for performing the steps of:
s1, acquiring a target adjustment message, wherein the target adjustment message is used for adjusting key value pairs stored in a target storage area, the key value pairs are stored in the target storage area according to a first sequence, the target storage area is also stored with an index table entry for indicating the corresponding relation between the storage address of the key name and the storage address of the key value included in the key value pair, the index table entry is stored in the target storage area according to a second sequence, and the first sequence and the second sequence are opposite;
s2, determining a target index table entry corresponding to the target adjustment message, wherein the target index table entry is used for indicating a key name and an address of the key value included in the target key value pair indicated by the target adjustment message and an adjustment type indicated by the target adjustment message;
s3, whether a target index table entry exists in the stored index table entries is sequentially searched according to the first sequence;
s4, in the event that it is determined that the target index table entries do not exist, storing the target index table entries in the target storage area in the second order.
In an exemplary embodiment, the computer-readable storage medium may include, but is not limited to: various media capable of storing computer programs, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
Embodiments of the present invention also provide an electronic device comprising a memory having a computer program stored therein and a processor arranged to run the computer program to perform the steps of any of the above method embodiments.
In an exemplary embodiment, the electronic apparatus may further include a transmission device and an input/output device, wherein the transmission device is connected to the processor, and the input/output device is connected to the processor.
In an exemplary embodiment, the processor may be configured to execute the following steps by a computer program:
s1, acquiring a target adjustment message, wherein the target adjustment message is used for adjusting key value pairs stored in a target storage area, the key value pairs are stored in the target storage area according to a first sequence, the target storage area is also stored with an index table entry for indicating the corresponding relation between the storage address of the key name and the storage address of the key value included in the key value pair, the index table entry is stored in the target storage area according to a second sequence, and the first sequence and the second sequence are opposite;
s2, determining a target index table entry corresponding to the target adjustment message, wherein the target index table entry is used for indicating a key name and an address of the key value included in the target key value pair indicated by the target adjustment message and an adjustment type indicated by the target adjustment message;
s3, whether a target index table entry exists in the stored index table entries is sequentially searched according to the first sequence;
s4, in the event that it is determined that the target index table entries do not exist, storing the target index table entries in the target storage area in the second order.
For specific examples in this embodiment, reference may be made to the examples described in the above embodiments and exemplary embodiments, and details of this embodiment are not repeated herein.
It will be apparent to those skilled in the art that the various modules or steps of the invention described above may be implemented using a general purpose computing device, they may be centralized on a single computing device or distributed across a network of computing devices, and they may be implemented using program code executable by the computing devices, such that they may be stored in a memory device and executed by the computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into various integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the principle of the present invention should be included in the protection scope of the present invention.

Claims (11)

1. A method for adjusting key-value pairs, comprising:
acquiring a target adjustment message, wherein the target adjustment message is used for adjusting key value pairs stored in a target storage area, the key value pairs are stored in the target storage area according to a first sequence, the target storage area is also stored with an index table entry for indicating a corresponding relation between storage addresses of key names and storage addresses of key values included in the key value pairs, the index table entry is stored in the target storage area according to a second sequence, and the first sequence and the second sequence are opposite;
determining a target index table entry corresponding to the target adjustment message, wherein the target index table entry is used for indicating a key name and an address of the key value included in a target key value pair indicated by the target adjustment message and an adjustment type indicated by the target adjustment message;
sequentially searching whether the target index table entries exist in the stored index table entries according to the first sequence;
and under the condition that the target index table entries do not exist, storing the target index table entries in the target storage area according to the second sequence.
2. The method of claim 1, wherein prior to obtaining the target adjustment message, the method further comprises:
storing the target key-value pairs into the target storage area from a first storage entry in the first order;
storing the index table entries into the target storage area from a second storage entry according to the second sequence;
wherein the first storage entry and the second storage entry are different storage entries.
3. The method of claim 2, wherein storing the target key-value pairs in the first order by a first storage entry into the target storage area comprises:
acquiring a first character string, wherein the first character string is used for representing a key name included in the target key-value pair;
storing the first character string in the target storage area by a first storage inlet according to the first sequence;
acquiring a second character string, wherein the second character string is used for representing a key value included in the target key value pair;
and storing the second character string in the target storage area by a second storage inlet according to the first sequence.
4. The method of claim 3, wherein storing the index table entries in the second order from a second storage entry into the target storage area comprises:
acquiring a first storage address of the first character string stored in the target storage area and a second storage address of the second character string stored in the target storage area;
and determining the index table entries based on the first storage address and the second storage address, and storing the index table entries into the target storage area from the second storage entry according to the second sequence.
5. The method of claim 2,
storing the target key-value pairs into the target storage area in the first order by a first storage entry comprises: acquiring address information indicated by a first top pointer, wherein the first top pointer is established at the first storage entrance in advance and indicates unoccupied addresses in the target storage area according to the first sequence; storing the target key-value pair in the address indicated by the first top pointer;
storing the index table entries into the target storage area from a second storage entry according to the second order comprises: acquiring address information indicated by a second top pointer, wherein the second top pointer is established at the second storage entrance in advance and indicates an unoccupied address in the target storage area according to the second sequence; and storing the index table entry into the address indicated by the second top pointer.
6. The method of claim 5, wherein storing the target key-value pair to the address indicated by the first top pointer comprises:
storing the target key-value pair in the address indicated by the first top pointer if it is determined that the difference between the first top pointer and the second top pointer is greater than a first predetermined threshold.
7. The method of claim 5, wherein storing the index table entry to the address indicated by the second top of stack pointer comprises:
storing the index table entry into an address indicated by the second top pointer if it is determined that the difference between the first top pointer and the second top pointer is greater than a second predetermined threshold.
8. The method according to any one of claims 1 to 7,
in a case that the adjustment type indicated by the target adjustment message is the newly added target key-value pair, after storing the target index table entries in the target storage area according to the second order, the method further includes: storing the target key values into the target storage area according to the first sequence;
determining a target index table entry corresponding to the target adjustment message when the adjustment type indicated by the target adjustment message is the deleted target key-value pair comprises: determining an address pair consisting of a storage address of a key name included in the target key value pair and a target storage address as the target index table item;
determining a target index table entry corresponding to the target adjustment message if the adjustment type indicated by the target adjustment message is to modify the target key-value pair comprises: and determining an address pair formed by the storage address of the key name included in the target key value pair and the storage address of the key value included in the target key value pair as the target index table entry.
9. An apparatus for adjusting key-value pairs, comprising:
an obtaining module, configured to obtain a target adjustment message, where the target adjustment message is used to adjust key value pairs stored in a target storage area, the key value pairs are stored in the target storage area according to a first sequence, the target storage area further stores an index table entry used to indicate a correspondence between storage addresses of key names and storage addresses of key values included in the key value pairs, the index table entry is stored in the target storage area according to a second sequence, and the first sequence and the second sequence are in an opposite sequence;
a determining module, configured to determine a target index table entry corresponding to the target adjustment message, where the target index table entry is used to indicate a key name and an address of the key value included in a target key value pair adjusted by the target adjustment message, and an adjustment type indicated by the target adjustment message;
the searching module is used for sequentially searching whether the target index table entries exist in the stored index table entries according to the first sequence;
and the storage module is used for storing the target index table entries in the target storage area according to the second sequence under the condition that the target index table entries do not exist.
10. A computer-readable storage medium, in which a computer program is stored, which computer program, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 8.
11. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method as claimed in any of claims 1 to 8 are implemented when the computer program is executed by the processor.
CN202011477420.0A 2020-12-15 2020-12-15 Key value pair adjustment method, key value pair adjustment device, storage medium and electronic device Active CN112579003B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011477420.0A CN112579003B (en) 2020-12-15 2020-12-15 Key value pair adjustment method, key value pair adjustment device, storage medium and electronic device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011477420.0A CN112579003B (en) 2020-12-15 2020-12-15 Key value pair adjustment method, key value pair adjustment device, storage medium and electronic device

Publications (2)

Publication Number Publication Date
CN112579003A true CN112579003A (en) 2021-03-30
CN112579003B CN112579003B (en) 2022-06-14

Family

ID=75135066

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011477420.0A Active CN112579003B (en) 2020-12-15 2020-12-15 Key value pair adjustment method, key value pair adjustment device, storage medium and electronic device

Country Status (1)

Country Link
CN (1) CN112579003B (en)

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH08328924A (en) * 1995-05-31 1996-12-13 Nec Corp Index updating system
CN103838844A (en) * 2014-03-03 2014-06-04 珠海市君天电子科技有限公司 Method and device for storing and transmitting key value pair data
US9223517B1 (en) * 2013-05-03 2015-12-29 Emc Corporation Scalable index store
US20160299688A1 (en) * 2015-04-10 2016-10-13 Samsung Electronics Co., Ltd. Electronic system with storage management mechanism and method of operation thereof
CN106469198A (en) * 2016-08-31 2017-03-01 华为技术有限公司 Key assignments storage method, apparatus and system
CN106708427A (en) * 2016-11-17 2017-05-24 华中科技大学 Storage method suitable for key value pair data
CN109710190A (en) * 2018-12-26 2019-05-03 百度在线网络技术(北京)有限公司 A kind of date storage method, device, equipment and storage medium
CN109739857A (en) * 2018-12-28 2019-05-10 深圳市网心科技有限公司 Data distribution formula wiring method, device, terminal and storage medium under high concurrent
CN110134335A (en) * 2019-05-10 2019-08-16 天津大学深圳研究院 A kind of RDF data management method, device and storage medium based on key-value pair
CN110764705A (en) * 2019-10-22 2020-02-07 北京锐安科技有限公司 Data reading and writing method, device, equipment and storage medium
CN111752955A (en) * 2020-06-29 2020-10-09 深圳前海微众银行股份有限公司 Data processing method, device, equipment and computer readable storage medium

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH08328924A (en) * 1995-05-31 1996-12-13 Nec Corp Index updating system
US9223517B1 (en) * 2013-05-03 2015-12-29 Emc Corporation Scalable index store
CN103838844A (en) * 2014-03-03 2014-06-04 珠海市君天电子科技有限公司 Method and device for storing and transmitting key value pair data
US20160299688A1 (en) * 2015-04-10 2016-10-13 Samsung Electronics Co., Ltd. Electronic system with storage management mechanism and method of operation thereof
CN106469198A (en) * 2016-08-31 2017-03-01 华为技术有限公司 Key assignments storage method, apparatus and system
CN106708427A (en) * 2016-11-17 2017-05-24 华中科技大学 Storage method suitable for key value pair data
CN109710190A (en) * 2018-12-26 2019-05-03 百度在线网络技术(北京)有限公司 A kind of date storage method, device, equipment and storage medium
CN109739857A (en) * 2018-12-28 2019-05-10 深圳市网心科技有限公司 Data distribution formula wiring method, device, terminal and storage medium under high concurrent
CN110134335A (en) * 2019-05-10 2019-08-16 天津大学深圳研究院 A kind of RDF data management method, device and storage medium based on key-value pair
CN110764705A (en) * 2019-10-22 2020-02-07 北京锐安科技有限公司 Data reading and writing method, device, equipment and storage medium
CN111752955A (en) * 2020-06-29 2020-10-09 深圳前海微众银行股份有限公司 Data processing method, device, equipment and computer readable storage medium

Also Published As

Publication number Publication date
CN112579003B (en) 2022-06-14

Similar Documents

Publication Publication Date Title
US9575976B2 (en) Methods and apparatuses to optimize updates in a file system based on birth time
CN112328435B (en) Method, device, equipment and storage medium for backing up and recovering target data
CN111177143B (en) Key value data storage method and device, storage medium and electronic equipment
US11074133B2 (en) Method, electronic device and computer readable medium of file management
CN109976669B (en) Edge storage method, device and storage medium
WO2006052938A2 (en) Implementing application specific management policies on a content addressed storage device
CN110413711A (en) A kind of variance data acquisition methods and its storage medium
CN114490060A (en) Memory allocation method and device, computer equipment and computer readable storage medium
CN113779286B (en) Method and device for managing graph data
CN112306748B (en) Data recovery method, device and storage medium
CN112579003B (en) Key value pair adjustment method, key value pair adjustment device, storage medium and electronic device
CN114443598A (en) Data writing method and device, computer equipment and storage medium
CN106293530B (en) A kind of method for writing data and device
CN108958838A (en) Novel method and device for updating attribute information
CN111752941A (en) Data storage method, data access method, data storage device, data access device, server and storage medium
CN106980685B (en) Data processing method and data processing device
CN110866380A (en) Method and terminal for filling in information field content
CN114356386A (en) Block differential upgrading method, terminal equipment and computer readable storage medium
CN102298592A (en) Method and device for managing list
EP2164005B1 (en) Content addressable storage systems and methods employing searchable blocks
CN110377584A (en) A kind of access method and device of the data structure edition compatibility based on metadata
CN112527896B (en) Processing method and device of blockchain ledger data, storage medium and electronic equipment
US20170255657A1 (en) Single IO Operation Integer-Value Database
CN110795297B (en) Electronic equipment testing method and device
CN113364875B (en) Method, apparatus and computer readable storage medium for accessing data at block link points

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant