Marriage registration system data query method and device and terminal equipment

Abstract

The application provides a marriage registration system data query method and device and terminal equipment, the method comprises the following steps: receiving the data query request of each marriage registration terminal in real time, and adding each data query request to a preset data query queue; dividing the data query queue according to a preset time interval to obtain a plurality of sub-queues; selecting the first n sub-queues from the data query queue; for any sub-queue in the first n sub-queues, the following steps are executed: sending each data query request in the target sub-queue to a local database and a national database in sequence respectively to obtain the local database data and the national database data corresponding to each data query request, performing deduplication processing on the local database data and the national database data to obtain the response data corresponding to each data query request, and returning the response data corresponding to each data query request to the corresponding marriage registration terminal. The application can ensure effective query of marriage registration data.

Description

Technical Field

[0001] This invention belongs to the field of data query technology, and more specifically, relates to a data query method, device and terminal equipment for a marriage registration system. Background Technology

[0002] In the marriage registration system, data queries are typically performed by directly accessing the national database. However, data from local databases is usually uploaded to the national database on a pre-set schedule, and omissions may occur during data transmission. This results in incomplete data in the national database, meaning that directly querying the national database may not yield any results. Summary of the Invention

[0003] The purpose of this invention is to provide a method, apparatus, and terminal device for querying data in a marriage registration system, so as to solve the problem that marriage registration data cannot be found when directly querying the national database in the prior art.

[0004] A first aspect of this invention provides a method for querying data in a marriage registration system, comprising:

[0005] It receives data query requests from various marriage registration terminals in real time and adds each data query request to a preset data query queue according to the request time of each data query request;

[0006] The data query queue is divided into multiple sub-queues according to a preset time interval;

[0007] Select the first n sub-queues from the data query queue, wherein the total number of data query requests in the first n sub-queues is less than a preset value;

[0008] For any of the first n subqueues, perform the following steps: send each data query request in the target subqueue to the local database and the national database in sequence to obtain the local database data and national database data corresponding to each data query request; perform deduplication on the local database data and national database data corresponding to each data query request to obtain the response data corresponding to each data query request; and return the response data corresponding to each data query request to the corresponding marriage registration terminal.

[0009] A second aspect of the present invention provides a data query device for a marriage registration system, comprising:

[0010] The data receiving module is used to receive data query requests from various marriage registration terminals in real time and add each data query request to a preset data query queue according to the request time of each data query request.

[0011] The data caching module is used to divide the data query queue into multiple sub-queues according to a preset time interval;

[0012] The data query module is used to select the first n sub-queues from the data query queue, wherein the total number of data query requests in the first n sub-queues is less than a preset value;

[0013] For any of the first n subqueues, perform the following steps: send each data query request in the target subqueue to the local database and the national database in sequence to obtain the local database data and national database data corresponding to each data query request; perform deduplication on the local database data and national database data corresponding to each data query request to obtain the response data corresponding to each data query request; and return the response data corresponding to each data query request to the corresponding marriage registration terminal.

[0014] A third aspect of the present invention provides a terminal device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the above-described marriage registration system data query method.

[0015] In a fourth aspect, the present invention provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the above-described marriage registration system data query method.

[0016] The beneficial effects of the marriage registration system data query method, apparatus, and terminal equipment provided by this invention are as follows: Unlike existing technologies, this invention queries both local and national databases, deduplicating the retrieved local and national data to ensure effective querying of marriage registration data. Furthermore, this invention addresses the query efficiency issue of large-volume data query requests by adding data query requests to a data query queue. By dividing the data query queue and limiting the number of data query requests in sub-queues, the data processing pressure can be effectively reduced, ensuring overall data query efficiency. Attached Figure Description

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

[0018] Figure 1This is a flowchart illustrating a data query method for a marriage registration system according to an embodiment of the present invention.

[0019] Figure 2 This is a structural block diagram of a data query device for a marriage registration system provided in an embodiment of the present invention;

[0020] Figure 3 This is a schematic block diagram of a terminal device provided in an embodiment of the present invention. Detailed Implementation

[0021] To make the technical problems to be solved, the technical solutions, and the beneficial effects of the present invention clearer, the present invention will be further described in 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 present invention and are not intended to limit the present invention.

[0022] Please refer to Figure 1 , Figure 1 This is a flowchart illustrating a data query method for a marriage registration system according to an embodiment of the present invention. The method includes:

[0023] S101: Receives data query requests from each marriage registration terminal in real time and adds each data query request to a preset data query queue according to the request time of each data query request.

[0024] In this embodiment, the executing entity can be a terminal or a regional server in a certain area; this embodiment does not impose any limitations.

[0025] In this embodiment, each data query request can be added to a preset data query queue in the order of its request time. The earlier the request time, the higher the position in the data query queue.

[0026] S102: Divide the data query queue into multiple sub-queues according to a preset time interval.

[0027] In this embodiment, dividing the data query queue does not change the queue order of each data query request within the queue. The preset time interval can be adjusted based on the current time. For example, if the data statistics show a high number of query requests in month x, the preset time interval can be adjusted to a lower value in month x; conversely, if the data statistics show a low number of query requests in month y, the preset time interval can be adjusted to a higher value in month y.

[0028] S103: Select the first n sub-queues from the data query queue, wherein the total number of data query requests in the first n sub-queues is less than a preset value.

[0029] For any of the first n subqueues, perform the following steps: send each data query request in the target subqueue to the local database and the national database in sequence to obtain the local database data and national database data corresponding to each data query request; perform deduplication on the local database data and national database data corresponding to each data query request to obtain the response data corresponding to each data query request; and return the response data corresponding to each data query request to the corresponding marriage registration terminal.

[0030] In this embodiment, n is an integer, and its specific value is determined by the number of data query requests in each sub-queue. The selected n sub-queues satisfy the condition that "the total number of data query requests in the n sub-queues is less than a preset value." The preset value is the upper limit of the data processing capacity of the local machine (i.e., the executing entity).

[0031] In this embodiment, when sending each data query request to the local database, the local database can prioritize selecting the local database where the IP address of the marriage registration terminal in the data query request is located. If the query cannot be found, then the database will be traversed and queried in each local database.

[0032] As can be seen from the above, unlike existing technologies, this invention queries both local and national databases, and deduplicates the retrieved local and national data to ensure effective querying of marriage registration data. Furthermore, this invention addresses the efficiency issue of large-scale data query requests by adding data query requests to a data query queue. By dividing the data query queue and limiting the number of data query requests in each sub-queue, the data processing pressure can be effectively reduced, ensuring overall data query efficiency.

[0033] Optionally, as a specific implementation of the marriage registration system data query method provided in this embodiment of the invention, after dividing the data query queue into multiple sub-queues according to a preset time interval, the marriage registration system data query method may further include:

[0034] The data query requests in each sub-queue are rearranged based on the request fields of the data query requests in each sub-queue to obtain the rearranged sub-queues.

[0035] The request field can be either the identification number of one spouse or the names of both spouses. In this embodiment, data query requests within each sub-queue can be rearranged based on the request field to ensure that data query requests with the same request field are grouped together, thereby enabling subsequent data grouping and improving data processing efficiency.

[0036] If the requested field is an ID number, the order of each data query request is determined by the size of the ID number; if the requested field is a name, the order of each data query request is determined by the first letter of the name.

[0037] Optionally, as a specific implementation of the marriage registration system data query method provided in this embodiment of the invention, after obtaining the rearranged sub-queue, the marriage registration system data query method may further include:

[0038] For any of the first n subqueues, perform the following steps:

[0039] The data query requests in the target sub-queue are grouped according to the request fields. Each group of data query requests in the target sub-queue is sent to the local database and the national database respectively to obtain the local database data and the national database data corresponding to each data query request. The local database data and the national database data corresponding to each data query request are deduplicated to obtain the response data corresponding to each data query request. The response data corresponding to each data query request is then returned to the corresponding marriage registration terminal.

[0040] In this embodiment, after rearrangement, data query requests with the same request fields within each sub-queue are adjacent. Based on this, the data query requests within each sub-queue can be directly grouped according to the request fields (without changing the order of each data query request), and data can be requested based on the grouped requests to improve data query efficiency.

[0041] Optionally, as a specific implementation of the data query method for the marriage registration system provided in this embodiment of the invention, the data query requests in the target sub-queue are grouped according to the request fields, including:

[0042] If two adjacent data query requests in the target subqueue both have the ID number as their request field, and the address codes of the two ID numbers are the same, then the adjacent data query requests are considered as a group.

[0043] In this embodiment, if the document number is an ID card number, then the address code is the first 6 digits of the ID card number. In other words, data query requests for the same registered address are grouped together. This design can reduce the number of accesses to the local database and improve data query efficiency.

[0044] Optionally, as a specific implementation of the data query method for the marriage registration system provided in this embodiment of the invention, the data query requests in the target sub-queue are sent to the local database and the national database in groups, including:

[0045] If the request field of a data query request in a target subqueue is an ID number, then the data query request for that group will be sent to both the local database and the national database simultaneously.

[0046] If the request field of a certain group of data query requests in the target sub-queue is the names of both parties, then the group of data query requests is first sent to the national database to obtain the identification number corresponding to each data query request in the group of data query requests, and then each data query request is sent to the local database based on the identification number corresponding to each data query request.

[0047] In this embodiment, if the request field of a certain group of data query requests in the target sub-queue is an identification number, the local database will determine the address code based on the identification number in that group of data query requests.

[0048] Optionally, as a specific implementation of the marriage registration system data query method provided in this embodiment of the invention, if the request field of a certain group of data query requests in the target sub-queue is the names of both parties, and the query result of the national database is empty after the group of data query requests is sent to the national database, then the preferred query location corresponding to each data query request is determined based on the IP address of the marriage registration terminal carried by each query request in the group of data query requests, and each query request is sent to the local database of its corresponding preferred query location for data query.

[0049] If the corresponding data is not found in the preferred query location, queries can be requested from various local databases in sequence until the corresponding data is found.

[0050] Optionally, as a specific implementation of the marriage registration system data query method provided in this embodiment of the invention, the local database data and the national database data corresponding to a certain data query request are deduplicated to obtain the response data corresponding to the data query request, including:

[0051] Based on the document numbers and names of both parties contained in the local and national databases corresponding to the data query request, the local and national databases corresponding to the data query request are deduplicated to obtain the response data corresponding to the data query request.

[0052] In this embodiment, response data with the same document number and the same name of both spouses are merged ("OR") to achieve deduplication of local database data and national database data, and obtain the corresponding response data.

[0053] Corresponding to the marriage registration system data query method in the above embodiment, Figure 2 This is a structural block diagram of a data query device for a marriage registration system provided in an embodiment of the present invention. For ease of explanation, only the parts relevant to the embodiment of the present invention are shown. (See references) Figure 2The marriage registration system data query device 20 includes: a data receiving module 21, a data caching module 22, and a data query module 23.

[0054] Among them, the data receiving module 21 is used to receive data query requests from each marriage registration terminal in real time, and add each data query request to a preset data query queue according to the request time of each data query request.

[0055] Data caching module 22 is used to divide the data query queue according to a preset time interval to obtain multiple sub-queues;

[0056] Data query module 23 is used to select the first n sub-queues from the data query queue, wherein the total number of data query requests in the first n sub-queues is less than a preset value;

[0057] For any of the first n subqueues, perform the following steps: send each data query request in the target subqueue to the local database and the national database in sequence to obtain the local database data and national database data corresponding to each data query request; perform deduplication on the local database data and national database data corresponding to each data query request to obtain the response data corresponding to each data query request; and return the response data corresponding to each data query request to the corresponding marriage registration terminal.

[0058] Optionally, as a specific implementation of the marriage registration system data query device provided in this embodiment of the invention, the data caching module 22 is further used to divide the data query queue according to a preset time interval to obtain multiple sub-queues, and then rearrange the data query requests in each sub-queue based on the request field of the data query request in each sub-queue to obtain the rearranged sub-queue.

[0059] Optionally, as a specific implementation of the marriage registration system data query device provided in this embodiment of the invention, the data query module 23 is further configured to perform the following steps for any one of the first n sub-queues after obtaining the rearranged sub-queues:

[0060] The data query requests in the target sub-queue are grouped according to the request fields. Each group of data query requests in the target sub-queue is sent to the local database and the national database respectively to obtain the local database data and the national database data corresponding to each data query request. The local database data and the national database data corresponding to each data query request are deduplicated to obtain the response data corresponding to each data query request. The response data corresponding to each data query request is then returned to the corresponding marriage registration terminal.

[0061] Optionally, as a specific implementation of the marriage registration system data query device provided in this embodiment of the invention, the data query module 23 is specifically used for:

[0062] If two adjacent data query requests in the target subqueue both have the ID number as their request field, and the address codes of the two ID numbers are the same, then the adjacent data query requests are considered as a group.

[0063] Optionally, as a specific implementation of the marriage registration system data query device provided in this embodiment of the invention, the data query module 23 is specifically used for:

[0064] If the request field of a data query request in a target subqueue is an ID number, then the data query request for that group will be sent to both the local database and the national database simultaneously.

[0065] If the request field of a certain group of data query requests in the target sub-queue is the names of both parties, then the group of data query requests is first sent to the national database to obtain the identification number corresponding to each data query request in the group of data query requests, and then each data query request is sent to the local database based on the identification number corresponding to each data query request.

[0066] Optionally, as a specific implementation of the marriage registration system data query device provided in this embodiment of the invention, the data query module 23 is specifically used for:

[0067] If the request field of a certain group of data query requests in the target sub-queue is the names of both parties, and the query result of the national database is empty after the group of data query requests is sent to the national database, then the preferred query location corresponding to each data query request is determined based on the IP address of the marriage registration terminal carried by each query request in the group of data query requests, and each query request is sent to the local database of its corresponding preferred query location for data query.

[0068] Optionally, as a specific implementation of the marriage registration system data query device provided in this embodiment of the invention, the data query module 23 is specifically used for:

[0069] Based on the document numbers and names of both parties contained in the local and national databases corresponding to the data query request, the local and national databases corresponding to the data query request are deduplicated to obtain the response data corresponding to the data query request.

[0070] See Figure 3 , Figure 3 This is a schematic block diagram of a terminal device provided according to an embodiment of the present invention. Figure 3The terminal 300 in this embodiment may include one or more processors 301, one or more input devices 302, one or more output devices 303, and one or more memories 304. The processors 301, input devices 302, output devices 303, and memories 304 communicate with each other via a communication bus 305. The memories 304 store computer programs, including program instructions. The processors 301 execute the program instructions stored in the memories 304. Specifically, the processors 301 are configured to invoke the program instructions to perform the functions of the modules / units in the above-described device embodiments, such as... Figure 2 The functions of modules 21 to 23 are shown.

[0071] It should be understood that, in this embodiment of the invention, the processor 301 may be a Central Processing Unit (CPU), but it may also be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor.

[0072] Input device 302 may include a touchpad, a fingerprint sensor (for collecting the user's fingerprint information and fingerprint orientation information), a microphone, etc., and output device 303 may include a display (LCD, etc.), a speaker, etc.

[0073] The memory 304 may include read-only memory and random access memory, and provides instructions and data to the processor 301. A portion of the memory 304 may also include non-volatile random access memory. For example, the memory 304 may also store device type information.

[0074] In specific implementations, the processor 301, input device 302, and output device 303 described in the embodiments of the present invention can execute the implementation methods described in the first and second embodiments of the marriage registration system data query method provided in the embodiments of the present invention, or they can execute the implementation methods of the terminal described in the embodiments of the present invention, which will not be repeated here.

[0075] In another embodiment of the present invention, a computer-readable storage medium is provided. The computer-readable storage medium stores a computer program, which includes program instructions. When executed by a processor, the program instructions implement all or part of the processes in the methods described above. The computer program can also instruct related hardware to complete the process. The computer program can be stored in a computer-readable storage medium, and when executed by a processor, it can implement the steps of the various method embodiments described above. The computer program includes computer program code, which can be in the form of source code, object code, executable files, or certain intermediate forms. The computer-readable medium can include any entity or device capable of carrying computer program code, recording media, USB flash drives, portable hard drives, magnetic disks, optical disks, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc. It should be noted that the content included in the computer-readable medium can be appropriately added or removed according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, the computer-readable medium does not include electrical carrier signals and telecommunication signals.

[0076] The computer-readable storage medium can be an internal storage unit of the terminal in any of the foregoing embodiments, such as the terminal's hard disk or memory. The computer-readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital card (SD), flash card, etc., equipped on the terminal. Furthermore, the computer-readable storage medium can include both internal storage units and external storage devices of the terminal. The computer-readable storage medium is used to store computer programs and other programs and data required by the terminal. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0077] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this invention.

[0078] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the terminals and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0079] In the several embodiments provided in this application, it should be understood that the disclosed terminals and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be indirect coupling or communication connection through some interfaces or units, or it may be an electrical, mechanical, or other form of connection.

[0080] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of the embodiments of the present invention, depending on actual needs.

[0081] Furthermore, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0082] The above are merely specific embodiments of the present invention, but the scope of protection of the present invention is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in the present invention, and these modifications or substitutions should all be covered within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A method of querying data in a marriage registration system, characterized by, include: It receives data query requests from various marriage registration terminals in real time and adds each data query request to a preset data query queue according to the request time of each data query request; The data query queue is divided into multiple sub-queues according to a preset time interval; Select the first n sub-queues from the data query queue, wherein the total number of data query requests in the first n sub-queues is less than a preset value; For any of the first n subqueues, perform the following steps: send each data query request in the target subqueue to the local database and the national database in sequence to obtain the local database data and national database data corresponding to each data query request; perform deduplication on the local database data and national database data corresponding to each data query request to obtain the response data corresponding to each data query request; and return the response data corresponding to each data query request to the corresponding marriage registration terminal.

2. The marriage registration system data query method of claim 1, wherein, After dividing the data query queue into multiple sub-queues according to a preset time interval, the process also includes: The data query requests in each sub-queue are rearranged based on the request fields of the data query requests in each sub-queue to obtain the rearranged sub-queues.

3. The method of claim 2, wherein the marriage registration system data query method is characterized by, After obtaining the rearranged subqueue, it also includes: For any of the first n subqueues, perform the following steps: The data query requests in the target sub-queue are grouped according to the request fields. Each group of data query requests in the target sub-queue is sent to the local database and the national database respectively to obtain the local database data and the national database data corresponding to each data query request. The local database data and the national database data corresponding to each data query request are deduplicated to obtain the response data corresponding to each data query request. The response data corresponding to each data query request is then returned to the corresponding marriage registration terminal.

4. The marriage registration system data query method of claim 3, wherein, The grouping of each data query request in the target sub-queue according to the request field includes: If two adjacent data query requests in the target subqueue both have ID number as their request field, and the address codes of the two ID numbers are the same, then the adjacent data query requests are considered as a group.

5. The marriage registration system data query method of claim 3, wherein, The step of sending each data query request in the target sub-queue to the local database and the national database in groups includes: If the request field of a data query request in a target subqueue is an ID number, then the data query request for that group will be sent to both the local database and the national database simultaneously. If the request field of a certain group of data query requests in the target sub-queue is the names of both parties, then the group of data query requests is first sent to the national database to obtain the identification number corresponding to each data query request in the group of data query requests, and then each data query request is sent to the local database based on the identification number corresponding to each data query request.

6. The marriage registration system data query method of claim 5, wherein, If the request field of a certain group of data query requests in the target sub-queue is the names of both parties, and the query result of the national database is empty after the group of data query requests is sent to the national database, then the query location corresponding to each data query request is determined based on the IP address of the marriage registration terminal carried by each query request in the group of data query requests, and each query request is sent to the local database of its corresponding query location for data query.

7. The method of claim 1 to 6, wherein, The local and national databases corresponding to a given data query request are deduplicated to obtain the response data for that query request, including: Based on the document numbers and names of both parties contained in the local and national databases corresponding to the data query request, the local and national databases corresponding to the data query request are deduplicated to obtain the response data corresponding to the data query request.

8. A marriage registration system data query apparatus characterized by comprising: include: The data receiving module is used to receive data query requests from various marriage registration terminals in real time and add each data query request to a preset data query queue according to the request time of each data query request. The data caching module is used to divide the data query queue into multiple sub-queues according to a preset time interval; The data query module is used to select the first n sub-queues from the data query queue, wherein the total number of data query requests in the first n sub-queues is less than a preset value; For any of the first n subqueues, perform the following steps: send each data query request in the target subqueue to the local database and the national database in sequence to obtain the local database data and national database data corresponding to each data query request; perform deduplication on the local database data and national database data corresponding to each data query request to obtain the response data corresponding to each data query request; and return the response data corresponding to each data query request to the corresponding marriage registration terminal.

9. A terminal device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the method as described in any one of claims 1 to 7.

10. A computer-readable storage medium storing a computer program, the computer program comprising instructions that, when executed by a computer, cause the computer to perform the method of any one of claims 1 to 9. When the computer program is executed by a processor, it implements the steps of the method as described in any one of claims 1 to 7.

Images