CN113918662A - Data processing method and device, storage medium and electronic equipment - Google Patents

Data processing method and device, storage medium and electronic equipment Download PDF

Info

Publication number
CN113918662A
CN113918662A CN202111198164.6A CN202111198164A CN113918662A CN 113918662 A CN113918662 A CN 113918662A CN 202111198164 A CN202111198164 A CN 202111198164A CN 113918662 A CN113918662 A CN 113918662A
Authority
CN
China
Prior art keywords
message
business
link
message queue
links
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202111198164.6A
Other languages
Chinese (zh)
Inventor
邱明明
张栋芳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jingdong Technology Holding Co Ltd
Original Assignee
Jingdong Technology Holding Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Jingdong Technology Holding Co Ltd filed Critical Jingdong Technology Holding Co Ltd
Priority to CN202111198164.6A priority Critical patent/CN113918662A/en
Publication of CN113918662A publication Critical patent/CN113918662A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/284Relational databases
    • G06F16/288Entity relationship models
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2458Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2465Query processing support for facilitating data mining operations in structured databases
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/248Presentation of query results
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/25Integrating or interfacing systems involving database management systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • GPHYSICS
    • G08SIGNALLING
    • G08BSIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B21/00Alarms responsive to a single specified undesired or abnormal condition and not otherwise provided for
    • G08B21/18Status alarms
    • G08B21/182Level alarms, e.g. alarms responsive to variables exceeding a threshold

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Fuzzy Systems (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Software Systems (AREA)
  • Computing Systems (AREA)
  • Business, Economics & Management (AREA)
  • Emergency Management (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The application discloses a data processing method, a data processing device, a storage medium and electronic equipment, wherein business links with dependency relationships in each business link are determined, the dependency relationships are used for representing the relationship that the change of one business link in two business links affects the other business link, the target message quantity corresponding to message queue messages of the business links with the dependency relationships is obtained, the target message quantity is used for indicating the service backlog quantity of the two business links with the dependency relationships, and if the target message quantity is larger than a preset threshold value, alarm information is generated and displayed. By the scheme, various business links in the whole business process are monitored in real time, and if any business link in the whole business process has a business overstock condition, corresponding real-time alarm information is generated, so that the accuracy of alarm data is improved. In addition, in the monitoring process, operations such as buried point development, testing, online verification and the like do not need to be carried out in each process link, and labor cost and maintenance cost are reduced.

Description

Data processing method and device, storage medium and electronic equipment
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a data processing method and apparatus, a storage medium, and an electronic device.
Background
With the rise of the internet era, various products such as cash credits and financing products are derived. With the continuous iterative development of services, the complexity of products is higher and higher, and the accurate alarm mode for monitoring service loops on various asynchronous processes is particularly important.
The existing service loop monitoring needs each service product line, code intrusive type point burying is carried out in each link, for example, 10 nodes on a link need to be monitored, code intrusive type programming needs to be carried out on the 10 nodes, code intrusive type programming needs to carry out a series of operations of point burying development, testing, online verification and verification in each process link, and the code intrusive type programming development cost is high, so that the labor cost and the maintenance cost are high. And the service loop monitoring is based on the probe mode method level monitoring, the underlying framework based on the probe mode method level monitoring and the like, so that the possibility of data loss is caused, the condition of inaccurate data exists in the service loop monitoring, and the generated alarm data is inaccurate when the service loop monitoring is abnormal.
Therefore, labor cost and maintenance cost of service loop monitoring on the existing asynchronous flow are high, and accuracy of alarm data generated by the service loop monitoring is low.
Disclosure of Invention
In view of this, the present application discloses a data processing method, an apparatus, a storage medium and an electronic device, which are intended to improve accuracy of alarm data in a whole business process and reduce labor cost and maintenance cost.
In order to achieve the purpose, the technical scheme is as follows:
a first aspect of the present application discloses a data processing method, including:
determining business links with dependency relationships in all business links; the dependency relationship is used for representing the relationship that the change of one business link in the two business links influences the other business link;
acquiring the number of target messages corresponding to the message queue messages of the business links with the dependency relationship; the target message quantity is used for indicating the service backlog quantity of two service links with the dependency relationship;
and if the number of the target messages is larger than a preset threshold value, generating first alarm information and displaying the first alarm information.
Preferably, after the obtaining of the number of target messages corresponding to the message queue message of the business link having the dependency relationship, the method further includes:
storing the message queue message into a preset database;
the process of storing the message queue message to a preset database comprises the following steps:
determining a time dimension corresponding to the message queue message;
and storing the message queue message into a preset database corresponding to the time dimension.
Preferably, the obtaining of the number of target messages corresponding to the message queue message of the business link having the dependency relationship includes:
inquiring the preset database to obtain a first message queue message and a second message queue message of two business links with the dependency relationship;
and performing difference calculation on the second message quantity corresponding to the second message queue message and the first message quantity corresponding to the first message queue message to obtain the target message quantity corresponding to the message queue message of the business link with the dependency relationship.
Preferably, the method further comprises the following steps:
executing processing operation when the first alarm information is received; the processing operation includes at least one or more of a demotion operation, a locking operation, and an interception operation.
Preferably, before the determining the business links with dependencies among the business links, the method further includes:
and acquiring the message queue message of each service link.
Preferably, the method further comprises the following steps:
configuring each alarm threshold corresponding to each business link;
and if the message quantity of the message queue messages of each business link is smaller than the corresponding alarm threshold value, generating second alarm information.
A second aspect of the present application discloses a data processing apparatus, the apparatus comprising:
the determining unit is used for determining the business links with dependency relationship in each business link; the dependency relationship is used for representing the relationship that the change of one business link in the two business links influences the other business link;
the first obtaining unit is used for obtaining the number of target messages corresponding to the message queue messages of the business links with the dependency relationship; the target message quantity is used for indicating the service backlog quantity of two service links with the dependency relationship;
and the first generating unit is used for generating and displaying first alarm information if the number of the target messages is larger than a preset threshold value.
Preferably, the method further comprises the following steps:
the storage unit is used for storing the message queue message into a preset database;
the memory cell includes:
a determining module, configured to determine a time dimension corresponding to the message queue message;
and the storage module is used for storing the message queue message into a preset database corresponding to the time dimension.
A third aspect of the present application discloses a storage medium, which includes stored instructions, and when the instructions are executed, the storage medium controls a device in which the storage medium is located to execute the data processing method according to any one of the first aspect.
A fourth aspect of the present application discloses an electronic device comprising a memory, and one or more instructions, wherein the one or more instructions are stored in the memory and configured to be executed by the one or more processors to perform the data processing method according to any one of the first aspect.
According to the technical scheme, the data processing method, the data processing device, the data processing storage medium and the electronic equipment are used for determining business links with dependency relationships in all business links, the dependency relationships are used for representing the relationship that the change of one business link affects the other business link in two business links, the target message quantity corresponding to the message queue messages of the business links with the dependency relationships is obtained, the target message quantity is used for indicating the service backlog quantity of the two business links with the dependency relationships, and if the target message quantity is larger than a preset threshold value, alarm information is generated and displayed. By the scheme, various business links in the whole business process are monitored in real time, and if any business link in the whole business process has a business overstock condition, corresponding real-time alarm information is generated, so that the accuracy of alarm data is improved. In addition, in the monitoring process, operations such as buried point development, testing, online verification and the like do not need to be carried out in each process link, and labor cost and maintenance cost are reduced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
FIG. 1 is a block diagram of a data processing system according to an embodiment of the present disclosure;
fig. 2 is a schematic flow chart of a data processing method disclosed in an embodiment of the present application;
FIG. 3 is a diagram illustrating an embodiment of a message queue storing messages to a predetermined database;
fig. 4 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In this application, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
As known from the background art, the labor cost and the maintenance cost of service loop monitoring in the existing asynchronous process are high, and the accuracy of alarm data generated by the service loop monitoring is low.
In order to solve the above problems, embodiments of the present application disclose a data processing method, an apparatus, a storage medium, and an electronic device, which monitor various service links in the entire service flow in real time, and generate corresponding real-time alarm information if any one service link in the entire service flow has a service backlog condition, so as to improve accuracy of alarm data. In addition, in the monitoring process, a series of operations of point burying development, testing, online verification and verification are not required to be carried out in each process link, and labor cost and maintenance cost are reduced. The specific implementation is illustrated by the following examples.
Referring to fig. 1, an architecture diagram of a data processing system (loop monitoring architecture) disclosed in an embodiment of the present application includes a marketing system 11, a transaction system 12, an mq1 interface, an mq2 interface, a message middleware 13, a Flink real-time computing platform 14, a Habase database 15, an index platform 16, a query presentation module 17, an alarm monitoring module 18, and a user behavior analysis module 19, where a query manner of the query presentation module 17 includes a PC web page, an APP, and a graph, and functions of the alarm monitoring module 18 include an analysis function, a monitoring function, an alarm function, a T + N report function, and a data engine aviator function.
The marketing system 11, the transaction system 12 and other business systems interact data with the interface such as the mq1 interface and the mq2 interface through the message middleware 13.
The data is used by inquiring the data in the modules such as the display module 17, the alarm monitoring module 18 and the user behavior analysis module 19.
The marketing system 11 is used for providing an operation tool and a system service for performing user operation, promoting transactions, and further promoting receipts. When the user pays at the cash register, the user can pay the principal fee or pay the fee or other fees generated by the bill amount.
The transaction system 12 is used for providing a series of interface implementations for the user to display and implement transaction functions on the front-end page.
The index platform 16 is used for mainly including management functions of unifying index definition, unifying index caliber, unifying data models and the like, eliminating index data ambiguity through unified management of indexes, and meanwhile, realizing rapid application, monitoring and early warning and the like of index data, avoiding data chimney type construction and saving company resources.
The user behavior analysis module 19 is used for analyzing the behavior of the user in each link of user transaction, transaction flow and the like, and is used for operation.
The T + N report function is used for data analysis, and the management layer makes decision reference.
The data engine navigator function is used for a high-performance and light-weight expression evaluation engine realized by java language, and is mainly used for dynamic evaluation of various expressions.
The Habase database 15 is used for storing message queue messages of all business links.
Among these, HBASE database 15 is a distributed, column-oriented open source database, and this technology is derived from the Google paper "Bigtable: a distributed storage system of structured data. Just as Bigtable takes advantage of the distributed data storage provided by the Google File System (File System), the hbsase database 15 provides Bigtable-like capabilities over Hadoop. The HBASE database 15 is a child of the Hadoop entry of Apache. The HBASE database 15 is a database suitable for unstructured data storage, unlike a general relational database. Another difference is that the HBASE database 15 is based on a column rather than a row based pattern.
The query presentation module 17 queries the Habase database 15, and obtains the message number of the first message queue message based on the mq1 interface; the message quantity of the second message queue message is obtained based on the mq2 interface by querying the Habase database 15.
The Message Queue (MQ) Message is a data structure of "first-in first-out" in the basic data structure. The method is generally used for solving the problems of application decoupling, asynchronous messages, flow peak clipping and the like, and realizes a high-performance, high-availability, scalable and final consistency framework.
The data processing system determines business links with dependency relationship in each business link; the dependency relationship is used for representing the relationship that the change of one business link in the two business links influences the other business link.
Acquiring the number of target messages corresponding to the message queue messages of the business links with the dependency relationship through a Flink real-time computing platform 14; the target message quantity is used for indicating the backlog quantity of the business in two business links with dependency relationship.
The Flink real-time computing platform 14 performs difference computation on the second message quantity corresponding to the second message queue message and the first message quantity corresponding to the first message queue message to obtain the target message quantity corresponding to the message queue message of the business link with the dependency relationship.
The Flink real-time computing platform 14 is a distributed processing engine for streaming data and batch data, the code is mainly implemented by Java, and part of the code is Scala. It can handle bounded batch datasets as well as unbounded real-time datasets. For Flink, the main scene to be processed is stream data, and batch data is only a limit special case of the stream data, so the Flink real-time computing platform 14 is also a stream batch unified computing engine. The data focus is a data index management platform, mainly comprises management functions of unified index definition, unified index caliber, unified data model and the like, eliminates ambiguity of index data through unified management of indexes, can realize quick application, monitoring and early warning and the like of the index data, avoids data chimney type construction, and saves company resources.
Resources are limited, and in order to better allocate resources, hierarchical management needs to be performed according to the influence of the resources on the importance of the e-commerce services from the perspective of the e-commerce services, so as to preferentially ensure a system with high priority. The basic hierarchy definition is shown in table 1.
Figure BDA0003303889530000061
Figure BDA0003303889530000071
TABLE 1
If the number of the target messages is larger than the preset threshold value, first alarm information is generated and displayed through the alarm monitoring module 17.
The preset threshold may be 100 or 150, and the specific preset threshold is determined by a technician according to an actual situation, and the application is not particularly limited.
And configuring each alarm threshold corresponding to each business link, and if the message quantity of the message queue message of each business link is less than the corresponding alarm threshold, generating second alarm information through the alarm monitoring module 17.
The determination of each alarm threshold is set according to the actual situation of each service link, and the application is not specifically limited.
When receiving alarm information, executing alarm processing operation through the alarm monitoring module 17; the alarm handling operations include at least one or more of a downgrade operation, a lock operation, and an intercept operation.
In the embodiment of the application, various business links in the whole business process are monitored in real time, and if any business link in the whole business process has a business overstock condition, corresponding real-time alarm information is generated, so that the accuracy of alarm data is improved. In addition, in the monitoring process, a series of operations of point burying development, testing, online verification and verification are not required to be carried out in each process link, and labor cost and maintenance cost are reduced.
Referring to fig. 2, a schematic flow chart of a data processing method disclosed in an embodiment of the present application is shown, where the data processing method is applied to the data processing system in fig. 1 in the above embodiment, and the data processing method mainly includes the following steps:
s201: and acquiring the message queue message of each service link.
In S201, message queue information, that is, mq messages, sent by each business link in a Structured Query Language (SQL) consumption business system is obtained.
Wherein, the message queue is a data structure of 'first-in first-out' in the basic data structure. The method is generally used for solving the problems of application decoupling, asynchronous messages, flow peak clipping and the like, and realizes a high-performance, high-availability, scalable and final consistency framework.
Monitoring the access of various service mq messages is adopted, no code is invaded to an SQL consumption service system, and the abnormal condition of the service can be monitored in real time.
Each business link comprises a loan application link, a limit deduction link, a repayment plan generation link, a financing link, a payment withholding link and the like.
And (4) the mq messages generated by each link are consumed through a preset data operation platform and are stored in an HBASE database.
Optionally, the message queue message is stored in a preset database.
The process of storing the message queue message in the preset database is as follows:
first, a time dimension corresponding to a message queue message is determined.
The time dimension may be different time dimensions such as minutes, hours, days, etc.
And then, storing the message queue message into a preset database corresponding to the time dimension.
The preset database may be an HBASE database or other types of databases, the determination of the preset database is set by a technician according to actual conditions, and the preset database is preferably the HBASE database.
The HABASE database includes the HABASE database in the time dimension of hours, the HABASE database in the time dimension of minutes, and the HABASE database in the time dimension of days.
In particular, refer to fig. 3 for a process of storing a message queue message in a preset database.
In fig. 3, JIMQ 2: it _ itroan _ success is a funding success entry, JIMQ 2: the plan generation success entry is xjd _ it _ d _ lan _ success is a new table built on the real-time computing platform, mq funding success messages are stored, xjd _ it _ d _ plan _ success is a new table built on the real-time computing platform, mq staging success messages are stored, 326ffc4031b17bc3f45789f6724efd98 is a processing funding success message operation, 5b87f9d163b79fe0 567 d008cb7f e is a processing staging success message operation, aa2104a4621619b597d785cc73290c6a is a processing process for the results of the above two message operations, xjd _ it _ d _ plan _ day is a time dimension in days, xjd _ it _ d _ plan _ success _ task _ date is a time dimension in hours, and bas _ it _ d _ 4 _ plan _ task _ day is a time dimension in hours, and bas _ it _ d _ plan _ success _ day is a time dimension in hours, and bas _ it _ d _ 4 minutes is a time dimension in hours: data service: data _ focus _ rt _ index _ day is a database of HABASE with a time dimension of days, HABASE: data service: data _ focus _ rt _ index _ hours is a database of HABASE with time dimension of hours, HABASE: data service: data _ focus _ rt _ index _ min is a database of HABASE with a time dimension of minutes.
For convenience of understanding the processes of the processing funding success message operation, the processing staging success message operation, and the processing of the results of the above two message operations, the following description is given by way of example:
for example, 326ffc4031b17bc3f45789f6724efd98 is a processing funding success message operation, data after processing, and the number of consumed mq at this time is 500; 5b87f9d163b79fe0aee4d008cb7f661e is a machining staging success message operation, the number of consumed mq is 1000 at this time, aa2104a4621619b597d785cc73290c6a is the machining processing of the two operation results after machining, 1000-.
By JIMQ 2: the it _ itroan _ success link and JIMQ 2: and an it _ place _ success link, namely processing the operation with the name of gold stripe borrowing, staging, successful funding, and then respectively storing the processed operation into HBASE databases (HABASE: data _ focus _ rt _ index _ day, HABASE: data _ focus _ rt _ index _ source, and HABASE: data _ focus _ index _ source) corresponding to the time dimension through operation scripts according to different time dimensions (xjd _ it _ d _ place _ success _ day, xjd _ it _ d _ place _ success _ source, and xjd _ it _ d _ place _ success _ min).
For the convenience of understanding the operation details of the job, the description is made here by way of example.
The job execution content includes ID1, ID0, and ID 2.
In the ID1 operation situation, the concurrency is 1, the system Throughput (TPS) is 23.20 pieces/second, the traffic delay is 50.87s, there is no computation time consumption, the input queue is 0.00%, and the output queue is 2.78%.
In the running condition of the ID0, the concurrency is 1, the TPS is 23.07 pieces/second, the service delay is 51.98s, no calculation is consumed, the input queue is 0.00%, and the output queue is 2.78%.
In the running condition of the ID2, the concurrency is 1, the TPS is 11.57 pieces/second, no service delay exists, no calculation time is consumed, the input queue is 0.00%, and the output queue is 0.00%.
S202: determining business links with dependency relationships in all business links; the dependency relationship is used for representing the relationship that the change of one business link in the two business links influences the other business link.
In S202, there is a business link with a dependency relationship, for example, there is a dependency relationship between the borrowing applying link and the line deducting link, and there is a dependency relationship between the funding link and the payment-taking-over link.
If the paying link is unsuccessful, the paying link can not be executed, so that the paying link and the paying link have dependence relationship, and the paying link depends on the paying link.
S203: acquiring the number of target messages corresponding to message queue messages of a business link with a dependency relationship; the target message quantity is used for indicating the backlog quantity of the business in two business links with dependency relationship.
In S203, the number of message queue messages of the two business links having dependency is counted, and the number of message queue messages of the two business links having dependency is subjected to difference calculation to obtain the number of target messages.
Specifically, the process of acquiring the number of target messages corresponding to the message queue message of the business link with the dependency relationship is as follows:
firstly, a preset database is inquired to obtain a first message queue message and a second message queue message of two business links with dependency relationship.
To facilitate understanding of the process of querying the predetermined database, the description is given by way of example.
For example, the data query function includes index coding, time granularity, time range, service dimension, upper limit of query number, table name, and the like.
Setting time granularity as minutes, setting time range from 2021-05-21 to 2021-05-2114:59, setting the upper limit of the number of query strips as 50, setting service dimensionality as all, and querying data to obtain query results.
The query result includes sequence number 1, sequence number 2, and sequence number 3. The time corresponding to sequence number 1 is 2021-05-2114:00, the key corresponding to sequence number 1 is 95c4897_ R _ B _000300_ ALL [ M ]202105211400, and the Value corresponding to sequence number 1 is-232; the time corresponding to sequence number 2 is 2021-05-2114:00, the key corresponding to sequence number 2 is 95c4897_ R _ B _000300_ ALL [ M ]20210521141, and the Value corresponding to sequence number 2 is-236; time corresponding to sequence number 3 is 2021-05-2114:00, key corresponding to sequence number 3 is 95c4897_ R _ B _000300_ ALL [ M ]202105211402, Value corresponding to sequence number 3 is-231.
And displaying the data values obtained by inquiring the HBASE database in a bar chart, a sector graph and other modes through different time dimensions.
And after the operation is stored in the HBASE database, inquiring the HBASE database to obtain an actual value (value) of the occurrence of the service, namely the service backlog quantity in two service links with a dependency relationship, and if the actual value is greater than a preset threshold value, performing alarm operation.
And then, performing difference calculation on the second message quantity corresponding to the second message queue message and the first message quantity corresponding to the first message queue message to obtain the target message quantity corresponding to the message queue message of the business link with the dependency relationship.
For convenience of understanding the process of obtaining the number of target messages corresponding to the message queue message of the business link having the dependency relationship, the description is given here by way of example.
For example, querying an HBASE database to obtain a funding link and a depreciation link with dependency relationship, wherein the number of first message queue messages generated by the funding link is 200, the number of second message queue messages generated by the depreciation link is 300, and the number of target messages corresponding to the message queue messages of the funding link and the depreciation link is 100 obtained by subtracting the number of the first message queue messages from the number of the second message queue messages.
S204: and if the number of the target messages is larger than a preset threshold value, generating first alarm information and displaying the first alarm information.
In S204, if the target message quantity is greater than the preset threshold, it is determined that the service quantities in the two service links corresponding to the target message quantity are backlogged, a first alarm message is generated, and the first alarm message is displayed in a manner of mail, short message, Application (APP) message, or the like.
The first alarm information is used for indicating alarm information generated when the number of the target messages is larger than a preset threshold value.
The number of the preset thresholds may be 200 or 300, and the specific preset threshold is determined by a technician according to an actual situation, which is not specifically limited in the present application.
The display mode may be a mail, a short message, etc., and the determination of the specific display mode is not specifically limited in the present application.
The scheme is that the whole business link is monitored, and when the nodes in each business link are overstocked, accurate monitoring alarm is provided.
Executing processing operation when the first alarm information is received; the processing operation includes at least one or more of a demotion operation, a locking operation, and an interception operation.
Optionally, each alarm threshold corresponding to each business link is configured, and if the number of messages in the message queue of each business link is smaller than the alarm threshold corresponding to the business link, second alarm information is generated.
The second alarm information is used for indicating that the message quantity of each business link is smaller than the alarm information generated by the corresponding alarm threshold.
Each alarm threshold corresponding to each business link is set by a technician according to the actual situation of each business link, and the application is not particularly limited.
For convenience of understanding, if the number of the message in the message queue of each service link is smaller than the alarm threshold corresponding to the message queue, the process of generating the second alarm information is described here by way of example.
For example, the number of alarm thresholds configured in the funding link is 1 minute 100, and the number of messages of the message queue messages generated in the funding link is 1 minute 80, that is, 1 minute 100 smaller than the configured alarm thresholds, to generate the second alarm information.
According to the scheme, the service loop monitoring alarm is realized in a code-free invasive mode, the development cost and the labor cost are saved, the service abnormity is timely discovered, and the production accidents are reduced so as to reduce the cost and reduce the risk of batch customer complaints.
In the embodiment of the application, various business links in the whole business process are monitored in real time, and if any business link in the whole business process has a business overstock condition, corresponding real-time alarm information is generated, so that the accuracy of alarm data is improved. In addition, in the monitoring process, operations such as buried point development, testing, online verification and the like do not need to be carried out in each process link, and labor cost and maintenance cost are reduced.
Based on the data processing method disclosed in fig. 2 in the foregoing embodiment, the embodiment of the present application also correspondingly discloses a data processing apparatus, which includes a determining unit 401, a first obtaining unit 402, and a first generating unit 403, as shown in fig. 4.
A determining unit 401, configured to determine a service link having a dependency relationship among the service links; the dependency relationship is used for representing the relationship that the change of one business link in the two business links influences the other business link.
A first obtaining unit 402, configured to obtain a target message quantity corresponding to a message queue message of a business link having a dependency relationship; the target message quantity is used for indicating the backlog quantity of the business in two business links with dependency relationship.
A first generating unit 403, configured to generate and display first alarm information if the number of target messages is greater than a preset threshold.
Further, the device also comprises a storage unit.
And the storage unit is used for storing the message queue message into a preset database.
Further, the storage unit comprises a determining module and a storage module.
And the determining module is used for determining the time dimension corresponding to the message queue message.
And the storage module is used for storing the message queue messages into a preset database corresponding to the time dimension.
Further, the first obtaining unit 402 includes a query module and a calculation module.
And the query module is used for querying a preset database to obtain a first message queue message and a second message queue message of two business links with dependency relationship.
And the calculating module is used for performing difference calculation on the second message quantity corresponding to the second message queue message and the first message quantity corresponding to the first message queue message to obtain the target message quantity corresponding to the message queue message of the business link with the dependency relationship.
Furthermore, the system also comprises an execution unit.
The execution unit is used for executing processing operation when the first alarm information is received; the processing operation includes at least one or more of a demotion operation, a locking operation, and an interception operation.
Further, the device also comprises a second acquisition unit.
And the second acquisition unit is used for acquiring the message queue message of each service link.
Further, the device also comprises a configuration unit and a second generation unit.
And the configuration unit is used for configuring each alarm threshold corresponding to each service link.
And the second generating unit is used for generating second alarm information if the message quantity of the message queue messages of each business link is smaller than the corresponding alarm threshold value.
In the embodiment of the application, various business links in the whole business process are monitored in real time, and if any business link in the whole business process has a business overstock condition, corresponding real-time alarm information is generated, so that the accuracy of alarm data is improved. In addition, in the monitoring process, a series of operations of point burying development, testing, online verification and verification are not required to be carried out in each process link, and labor cost and maintenance cost are reduced.
The embodiment of the application also provides a storage medium, which comprises stored instructions, wherein when the instructions are executed, the device where the storage medium is located is controlled to execute the data processing method.
The embodiment of the present application further provides an electronic device, which has a schematic structural diagram as shown in fig. 5, and specifically includes a memory 501 and one or more instructions 502, where the one or more instructions 502 are stored in the memory 501, and are configured to be executed by one or more processors 503 to perform the data processing method.
The specific implementation procedures and derivatives thereof of the above embodiments are within the scope of the present invention.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, the system or system embodiments are substantially similar to the method embodiments and therefore are described in a relatively simple manner, and reference may be made to some of the descriptions of the method embodiments for related points. The above-described system and system embodiments are only illustrative, wherein the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.

Claims (10)

1. A method of data processing, the method comprising:
determining business links with dependency relationships in all business links; the dependency relationship is used for representing the relationship that the change of one business link in the two business links influences the other business link;
acquiring the number of target messages corresponding to the message queue messages of the business links with the dependency relationship; the target message quantity is used for indicating the service backlog quantity of two service links with the dependency relationship;
and if the number of the target messages is larger than a preset threshold value, generating first alarm information and displaying the first alarm information.
2. The method according to claim 1, wherein after the obtaining of the number of target messages corresponding to the message queue messages of the business link having the dependency relationship, the method further comprises:
storing the message queue message into a preset database;
the process of storing the message queue message to a preset database comprises the following steps:
determining a time dimension corresponding to the message queue message;
and storing the message queue message into a preset database corresponding to the time dimension.
3. The method according to claim 2, wherein the obtaining of the number of target messages corresponding to the message queue message of the business link having the dependency relationship comprises:
inquiring the preset database to obtain a first message queue message and a second message queue message of two business links with the dependency relationship;
and performing difference calculation on the second message quantity corresponding to the second message queue message and the first message quantity corresponding to the first message queue message to obtain the target message quantity corresponding to the message queue message of the business link with the dependency relationship.
4. The method of claim 1, further comprising:
executing processing operation when the first alarm information is received; the processing operation includes at least one or more of a demotion operation, a locking operation, and an interception operation.
5. The method of claim 1, prior to determining the business links with dependencies among the business links, further comprising:
and acquiring the message queue message of each service link.
6. The method of claim 5, further comprising:
configuring each alarm threshold corresponding to each business link;
and if the message quantity of the message queue messages of each business link is smaller than the corresponding alarm threshold value, generating second alarm information.
7. A data processing apparatus, characterized in that the apparatus comprises:
the determining unit is used for determining the business links with dependency relationship in each business link; the dependency relationship is used for representing the relationship that the change of one business link in the two business links influences the other business link;
the first obtaining unit is used for obtaining the number of target messages corresponding to the message queue messages of the business links with the dependency relationship; the target message quantity is used for indicating the service backlog quantity of two service links with the dependency relationship;
and the first generating unit is used for generating and displaying first alarm information if the number of the target messages is larger than a preset threshold value.
8. The apparatus of claim 7, further comprising:
the storage unit is used for storing the message queue message into a preset database;
the memory cell includes:
a determining module, configured to determine a time dimension corresponding to the message queue message;
and the storage module is used for storing the message queue message into a preset database corresponding to the time dimension.
9. A storage medium comprising stored instructions, wherein the instructions, when executed, control a device on which the storage medium resides to perform a data processing method according to any one of claims 1 to 6.
10. An electronic device comprising a memory, and one or more instructions, wherein the one or more instructions are stored in the memory and configured to be executed by the one or more processors to perform the data processing method of any one of claims 1 to 6.
CN202111198164.6A 2021-10-14 2021-10-14 Data processing method and device, storage medium and electronic equipment Pending CN113918662A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111198164.6A CN113918662A (en) 2021-10-14 2021-10-14 Data processing method and device, storage medium and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111198164.6A CN113918662A (en) 2021-10-14 2021-10-14 Data processing method and device, storage medium and electronic equipment

Publications (1)

Publication Number Publication Date
CN113918662A true CN113918662A (en) 2022-01-11

Family

ID=79240569

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111198164.6A Pending CN113918662A (en) 2021-10-14 2021-10-14 Data processing method and device, storage medium and electronic equipment

Country Status (1)

Country Link
CN (1) CN113918662A (en)

Similar Documents

Publication Publication Date Title
US11100435B2 (en) Machine learning artificial intelligence system for predicting hours of operation
US11249981B2 (en) Data quality analysis
KR101989330B1 (en) Auditing of data processing applications
CN112686717B (en) Data processing method and system for advertisement recall
CN110866698A (en) Device for assessing service score of service provider
CN111897706A (en) Server performance prediction method, device, computer system and medium
US20210383263A1 (en) Systems and methods for estimating validation time for fraud detection rules
US20220291840A1 (en) Value-based replication of streaming data
CN112734227A (en) Big data decision system and method
CN110197316B (en) Method and device for processing operation data, computer readable medium and electronic equipment
CN115983902A (en) Information pushing method and system based on user real-time event
CN113918662A (en) Data processing method and device, storage medium and electronic equipment
CN115936875A (en) Financial product form hanging processing method and device
CN115168509A (en) Processing method and device of wind control data, storage medium and computer equipment
CN113094241A (en) Method, device and equipment for determining accuracy of real-time program and storage medium
CN112148491B (en) Data processing method and device
US20230385820A1 (en) Methods and Systems for Predicting Cash Flow
CN115545934A (en) Data processing method and device
WO2023229473A1 (en) Methods and systems for predicting cash flow
CN115984001A (en) Event stream processing method, event stream processing device, electronic device, medium, and program product
CN117033405A (en) Processing method and device of data probe request, processor and electronic equipment
CN112598422A (en) Transaction risk assessment method, system, device and storage medium
CN113435991A (en) Electronic invoice data processing method and device, electronic equipment and readable medium
CN116244285A (en) Multi-level configurable verification method and system based on supervision data management
CN115544142A (en) Enterprise level data management system and method

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