CN109492017A - Business information inquiry processing method, system, computer equipment and storage medium - Google Patents
Business information inquiry processing method, system, computer equipment and storage medium Download PDFInfo
- Publication number
- CN109492017A CN109492017A CN201811086482.1A CN201811086482A CN109492017A CN 109492017 A CN109492017 A CN 109492017A CN 201811086482 A CN201811086482 A CN 201811086482A CN 109492017 A CN109492017 A CN 109492017A
- Authority
- CN
- China
- Prior art keywords
- task
- node
- host node
- subtask
- query
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 14
- 238000012545 processing Methods 0.000 claims abstract description 27
- 238000009499 grossing Methods 0.000 claims abstract description 22
- 238000000034 method Methods 0.000 claims abstract description 18
- 238000005194 fractionation Methods 0.000 claims description 21
- 238000004590 computer program Methods 0.000 claims description 15
- 238000006243 chemical reaction Methods 0.000 claims description 12
- 230000006870 function Effects 0.000 claims description 12
- 230000005540 biological transmission Effects 0.000 claims description 3
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/48—Indexing scheme relating to G06F9/48
- G06F2209/484—Precedence
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This application involves a kind of business information inquiry processing method, system, computer equipment and the storage mediums in cloud field based on PC cluster.The described method includes: host node receives the inquiry request that terminal is sent, and query task is generated using the inquiry request；The query task is split as multiple subtasks by the host node；For any subtask in multiple subtasks, the multiple load weights from node of the host node poll obtain the slave node being adapted with the subtask by weight smoothing processing；It is described to be inquired from node according to the subtask, return to corresponding business information；Multiple business information returned from node are packaged by the host node, generate query result corresponding with the query task；The query result is back to terminal by the host node.The search efficiency of business information can be effectively improved using this method.
Description
Technical field
This application involves field of computer technology, more particularly to a kind of business information inquiry processing method, system, calculating
Machine equipment and storage medium.
Background technique
With the development of computer technology, a variety of architectures have been emerged.It can be designed accordingly by architecture
Comprehensive business system, basic framework also have the limitation of its own, and business function is also restrained.For example, passing through PAFA (Ping
An Foundation Architecture, safety architecture) this architecture, a series of operation flow can be defined
And general utility functions.But limited by PAFA frame, the inquiry of business information can only obtain 10,000 records every time, if it is desired to
More recorded, then need repeatedly to be arranged different progress and repeatedly inquire, thus cause the search efficiency of business information compared with
It is low.
Summary of the invention
Based on this, it is necessary in view of the above technical problems, provide a kind of search efficiency that can effectively improve business information
Business information inquiry processing method, system, computer equipment and storage medium.
A kind of business information inquiry processing method, which comprises
Host node receives the inquiry request that terminal is sent, and generates query task using the inquiry request；
The query task is split as multiple subtasks by the host node；
The multiple load weights from node of the host node poll obtain being adapted with subtask by weight smoothing processing
Slave node；It is described to be inquired from node according to subtask, return to corresponding business information；
For any subtask in the multiple subtask, the host node by it is multiple from node return business information
It is packaged, generates query result corresponding with the query task；
The query result is back to terminal by the host node.
The query task corresponds to multiple preset query conditions in one of the embodiments,；The host node will be described
Query task is split as multiple subtasks
The host node obtains the corresponding priority of multiple preset query conditions；
The host node splits query task according to the level order and preset query condition of priority, raw
At multiple subtasks；
The quantity of host node record subtask and the task identification of each subtask.
In one of the embodiments, before the inquiry request that the host node receives that terminal is sent, further includes:
The host node obtains the corresponding task of a variety of default fractionation rules and splits code；
The host node splits code to the task and is compiled, and obtains corresponding task and splits machine code；
It includes: that the task is called to split machine code that the query task is split as multiple subtasks by the host node,
Machine code is split by the task to split the query task, obtains multiple subtasks.
The host node splits code to the task and is compiled in one of the embodiments, is appointed accordingly
Business splits machine code
The host node reads the first configuration file, has recorded in first configuration file and matches generation with the task point
The corresponding Java keyword of code and non-Java keyword；
The host node reads the second configuration file, has recorded and the Java keyword in second configuration file
Function；
The host node utilizes first configuration file, and the non-Java that task in first database is split code is crucial
Word replaces with corresponding Java keyword；
The host node will replace the task after keyword according to the function of Java keyword in second configuration file
Splitting code conversion is that the task of Java is supported to split machine code, and the task of the support Java obtained after conversion is split machine code
It is stored in the second database.
The multiple load weights from node of the host node poll in one of the embodiments, are smoothly located by weight
Reason obtains
The host node according to described from the multiple present load weights from node of node identification poll, according to described current
It is corresponding with subtask from node identification to load weight selection；
The host node is smoothed the corresponding present load weight of the slave node identification selected, using smooth
Result that treated selects next subtask corresponding from node identification；
Multiple subtasks are sequentially allocated to corresponding from node by the host node according to the slave node identification selected.
A kind of business information query processing system, the system comprises:
Host node generates query task using the inquiry request for receiving the inquiry request of terminal transmission；It will be described
Query task is split as multiple subtasks；For any subtask in the multiple subtask, poll is multiple from the negative of node
Weight is carried, the slave node being adapted with subtask is obtained by weight smoothing processing；
Corresponding business information is returned from node for being inquired according to subtask；
The host node is also used to for multiple business information returned from node being packaged, and generates and the query task
Corresponding query result；The query result is back to terminal.
The host node is also used to obtain the corresponding priority of multiple preset query conditions in one of the embodiments,；
According to the level order and preset query condition of priority, query task is split, generates multiple subtasks；Record
The task identification of the quantity of task and each subtask.
The host node is also used to obtain the corresponding task of a variety of default fractionation rules and splits in one of the embodiments,
Code；Code is split to the task to be compiled, and is obtained corresponding task and is split machine code；The task is called to split machine
Code splits machine code by the task and splits to the query task, obtains multiple subtasks.
A kind of computer equipment, including memory and processor, the memory are stored with computer program, the processing
Device realizes the step in above-mentioned each embodiment of the method when executing the computer program.
A kind of computer readable storage medium, is stored thereon with computer program, and the computer program is held by processor
The step in above-mentioned each embodiment of the method is realized when row.
Above-mentioned business information inquiry processing method, system, computer equipment and storage medium, when needing to carry out business information
Inquiry when, can by terminal to host node send inquiry request.Host node generates corresponding inquiry according to inquiry request and appoints
Business, is split as multiple subtasks for query task.For any subtask in the multiple subtask, host node poll is multiple
From the load weight of node, the slave node being adapted with subtask is obtained by weight smoothing processing.It is multiple from node to distribution
It is concurrently inquired to subtask, it is hereby achieved that required business information.Host node by from querying node to business believe
Breath is packaged, and generates corresponding query result, and query result is back to terminal.Thus terminal only needs one query that can obtain
, to effectively overcome the limitation of basic framework, business information is improved without repeatedly inquiry to required multiple business information
Search efficiency.
Detailed description of the invention
Fig. 1 is the application scenario diagram of business information inquiry processing method in one embodiment；
Fig. 2 is the flow diagram of business information inquiry processing method in one embodiment；
Fig. 3 is the flow diagram of business information inquiry processing method in another embodiment；
Fig. 4 is the structural block diagram of business information query processing system in one embodiment；
Fig. 5 is the internal structure chart of computer equipment in one embodiment.
Specific embodiment
It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the application are more clearly understood
The application is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the application, not
For limiting the application.
Business information inquiry processing method provided by the present application, can be applied in application environment as shown in Figure 1.Its
In, terminal 102 is communicated by network with server cluster 104.It include host node and multiple from node in server cluster.
Wherein, communication connection is established between host node and terminal, and communication connection is established between node and host node.Wherein, terminal 102
It can be, but not limited to be various personal computers, laptop, smart phone, tablet computer and portable wearable device.
When terminal 102 needs inquiry business information, inquiry request can be sent to server cluster 104.In server cluster 104
Host node receives the inquiry request, generates corresponding query task using inquiry request.Query task is split as more by host node
A subtask.The multiple load weights from node of host node poll, by weight smoothing processing obtain with subtask be adapted
From node；It is inquired from node according to subtask, returns to corresponding business information.Host node by it is multiple from node return industry
Business information is packaged, and generates query result corresponding with query task.Query result is back to terminal 102 by host node.Eventually
End only needs one query that required multiple business information can be obtained, without repeatedly inquiry, to effectively overcome basic framework
Limitation, improve the search efficiency of business information.
In one embodiment, it as shown in Fig. 2, providing a kind of business information inquiry processing method, applies in this way
It is illustrated for host node in Fig. 1 in server cluster, comprising the following steps:
Step 202, host node receives the inquiry request that terminal is sent, and generates query task using inquiry request.
Step 204, query task is split as multiple subtasks by host node.
When terminal needs inquiry business information, corresponding querying condition can be selected by query page, is generated and is looked into this
Ask request.Inquiry request is sent to server cluster by terminal.It include host node and multiple from node in server cluster.Its
In, communication connection is established between host node and terminal, and communication connection is established between node and host node.Host node receives this and looks into
Request is ask, generates corresponding query task using inquiry request.
In order to effectively improve search efficiency, query task can be split as multiple sons according to preset query condition by host node
Task, so that multiple subtasks can concurrently be inquired.Host node obtains the corresponding priority of multiple preset query conditions；It is main
Node splits query task according to the level order and preset query condition of priority, generates multiple subtasks；It is main
The task identification of the quantity of nodes records subtask and each subtask.All subtask marks are stored in message by host node
Queue is distributed multiple subtasks to accordingly from node by the way of first in first out.
Step 206, for any subtask in multiple subtasks, the multiple load weights from node of host node poll,
The slave node being adapted with subtask is obtained by weight smoothing processing；It is inquired, is returned corresponding from node according to subtask
Business information.
Host node is multiple from the corresponding present load weight of node identification according to node listing acquisition, to multiple from node mark
Know corresponding present load weight to be traversed, obtains highest load weight.Host node appoints first son in message queue
Business distribution smoothly locates the present load weight of the slave node behind distribution subtask to the slave node of highest load weight
Reason.Host node is multiple from the corresponding present load weight of node identification according to the calculating of smoothing processing result, obtains highest and currently bears
Weight is carried, next subtask in message queue is distributed to the slave node of highest present load weight, next height is obtained
Task is corresponding from node identification.The resource consumption of the slave node of currently allocated subtask can be carried out by smoothing processing
It offsets, prevents from computing repeatedly its load weight, multiple load balancing from node in cluster are reached with this.
Step 208, multiple business information returned from node are packaged by host node, are generated corresponding with query task
Query result.
Step 210, query result is back to terminal by host node.
Multiple subtasks each can be distributed from node, the multiple subtasks being assigned to concurrently are executed from node and are looked into
It askes, obtains corresponding business information.Task identification can be corresponded to from node, and the business information that inquiry obtains is back to host node.
Business information is corresponded to task identification and cached by host node, main when receiving the corresponding business information of all task identifications
Multiple business information returned from node are packaged by node, generate query result corresponding with query task.In host node
When being packaged to business information, host node can identify corresponding query result according to preset query condition according to subtask
Priority is packaged.Wherein, host node can be is packaged according to the sequence of priority from high to low, can also according to from
Low to high sequence is packaged.Query result after encapsulation is back to terminal by host node.
In the present embodiment, when needing to carry out the inquiry of business information, inquiry can be sent to host node by terminal and asked
It asks.Host node generates corresponding query task according to inquiry request, and query task is split as multiple subtasks.For multiple sons
Any subtask in task, the multiple load weights from node of host node poll obtain appointing with son by weight smoothing processing
The adaptable slave node of business.It is multiple concurrently to inquire from node to being assigned to subtask, it is hereby achieved that required business
Information.Host node by from querying node to business information be packaged, generate corresponding query result, query result returned
To terminal.Thus terminal only needs one query that required multiple business information can be obtained, without repeatedly inquiry, thus effective gram
The limitation for having taken basic framework improves the search efficiency of business information.
In one embodiment, query task corresponds to multiple preset query conditions；Query task is split as more by host node
A subtask includes: that host node obtains the corresponding priority of multiple preset query conditions；Host node is suitable according to the rank of priority
Sequence and preset query condition, split query task, generate multiple subtasks；Host node record subtask quantity with
And the task identification of each subtask.
Each preset query condition can be preconfigured corresponding priority.Host node can be according to priority to more
A preset query condition is ranked up.Host node splits query task according to the level order of priority.For example, default
It include query time, mechanism, customer grade, customer ownership region etc. in querying condition.The sequence of priority from high to low is machine
Structure, customer ownership region, customer grade, query time.A preset query condition can be corresponded in query task, it can also be right
Answer multiple preset query conditions.Host node tears query task open according to the sequence of preset query condition priority from high to low
Point, generate multiple subtasks.For example, preset query condition are as follows: the client list of 1 Yue Nei10Jia mechanism.Host node root first
Query task is split according to mechanism, is split as 10 subtasks, each subtask is continued to split further according to query time,
Final split obtains 40 subtasks.
Each subtask has corresponding task identification, and host node records the quantity of subtask after task fractionation
And the task identification of each subtask.Host node is by all subtask mark deposit message queues, using first in first out
Mode distributes multiple subtasks to accordingly from node.By can concurrently be inquired multiple subtasks from node, by
This is without repeatedly inquiry, it can all business information can be obtained by one query, effectively increase business information
Search efficiency.
In one embodiment, a kind of business information inquiry processing method is provided, as shown in Figure 3, comprising the following steps:
Step 302, host node obtains the corresponding task of a variety of default fractionation rules and splits code.
Step 304, host node splits code to task and is compiled, and obtains corresponding task and splits machine code.
Step 306, host node receives the inquiry request that terminal is sent, and generates query task using inquiry request.
Step 308, host node calls task to split machine code, splits machine code by task and tears open to query task
Point, obtain multiple subtasks.
Step 310, for any subtask in multiple subtasks, the multiple load weights from node of host node poll,
The slave node being adapted with subtask is obtained by weight smoothing processing；It is inquired, is returned corresponding from node according to subtask
Business information.
Step 312, multiple business information returned from node are packaged by host node, are generated corresponding with query task
Query result.
Step 314, query result is back to terminal by host node.
In traditional mode, host node can call corresponding task to split code when splitting query task.Main section
Point splits code to task and is compiled, and generates corresponding task and splits machine code, host node splits machine code by task will
Query task is split.
In order to effectively improve the fractionation efficiency of query task, in the present embodiment, after host node starting, i.e., default torn open to a variety of
Then corresponding task fractionation code is compiled divider, is obtained corresponding task and is split machine code.It is looked into when host node needs to split
When inquiry task, machine code directly can be split according to the default corresponding task of rule invocation that splits.Host node can appoint inquiry
Corresponding multiple preset query conditions of being engaged in split the input of machine code as task, and task splits machine code and carries out operation, will look into
Inquiry task is split as multiple subtasks.
In this process, it is compiled as task fractionation machine code in advance since task splits code.It is looked into needing to split
When inquiry task, corresponding task fractionation machine code can be called directly and split.Save compiler task split code when
Between, effectively increase the fractionation efficiency of query task.
Further, different query task can have different default fractionation rules.Host node can also in advance will be more
The default corresponding task of rule that splits of kind splits code deposit database.Multiple-task in database is split code by host node
It is compiled in advance, the task that compiling is obtained splits the corresponding default rule that splits of machine code and is stored in database together.Work as master
When node starts, the database is accessed, the corresponding task of a variety of default fractionation rules is loaded and splits machine code.When host node needs
When splitting query task, machine code directly can be split according to the default corresponding task of rule invocation that splits.Host node can incite somebody to action
Entrained preset query condition splits the input of machine code as task in query task, by task fractionation machine code according to
The default rule that splits carries out operation, thus completes the fractionation of query task.The corresponding task disassembling machine of rule is split due to default
Device code is compiled before host node starting, is thus further saved the time that compiler task splits code, is further increased
The fractionation efficiency of query task.
In one embodiment, host node splits code to task and is compiled, and obtains corresponding task and splits machine code
Include: that host node reads the first configuration file, Java corresponding with task point matching code is had recorded in the first configuration file and is closed
Key word and non-Java keyword；Host node reads the second configuration file, has recorded and Java keyword in the second configuration file
Function；Host node utilizes the first configuration file, and the non-Java keyword that task in first database splits code is replaced with
Corresponding Java keyword；Host node will be replaced appointing after keyword according to the function of Java keyword in the second configuration file
It is that the task of Java is supported to split machine code that business, which splits code conversion, and the task of the support Java obtained after conversion is split machine
Code the second database of deposit.
A variety of regular corresponding tasks fractionation codes of default fractionation can be to be write in advance using different computer languages
's.For example, it may be write using the computational languages such as C language, C++, Java and Python.For the ease of developer into
The unified development of row needs to split the task of non-Java the task that code conversion is Java and splits code.
Multiple databases are deployed in the present embodiment, in server cluster, database includes first database and the second number
According to library.Wherein, stored in first database non-Java task split code (other computer languages i.e. in addition to Java
Task splits code), Java task is stored in the second database splits code.Multiple configuration texts are also stored in host node
Part, configuration file include the first configuration file and the second configuration file.Multiple configuration files can store in first database
In, it also can store in the second database.Multiple java keywords and corresponding non-are had recorded in first configuration file
Java keyword.The function of each java keyword is had recorded in second configuration file.
Host node utilizes the first configuration file, splits code to the task of a variety of non-Java in first database and identifies phase
The non-Java keyword answered, the non-Java keyword that will identify that replace with corresponding Java keyword.Host node is according to second
The function of each Java keyword in configuration file splits code to the task after replacement keyword and converts, so that conversion
It is that the task of Java is supported to split code that task afterwards, which splits code,.Host node splits code to the task after conversion and further compiles
It translates, generates and the task of Java is supported to split machine code.It is thus achieved that it is Java's that the task of non-Java, which is split code conversion,
Task splits machine code, and only developer does not provide convenience, and effectively saves task code compilation time, facilitates
It improves query task and splits efficiency.
In one embodiment, the multiple load weights from node of host node poll, by weight smoothing processing obtain with
The adaptable slave node in subtask includes: host node according to from the multiple present load weights from node of node identification poll, root
It is selected according to present load weight corresponding with subtask from node identification；Host node is corresponding to the slave node identification selected to work as
Preceding load weight is smoothed, and selects next subtask corresponding from node identification using the result after smoothing processing；
Multiple subtasks are sequentially allocated to corresponding from node by host node according to the slave node identification selected.
Host node is multiple from the corresponding present load weight of node identification according to the calculating of smoothing processing result, obtains highest and works as
Next subtask in message queue is distributed to the slave node of highest present load weight, is obtained next by preceding load weight
A subtask is corresponding from node identification.It can be to the resource consumption of the slave node of currently allocated subtask by smoothing processing
It is offset, prevents from computing repeatedly its load weight, multiple load balancing from node in cluster are reached with this.
The present load weight of the slave node behind distribution subtask is smoothed in one of the embodiments,
Step includes: that host node is multiple from the corresponding initial load weight of node identification according to node listing acquisition；Using multiple initial
Weight calculation loads weight summation；Using load weight summation highest load weight to the current of the slave node behind distribution subtask
Load weight is smoothed.
Host node can load weight summation from the initial load weight calculation of node according to multiple in cluster.Complete one
After the distribution of a subtask, host node is smoothed highest load weight using load weight summation.Specifically, main
Node can use highest load weight and subtract load weight summation, to the present load weight of the slave node of assigned subtask
Smoothing computation is carried out, smoothed out load weight is obtained.It can be to the slave node of currently allocated subtask by smoothing processing
Resource consumption offset, prevent from computing repeatedly its and load weight, multiple load balancing from node in cluster are reached with this.
It should be understood that although each step in the flow chart of Fig. 2 and Fig. 3 is successively shown according to the instruction of arrow,
But these steps are not that the inevitable sequence according to arrow instruction successively executes.Unless expressly state otherwise herein, these
There is no stringent sequences to limit for the execution of step, these steps can execute in other order.Moreover, in Fig. 2 and Fig. 3
At least part step may include that perhaps these sub-steps of multiple stages or stage are not necessarily same to multiple sub-steps
One moment executed completion, but can execute at different times, and the execution in these sub-steps or stage sequence is also not necessarily
Be successively carry out, but can at least part of the sub-step or stage of other steps or other steps in turn or
Alternately execute.
In one embodiment, as shown in figure 4, providing a kind of business information query processing system, comprising:
Host node 402 generates query task using inquiry request for receiving the inquiry request of terminal transmission；It will inquiry
Task is split as multiple subtasks；For any subtask in multiple subtasks, the multiple load weights from node of poll are led to
It crosses weight smoothing processing and obtains the slave node 404 being adapted with subtask.
Corresponding business information is returned from node 404 for being inquired according to subtask.
Host node 402 is also used to for multiple business information returned from node being packaged, and generates corresponding with query task
Query result；Query result is back to terminal.
In one embodiment, host node 402 is also used to obtain the corresponding priority of multiple preset query conditions；According to excellent
The level order and preset query condition of first grade, split query task, generate multiple subtasks；Record subtask
The task identification of quantity and each subtask.
In one embodiment, host node 402 is also used to obtain the corresponding task of a variety of default fractionation rules and splits code；
Code is split to task to be compiled, and is obtained corresponding task and is split machine code；Calling task splits machine code, is torn open by task
Point machine code splits query task, obtains multiple subtasks.
In one embodiment, host node 402 is also used to read the first configuration file, had recorded in the first configuration file with
The task point matching corresponding Java keyword of code and non-Java keyword；
The second configuration file is read, the function with Java keyword is had recorded in the second configuration file；Utilize the first configuration
The non-Java keyword that task in first database splits code is replaced with corresponding Java keyword by file；According to second
The function of Java keyword in configuration file, it is that the task of Java is supported to tear open that the task after replacement keyword, which is split code conversion,
Divide machine code, the task of the support Java obtained after conversion is split into machine code and is stored in the second database.
In one embodiment, host node 402 is also used to basis from the multiple present loads from node of node identification poll
Weight selects corresponding with subtask from node identification according to present load weight；
The corresponding present load weight of the slave node identification selected is smoothed, the knot after smoothing processing is utilized
Fruit selects next subtask corresponding from node identification；Multiple subtasks are sequentially allocated according to the slave node identification selected
It is extremely corresponding from node.
In one embodiment, a kind of computer equipment is provided, which can be server, and server can
To be server cluster.It include host node and multiple from node in server cluster.By taking host node as an example, internal structure chart
It can be as shown in Figure 5.The computer equipment includes processor, memory, network interface and the data connected by system bus
Library.Wherein, the processor of the computer equipment is for providing calculating and control ability.The memory of the computer equipment includes non-
Volatile storage medium, built-in storage.The non-volatile memory medium is stored with operating system, computer program and database.
The built-in storage provides environment for the operation of operating system and computer program in non-volatile memory medium.The computer is set
Standby database is for storage vendor's information, employee information etc..The network interface of the computer equipment is used for and external end
End passes through network connection communication.To realize any of the above-described kind of business information query processing when the computer program is executed by processor
Method.
It will be understood by those skilled in the art that structure shown in Fig. 5, only part relevant to application scheme is tied
The block diagram of structure does not constitute the restriction for the computer equipment being applied thereon to application scheme, specific computer equipment
It may include perhaps combining certain components or with different component layouts than more or fewer components as shown in the figure.
In one embodiment, a kind of computer readable storage medium is additionally provided, computer program is stored thereon with, is counted
Calculation machine program realizes the step in above-mentioned each embodiment of the method when being executed by processor.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the computer program can be stored in a non-volatile computer
In read/write memory medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein,
To any reference of memory, storage, database or other media used in each embodiment provided herein,
Including non-volatile and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM
(PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include
Random access memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms,
Such as static state RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhancing
Type SDRAM (ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM
(RDRAM), direct memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
Each technical characteristic of above embodiments can be combined arbitrarily, for simplicity of description, not to above-described embodiment
In each technical characteristic it is all possible combination be all described, as long as however, the combination of these technical characteristics be not present lance
Shield all should be considered as described in this specification.
The several embodiments of the application above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the concept of this application, various modifications and improvements can be made, these belong to the protection of the application
Range.Therefore, the scope of protection shall be subject to the appended claims for the application patent.
Claims (10)
1. a kind of business information inquiry processing method, which comprises
Host node receives the inquiry request that terminal is sent, and generates query task using the inquiry request；
The query task is split as multiple subtasks by the host node；
For any subtask in the multiple subtask, the multiple load weights from node of the host node poll pass through
Weight smoothing processing obtains the slave node being adapted with the subtask；It is described to be inquired from node according to the subtask,
Return to corresponding business information；
Multiple business information returned from node are packaged by the host node, generate inquiry corresponding with the query task
As a result；
The query result is back to terminal by the host node.
2. the method according to claim 1, wherein the query task corresponds to multiple preset query conditions；Institute
It states host node the query task is split as multiple subtasks and include:
The host node obtains the corresponding priority of multiple preset query conditions；
The host node splits query task according to the level order and preset query condition of priority, generates more
A subtask；
The quantity of host node record subtask and the task identification of each subtask.
3. the method according to claim 1, wherein the host node receive terminal send inquiry request it
Before, further includes:
The host node obtains the corresponding task of a variety of default fractionation rules and splits code；
The host node splits code to the task and is compiled, and obtains corresponding task and splits machine code；
It includes: that the task is called to split machine code that the query task is split as multiple subtasks by the host node, is passed through
The task splits machine code and splits to the query task, obtains multiple subtasks.
4. according to the method described in claim 3, it is characterized in that, the host node compiles task fractionation code
It translates, obtaining corresponding task fractionation machine code includes:
The host node reads the first configuration file, has recorded in first configuration file and matches code pair with the task point
The Java keyword and non-Java keyword answered；
The host node reads the second configuration file, and the function with the Java keyword is had recorded in second configuration file
Energy；
The host node utilizes first configuration file, and the non-Java keyword that task in first database splits code is replaced
It is changed to corresponding Java keyword；
The host node splits the task after replacement keyword according to the function of Java keyword in second configuration file
Code conversion is that the task of Java is supported to split machine code, and the task of the support Java obtained after conversion is split machine code deposit
Second database.
5. the method according to claim 1, wherein the multiple load weights from node of the host node poll,
Obtaining the slave node adaptable with subtask by weight smoothing processing includes:
The host node according to described from the multiple present load weights from node of node identification poll, according to the present load
Weight selection is corresponding with subtask from node identification；
The host node is smoothed the corresponding present load weight of the slave node identification selected, utilizes smoothing processing
Result afterwards selects next subtask corresponding from node identification；
Multiple subtasks are sequentially allocated to corresponding from node by the host node according to the slave node identification selected.
6. a kind of business information query processing system, which is characterized in that the system comprises:
Host node generates query task for receiving the inquiry request of terminal transmission, and using the inquiry request；It is looked into described
Inquiry task is split as multiple subtasks；For any subtask in the multiple subtask, the multiple loads from node of poll
Weight obtains the slave node being adapted with the subtask by weight smoothing processing；
Corresponding business information is returned from node for being inquired according to the subtask；
The host node is also used to for multiple business information returned from node being packaged, and generates corresponding with the query task
Query result；The query result is back to terminal.
7. system according to claim 6, which is characterized in that the host node is also used to obtain multiple preset query conditions
Corresponding priority；According to the level order and preset query condition of priority, query task is split, is generated multiple
Subtask；Record the quantity of subtask and the task identification of each subtask.
8. system according to claim 6, which is characterized in that the host node is also used to obtain a variety of default fractionation rules
Corresponding task splits code；Code is split to the task to be compiled, and is obtained corresponding task and is split machine code；Call institute
It states task and splits machine code, machine code is split by the task, the query task is split, obtain multiple subtasks.
9. a kind of computer equipment, including memory and processor, the memory are stored with computer program, feature exists
In the step of processor realizes any one of claims 1 to 5 the method when executing the computer program.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The step of method described in any one of claims 1 to 5 is realized when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811086482.1A CN109492017B (en) | 2018-09-18 | 2018-09-18 | Service information query processing method, system, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811086482.1A CN109492017B (en) | 2018-09-18 | 2018-09-18 | Service information query processing method, system, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109492017A true CN109492017A (en) | 2019-03-19 |
| CN109492017B CN109492017B (en) | 2024-01-12 |
Family
ID=65690675
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811086482.1A Active CN109492017B (en) | 2018-09-18 | 2018-09-18 | Service information query processing method, system, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109492017B (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110765157A (en) * | 2019-09-06 | 2020-02-07 | 中国平安财产保险股份有限公司 | Data query method and device, computer equipment and storage medium |
| CN111444445A (en) * | 2020-03-25 | 2020-07-24 | 平安医疗健康管理股份有限公司 | Data transmission method, system, computer equipment and readable storage medium |
| CN111784318A (en) * | 2020-06-29 | 2020-10-16 | 京东数字科技控股有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN111858585A (en) * | 2020-06-30 | 2020-10-30 | 深圳幂度信息科技有限公司 | Block chain strategy processing device, computer readable storage medium and terminal equipment |
| CN111858656A (en) * | 2020-07-21 | 2020-10-30 | 威讯柏睿数据科技(北京)有限公司 | Static data query method and device based on distributed architecture |
| CN111858657A (en) * | 2020-07-21 | 2020-10-30 | 威讯柏睿数据科技(北京)有限公司 | Method and equipment for accelerating data parallel query based on high-frequency data processing |
| CN111930770A (en) * | 2020-07-15 | 2020-11-13 | 北京金山云网络技术有限公司 | Data query method and device and electronic equipment |
| CN112347256A (en) * | 2020-11-06 | 2021-02-09 | 中国平安人寿保险股份有限公司 | Method, device, equipment and storage medium for running task |
| CN113342532A (en) * | 2021-06-25 | 2021-09-03 | 深圳前海微众银行股份有限公司 | Zookeeper-based distributed task scheduling method and system |
| CN113806575A (en) * | 2021-08-05 | 2021-12-17 | 北京房江湖科技有限公司 | Method and device for obtaining picture information in warehouse splitting |
| CN115297122A (en) * | 2022-09-29 | 2022-11-04 | 数字江西科技有限公司 | Government affair operation and maintenance method and system based on load automatic monitoring |
| CN117808602A (en) * | 2024-03-01 | 2024-04-02 | 联动优势电子商务有限公司 | Hot account billing method and related device based on sub-account expansion |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101464884A (en) * | 2008-12-31 | 2009-06-24 | 阿里巴巴集团控股有限公司 | Distributed task system and data processing method using the same |
| CN102467415A (en) * | 2010-11-03 | 2012-05-23 | 大唐移动通信设备有限公司 | Service facade task processing method and equipment |
| CN102479225A (en) * | 2010-11-26 | 2012-05-30 | 中国移动通信集团四川有限公司 | Distributed data analyzing and processing method and system |
| CN106407190A (en) * | 2015-07-27 | 2017-02-15 | 阿里巴巴集团控股有限公司 | Event record querying method and device |
| CN108156236A (en) * | 2017-12-22 | 2018-06-12 | 平安养老保险股份有限公司 | Service request processing method, device, computer equipment and storage medium |
| CN108156235A (en) * | 2017-12-22 | 2018-06-12 | 平安养老保险股份有限公司 | Online verification method, apparatus, computer equipment and storage medium |
-
2018
- 2018-09-18 CN CN201811086482.1A patent/CN109492017B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101464884A (en) * | 2008-12-31 | 2009-06-24 | 阿里巴巴集团控股有限公司 | Distributed task system and data processing method using the same |
| CN102467415A (en) * | 2010-11-03 | 2012-05-23 | 大唐移动通信设备有限公司 | Service facade task processing method and equipment |
| CN102479225A (en) * | 2010-11-26 | 2012-05-30 | 中国移动通信集团四川有限公司 | Distributed data analyzing and processing method and system |
| CN106407190A (en) * | 2015-07-27 | 2017-02-15 | 阿里巴巴集团控股有限公司 | Event record querying method and device |
| CN108156236A (en) * | 2017-12-22 | 2018-06-12 | 平安养老保险股份有限公司 | Service request processing method, device, computer equipment and storage medium |
| CN108156235A (en) * | 2017-12-22 | 2018-06-12 | 平安养老保险股份有限公司 | Online verification method, apparatus, computer equipment and storage medium |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110765157A (en) * | 2019-09-06 | 2020-02-07 | 中国平安财产保险股份有限公司 | Data query method and device, computer equipment and storage medium |
| CN110765157B (en) * | 2019-09-06 | 2024-02-02 | 中国平安财产保险股份有限公司 | Data query method, device, computer equipment and storage medium |
| CN111444445A (en) * | 2020-03-25 | 2020-07-24 | 平安医疗健康管理股份有限公司 | Data transmission method, system, computer equipment and readable storage medium |
| CN111784318A (en) * | 2020-06-29 | 2020-10-16 | 京东数字科技控股有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN111858585A (en) * | 2020-06-30 | 2020-10-30 | 深圳幂度信息科技有限公司 | Block chain strategy processing device, computer readable storage medium and terminal equipment |
| CN111930770A (en) * | 2020-07-15 | 2020-11-13 | 北京金山云网络技术有限公司 | Data query method and device and electronic equipment |
| CN111858657A (en) * | 2020-07-21 | 2020-10-30 | 威讯柏睿数据科技(北京)有限公司 | Method and equipment for accelerating data parallel query based on high-frequency data processing |
| CN111858657B (en) * | 2020-07-21 | 2022-02-22 | 威讯柏睿数据科技(北京)有限公司 | Method and equipment for accelerating data parallel query based on high-frequency data processing |
| CN111858656A (en) * | 2020-07-21 | 2020-10-30 | 威讯柏睿数据科技(北京)有限公司 | Static data query method and device based on distributed architecture |
| CN112347256A (en) * | 2020-11-06 | 2021-02-09 | 中国平安人寿保险股份有限公司 | Method, device, equipment and storage medium for running task |
| CN113342532A (en) * | 2021-06-25 | 2021-09-03 | 深圳前海微众银行股份有限公司 | Zookeeper-based distributed task scheduling method and system |
| CN113806575A (en) * | 2021-08-05 | 2021-12-17 | 北京房江湖科技有限公司 | Method and device for obtaining picture information in warehouse splitting |
| CN113806575B (en) * | 2021-08-05 | 2024-02-20 | 贝壳找房(北京)科技有限公司 | Picture information acquisition method and device in warehouse splitting |
| CN115297122A (en) * | 2022-09-29 | 2022-11-04 | 数字江西科技有限公司 | Government affair operation and maintenance method and system based on load automatic monitoring |
| CN117808602A (en) * | 2024-03-01 | 2024-04-02 | 联动优势电子商务有限公司 | Hot account billing method and related device based on sub-account expansion |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109492017B (en) | 2024-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109492017A (en) | Business information inquiry processing method, system, computer equipment and storage medium | |
| CN108958796B (en) | Service request processing method and device and service request processing system | |
| US6011917A (en) | Method and computer system for generating process management computer programs from process models | |
| CN109788031A (en) | Business datum acquisition methods, device, computer equipment and storage medium | |
| CN109614227A (en) | Task resource concocting method, device, electronic equipment and computer-readable medium | |
| Song et al. | Powerinfer: Fast large language model serving with a consumer-grade gpu | |
| CN116911588A (en) | Business process execution method, device, equipment and storage medium | |
| CN110457401A (en) | Date storage method, device, computer equipment and storage medium | |
| Amoretti et al. | Efficient autonomic cloud computing using online discrete event simulation | |
| US9323509B2 (en) | Method and system for automated process distribution | |
| Cai et al. | Deployment and verification of machine learning tool-chain based on kubernetes distributed clusters: This paper is submitted for possible publication in the special issue on high performance distributed computing | |
| CN111966744B (en) | Workflow deployment method and device, computer equipment and storage medium | |
| CN112363804B (en) | Blockchain JVM application method, device and storage medium | |
| US11886460B2 (en) | Multiple version data cluster ETL processing | |
| CN112650502A (en) | Batch processing task processing method and device, computer equipment and storage medium | |
| Lazovik et al. | Runtime modifications of spark data processing pipelines | |
| CN113918290A (en) | API calling method and device | |
| US20170075736A1 (en) | Rule engine for application servers | |
| Thor et al. | Cloudfuice: A flexible cloud-based data integration system | |
| WO2021040582A1 (en) | Methods and apparatuses for providing a function as a service platform | |
| KR20070009777A (en) | System and method for managing object | |
| CN113806011B (en) | Cluster resource control method and device, cluster and computer readable storage medium | |
| EP4155918A1 (en) | A method and apparatus for isolated execution of computer code with a native code portion | |
| JPH0877118A (en) | Distributed processor and process execution method | |
| US20090019159A1 (en) | Transparently externalizing plug-in computation to cluster |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |