CN117407405A - Data updating method and device and electronic equipment - Google Patents

Data updating method and device and electronic equipment Download PDF

Info

Publication number
CN117407405A
CN117407405A CN202311358552.5A CN202311358552A CN117407405A CN 117407405 A CN117407405 A CN 117407405A CN 202311358552 A CN202311358552 A CN 202311358552A CN 117407405 A CN117407405 A CN 117407405A
Authority
CN
China
Prior art keywords
coding
target
data
values
initial
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.)
Pending
Application number
CN202311358552.5A
Other languages
Chinese (zh)
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.)
Ping An Bank Co Ltd
Original Assignee
Ping An Bank 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 Ping An Bank Co Ltd filed Critical Ping An Bank Co Ltd
Priority to CN202311358552.5A priority Critical patent/CN117407405A/en
Publication of CN117407405A publication Critical patent/CN117407405A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/10Text processing
    • G06F40/12Use of codes for handling textual entities
    • G06F40/126Character encoding
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207Discounts or incentives, e.g. coupons or rebates

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Strategic Management (AREA)
  • Finance (AREA)
  • Development Economics (AREA)
  • Accounting & Taxation (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Artificial Intelligence (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a data updating method, a device and electronic equipment, wherein the method comprises the following steps: the method comprises the steps of obtaining data to be updated, dividing the data into N sections, respectively carrying out initial coding on the data of each section to generate a first coding set, carrying out secondary coding on all first initial coding values to obtain a first target coding set, obtaining original data stored in a database, dividing the original data into N sections, respectively carrying out initial coding on the original data of each section to generate a second coding set, and carrying out secondary coding on the second coding set to obtain a second target coding set; and comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and updating data according to the comparison result. The embodiment of the invention adopts a double-division coding mode, greatly improves the comparison accuracy, and improves the comparison efficiency by adopting a sliding window comparison mode while improving the comparison accuracy under the condition of less error update.

Description

Data updating method and device and electronic equipment
Technical Field
The present invention relates to the technical field of financial science and technology, and in particular, to a data updating method, device and electronic equipment.
Background
The bank's equity system often complements the customer system, and for different customer groups, the bank or provider needs to design poorly-personalized equity products to meet different types of customer needs.
The equity products are typically defined autonomously by the bank or provider and provided for the customer to choose from. Wherein the bank needs to define the benefit products inside the bank from the benefit products provided by the vendor. The equity products can be commodities or services, and banks or suppliers can construct own equity systems in a mode of providing transaction full reduction, discount coupons, point exchange and the like, so that the viscosity of clients and the brand value are improved.
In the equity system of equity products of the bank at present, each equity has a corresponding guest group, namely an equity client list, business associates can add and delete users in the list at any time, issuing and displaying equity depends on the list, whether the users are in the list or not can be checked before issuing equity or displaying each time, and users not in the list are not displayed and issued. Because the data volume of the rights list is larger, when the rights list is updated, the method of total update is adopted, a great amount of time and CPU resources are consumed in the updating process, and the list updating efficiency is low.
Accordingly, the prior art is still in need of improvement and development.
Disclosure of Invention
In view of the shortcomings of the prior art, the invention provides a data updating method, a device and electronic equipment, and aims to solve the problems that in the prior art, the data volume of a rights list is large, a full-volume updating method is adopted when the rights list is updated, a great amount of time and CPU resources are consumed in the updating process, and the list updating efficiency is low.
The technical scheme of the invention is as follows:
the first embodiment of the invention provides a data updating method, which comprises the following steps:
the method comprises the steps of obtaining data to be updated, dividing the data to be updated into N sections, respectively carrying out initial coding on the data of each section, generating a first coding set composed of first initial coding values, carrying out secondary coding on all first initial coding values in the first coding set, and obtaining a first target coding set composed of first target coding values, wherein the data to be updated is rights client list data to be updated, and N is a positive integer greater than 1;
the method comprises the steps of obtaining original data stored in a database, dividing the original data into N sections, respectively carrying out initial coding on the original data of each section, generating a second coding set composed of second initial coding values, carrying out secondary coding on all second initial coding values in the second coding set to obtain a second target coding set composed of second target coding values, wherein the original data is non-updated rights and interests client list data;
and comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and updating data according to the comparison result.
Further, the obtaining the original data stored in the database, dividing the original data into N segments, respectively performing initial encoding on the original data of each segment, generating a second encoding set composed of second initial encoding values, performing secondary encoding on all the second initial encoding values in the second encoding set, and obtaining a second target encoding set composed of second target encoding values, where before the original data is the non-updated rights and interests client list data, the method includes:
the raw data is stored in advance in a mongo db database.
Further, the step of respectively performing initial encoding on the data of each segment to generate a first encoding set composed of first initial encoding values includes:
converting the data of each segment into a first character string;
and carrying out ASCII coding on the characters in the first character string to generate a first coding set consisting of first initial coding values.
Further, the performing secondary encoding on all the first initial encoding values in the first encoding set to obtain a first target encoding set composed of first target encoding values, including:
and carrying out MD5 coding on all the first initial coding values in the first coding set to obtain a first target coding set consisting of first target coding values.
Further, the data of each segment is respectively subjected to initial coding to generate a second coding set composed of second initial coding values, which comprises the following steps:
converting the original data of each segment into a second character string;
and carrying out ASCII coding on the characters in the second character string to generate a second coding set consisting of second initial coding values.
Further, performing secondary encoding on all second initial encoding values in the second encoding set to obtain a second target encoding set composed of second target encoding values, including:
and carrying out MD5 coding on all second initial coding values in the second coding set to obtain a second target coding set composed of second target coding values.
Further, the comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and updating the data according to the comparison result, includes:
comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and judging whether the first target coding value appears in the second target coding set;
if the corresponding first target coding value is not found in the second target coding set, updating the original data according to the first target coding value which is not found;
if all the first target coding values are found in the second target coding set, the data is judged not to be changed.
Another embodiment of the present invention provides a data updating apparatus, including:
the first coding module is used for acquiring data to be updated, dividing the data to be updated into N sections, respectively carrying out initial coding on the data of each section, generating a first coding set composed of first initial coding values, carrying out secondary coding on all the first initial coding values in the first coding set to obtain a first target coding set composed of first target coding values, wherein the data to be updated is rights client list data to be updated, and N is a positive integer greater than 1;
the second coding module is used for acquiring the original data stored in the database, dividing the original data into N sections, respectively carrying out initial coding on the original data of each section, generating a second coding set composed of second initial coding values, carrying out secondary coding on all the second initial coding values in the second coding set to obtain a second target coding set composed of second target coding values, wherein the original data is the non-updated rights and interests client list data;
and the data updating module is used for comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and updating the data according to the comparison result.
Another embodiment of the invention provides an electronic device including at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the data update method described above.
Another embodiment of the present invention also provides a non-volatile computer-readable storage medium storing computer-executable instructions that, when executed by one or more processors, cause the one or more processors to perform the data updating method described above.
The beneficial effects are that: the data updating method of the embodiment of the invention adopts a double-division coding mode, greatly improves the comparison accuracy, rarely generates error updating, improves the comparison accuracy, and simultaneously improves the comparison efficiency by adopting a sliding window comparison mode.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is a flow chart of a data updating method according to a preferred embodiment of the present invention;
FIG. 2 is a diagram illustrating a coding scheme of a preferred embodiment of a data updating method according to the present invention;
FIG. 3 is a schematic diagram of a functional module of a data updating apparatus according to a preferred embodiment of the present invention;
fig. 4 is a schematic hardware structure of an electronic device according to a preferred embodiment of the invention.
Detailed Description
The present invention will be described in further detail below in order to make the objects, technical solutions and effects of the present invention more clear and distinct. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
Each equity in the current equity system has a corresponding guest group, namely a list, and business associates can add and delete users in the list at any time, the issuing and displaying of equity depend on the list, whether the user is in the list or not can be checked before issuing equity or displaying each time, and users not in the list are not displayed and issued. The guest group data is currently maintained in MongoDB, and each time the guest group data is updated, the guest group data is compared with the data in MongoDB. The specific comparison method is to uniformly convert interface data and MongoDB data into Json character strings and then into char arrays (existing methods in Java). Then traversing to compare whether the char arrays are identical one by one. This approach, while viable, still requires consideration of performance satisfaction for a group list with billions of data. From the method traversal, it can be seen that this is a relatively time-consuming and CPU resource-consuming operation. The invention improves the accuracy of comparison and the comparison efficiency by a double coding mode.
Embodiments of the present invention are described below with reference to the accompanying drawings.
In view of the foregoing, an embodiment of the present invention provides a data updating method, please refer to fig. 1, and fig. 1 is a flowchart of a preferred embodiment of a data updating method of the present invention. As shown in fig. 1, it includes:
step S100, acquiring data to be updated, dividing the data to be updated into N sections, respectively carrying out initial coding on the data of each section to generate a first coding set composed of first initial coding values, and carrying out secondary coding on all the first initial coding values in the first coding set to obtain a first target coding set composed of first target coding values, wherein the data to be updated is rights customer list data to be updated, and N is a positive integer greater than 1;
step 200, obtaining original data stored in a database, dividing the original data into N sections, respectively carrying out initial coding on the original data of each section, generating a second coding set composed of second initial coding values, carrying out secondary coding on all second initial coding values in the second coding set, and obtaining a second target coding set composed of second target coding values, wherein the original data is non-updated rights customer list data;
and step S300, comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and updating data according to the comparison result.
In specific implementation, the data updating method of the embodiment of the invention is applied to updating the guest group list of the bank. .
In the embodiment of the invention, the original comparison of data from one piece to one piece is changed into batch comparison. For example, the number of data pulled by the interface is 100. Then we split it into 10 segments, 10 per segment, aligned 10 times. And (3) carrying out initial coding on each segment to obtain a low-resolution coded value, marking the low-resolution coded value as a first coded value, and combining all the first coded values into a first coded value set. Then, secondary coding is carried out to obtain a high-resolution coded value, the high-resolution coded value is recorded as a first target coded value, and the first target coded value is combined into a first target coded value set;
the method comprises the steps of obtaining pre-stored original data from a database, dividing the data, and carrying out initial coding on each piece of original data to obtain a low-resolution coded value, marking the low-resolution coded value as a second coded value, and combining all the second coded values into a second coded value set. And then carrying out secondary coding to obtain a high-resolution coded value, and marking the high-resolution coded value as a second target coded value, wherein the second target coded value is combined into a second target coded value set.
And comparing the first target coding value set with the second target coding value set, and judging whether to update the data according to the comparison result.
The embodiment of the invention greatly improves the comparison accuracy and rarely generates error update. The comparison efficiency is improved in a sliding window comparison mode without dropping the efficiency while the comparison accuracy is improved.
In one embodiment, obtaining original data stored in a database, dividing the original data into N segments, respectively performing initial encoding on the original data of each segment to generate a second encoded set composed of second initial encoded values, performing secondary encoding on all second initial encoded values in the second encoded set to obtain a second target encoded set composed of second target encoded values, where before the original data is the non-updated rights and interests client list data, the method includes:
the raw data is stored in advance in a mongo db database.
In specific implementation, list data of rights and interests clients are stored in a MongoDB database in advance. MongoDB is a database based on distributed file storage. Written in the c++ language. It is intended to provide a scalable high performance data storage solution for WEB applications.
MongoDB is a product that is interposed between a relational database and a non-relational database, most functional among which is most like a relational database. The data structure it supports is very loose, is in json-like bson format, and can therefore store more complex data types. The biggest characteristic of Mongo is that the query language supported by Mongo is very powerful, the grammar is somewhat similar to the object-oriented query language, almost most functions similar to the query of a relational database list can be realized, and the indexing of data is also supported.
In one embodiment, the data of each segment is initially encoded respectively to generate a first encoded set of first initial encoded values, including:
converting the data of each segment into a first character string;
and carrying out ASCII coding on the characters in the first character string to generate a first coding set consisting of first initial coding values.
In implementation, for example, let x be the data pulled by the interface, we divide it into 4 ends, assuming that each segment is s in length. And (3) coding each section in the coding mode of the original scheme to obtain a low-resolution coded value, marking the low-resolution coded value as a first coded value, and forming a first coding set by all the first coded values.
As shown in fig. 2, a specific example of ASCII encoding a character in the first character string is as follows, taking the character string "cut 123" as an example. x is initialized to 1 and y is initialized to 0.
The target characters are all converted into asc codes, then x adds the codes in turn, and y is the sum of the values of each step of x.
The value of x is 326 and the value of y is 1756. The resulting x, y values are then converted to hexadecimal. X is converted to 0X146 and y is converted to 0X06dc.
Linking the x and y values yields 0x06dc016. This value is the first encoded value.
In one embodiment, performing secondary encoding on all first initial encoding values in the first encoding set to obtain a first target encoding set composed of first target encoding values, including:
and carrying out MD5 coding on all the first initial coding values in the first coding set to obtain a first target coding set consisting of first target coding values. The MD5Message-Digest Algorithm (English: MD5Message-Digest Algorithm), a widely used cryptographic hash function, can generate a 128-bit (16-byte) hash value (hash value) to ensure that the Message transmissions are completely consistent.
In specific implementation, md5 is used to encode all first initial encoding values in the first encoding set to obtain a high-resolution encoding value, the high-resolution encoding value is recorded as a first target encoding value, and all the first target encoding values form the first target encoding set.
In one embodiment, the data of each segment is initially encoded respectively to generate a second encoded set of second initial encoded values, including:
converting the original data of each segment into a second character string;
and carrying out ASCII coding on the characters in the second character string to generate a second coding set consisting of second initial coding values.
In specific implementation, Y is data originally stored in MongoDB, and after 4 sets of code values are obtained according to the above example, comparison is performed in Y. In particular we use sliding windows, each of length s. Each segment is encoded in y as the data to be updated.
Converting the original data of each segment into a second character string; and carrying out ASCII coding on the characters in the second character string to generate a second coding set consisting of second initial coding values.
In one embodiment, performing secondary encoding on all second initial encoding values in the second encoding set to obtain a second target encoding set composed of second target encoding values, including:
and carrying out MD5 coding on all second initial coding values in the second coding set to obtain a second target coding set composed of second target coding values.
In specific implementation, MD5 encoding is performed on all the second initial encoded values in the second encoded set, so as to obtain a second target encoded set composed of second target encoded values.
In one embodiment, comparing a first target code value in a first target code set with a second target code value in a second target code set, and updating data according to the comparison result, includes:
comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and judging whether the first target coding value appears in the second target coding set;
if the corresponding first target coding value is not found in the second target coding set, updating the original data according to the first target coding value which is not found;
if all the first target coding values are found in the second target coding set, the data is judged not to be changed.
In the specific implementation, the coding of x and the coding of y are compared, if a certain group of coding values find the same coding value in the sliding comparison process of y, the section of data is not changed, if not, the section of data is changed, and the section of data is updated.
Compared with the prior art, the data updating method of the embodiment of the invention obtains the data to be updated, divides the data into N sections, respectively carries out initial coding on the data of each section, generates a first coding set, carries out secondary coding on all first initial coding values to obtain a first target coding set, obtains the original data stored in a database, divides the original data into N sections, respectively carries out initial coding on the original data of each section, generates a second coding set, and carries out secondary coding on the second coding set to obtain a second target coding set; and comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and updating data according to the comparison result. The embodiment of the invention adopts a double-division coding mode, greatly improves the comparison accuracy, and improves the comparison efficiency by adopting a sliding window comparison mode while improving the comparison accuracy under the condition of less error update.
It should be noted that, there is not necessarily a certain sequence between the steps, and those skilled in the art will understand that, in different embodiments, the steps may be performed in different orders, that is, may be performed in parallel, may be performed interchangeably, or the like.
Another embodiment of the present invention provides a data updating apparatus, as shown in fig. 3, the apparatus 1 includes:
the first encoding module 11 is configured to obtain data to be updated, divide the data to be updated into N segments, perform initial encoding on the data of each segment, generate a first encoding set composed of first initial encoding values, perform secondary encoding on all the first initial encoding values in the first encoding set, and obtain a first target encoding set composed of first target encoding values, where the data to be updated is rights client list data to be updated, and N is a positive integer greater than 1;
the second encoding module 12 is configured to obtain original data stored in a database, divide the original data into N segments, perform initial encoding on each segment of original data, generate a second encoded set composed of second initial encoded values, perform secondary encoding on all second initial encoded values in the second encoded set, and obtain a second target encoded set composed of second target encoded values, where the original data is non-updated rights and interests client list data;
the data updating module 13 is configured to compare the first target code value in the first target code set with the second target code value in the second target code set, and update data according to the comparison result.
The specific implementation is shown in the method embodiment, and will not be described herein.
In one embodiment, the apparatus further comprises a storage module for:
the raw data is stored in advance in a mongo db database.
The specific implementation is shown in the method embodiment, and will not be described herein.
In one embodiment, the first encoding module 11 is specifically configured to:
converting the data of each segment into a first character string;
and carrying out ASCII coding on the characters in the first character string to generate a first coding set consisting of first initial coding values.
The specific implementation is shown in the method embodiment, and will not be described herein.
In one embodiment, the first encoding module 11 is further configured to:
and carrying out MD5 coding on all the first initial coding values in the first coding set to obtain a first target coding set consisting of first target coding values.
The specific implementation is shown in the method embodiment, and will not be described herein.
In one embodiment, the second encoding module 12 is specifically configured to:
converting the original data of each segment into a second character string;
and carrying out ASCII coding on the characters in the second character string to generate a second coding set consisting of second initial coding values.
The specific implementation is shown in the method embodiment, and will not be described herein.
In one embodiment, the second encoding module 12 is further configured to:
and carrying out MD5 coding on all second initial coding values in the second coding set to obtain a second target coding set composed of second target coding values.
The specific implementation is shown in the method embodiment, and will not be described herein.
In one embodiment, the data update module 13 is specifically configured to:
comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and judging whether the first target coding value appears in the second target coding set;
if the corresponding first target coding value is not found in the second target coding set, updating the original data according to the first target coding value which is not found;
if all the first target coding values are found in the second target coding set, the data is judged not to be changed.
The specific implementation is shown in the method embodiment, and will not be described herein.
Another embodiment of the present invention provides an electronic device, as shown in fig. 4, the electronic device 10 includes:
one or more processors 110 and a memory 120, one processor 110 being illustrated in fig. 4, the processors 110 and the memory 120 being coupled via a bus or other means, the bus coupling being illustrated in fig. 4.
The processor 110 is configured to implement various control logic of the electronic device 10, which may be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), a single-chip microcomputer, ARM (Acorn RISC Machine) or other programmable logic device, discrete gate or transistor logic, discrete hardware controls, or any combination of these components. Also, the processor 110 may be any conventional processor, microprocessor, or state machine. The processor 110 may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
The memory 120 is used as a non-volatile computer readable storage medium for storing non-volatile software programs, non-volatile computer executable programs, and modules, such as program instructions corresponding to the data updating method in the embodiment of the present invention. The processor 110 performs various functional applications of the device 10 and data processing, i.e. implements the data updating method in the above-described method embodiments, by running non-volatile software programs, instructions and units stored in the memory 120.
The memory 120 may include a storage program area that may store an operating device, an application program required for at least one function, and a storage data area; the storage data area may store data created from the use of the device 10, etc. In addition, memory 120 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some embodiments, memory 120 may optionally include memory located remotely from processor 110, which may be connected to device 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
One or more units are stored in the memory 120 that, when executed by the one or more processors 110, perform the data update method in any of the method embodiments described above, e.g., perform method steps S100 through S300 in fig. 1 described above.
Embodiments of the present invention provide a non-transitory computer-readable storage medium storing computer-executable instructions for execution by one or more processors, e.g., to perform the method steps S100-S300 of fig. 1 described above.
By way of example, nonvolatile storage media can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically erasable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM), which acts as external cache memory. By way of illustration and not limitation, RAM may be available in many forms such as Synchronous RAM (SRAM), dynamic RAM, (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchl ink DRAM (SLDRAM), and Direct Rambus RAM (DRRAM). The disclosed memory controls or memories of the operating environment described herein are intended to comprise one or more of these and/or any other suitable types of memory.
Another embodiment of the present invention provides a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a processor, cause the processor to perform the data update method of the above-described method embodiment. For example, the above-described method steps S100 to S300 in fig. 1 are performed.
The embodiments described above are merely illustrative, wherein elements illustrated as separate elements may or may not be physically separate, and elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
From the above description of embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus a general purpose hardware platform, or may be implemented by hardware. Based on such understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the related art in the form of a software product, which may exist in a computer-readable storage medium such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method of the respective embodiments or some parts of the embodiments.
Conditional language such as "capable," "energy," "possible," or "may," among others, is generally intended to convey that a particular embodiment can include (but other embodiments do not include) particular features, elements, and/or operations unless specifically stated otherwise or otherwise understood within the context as used. Thus, such conditional language is also generally intended to imply that features, elements and/or operations are in any way required for one or more embodiments or that one or more embodiments must include logic for deciding, with or without input or prompting, whether these features, elements and/or operations are included or are to be performed in any particular embodiment.
What has been described herein in the specification and drawings includes examples of methods and apparatus capable of providing data updates. It is, of course, not possible to describe every conceivable combination of components and/or methodologies for purposes of describing the various features of the present disclosure, but it may be appreciated that many further combinations and permutations of the disclosed features are possible. It is therefore evident that various modifications may be made thereto without departing from the scope or spirit of the disclosure. Further, or in the alternative, other embodiments of the disclosure may be apparent from consideration of the specification and drawings, and practice of the disclosure as presented herein. It is intended that the examples set forth in this specification and figures be considered illustrative in all respects as illustrative and not limiting. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation.

Claims (10)

1. A method of data updating, the method comprising:
the method comprises the steps of obtaining data to be updated, dividing the data to be updated into N sections, respectively carrying out initial coding on the data of each section, generating a first coding set composed of first initial coding values, carrying out secondary coding on all first initial coding values in the first coding set, and obtaining a first target coding set composed of first target coding values, wherein the data to be updated is rights client list data to be updated, and N is a positive integer greater than 1;
the method comprises the steps of obtaining original data stored in a database, dividing the original data into N sections, respectively carrying out initial coding on the original data of each section, generating a second coding set composed of second initial coding values, carrying out secondary coding on all second initial coding values in the second coding set to obtain a second target coding set composed of second target coding values, wherein the original data is non-updated rights and interests client list data;
and comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and updating data according to the comparison result.
2. The method of claim 1, wherein the obtaining the original data stored in the database, dividing the original data into N segments, performing initial encoding on the original data of each segment, generating a second encoded set composed of second initial encoded values, performing secondary encoding on all second initial encoded values in the second encoded set, and obtaining a second target encoded set composed of second target encoded values, where before the original data is the non-updated rights client list data, the method includes:
the raw data is stored in advance in a mongo db database.
3. The method of claim 2, wherein the initially encoding the data of each segment separately generates a first encoded set of first initial encoded values, comprising:
converting the data of each segment into a first character string;
and carrying out ASCII coding on the characters in the first character string to generate a first coding set consisting of first initial coding values.
4. The method of claim 3, wherein the performing the secondary encoding on all the first initial encoded values in the first encoded set to obtain a first target encoded set of first target encoded values comprises:
and carrying out MD5 coding on all the first initial coding values in the first coding set to obtain a first target coding set consisting of first target coding values.
5. The method of claim 4, wherein the initially encoding the data of each segment separately generates a second encoded set of second initial encoded values, comprising:
converting the original data of each segment into a second character string;
and carrying out ASCII coding on the characters in the second character string to generate a second coding set consisting of second initial coding values.
6. The method of claim 5, wherein the secondarily encoding all the second initial encoded values in the second encoded set to obtain a second target encoded set of second target encoded values comprises:
and carrying out MD5 coding on all second initial coding values in the second coding set to obtain a second target coding set composed of second target coding values.
7. The method of claim 6, wherein comparing the first target code value in the first target code set with the second target code value in the second target code set, and updating the data according to the comparison result, comprises:
comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and judging whether the first target coding value appears in the second target coding set;
if the corresponding first target coding value is not found in the second target coding set, updating the original data according to the first target coding value which is not found;
if all the first target coding values are found in the second target coding set, the data is judged not to be changed.
8. A data updating apparatus, the apparatus comprising:
the first coding module is used for acquiring data to be updated, dividing the data to be updated into N sections, respectively carrying out initial coding on the data of each section, generating a first coding set composed of first initial coding values, carrying out secondary coding on all the first initial coding values in the first coding set to obtain a first target coding set composed of first target coding values, wherein the data to be updated is rights client list data to be updated, and N is a positive integer greater than 1;
the second coding module is used for acquiring the original data stored in the database, dividing the original data into N sections, respectively carrying out initial coding on the original data of each section, generating a second coding set composed of second initial coding values, carrying out secondary coding on all the second initial coding values in the second coding set to obtain a second target coding set composed of second target coding values, wherein the original data is the non-updated rights and interests client list data;
and the data updating module is used for comparing the first target coding value in the first target coding set with the second target coding value in the second target coding set, and updating the data according to the comparison result.
9. An electronic device, comprising at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the data updating method of any one of claims 1-7.
10. A non-transitory computer-readable storage medium storing computer-executable instructions which, when executed by one or more processors, cause the one or more processors to perform the data updating method of any of claims 1-7.
CN202311358552.5A 2023-10-19 2023-10-19 Data updating method and device and electronic equipment Pending CN117407405A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311358552.5A CN117407405A (en) 2023-10-19 2023-10-19 Data updating method and device and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311358552.5A CN117407405A (en) 2023-10-19 2023-10-19 Data updating method and device and electronic equipment

Publications (1)

Publication Number Publication Date
CN117407405A true CN117407405A (en) 2024-01-16

Family

ID=89492042

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311358552.5A Pending CN117407405A (en) 2023-10-19 2023-10-19 Data updating method and device and electronic equipment

Country Status (1)

Country Link
CN (1) CN117407405A (en)

Similar Documents

Publication Publication Date Title
Zeng et al. Research of Improved FP‐Growth Algorithm in Association Rules Mining
US11042427B2 (en) Automated consolidation of API specifications
US20100312821A1 (en) Web Page Optimization
Cai et al. Complexity Analysis of Primal‐Dual Interior‐Point Methods for Linear Optimization Based on a New Parametric Kernel Function with a Trigonometric Barrier Term
US10284686B2 (en) Server, client, system and method for preloading browsed page in browser
US11514003B2 (en) Data compression based on key-value store
US11070231B2 (en) Reducing storage of blockchain metadata via dictionary-style compression
CN102915363A (en) Website storing method and system
CN106790334A (en) A kind of page data transmission method and system
Cuomo et al. An application of the one-factor HullWhite model in an IoT financial scenario
CN107844488B (en) Data query method and device
CN103399934A (en) Form data transmission and storage method
Bin Ahmad et al. Some fixed and periodic points in abstract metric spaces
US20120324560A1 (en) Token data operations
Liu et al. A hybrid with distributed pooling blockchain protocol for image storage
Li et al. GCWSNet: Generalized consistent weighted sampling for scalable and accurate training of neural networks
CN107979595B (en) Private data protection method and gateway system
CN117407405A (en) Data updating method and device and electronic equipment
CN111143461A (en) Mapping relation processing system and method and electronic equipment
CN111858467A (en) File data processing method, device, equipment and medium based on artificial intelligence
CN114035822A (en) File updating method and equipment
Li et al. Efficient Algorithms for Optimal 4‐Bit Reversible Logic System Synthesis
CN113420869A (en) Translation method based on omnidirectional attention and related equipment thereof
Ramaprasath et al. Cache coherency algorithm to optimize bandwidth in mobile networks
Shi et al. Backward stochastic differential equations with Markov switching driven by Brownian motion and Poisson random measure

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