阅读说明：本技术 一种支付对账方法及服务器 (payment reconciliation method and server ) 是由 余意 鲜丹 郭亲华 谭国军 于 2019-07-03 设计创作，主要内容包括：本发明涉及数据处理技术领域,公开一种支付对账方法及服务器,该方法通过获取参考订单信息,然后根据参考订单信息,获取文件索引号及索引地址,该文件索引号用于标识订单文件,该订单文件用于记录与参考订单信息对应的基准订单信息,该索引地址用于指向所述基准订单信息在所述订单文件中的位置,再根据文件索引号及索引地址,获取基准订单信息,最后根据参考订单信息及基准订单信息,生成对账结果,从而达到快速对账的目的。该实施例根据基准订单信息,生成订单文件和索引文件,提高基准订单信息与参考订单信息的对账效率。(The invention relates to the technical field of data processing, and discloses a payment reconciliation method and a server. According to the embodiment, the order file and the index file are generated according to the benchmark order information, and the reconciliation efficiency of the benchmark order information and the reference order information is improved.)

1. A payment reconciliation method comprising:

Acquiring reference order information;

Acquiring a file index number and an index address according to the reference order information, wherein the file index number is used for identifying an order file, the order file is used for recording benchmark order information corresponding to the reference order information, and the index address is used for pointing to the position of the benchmark order information in the order file;

Acquiring the reference order information according to the file index number and the index address;

And generating a reconciliation result according to the reference order information and the benchmark order information.

2. The method of claim 1, wherein obtaining a file index number according to the reference order information comprises:

Extracting a reference order number from the reference order information;

and carrying out Hash modular operation on the reference order number to obtain a file index number.

3. the method according to claim 2, wherein the obtaining an index address according to the reference order information comprises:

Acquiring an index file, wherein the index file is used for recording an index address corresponding to the reference order number, and the reference order number is consistent with a reference order number in the reference order information;

And acquiring an index address according to the reference order number in the reference order information.

4. The method according to claim 1, wherein the obtaining the benchmark order information according to the index number and the index address comprises:

determining an order file corresponding to the file index number;

and traversing the reference order information corresponding to the index address from the order file.

5. The method according to any one of claims 1 to 4, further comprising:

And (4) constructing an order file and an index file in advance.

6. The method of claim 5, wherein pre-constructing the order file comprises:

acquiring information of each reference order;

And classifying the reference order information into corresponding order files respectively.

7. The method according to claim 6, wherein the classifying the reference order information into corresponding order files comprises:

Starting multithreading to process each piece of reference order information according to a Hash algorithm to obtain a file index number corresponding to each piece of reference order information;

And classifying each piece of the reference order information into an order file under the index number of the file.

8. The method of claim 7, wherein each thread index corresponds to each thread, and each thread index further corresponds to a file index and an index code, respectively, each file index corresponds to each order file, and each index code corresponds to each index file.

9. the method of claim 8, wherein pre-building the index file comprises:

And classifying the index address of each piece of the reference order information into an index file under the index code according to the index code corresponding to each piece of the reference order information.

10. A server, comprising:

At least one processor; and the number of the first and second groups,

A memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 9.

Technical Field

The invention relates to the technical field of data processing, in particular to a payment reconciliation method and a server.

background

with the development of internet technology, people use mobile payment more and more frequently, and common mobile payment methods include payment treasure, WeChat, Unionpay and the like. After the mobile payment is generated, the reconciliation system can reconcile the order generated by the mobile payment and the transaction order generated in the background. As people use mobile payments more and more, and more transaction orders are generated, the efficiency of the reconciliation system in handling the reconciliation becomes lower.

Disclosure of Invention

an object of an embodiment of the present invention is to provide a payment reconciliation method and a server, which can improve order reconciliation efficiency.

in order to solve the above technical problem, one technical solution adopted by the embodiments of the present invention is: provided is a payment reconciliation method, comprising the following steps:

Acquiring reference order information;

Acquiring a file index number and an index address according to the reference order information, wherein the file index number is used for identifying an order file, the order file is used for recording benchmark order information corresponding to the reference order information, and the index address is used for pointing to the position of the benchmark order information in the order file;

Acquiring the reference order information according to the file index number and the index address;

And generating a reconciliation result according to the reference order information and the benchmark order information.

in some embodiments, the obtaining a file index number according to the reference order information includes:

extracting a reference order number from the reference order information;

and carrying out Hash modular operation on the reference order number to obtain a file index number.

In some embodiments, the obtaining an index address according to the reference order information includes:

Acquiring an index file, wherein the index file is used for recording an index address corresponding to the reference order number, and the reference order number is consistent with a reference order number in the reference order information;

And acquiring an index address according to the reference order number in the reference order information.

in some embodiments, the obtaining the benchmark order information according to the index number and the index address of the file includes:

Determining an order file corresponding to the file index number;

and traversing the reference order information corresponding to the index address from the order file.

In some embodiments, the method further comprises:

And (4) constructing an order file and an index file in advance.

in some embodiments, the pre-built order file comprises:

Acquiring information of each reference order;

And classifying the reference order information into corresponding order files respectively.

In some embodiments, the classifying the reference order information into corresponding order files includes:

Starting multithreading to process each piece of reference order information according to a Hash algorithm to obtain a file index number corresponding to each piece of reference order information;

and classifying each piece of the reference order information into an order file under the index number of the file.

In some embodiments, each of the thread index numbers corresponds to each of the threads one to one, and each of the thread index numbers further corresponds to a file index number and an index code, respectively, each of the file index numbers corresponds to each of the order files one to one, and each of the index codes corresponds to each of the index files one to one.

In some embodiments, the pre-built index file comprises:

and classifying the index address of each piece of the reference order information into an index file under the index code according to the index code corresponding to each piece of the reference order information.

in another aspect of the embodiments of the present invention, a server is provided, including:

at least one processor; and the number of the first and second groups,

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the payment reconciliation method described above. The embodiment of the invention has the beneficial effects that: different from the situation of the prior art, the reconciliation method provided by the embodiment of the invention comprises the following steps: acquiring reference order information, and acquiring a file index number and an index address according to the reference order information, wherein the file index number is used for identifying an order file, the order file is used for recording benchmark order information corresponding to the reference order information, and the index address is used for pointing to the position of the benchmark order information in the order file; acquiring reference order information according to the index number and the index address of the file; and generating a reconciliation result according to the reference order information and the benchmark order information. The reconciliation method can improve the efficiency of payment reconciliation.

drawings

Fig. 1 is a schematic structural diagram of an account reconciliation system provided in an embodiment of the present invention;

Fig. 2 is a schematic flow chart of an account checking method according to an embodiment of the present invention;

FIG. 3 is a schematic flow chart of step 202 of FIG. 2;

FIG. 4 is a schematic flow chart of step 203 in FIG. 2;

Fig. 5 is a schematic flow chart of a reconciliation method according to another embodiment of the present invention;

FIG. 6 is a schematic flow chart of step 301 in FIG. 5;

Fig. 7 is a schematic structural diagram of an account checking device according to an embodiment of the present invention;

fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.

Detailed Description

in order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

it should be noted that, if not conflicted, the various features of the embodiments of the invention may be combined with each other within the scope of protection of the invention. Additionally, while functional block divisions are performed in the device diagrams, with logical sequences shown in the flowcharts, in some cases, the steps shown or described may be performed in a different order than the block divisions in the device diagrams, or the flowcharts.

Referring to fig. 1, fig. 1 is a schematic diagram of an exemplary system structure of an embodiment of a payment reconciliation method or a reconciliation apparatus applied to the present invention. As shown in fig. 1, the system configuration 100 includes a terminal apparatus 101, a server 102, and a network 103. Network 103 is the medium used to provide communication links between terminal device 101 and server 102. Network 103 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

a user may use terminal device 101 to interact with server 102 over network 103 to receive or send messages. Terminal device 101 may be any of a variety of electronic devices having a display screen including, but not limited to, a smart phone, a tablet computer, a smart watch, an e-reader, and the like. The terminal device 101 may further install various mobile payment applications, such as a wechat payment application, a pay bank application, a union pay card application, and the like, and the terminal device 101 further supports various payment methods, such as a face payment method, a code scanning payment method, and the like.

server 102 may be a server that locally stores data in response to terminal device requests. For example, when the terminal device 101 transmits order information, the server searches for background order data of the local system according to the order, performs reconciliation analysis processing on the order information transmitted by the terminal device and the background order data, and records a processing result (for example, a reconciliation amount, a reconciliation result, and the like).

The server 102 may also be a server that remotely obtains data from a third party server in response to a request by the terminal device 101. For example, when a user uses the terminal device 101 to transmit order information, the server 102 remotely obtains system background order data from a third-party server according to the order information, and then performs reconciliation analysis processing on the order information and the background order data transmitted by the terminal device, and records a processing result.

It should be noted that the payment reconciliation method provided by the embodiment of the present invention is generally executed by the server 102, and accordingly, the payment reconciliation apparatus is generally disposed in the server 102.

It should be understood that the number of terminal devices 101, servers 102, and networks 103 in fig. 1 is merely illustrative. There may be any number of terminal devices 101, servers 102, and networks 103, as desired for implementation.

referring to fig. 2, which shows a flow chart of a payment reconciliation method applied according to the system architecture 100, as shown in fig. 2, the method 200 includes:

Step 201: and acquiring reference order information.

In this embodiment, the reference order information refers to order information transmitted from the terminal device to the server, and after the user completes payment, the order information is generated, where the order information includes some information related to the payment, such as an order number, a payment amount, a payment time, and even a payment location, and when a reconciliation operation needs to be performed, the order information is acquired.

Step 202: and acquiring a file index number and an index address according to the reference order information.

In this embodiment, the file index number is used to identify an order file, and the order file may have a plurality of file index numbers, where the file index number refers to an order file id or an order file serial number.

the order file is used for recording benchmark order information corresponding to the reference order information, the benchmark order information is stored in the background server, relevant order information corresponding to the reference order information comprises some information relevant to the payment, such as order numbers, payment amounts, payment time, payment places and the like, and the benchmark order information is stored in a certain order file.

The index address is used for pointing to the position of the benchmark order information in the order file, a plurality of pieces of benchmark order information are stored in the order file, the position of each piece of benchmark order information in the order file is different, the benchmark order information can be stored in the order file in a list form, the sequence arranged in the list can be sorted according to the payment time, the payment amount and the like, and the position of the benchmark order information in the order file can be found according to the index address.

Step 203: and acquiring the reference order information according to the file index number and the index address.

in this embodiment, the file serial number of the order file in which the reference order information is located is found according to the file index number, and then the order file is found, and then the position of the reference order information in the order file is found according to the index address, and then the reference order information is obtained.

Step 204: and generating a reconciliation result according to the reference order information and the benchmark order information.

In this embodiment, the data of the reference order information is compared with the data of the benchmark order information, the compared data includes payment amount, payment state, payment time, and absence of orders (the reference order is a few multi-benchmark orders, or the benchmark order is a few and the reference order is a many), and the like, if the data is consistent, the reconciliation result is marked with the reconciled order, and if the data is inconsistent, the reference order and the benchmark order are put into an abnormal error table for subsequent processing.

In conclusion, by the method, the account checking efficiency and the data processing speed can be improved.

in some embodiments, referring to fig. 3, step 202 includes:

Step 2021: extracting a reference order number from the reference order information.

After each reference order is completed, a unique reference order number corresponding to the reference order number is generated, and the reference order number can be in the form of a series of numerical codes, a series of alphabetic codes, or a mixture of numerical codes and alphabetic codes.

Step 2022: and carrying out Hash modular operation on the reference order number to obtain a file index number.

The hash algorithm is to transform an input of an arbitrary length (also called a pre-mapped pre-image) into an output of a fixed length through a hash algorithm, and the output is a hash value. This transformation is a kind of compression mapping, i.e. the space of hash values is usually much smaller than the space of inputs, different inputs may hash to the same output, so it is not possible to determine a unique input value from a hash value. In short, it is a function of compressing a message of an arbitrary length to a message digest of a certain fixed length. And generating data with the same length for each reference order number according to a Hash algorithm, and generating a file index number, namely an order file id or an order file serial number, according to the data.

With continued reference to fig. 3, step 202 further includes:

step 2023: and acquiring an index file, wherein the index file is used for recording an index address corresponding to the reference order number, and the reference order number is consistent with the reference order number in the reference order information.

In some embodiments, the index file is generated in advance, the reference order number and the index address corresponding to the reference order number are the index information of the reference order, and the index information of each reference order is arranged in the index file list according to a certain order, for example, according to a rule of writing the index information into the index file.

In some embodiments, step 202 further comprises:

Step 2024: and acquiring an index address according to the reference order number in the reference order information.

The index address comprises the reference order number and a start address and an offset length corresponding to the reference order number, so that the index address uniquely corresponding to the order number can be acquired according to the order number.

referring to fig. 4, step 203 includes:

Step 2031: and determining the order file corresponding to the file index number.

in some embodiments, the file index number is a file serial number of the order file in which the reference order information is located, and the corresponding order file is determined according to the serial number.

Step 2032: and traversing the reference order information corresponding to the index address from the order file.

in some embodiments, after determining the corresponding order file, the corresponding base order information is traversed according to the base order number and the start address and offset length corresponding to the base order number.

referring to fig. 5, fig. 5 is a flowchart illustrating a payment reconciliation method according to another embodiment of the present invention. As shown in fig. 5, the method 300 includes:

step 301: and (4) constructing an order file and an index file in advance.

the index file is used for recording a reference order number and an index address related to the reference order information.

Referring to fig. 6, in the present embodiment, step 301 includes:

Step 3011: and acquiring each piece of reference order information.

each piece of reference order information is pre-stored in a database, and when each piece of reference order information is obtained, a plurality of pulling threads can be set in a thread pool mode to pull each piece of reference order information, wherein each thread (English: thread) is the minimum unit capable of performing operation scheduling by an operating system. It is included in the process and is the actual unit of operation in the process. A thread refers to a single sequential control flow in a process, multiple threads can be concurrently executed in a process, and each thread executes different tasks in parallel.

thread pools are a form of multi-threaded processing in which tasks are added to a queue and then automatically started after a thread is created. The thread pool threads are all background threads. Each thread uses a default stack size, runs at a default priority, and is in a multi-threaded unit.

The number of the pulling threads can be set according to the number of the time intervals, the reference order information in the same time interval is pulled by the same pulling thread, meanwhile, the pulling method can adopt a JDBC method to pull simultaneously, the pulling efficiency can be improved, a large amount of data can be processed, and the processing speed is higher. For example:

the reconciliation date is No. 5.11, all pieces of standard order information of No. 5.11 are obtained at present, all the pieces of order information are stored in the database, and the form of all the pieces of standard order information is as follows:

then, each piece of reference order information is firstly divided into 4 intervals according to the time interval: the time interval is not specifically set from 0 point to 6 points (front opening and back closing), from 6 points to 12 points (front opening and back closing), from 12 points to 18 points (front opening and back closing) and from 18 points to the next day 0 point (front opening and back closing), and people can set different time intervals as required.

then, according to the number of the time intervals, setting the same number of pull threads, here, setting 4 pull threads, and adopting a JDBC method to pull concurrently, wherein the specific process is as follows:

the first thread is responsible for pulling a reference order of No. 5.11 0-6 points (front opening and back closing), and the pulling order record is null;

The second thread is responsible for pulling a 5.11 # 6-12 point (front opening and back closing) reference order, 1 pulling order record is recorded, and the number of the reference order is 201901167902;

The third thread is responsible for pulling a reference order with the number of 5.11, 12-18 points (front opening and back closing), 2 records of the pull order are recorded, and the numbers of the reference order are 201901167904 and 201901167905 respectively;

The fourth thread is responsible for pulling a benchmark order with the number of 5.11, 18 points to the number of 5.12, 0 points (front opening and back closing), 1 order record is pulled, and the number of the benchmark order is 201901167903;

then there are 4 reference orders pulled in total.

Step 3012: and classifying the reference order information into corresponding order files respectively.

classifying the various pieces of standard order information after pulling according to a certain principle, and placing the classified same type of standard order information in the same order file, wherein the number of the order files can be the same as the number of the pulling threads. The specific classification process comprises the following steps:

firstly, according to a Hash algorithm, starting multithreading to process each piece of reference order information to obtain a file index number corresponding to each piece of reference order information.

In order to avoid the performance problem of concurrent writing of files, when a multithread drawing reference order is used, receiving threads with the same number are set to receive corresponding reference order information, when each piece of reference order information is obtained, a receiving thread number corresponding to each piece of reference order information is obtained according to a Hash algorithm, each piece of reference order information is stored in a receiving thread under the corresponding receiving thread number, a corresponding file index number, namely a file serial number or a file id number, is obtained according to the receiving thread number, and each piece of reference order information is classified into an order file under the file index number. For example: in the above example, 4 pull threads are set to pull the reference order information, then 4 receive threads are set to receive the reference order information, which are respectively called receive thread 1, receive thread 2, receive thread 3, and receive thread 4, and 4 order files are set to store the reference order information, which are respectively called file [0], file [1], file [2], and file [3], then the file ids, i.e. 0, 1, 2, and 3 are different file index numbers. Performing a hash algorithm on the reference order information with the order number of 201901167904 to obtain a receiving thread number of 0, receiving the reference order information by the receiving thread with the receiving thread number of 0, classifying the reference order information into an order file with the file index number of 0, namely an order file [0], reading the next piece of reference order information again, classifying again, and circulating the operation until all the reference order information is classified into the corresponding order file, wherein the specific result is as follows:

Step 3013: and classifying the index address of each piece of the reference order information into an index file under the index code according to the index code corresponding to each piece of the reference order information.

In this embodiment, each thread index number corresponds to each thread one by one, each thread index number further corresponds to a file index number and an index code, each file index number corresponds to each order file one by one, and each index code corresponds to each index file one by one.

The order files can be generated, the same number of index files can be generated, each piece of reference order information is classified into the corresponding order file, and then the position of the reference order information in the corresponding order file and the order number are classified into the index file under the index code according to the index code. The position of the reference order information in the corresponding order file can be represented by the position offset and the byte length of the piece of order information. For example: in the above example, 4 order files are generated, and 4 index files are generated, namely, an index file index [0], an index file index [1], an index file index [2] and an index file index [3], wherein the index file id numbers, namely, 0, 1, 2 and 3 are four different index codes. Since the benchmark order information with order number 201901167904 is captured and processed by the 0 th thread, the result of the processing is then: the thread index number is 0, the file index number is 0, the index code is 0, if the position offset of the benchmark order information in the order file [0] is 0, the byte length is 52, the index address of the benchmark order information is 201901167904,0,52, the index address is classified into the index file index [0], if a plurality of pieces of benchmark order information exist in the order file, the second piece of benchmark order information in the order file is read continuously, the offset of the second piece of benchmark order information in the order file [0] needs to be started from 52, if the byte length is 50, the index address of the second piece of benchmark order information is the order number, 52,50, the index address is classified into the index file index [0], the sequence of the index address of each piece of benchmark order information in the index file can be ordered according to the reading time of the benchmark order information, the ordering may be according to other principles as well. According to the index address in the index file, the position of the benchmark order information in the corresponding order file can be found, and then the benchmark order information is obtained.

The operation can be completed before the reference order information is transmitted to the server, for example, the operation can be performed in the early morning, so that enough time is available for pulling the reference order information in a time interval, then the order file and the index file are generated, the time interval can be divided into smaller and thinner, the storage pressure of the database is reduced, the pulling efficiency of JDBC is improved, after the reference order information is transmitted to the server, the order file and the index file which are generated in advance are used for reconciliation, the reconciliation time is saved, and the reconciliation efficiency is improved.

Referring to fig. 5, step 302: acquiring reference order information;

The reference order information is stored in a file, and the stored data comprises an order number, transaction time, transaction amount, transaction state and the like. For example: in the above example, the reference order information may be stored in a corresponding file transmitted to the server under number 5.11 in the state:

when reconciliation is carried out each time, a reference order is obtained from a reference order information file, the reference order is loaded into a memory, then subsequent reconciliation processing is carried out, when the reference order file is large, file slicing can be carried out on the reference order file, a corresponding index file is generated, the file slicing can be similarly sliced according to a time interval, then the index file is generated according to the same method, then the index file can be read firstly when reconciliation is carried out, and then the corresponding reference order information is obtained according to the index file, and the operation can increase concurrency capability for the subsequent reconciliation and can also improve reconciliation speed.

step 303: acquiring a file index number and an index address according to the reference order information, wherein the file index number is used for identifying an order file, the order file is used for recording benchmark order information corresponding to the reference order information, and the index address is used for pointing to the position of the benchmark order information in the order file;

When checking account, the hash algorithm is performed on the order number of the reference order information, so as to obtain the file index number, for example, for the reference order information with the order number of 201901167904, the hash algorithm is performed on the order number, so as to obtain the file index number of 0, and then the offset and the byte length of the base order information corresponding to the order number in the order file can be obtained from the index file indx [0] through a hash map.get (order no) command, and for the order number, the offset and the byte length are 0 and 52. Wherein the above operations are all completed in the memory.

Step 304: and acquiring the reference order information according to the file index number and the index address.

And according to the file index number, finding an order file under the corresponding file index number, and then acquiring the reference order information according to the index address. For example: for reference order information with an order number of 201901167904, if the file index number is 0, then the file index number is 0, the index address of the reference order information with the order number of 201901167904, that is, 201901167904,0,52, is found in the index file index [0], and the position of the reference order information with the order number of 201901167904 is found in the file [0] according to the index address, and then the information is obtained.

Step 305: and generating a reconciliation result according to the reference order information and the benchmark order information.

the checked order is marked correspondingly, and some orders with errors are put into an abnormal error table. For example: checking the reference order information and the benchmark order information, wherein the final checking result is as follows:

1)201901167901 order time is inconsistent (across days, settling time issues arise);

2)201901167902 order amount inconsistent (for uneven);

3)201901167903 order status is inconsistent (order status is not synchronized, one state needs to be synchronized);

4)201901167904 order information is consistent (leveled);

5)201901167905 benchmark order more reference orders less (generate overhead accounts);

6)201901167906 benchmark order is less referenced to more (generate overhead accounts).

Except for the 4 th order, other reference order information and benchmark order information are put into an abnormal error table, and the account checking of the next round is carried out.

the embodiment of the invention provides a payment reconciliation method, which comprises the steps of obtaining reference order information, obtaining a file index number and an index address according to the reference order information, wherein the file index number is used for identifying an order file, the order file is used for recording benchmark order information corresponding to the reference order information, the index address is used for pointing to the position of the benchmark order information in the order file, obtaining the benchmark order information according to the file index number and the index address, and finally generating a reconciliation result according to the reference order information and the benchmark order information, thereby achieving the purpose of rapid reconciliation. According to the embodiment, the order file and the index file are generated according to the benchmark order information, and the reconciliation efficiency of the benchmark order information and the reference order information is improved.

Referring to fig. 7, fig. 7 is a schematic structural diagram of a payment reconciliation apparatus according to an embodiment of the present invention, and as shown in the drawing, the payment reconciliation apparatus 400 includes: a first obtaining module 401, a second obtaining module 402, a third obtaining module 403, and a first generating module 404.

the first obtaining module 401 is configured to obtain reference order information; the second obtaining module 402 is configured to obtain a file index number and an index address according to the reference order information, where the file index number is used to identify an order file, the order file is used to record benchmark order information corresponding to the reference order information, and the index address is used to point to a position of the benchmark order information in the order file; a third obtaining module 403, configured to obtain the benchmark order information according to the index number and the index address of the file; the first generating module 404 is configured to generate a reconciliation result according to the reference order information and the benchmark order information.

with continuing reference to fig. 7, the second obtaining module 402 includes: a first extraction unit 4021, a first generation unit 4022, a first acquisition unit 4023, and a second acquisition unit 4024.

The first extraction unit 4021 is configured to extract a reference order number from the reference order information.

the first generating unit 4022 is configured to perform a hash modulo operation on the reference order number to obtain a file index number.

The first obtaining unit 4023 is configured to obtain an index file, where the index file is configured to record an index address corresponding to the reference order number, where the reference order number is consistent with a benchmark order number in the benchmark order information.

The second obtaining unit 4024 is configured to obtain an index address according to the reference order number in the reference order information.

Referring to fig. 7, the third obtaining module 403 includes: a first determination unit 4031 and a first traversal unit 4032.

The first determining unit 4031 is configured to determine an order file corresponding to the file index number.

The first traversal unit 4032 is configured to traverse reference order information corresponding to the index address from the order file.

In some optional implementations of this embodiment, referring also to fig. 7, the apparatus 400 further includes a second generating module 405, which is specifically configured to pre-construct an order file and an index file.

the second generating module 405 includes a third obtaining unit 4051, a first classifying unit 4052, and a second classifying unit 4053.

The third obtaining unit 4051 is configured to obtain each piece of reference order information.

the first classifying unit 4052 is configured to classify each piece of reference order information into a corresponding order file, and specifically, to start multithreading to process each piece of reference order information according to a hash algorithm, so as to obtain a file index number corresponding to each piece of reference order information; and classifying each piece of the reference order information into an order file under the index number of the file.

The second classifying unit 4053 is configured to classify the index address of each piece of the benchmark order information into an index file under the file index number according to an index code corresponding to each piece of the benchmark order information.

it should be noted that, because the contents of information interaction, execution process, and the like between the modules in the apparatus are based on the same concept as the method embodiment of the present invention, specific contents may refer to the description in the method embodiment of the present invention, and are not described herein again.

the embodiment of the invention provides a payment reconciliation method and device, which can achieve the aim of quickly reconciliation by acquiring reference order information, then acquiring a file index number and an index address according to the reference order information, wherein the file index number is used for identifying an order file, the order file is used for recording benchmark order information corresponding to the reference order information, the index address is used for pointing to the position of the benchmark order information in the order file, then acquiring the benchmark order information according to the file index number and the index address, and finally generating a reconciliation result according to the reference order information and the benchmark order information. According to the embodiment, the order file and the index file are generated according to the benchmark order information, and the reconciliation efficiency of the benchmark order information and the reference order information is improved.

Referring to fig. 8, fig. 8 is a schematic diagram of a hardware structure of an electronic device 500 for executing the payment reconciliation method according to the embodiment of the present invention, as shown in fig. 8, the electronic device 500 includes:

One or more processors 501 and a memory 502, with one processor 501 being an example in fig. 8.

the processor 501 and the memory 502 may be connected by a bus or other means, and fig. 8 illustrates a bus connection as an example.

the memory 502, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules, such as program instructions/modules (e.g., the modules shown in fig. 7) corresponding to the advertisement recommendation method in the embodiments of the present invention. The processor 501 executes various functional applications and data processing of the server by running nonvolatile software programs, instructions and modules stored in the memory 502, namely, the payment reconciliation method of the above method embodiment is realized.

the memory 502 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created from use of the payment reconciliation apparatus, and the like. Further, the memory 502 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, the memory 502 may optionally include memory located remotely from the processor 501, which may be connected to the payment reconciliation device 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.

The one or more modules are stored in the memory 502 and when executed by the one or more processors 501, perform the payment reconciliation method in any of the method embodiments described above, e.g., perform the method steps of fig. 2-6 described above, implementing the functionality of the modules and units in fig. 7.

The product can execute the method provided by the embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method. For technical details that are not described in detail in this embodiment, reference may be made to the method provided by the embodiment of the present invention.

the electronic device of embodiments of the present invention exists in a variety of forms, including but not limited to:

(1) The server is similar to a general computer architecture, but has higher requirements on processing capability, stability, reliability, safety, expandability, manageability and the like because of the need of providing highly reliable services.

(2) And other electronic devices with data interaction functions.

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 of fig. 2-6 described above, to implement the functions of the modules and units of fig. 7.

embodiments of the present invention provide a computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program comprising program instructions that, when executed by a computer, cause the computer to perform an advertisement recommendation method in any of the above-described method embodiments, e.g., to perform the method steps of fig. 2 to 6 described above, to implement the functions of the modules and units in fig. 7.

the above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.

Through the above description of the embodiments, those skilled in the art will clearly understand that the embodiments may be implemented by software plus a general hardware platform, and may also be implemented by hardware. It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware related to instructions of a computer program, which can be stored in a computer readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.

Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; within the idea of the invention, also technical features in the above embodiments or in different embodiments may be combined, steps may be implemented in any order, and there are many other variations of the different aspects of the invention as described above, which are not provided in detail for the sake of brevity; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.