Merchant information processing method, server, storage medium and program product

Abstract

The invention provides a merchant information processing method, a server, a storage medium and a program product. The method comprises the steps that a first query request sent by a terminal is received, the first query request comprises a first request code, and the first request code is used for indicating identifiers corresponding to updating requests for multiple pieces of merchant information; determining a plurality of merchant tables corresponding to the first request code in a database; determining multiple pieces of merchant information corresponding to the first request code in multiple merchant tables; and sending the multiple pieces of merchant information to the terminal.

Description

Technical Field

[0001] The present disclosure relates to the technical field of data storage, and more particularly to a merchant information processing method, a server, a storage medium and a program product. Background Art

[0002] With the advancement and development of technology, more and more merchant information is stored in the server. Usually, the server will store the merchant information of the same category in a merchant information table. For example, all franchisee information is stored in the franchisee information table; for another example, all store information is stored in the store information table.

[0003] Since franchisees and stores are related, franchisees and stores may update information synchronously in a certain scenario. For example, a franchisee has a store. In a certain scenario, the franchisee updates the brand name and the store also updates the store name. The server will add the updated brand name to the franchisee information table and the updated store name to the store information table.

[0004] From the above content, we can know that users can learn about changes in franchisee information by querying the franchisee information table through the server, and users can learn about changes in store information by querying the store information table through the server. However, users cannot learn about the correlation between changes in franchisee information and changes in store information through the server.

[0005] Therefore, after the server synchronously updates multiple associated merchant information, only the update status of a certain merchant information can be queried through the server, and the update status of multiple associated merchant information in this synchronous update cannot be queried through the server. Summary of the invention

[0006] The present disclosure provides a merchant information processing method, a server, a storage medium and a program product.

[0007] According to a first aspect of the present disclosure, a merchant information processing method is provided, the method comprising: receiving a first query request sent by a terminal, the first query request comprising a first request code, the first request code being used to indicate an identifier corresponding to an update request for multiple merchant information; determining multiple merchant tables corresponding to the first request code in a database; determining multiple merchant information corresponding to the first request code in multiple merchant tables; and sending multiple merchant information to the terminal.

[0008] According to a merchant information processing method of at least one embodiment of the present disclosure, the multiple merchant tables include a first merchant table and a second merchant table, and the multiple merchant information includes first merchant information and second merchant information.

[0009] According to at least one embodiment of the merchant information processing method of the present disclosure, multiple merchant tables corresponding to the first request code are determined in a database, including: determining a first merchant type and a second merchant type corresponding to the first request code; determining a first merchant table corresponding to the first merchant type in the database; and determining a second merchant table corresponding to the second merchant type in the database.

[0010] According to at least one embodiment of the merchant information processing method of the present disclosure, determining multiple merchant information corresponding to a first request code in multiple merchant tables includes: determining first merchant information corresponding to the first request code in the first merchant table; and determining second merchant information corresponding to the first request code in the second merchant table.

[0011] According to the merchant information processing method of at least one embodiment of the present disclosure, before receiving the first query request sent by the terminal, the method also includes: receiving a first storage request sent by the terminal, the first storage request including the first merchant information and the second merchant information; generating a first request code corresponding to the first storage request; determining a first merchant table corresponding to the first merchant information; determining a second merchant table corresponding to the second merchant information; storing a mapping relationship between the first request code and the first merchant information in the first merchant table; and storing a mapping relationship between the first request code and the second merchant information in the second merchant table.

[0012] According to a merchant information processing method of at least one embodiment of the present disclosure, determining a first merchant table corresponding to first merchant information includes: acquiring a first merchant type corresponding to the first merchant information; and determining a first merchant table corresponding to the first merchant type.

[0013] According to a merchant information processing method of at least one embodiment of the present disclosure, determining a second merchant table corresponding to second merchant information includes: acquiring a second merchant type corresponding to the second merchant information; and determining a second merchant table corresponding to the second merchant type.

[0014] According to the merchant information processing method of at least one embodiment of the present disclosure, after storing the mapping relationship between the first request code and the second merchant information in the second merchant table, the method further includes: receiving a first invalid request sent by a terminal, the first invalid request including a first request code; determining a first merchant table and a second merchant table corresponding to the first request code; determining in the first merchant table that the first merchant information corresponding to the first request code is invalid information; and determining in the second merchant table that the second merchant information corresponding to the first request code is invalid information.

[0015] According to the merchant information processing method of at least one embodiment of the present disclosure, after determining in the second merchant table that the second merchant information corresponding to the first request code is invalid information, the method further includes: determining in the first merchant table a first merchant identifier corresponding to the first request code; determining whether there is a second request code corresponding to the first merchant identifier in the first merchant table, and an execution time corresponding to the second request code is earlier than an execution time corresponding to the first request code; when there is a second request code corresponding to the first merchant identifier in the first merchant table, determining in the first merchant table that the third merchant information corresponding to the second request code is valid information.

[0016] According to the merchant information processing method of at least one embodiment of the present disclosure, after determining in the second merchant table that the second merchant information corresponding to the first request code is invalid information, the method further includes: determining in the second merchant table a second merchant identifier corresponding to the first request code; determining whether there is a second request code corresponding to the second merchant identifier in the second merchant table, and an execution time corresponding to the second request code is earlier than an execution time corresponding to the first request code; when there is a second request code corresponding to the second merchant identifier in the second merchant table, determining in the second merchant table that fourth merchant information corresponding to the second request code is valid information.

[0017] According to a second aspect of the present disclosure, a merchant information processing method is provided, the method comprising: receiving a first query request sent by a terminal, the first query request comprising a first merchant type and a first merchant identifier; determining a first merchant table corresponding to the first merchant type in a database; determining a plurality of request codes corresponding to the first merchant identifier in the first merchant table, wherein a request code in the plurality of request codes is used to indicate an identifier corresponding to an update request for a plurality of merchant information; determining a plurality of scenario types corresponding to the plurality of request codes, the scenario type being a type corresponding to the update request; and sending the plurality of scenario types to the terminal.

[0018] According to a third aspect of the present disclosure, a server is provided, comprising: a memory storing execution instructions; and a processor executing the execution instructions stored in the memory, so that the processor executes the merchant information processing method of any embodiment of the present disclosure.

[0019] According to a fourth aspect of the present disclosure, a readable storage medium is provided, in which execution instructions are stored. When the execution instructions are executed by a processor, they are used to implement the merchant information processing method of any embodiment of the present disclosure.

[0020] According to a fifth aspect of the present disclosure, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the merchant information processing method of any embodiment of the present disclosure is implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] The accompanying drawings illustrate exemplary embodiments of the present disclosure and together with the description serve to explain the principles of the present disclosure. These drawings are included to provide a further understanding of the present disclosure and are incorporated in and constitute a part of this specification.

[0022] Figure 1 An application scenario of a merchant information processing method according to an embodiment of the present disclosure is shown.

[0023] Figure 2 A schematic diagram of the overall process of a merchant information processing method M100 according to an embodiment of the present disclosure is shown.

[0024] Figure 3 A schematic diagram of the overall process of a merchant information processing method M200 according to another embodiment of the present disclosure is shown.

[0025] Figure 4 A schematic diagram showing the overall flow of a merchant information processing method M300 according to yet another embodiment of the present disclosure is shown.

[0026] Figure 5 It is a schematic block diagram of the structure of a merchant information processing device according to an embodiment of the present disclosure.

[0027] Figure 6 It is a schematic block diagram of the structure of a server 3000 according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0028] The present disclosure is further described in detail below in conjunction with the accompanying drawings and examples. It is understood that the specific examples described herein are only used to explain the relevant content, rather than to limit the present disclosure. It should also be noted that, for ease of description, only the parts related to the present disclosure are shown in the accompanying drawings.

[0029] It should be noted that, in the absence of conflict, the embodiments and features of the embodiments in the present disclosure can be combined with each other. The technical solution of the present disclosure will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0030] Currently, the server stores merchant information of the same category in one merchant information table. Since franchisees and stores are related, franchisees and stores may update information synchronously in a certain scenario.

[0031] For example, a franchisee has a store. In a certain scenario, the franchisee updates the brand name and the store also updates the store name. The server will add the updated brand name to the franchisee information table and the updated store name to the store information table.

[0032] The user can learn about changes in franchisee information by querying the franchisee information table through the server, and can learn about changes in store information by querying the store information table through the server. However, the user cannot learn about the correlation between changes in franchisee information and changes in store information through the server.

[0033] Therefore, after the server synchronously updates multiple associated merchant information, only the update status of a certain merchant information can be queried through the server, and the update status of multiple associated merchant information in this synchronous update cannot be queried through the server.

[0034] To this end, the present disclosure proposes a merchant information processing method. When multiple merchant information in an update request is updated, a request code is assigned to the update request, and a mapping relationship between the request code and the multiple merchant information updated this time is established, so that the multiple merchant information updated this time all correspond to the same request code.

[0035] If the user needs to query which merchant information in an update request is updated, the user may send a request code corresponding to the update request to the server, and the server obtains the multiple merchant information updated in the update request according to the request code.

[0036] Figure 1 The application scenario of the merchant information processing method according to one embodiment of the present disclosure is shown. In the application scenario, a server 101 , a database 102 , a network 103 , a mobile phone 104 and a computer 105 are mainly shown. Both the mobile phone 104 and the computer 105 can communicate with the server 101 through the network 103 .

[0037] exist Figure 1 In the example shown, when a user needs to query which merchant information is updated in an update request, the user can obtain the request code E1 corresponding to this update request in the application software of the mobile phone 104, and the mobile phone 104 will generate a query request D1 corresponding to the request code E1. Then, the mobile phone 104 sends the query request D1 to the server 101, and the query request D1 includes the request code E1.

[0038] After the server 101 receives the query request D1 sent by the mobile phone 104, the server 101 extracts the request code E1 in the query request D1. Then, the server 101 searches the database 102 for the franchisee information table and the store information table corresponding to the request code E1.

[0039] Please refer to Table 1 and Table 2. Table 1 is the franchisee information table, and Table 2 is the store information table.

[0040] Table 1 Table 2 After the server 101 searches the franchisee information table and the store information table corresponding to the request code E1 in the database 102, the server 101 determines the franchisee information corresponding to the request code E1 in the franchisee information table, and determines the store information corresponding to the request code E1 in the store information table.

[0041] In the franchisee information table (Table 1), the franchisee information corresponding to the request code E1 includes the franchisee identification A1 and the brand name "T0 Coffee".

[0042] In the store information table (Table 2), the store information corresponding to the request code E1 includes the store identification B1 and the store name "T0 Coffee".

[0043] After the server 101 obtains the franchisee information and store information corresponding to the request code E1, the server 101 sends the franchisee information and store information corresponding to the request code E1 to the mobile phone 104 through the network 103. At this time, the user can see through the mobile phone 104 that in the update request corresponding to the request code E1, the franchisee information and store information are updated. Specifically, the franchisee information includes the franchisee logo A1 and the brand name "T0 Coffee", and the store information includes the store logo B1 and the store name "T0 Coffee".

[0044] Therefore, through Figure 1 As shown in the example, if the user needs to query which merchant information is updated in an update request, the user can send the request code E1 corresponding to the update request to the server 101. The server 101 obtains the franchisee information and store information updated in the update request according to the request code E1.

[0045] exist Figure 1 In the example shown, the user can interact with the server 101 not only through the mobile phone 104, but also through the computer 105. The process of the user interacting with the server 101 through the computer 105 can refer to the process of the mobile phone 104 interacting with the server 101.

[0046] Figure 2 FIG. 1 is a schematic diagram showing the overall process of a merchant information processing method M100 according to an embodiment of the present disclosure. Figure 2 The method shown includes steps S110 to S140. The method can be performed by Figure 1 The server 101 shown is executed.

[0047] Specifically, Figure 2 The methods shown include: S110: Receive a first query request sent by a terminal.

[0048] The terminal may be a mobile phone, a tablet computer, a laptop computer, a desktop computer, etc. The first query request includes a first request code, and the first request code is used to indicate an identifier corresponding to an update request for multiple merchant information.

[0049] S120: Determine in a database a plurality of merchant tables corresponding to the first request code.

[0050] In a specific embodiment, the multiple merchant tables include a first merchant table and a second merchant table, and the multiple merchant information include first merchant information and second merchant information.

[0051] Specifically, the following method can be used to determine multiple merchant tables corresponding to the first request code in the database: determine the first merchant type and the second merchant type corresponding to the first request code; determine the first merchant table corresponding to the first merchant type in the database; determine the second merchant table corresponding to the second merchant type in the database.

[0052] S130: Determine multiple merchant information corresponding to the first request code in multiple merchant tables.

[0053] Specifically, the following method can be used to determine multiple merchant information corresponding to the first request code in multiple merchant tables: determine the first merchant information corresponding to the first request code in the first merchant table; determine the second merchant information corresponding to the first request code in the second merchant table S140: Send multiple merchant information to the terminal.

[0054] exist Figure 2 In the example shown, if the user needs to query which merchant information is updated in an update request, the user can send a request code corresponding to the update request to the server, and the server can obtain multiple merchant information updated in the update request according to the request code.

[0055] Figure 3 FIG. 2 is a schematic diagram showing the overall process of a merchant information processing method M200 according to another embodiment of the present disclosure. Figure 3 The method shown includes steps S210 to S260, Figure 3 Steps S210 to S260 in Figure 2 Before step S110. The method may be Figure 1 The server 101 shown is executed.

[0056] Specifically, Figure 3 The methods shown include: S210: Receive a first storage request sent by a terminal.

[0057] The first storage request is an update request. Specifically, the first storage request includes the first merchant information and the second merchant information.

[0058] S220. Generate a first request code corresponding to the first storage request.

[0059] After the server receives the first storage request sent by the terminal, the server will store a first request code corresponding to the first storage request.

[0060] In this embodiment, the first request code is used to indicate an identifier corresponding to an update request for the first merchant information and the second merchant information.

[0061] S230: Determine a first merchant table corresponding to the first merchant information.

[0062] Specifically, the first merchant table corresponding to the first merchant information may be determined in the following manner: obtaining a first merchant type corresponding to the first merchant information; and determining a first merchant table corresponding to the first merchant type.

[0063] For example, in Figure 1 In the example shown, the first merchant information is the franchisee identifier A1 and the brand name "T0 Coffee", the first merchant type is a franchisee, and the first merchant table is the franchisee information table shown in Table 1.

[0064] S240: Determine a second merchant table corresponding to the second merchant information.

[0065] Specifically, the second merchant table corresponding to the second merchant information may be determined in the following manner: obtaining the second merchant type corresponding to the second merchant information; and determining the second merchant table corresponding to the second merchant type.

[0066] For example, in Figure 1 In the example shown, the second merchant information is the store identification B1 and the store name "T0 Coffee", the second merchant type is the store, and the second merchant table is the store information table shown in Table 2.

[0067] S250: Store a mapping relationship between the first request code and the first merchant information in a first merchant table.

[0068] S260: Store a mapping relationship between the first request code and the second merchant information in the second merchant table.

[0069] exist Figure 3In the example shown, when the first merchant information and the second merchant information in the first storage request are updated, a first request code is assigned to the first storage request, a mapping relationship between the first request code and the first merchant information is stored in the first merchant table, and a mapping relationship between the first request code and the second merchant information is stored in the second merchant table, so that the first merchant information and the second merchant information updated this time both correspond to the first request code, so that the multiple merchant information updated in this update request can be queried based on the first request code later.

[0070] exist Figure 3 After S260 shown, the server may also invalidate the first merchant information and the second merchant information corresponding to the first request code in the following manner: receiving a first invalidation request sent by the terminal, the first invalidation request including the first request code; determining a first merchant table and a second merchant table corresponding to the first request code; determining in the first merchant table that the first merchant information corresponding to the first request code is invalid information; and determining in the second merchant table that the second merchant information corresponding to the first request code is invalid information.

[0071] If the first merchant information and the second merchant information corresponding to the first request code are to be invalidated, the terminal may be used to send a first invalidation request to the server. The server obtains the first request code in the first invalidation request, determines the first merchant table and the second merchant table corresponding to the first request code, and determines in the first merchant table and the second merchant table that the first merchant information and the second merchant information corresponding to the first request code are invalid information, thereby performing an invalidation operation on multiple merchant information corresponding to the first request code.

[0072] After determining in the second merchant table that the second merchant information corresponding to the first request code is invalid information, the server may further determine in the first merchant table the first merchant identifier corresponding to the first request code; determine whether there is a second request code corresponding to the first merchant identifier in the first merchant table, and the execution time corresponding to the second request code is earlier than the execution time corresponding to the first request code; when there is a second request code corresponding to the first merchant identifier in the first merchant table, determine in the first merchant table that the third merchant information corresponding to the second request code is valid information.

[0073] After determining that the first merchant information corresponding to the first request code is invalid in the first merchant table, in order to ensure that the first merchant identifier corresponding to the first request code can be rolled back to the information after the last update, the server can determine whether there is a second request code corresponding to the first merchant identifier in the first merchant table. If it exists, it means that the third merchant information corresponding to the second request code is the information after the last update. Then the server will determine that the third merchant information corresponding to the second request code is valid in the first merchant table, so that the third merchant information corresponding to the first merchant identifier in the first merchant table is valid, so that after the server invalidates the first merchant information corresponding to the first request code, the first merchant identifier can be rolled back to the third merchant information after the last update. Therefore, it is achieved that after the first merchant information corresponding to the first request code is invalidated, the third merchant information updated last can also be restored.

[0074] After determining in the second merchant table that the second merchant information corresponding to the first request code is invalid information, the server may further determine in the second merchant table a second merchant identifier corresponding to the first request code; determine whether there is a second request code corresponding to the second merchant identifier in the second merchant table, and an execution time corresponding to the second request code is earlier than an execution time corresponding to the first request code; when there is a second request code corresponding to the second merchant identifier in the second merchant table, determine in the second merchant table that the fourth merchant information corresponding to the second request code is valid information.

[0075] Among them, after determining that the second merchant information corresponding to the first request code is invalid information in the second merchant table, in order to ensure that the second merchant identifier corresponding to the first request code can be rolled back to the information after the last update, the server can determine whether there is a second request code corresponding to the second merchant identifier in the second merchant table. If it exists, it means that the fourth merchant information corresponding to the second request code is the information after the last update, then the server will determine that the fourth merchant information corresponding to the second request code is valid information in the second merchant table, so that the fourth merchant information corresponding to the second merchant identifier in the second merchant table is valid, thereby realizing that after the server invalidates the second merchant information corresponding to the first request code, the second merchant identifier can be rolled back to the fourth merchant information after the last update. Therefore, it is realized that after the second merchant information corresponding to the first request code is invalidated, the fourth merchant information updated last can also be restored.

[0076] Figure 4 FIG. 2 is a schematic diagram showing the overall process of a merchant information processing method M300 according to another embodiment of the present disclosure. Figure 4 The method shown includes steps S310 to S350. The method can be Figure 1 The server 101 shown is executed.

[0077] Specifically, Figure 4 The methods shown include: S310: Receive a first query request sent by a terminal.

[0078] The first query request includes a first merchant type and a first merchant identifier.

[0079] S320: Determine in a database a first merchant table corresponding to the first merchant type.

[0080] S330: Determine, in the first merchant table, a plurality of request codes corresponding to the first merchant identifier.

[0081] The request code in the multiple request codes is used to indicate an identifier corresponding to an update request for multiple merchant information.

[0082] S340: Determine multiple scene types corresponding to multiple request codes.

[0083] The scene type is the type corresponding to the update request.

[0084] S350: Send multiple scene types to the terminal.

[0085] exist Figure 4 In the example shown, each scene type represents a type corresponding to an update request. In order to obtain all update requests corresponding to the first merchant identifier, a first query request including the first merchant type and the first merchant identifier can be sent to the server. The server determines the first merchant table corresponding to the first merchant type, and determines multiple request codes corresponding to the first merchant identifier in the first merchant table. Multiple scene types corresponding to the first merchant identifier are obtained through the multiple request codes corresponding to the first merchant identifier. The multiple scene types corresponding to the first merchant identifier are equivalent to all update requests corresponding to the first merchant identifier. Finally, the server sends multiple scene types to the terminal.

[0086] Therefore, through Figure 4 As can be seen from the examples shown, the present disclosure can query all scenario types corresponding to a merchant identifier through a server, thereby knowing the types corresponding to all update requests corresponding to a merchant identifier.

[0087] See also Figure 5 As shown, Figure 5 It is a schematic block diagram of the structure of a merchant information processing device according to an embodiment of the present disclosure.

[0088] like Figure 5 As shown, the merchant information processing device includes: The receiving module 110 is configured to receive a first query request sent by a terminal, wherein the first query request includes a first request code, and the first request code is used to indicate an identifier corresponding to an update request for multiple merchant information.

[0089] The determination module 120 is used to determine multiple merchant tables corresponding to the first request code in the database, and determine multiple merchant information corresponding to the first request code in the multiple merchant tables.

[0090] The sending module 130 is used to send multiple merchant information to the terminal.

[0091] The above-mentioned dynamic allocation device for fuse strategies may be in the form of computer software, and each module of the above-mentioned dynamic allocation device for fuse strategies may be implemented by a computer software module.

[0092] The implementation process of the functions and effects of each module in the dynamic allocation device of the above-mentioned fuse strategy is specifically detailed in the implementation process of the corresponding steps in the above-mentioned method, and will not be repeated here.

[0093] See also Figure 6 As shown, Figure 6 It is a schematic block diagram of the structure of a server 3000 according to an embodiment of the present disclosure.

[0094] The hardware structure of the server 3000 can be implemented using a bus architecture. The bus architecture can include any number of interconnected buses and bridges, depending on the specific application and overall design constraints of the hardware. The bus 3100 connects various circuits including one or more processors 3200, memory 3300, and / or hardware modules together. The bus 3100 can also connect various other circuits 3400 such as peripherals, voltage regulators, power management circuits, external antennas, etc.

[0095] The bus 3100 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Component (EISA) bus, etc. A bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one connecting line is used in the figure, but it does not mean that there is only one bus or one type of bus.

[0096] The present disclosure also provides a readable storage medium, in which a computer program is stored, and the computer program is used to implement the above method when executed by a processor. "Readable storage medium" can be any device that can contain, store, communicate, propagate or transmit a program for use in an instruction execution system, device or equipment or in combination with these instruction execution systems, devices or equipment. More specific examples of readable storage media include the following: an electrical connection portion (electronic device) with one or more wirings, a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and editable read-only memory (EPROM or flash memory), an optical fiber device, and a portable read-only memory (CDROM), etc.

[0097] The present disclosure also provides a computer program product. The method of the present disclosure can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instruction is loaded and executed, the process or function of the present disclosure is executed in whole or in part.

[0098] The computer program or instructions may be stored in a readable storage medium or transmitted from one readable storage medium to another readable storage medium, for example, the computer program or instructions may be transmitted from one website, computer, server or data center to another website, computer, server or data center by wired or wireless means. The readable storage medium may be any available medium that can be accessed or a data storage device such as a server, data center, etc. that integrates one or more available media. The available medium may be a magnetic medium, such as a floppy disk, a hard disk, or a magnetic tape; it may also be an optical medium, such as a digital video disk; it may also be a semiconductor medium, such as a solid state drive. The computer readable storage medium may be a volatile or non-volatile storage medium, or may include both volatile and non-volatile types of storage media.

[0099] Those skilled in the art will appreciate that the embodiments of the present disclosure may be provided as methods, systems, or computer program products. Therefore, the present disclosure may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present disclosure may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0100] The present disclosure is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to the present disclosure. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0101] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0102] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0103] In the description of this specification, the description with reference to the terms "one embodiment / method", "some embodiments / methods", "example", "specific example", or "some examples" etc. means that the specific features, structures, or characteristics described in conjunction with the embodiment / method or example are included in at least one embodiment / method or example of the present disclosure. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment / method or example. Moreover, the specific features, structures, or characteristics described may be combined in any one or more embodiments / methods or examples in a suitable manner. In addition, those skilled in the art may combine and combine different embodiments / methods or examples described in this specification and features of different embodiments / methods or examples, unless they are contradictory.

[0104] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the features. In the description of the present disclosure, "plurality" means at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0105] Those skilled in the art should understand that the above embodiments are only for the purpose of clearly illustrating the present disclosure, and are not intended to limit the scope of the present disclosure. For those skilled in the art, other changes or modifications may be made based on the above disclosure, and these changes or modifications are still within the scope of the present disclosure.

Claims

1. A merchant information processing method, characterized in that: include: receiving a first query request sent by a terminal, wherein the first query request includes a first request code, and the first request code is used to indicate an identifier corresponding to an update request for multiple merchant information; Determine in a database a plurality of merchant tables corresponding to the first request code; Determine, in the plurality of merchant tables, a plurality of merchant information corresponding to the first request code; The plurality of merchant information is sent to the terminal.

2. The method according to claim 1, characterized in that The plurality of merchant tables include a first merchant table and a second merchant table, and the plurality of merchant information include first merchant information and second merchant information.

3. The method according to claim 2, characterized in that Determining in a database a plurality of merchant tables corresponding to the first request code includes: Determine a first merchant type and a second merchant type corresponding to the first request code; Determine in a database a first merchant table corresponding to the first merchant type; A second merchant table corresponding to the second merchant type is determined in the database.

4. The method according to claim 2, characterized in that Determining multiple merchant information corresponding to the first request code in the multiple merchant tables includes: Determine, in the first merchant table, first merchant information corresponding to the first request code; Determine the second merchant information corresponding to the first request code in the second merchant table.

5. The method according to claim 2, characterized in that Before receiving the first query request sent by the terminal, the method further includes: Receiving a first storage request sent by a terminal, wherein the first storage request includes first merchant information and second merchant information; generating the first request code corresponding to the first storage request; Determine the first merchant table corresponding to the first merchant information; Determine the second merchant table corresponding to the second merchant information; Storing a mapping relationship between the first request code and the first merchant information in the first merchant table; The mapping relationship between the first request code and the second merchant information is stored in the second merchant table.

6. The method according to claim 5, characterized in that Optionally, determining the first merchant table corresponding to the first merchant information includes: acquiring a first merchant type corresponding to the first merchant information; and determining the first merchant table corresponding to the first merchant type; Optionally, determining the second merchant table corresponding to the second merchant information includes: acquiring a second merchant type corresponding to the second merchant information; and determining the second merchant table corresponding to the second merchant type; Optionally, after storing the mapping relationship between the first request code and the second merchant information in the second merchant table, the method further includes: receiving a first invalid request sent by a terminal, the first invalid request including the first request code; determining the first merchant table and the second merchant table corresponding to the first request code; determining in the first merchant table that the first merchant information corresponding to the first request code is invalid information; determining in the second merchant table that the second merchant information corresponding to the first request code is invalid information; Optionally, after determining in the second merchant table that the second merchant information corresponding to the first request code is invalid information, the method further includes: determining in the first merchant table a first merchant identifier corresponding to the first request code; determining whether there is a second request code corresponding to the first merchant identifier in the first merchant table, and an execution time corresponding to the second request code is earlier than an execution time corresponding to the first request code; when there is a second request code corresponding to the first merchant identifier in the first merchant table, determining in the first merchant table that third merchant information corresponding to the second request code is valid information; Optionally, after determining in the second merchant table that the second merchant information corresponding to the first request code is invalid information, the method further includes: determining in the second merchant table a second merchant identifier corresponding to the first request code; determining whether there is a second request code corresponding to the second merchant identifier in the second merchant table, and an execution time corresponding to the second request code is earlier than an execution time corresponding to the first request code; when there is a second request code corresponding to the second merchant identifier in the second merchant table, determining in the second merchant table that fourth merchant information corresponding to the second request code is valid information.

7. A merchant information processing method, characterized in that: include: Receiving a first query request sent by a terminal, wherein the first query request includes a first merchant type and a first merchant identifier; Determine in a database a first merchant table corresponding to the first merchant type; Determining, in the first merchant table, a plurality of request codes corresponding to the first merchant identifier, wherein a request code in the plurality of request codes is used to indicate identifiers corresponding to update requests for multiple merchant information; Determine a plurality of scene types corresponding to the plurality of request codes, the scene types being types corresponding to the update request; The multiple scene types are sent to the terminal.

8. A server, characterized in that: include: a memory storing a computer program; as well as A processor, wherein the processor executes the computer program stored in the memory, so that the processor executes the merchant information processing method according to any one of claims 1 to 7.

9. A readable storage medium, characterized in that: The readable storage medium stores a computer program, and when the computer program is executed by a processor, the computer program is used to implement the merchant information processing method according to any one of claims 1 to 7.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the merchant information processing method according to any one of claims 1 to 7 is implemented.

Images