CN115048595A - Data acquisition method, device, terminal and storage medium - Google Patents
Data acquisition method, device, terminal and storage medium Download PDFInfo
- Publication number
- CN115048595A CN115048595A CN202210862488.3A CN202210862488A CN115048595A CN 115048595 A CN115048595 A CN 115048595A CN 202210862488 A CN202210862488 A CN 202210862488A CN 115048595 A CN115048595 A CN 115048595A
- Authority
- CN
- China
- Prior art keywords
- data
- target
- time
- real
- service
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0866—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches for peripheral storage systems, e.g. disk cache
- G06F12/0871—Allocation or management of cache space
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9538—Presentation of query results
-
- 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/54—Interprogram communication
- G06F9/544—Buffers; Shared memory; Pipes
-
- 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/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The embodiment of the application relates to the technical field of big data, and provides a data acquisition method, a device, a terminal and a storage medium. The second moment is greater than or equal to the first moment, namely the real-time data and the historical data are continuous or the real-time data and the historical data are overlapped, so that the finally obtained accumulated data cannot be lost, the data can be effectively prevented from being lost, and the completeness of data display is ensured.
Description
Technical Field
The present application relates to the field of big data technologies, and in particular, to a data acquisition method, an apparatus, a terminal, and a storage medium.
Background
With the development of internet technology, a large amount of data is often presented in the form of electronic data. In order to clearly and intuitively understand the development trend of a service, it is usually necessary to display the data of the service at each time point. For example, in an epidemic situation report, in order to make people intuitively know the local epidemic situation, the number of confirmed cases per day from the occurrence of the local epidemic needs to be displayed.
Generally, if a data presentation request of a user is received at time a, data at each time point before time a is acquired for presentation. However, acquiring data cannot be completed in a moment, and if data acquisition is completed and displayed at time B, if new data is generated between time a and time B, the acquired data is lost, and data display is incomplete.
Disclosure of Invention
An object of the embodiments of the present application is to provide a data acquisition method, an apparatus, a terminal, and a storage medium, which are used to avoid data missing in data display.
In order to achieve the above purpose, the embodiments of the present application employ the following technical solutions:
in a first aspect, an embodiment of the present application provides a data acquisition method, which is applied to a terminal, where the terminal includes at least one data presentation page, the data presentation page includes at least one display unit, and each display unit in the data presentation page is used to present data of a same service;
the method comprises the following steps:
responding to a data acquisition request of a target display unit, and acquiring real-time data of a target service corresponding to the target display unit from a first moment;
acquiring historical data of the target service at a second moment, wherein the second moment is greater than or equal to the first moment;
after the historical data are received, combining the historical data and the real-time data from the first moment to the receiving moment of the historical data to obtain the accumulated class data of the target service;
and distributing the accumulated class data to the target display unit so that the target display unit displays the accumulated class data.
Optionally, the terminal maintains a primary thread queue and a secondary thread queue, where the primary thread queue includes a plurality of primary threads, and the primary threads are used to distribute data to the data presentation page; the secondary thread queue comprises a plurality of secondary threads, and the secondary threads are used for distributing data to the display unit; the accumulated class data comprises a service identifier of the target service and a hash value of the target display unit;
the step of distributing the accumulated class data to the target display unit includes:
determining a primary target thread matched with the service identifier from the plurality of primary threads according to the service identifier of the target service;
distributing the accumulated class data to each secondary thread associated with the service identifier by using the primary target thread;
distributing the accumulated class data to the target display unit using a secondary thread that matches the hash value of the target display unit.
Optionally, the terminal maintains a plurality of linked lists, and one linked list is used for caching real-time data of one service; the terminal is in communication connection with a first server, and the first server is used for storing real-time data of each service; the data acquisition request comprises a service identifier of the target service;
the step of responding to the data acquisition request of the target display unit and acquiring real-time data of the target service corresponding to the target display unit from a first moment comprises the following steps:
responding to the data acquisition request, and calculating key value data corresponding to the target service according to the service identification of the target service;
searching whether a target linked list corresponding to the key value data exists according to the key value data;
if so, continuing to receive the real-time data of the target service pushed by the first server and caching the real-time data to the target linked list;
if not, applying for a target linked list corresponding to the key value data, subscribing real-time data of the target service from a first moment to the first server, receiving the real-time data of the target service pushed by the first server, and caching the real-time data to the target linked list.
Optionally, the target linked list includes a plurality of linked list nodes, and one linked list node is used for caching real-time data of the target service at one moment;
the step of receiving the real-time data of the target service pushed by the first server and caching the real-time data to the target linked list includes:
receiving real-time data of the target service pushed by the first server, wherein the real-time data comprises a first timestamp;
and sequentially caching the real-time data of the target service into each linked list node of the target linked list according to the sequence of the first timestamps.
Optionally, after receiving the historical data, the step of merging the historical data and the real-time data between the first time and the time of receiving the historical data to obtain the accumulated class data of the target service includes:
after the historical data are received, acquiring real-time data cached in the target linked list from the first moment to the receiving moment of the historical data, wherein the real-time data comprise a first time stamp, and the historical data comprise a second time stamp;
comparing the first time stamp with the second time stamp to determine real-time data which is not contained in the historical data;
and merging real-time data which are not contained in the historical data into the historical data to obtain the accumulated data.
Optionally, the target linked list includes a plurality of linked list nodes, and one linked list node is used for caching real-time data of the target service at one moment;
the step of obtaining the real-time data cached in the target linked list from the first time to the receiving time of the historical data includes:
determining a plurality of target linked list nodes caching real-time data between the first moment and the historical data receiving moment from the target linked list according to the first time stamp;
according to the sequence of the first time stamps, the cached real-time data of each target linked list node is taken out in sequence;
for each target linked list node, after the real-time data cached by the target linked list node is taken out, detecting whether other display units request the real-time data cached by the target linked list node exists or not;
if yes, keeping the cache of the target linked list node unchanged;
if not, releasing the target linked list nodes, and placing the idle target linked list nodes at the tail of the target linked list.
Optionally, the terminal is further communicatively connected to a second server, and the second server is configured to store history data of each service;
the step of obtaining the historical data of the target service at the second moment comprises the following steps:
responding to the data acquisition request, and requesting data from a second server by using the service identifier of the target service;
receiving historical data of the target service at a second moment sent by the second server;
or, the step of obtaining the historical data of the target service at the second moment includes:
when receiving the real-time data of the target service, requesting data from a second server by using the service identifier of the target service;
and receiving historical data of the target service at a second moment sent by the second server.
In a second aspect, an embodiment of the present application further provides a data obtaining apparatus, which is applied to a terminal, where the terminal includes at least one data presentation page, the data presentation page includes at least one display unit, and each display unit in the data presentation page is used for presenting data of a same service;
the device comprises:
the real-time data acquisition module is used for responding to a data acquisition request of a target display unit and acquiring real-time data of a target service corresponding to the target display unit from a first moment;
a historical data acquisition module, configured to acquire historical data of a second time when the target service is ended, where the second time is greater than or equal to the first time;
the data merging module is used for merging the historical data and real-time data between the first moment and the historical data receiving moment after receiving the historical data to obtain the accumulated data of the target service;
and the data distribution module is used for distributing the accumulated class data to the target display unit so as to enable the target display unit to display the accumulated class data.
In a third aspect, an embodiment of the present application further provides a terminal, including a processor and a memory, where the memory is used to store a program, and the processor is used to implement the data acquisition method in the first aspect when executing the program.
In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the data obtaining method in the first aspect.
Compared with the prior art, according to the data acquisition method, the data acquisition device, the terminal and the storage medium provided by the embodiment of the application, when a data acquisition request of a target display unit is received, the data acquisition request represents data of a target service which a user wants to view and is displayed by the target display unit, first, real-time data of the target service from a first moment is acquired, then, historical data of the target service at a second moment is acquired, and after the historical data is received, the historical data and the real-time data between the first moment and the receiving moment of the historical data are merged to obtain accumulated class data of the target service and are distributed to the target display unit for displaying. The second moment is greater than or equal to the first moment, namely the real-time data and the historical data are continuous or the real-time data and the historical data are overlapped, so that the finally obtained accumulated data cannot be lost, the data can be effectively prevented from being lost, and the completeness of data display is ensured.
Drawings
Fig. 1 shows an example diagram of a data acquisition process provided by the prior art.
Fig. 2 shows a schematic diagram of an application scenario provided in an embodiment of the present application.
Fig. 3 shows a first flowchart of a data acquisition method according to an embodiment of the present application.
Fig. 4 illustrates an exemplary view one of a data presentation page provided in an embodiment of the present application.
Fig. 5 shows an exemplary diagram ii of a data presentation page provided in an embodiment of the present application.
Fig. 6 shows an exemplary diagram of a data acquisition process provided in an embodiment of the present application.
Fig. 7 illustrates an example diagram i of a linked list provided in an embodiment of the present application.
Fig. 8 is a flowchart illustrating step S101 in the data acquisition method illustrated in fig. 3.
Fig. 9 shows a flowchart of a data acquisition method according to an embodiment of the present application.
Fig. 10 shows a third flowchart of a data acquisition method provided in the embodiment of the present application.
Fig. 11 illustrates an example of a linked list provided in an embodiment of the present application.
Fig. 12 is a diagram illustrating an example of a thread queue according to an embodiment of the present application.
Fig. 13 is a schematic block diagram illustrating a data acquisition apparatus according to an embodiment of the present application.
Fig. 14 shows a block diagram of a terminal according to an embodiment of the present application.
Icon: 100-a data acquisition device; 101-a real-time data acquisition module; 102-a historical data acquisition module; 103-a data merging module; 104-a data distribution module; 10-a terminal; 11-a processor; 12-a memory; 13-a bus; 20-a first server; 30-a second server.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application.
Data can be displayed in a data display page at the front end in a graphic image mode through data display, so that the effect of clearly and effectively transmitting and communicating information is achieved. Currently, market data has become key information concerned by enterprises and individuals, and the market data comprises data of a business at each time point, and can reflect the development trend of the business. For example, in the financial field, the change of market data (e.g., stocks, futures, funds, precious metals, foreign exchange, etc.) can reflect the market change in a certain field and is also the basis of user transactions, and therefore, it is an extremely important task to accurately and timely display market data.
Generally, in the presentation of the behavior data, if a data presentation request of a user is received at time a, data at each time point before time a is acquired for presentation. However, acquiring data cannot be completed in a moment, and if data acquisition is completed and displayed at time B, if new data is generated between time a and time B, the acquired data is lost, and data display is incomplete.
For example, in the market data display in the financial field, in order to help users make correct buying and selling decisions based on market data, accumulated class data is usually displayed, and the accumulated class data includes historical data and real-time data, the real-time data changes along with transaction commitment or transaction bargaining, and the historical data gradually increases along with the transaction bargaining. Therefore, when a data display request of a user is received, historical data and real-time data need to be acquired first.
In the prior art, a subscription push mode is generally adopted for acquiring real-time data, and an active request mode is generally adopted for acquiring historical data. To display the accumulated class data, the historical data is usually acquired first, and then the real-time data is subscribed. That is, at a certain time point, if a data display request of a user is received, generally, historical data before the time point is obtained first, and then real-time data is received in a subscription push manner. However, the acquisition of the history data cannot be completed in a moment, and new market data may be generated between the acquisition of the history data and the subscription of the real-time data, so that the acquired data may be missing, and the data display may be incomplete.
For example, referring to fig. 1, if a data display request of a user is received at time a, a historical data acquisition request is initiated, and the historical data is received at time B and the real-time data is subscribed, so that the pushed real-time data from time B can be received. Obviously, if new market data is generated between the time a and the time B, the data in the time interval from the time a to the time B is lost, and the data display is incomplete.
In order to solve the above problem, in the embodiment of the present application, when a data display request of a user is received, the real-time data from a first time is subscribed first, then the historical data up to a second time is acquired, and meanwhile, after the historical data is received, the historical data and the real-time data from the first time to the receiving time of the historical data are merged to obtain the accumulated data for displaying. Because the second time is greater than or equal to the first time, the finally obtained accumulated data cannot be lost, so that the data loss can be effectively avoided, and the completeness of data display is ensured.
As described in detail below.
Before describing the specific implementation of the embodiment of the present application, a possible application scenario is described. Referring to fig. 2, fig. 2 shows a schematic diagram of a possible application scenario, which includes a terminal 10, a first server 20, and a second server 30, wherein the terminal 10, the first server 20, and the second server 30 are connected through a network to implement data transmission between the terminal 10 and the first server 20, and between the terminal 10 and the second server 30.
The first server 20 is used to store real-time data of each service, and the second server 30 is used to store historical data of each service. The first server 20 and the second server 30 may be a single server or a server cluster, which is not limited in this embodiment.
The terminal 10 may be any one of a smart phone, a tablet computer, a notebook computer, a desktop computer, and the like, and the above devices may be used to implement the data acquisition method of the following embodiments.
The operating system run by the terminal 10 may include Android (Android), IOS, Windows phone, Windows, and the like. The terminal 10 may run a plurality of applications of different categories, such as games, system security, social communications, audio-visual, video-photographic, news-reading, life-saving, traffic navigation, travel hotels, shopping offers, sports, education, learning, theme wallpaper, financial, and business applications.
The different classes of applications may include specific applications, such as stock class applications, and the like. The stock application may include a display interface, and the terminal 10 may receive a specified operation for the display interface, where the specified operation may include a click operation, a double-click operation, a re-click operation, or a sliding operation, and the present application is not limited in this respect.
The user can initiate a data display request through a display interface of the stock class application program, after receiving the data display request, the terminal 10 firstly subscribes real-time data from a first time to the first server 20, then initiates a historical data acquisition request to the second server 30 at a second time, and after receiving the historical data sent by the second server 30, merges the historical data and the real-time data from the first time to the historical data receiving time to obtain accumulated class data, and displays the accumulated class data through the display interface of the stock class application program.
It should be noted that besides one possible application scenario shown in fig. 2, there are some other application scenarios in the embodiment of the present application. In another possible application scenario, the first server 20 and the second server 30 in fig. 2 may be the same server, and the server may be deployed with different databases for storing real-time data and historical data of each service, which is not limited in this embodiment of the present invention.
Referring to fig. 3, fig. 3 is a schematic flow chart illustrating a data acquisition method according to an embodiment of the present disclosure. The data acquisition method is applied to the terminal 10 and can comprise the following steps:
s101, responding to a data acquisition request of a target display unit, and acquiring real-time data of a target service corresponding to the target display unit from a first moment.
In this embodiment, the terminal 10 includes at least one data presentation page, the data presentation page includes at least one display unit, and each display unit in the data presentation page is used for presenting data of the same service.
After entering a specific application program running on the terminal 10, please refer to fig. 4, a service identifier of each service is displayed on the display interface, where the service identifier may uniquely represent the service, and the service identifier may be an enterprise name, an enterprise code, or the like. Each service has a corresponding data display page, and a user can enter the data display interface of the service by clicking the service identifier of the service on the display interface. For example, if the user clicks the service identifier 1, the data presentation page of the service 1 is entered.
Taking a stock application as an example, after entering the stock application, the stock code of each stock is displayed on the display interface, and when a user clicks one stock code, the data display page of the stock is displayed.
In general, a data presentation page includes various display units, each for presenting data of the same service from different dimensions (e.g., charts, etc.). After a user clicks a service identifier of a service to enter a data display interface of the service, data of a first display unit is usually displayed by default, as shown in fig. 4, and after the user enters a display interface of the service 1, data of the display unit 1 is directly displayed.
If the user wants to view the data of other display units, the user can click other display units, and then the data of other display units can be displayed. For example, as shown in fig. 5, when the user clicks the display unit 2, the data of the display unit 2 is displayed.
Taking stock application programs as an example, a data display page generally includes display units such as a quotation board, a K line, a time division, a tick chart, a pen division, a snapshot and the like, and is used for displaying the market trend and the deal information of a stock in a certain time period, and each display unit needs to subscribe the same stock code so as to complete the market refreshing display of the whole page. When the user clicks on the K line, the K line graph of the stock will be shown.
Therefore, the target display unit can be any display unit of any data display page, and each display unit in the same data display page displays data of the same service.
The obtaining request of the target display unit may be triggered by the user clicking a data presentation page of a service, and the target display unit may be a first display unit under the data presentation page of the service. The request for obtaining the target display unit may also be triggered by the user clicking one display unit under the data display page of one service, and at this time, the target display unit may be the display unit clicked by the user. The embodiment of the present application does not set any limit to this.
In this embodiment, the first time point is a time point when the terminal 10 subscribes to the real-time data from the first server 20, and the real-time data may be subscribed to the first server 20 immediately after receiving the data acquisition request of the target display unit, or may be subscribed after a specified time (for example, 1s) elapses. Therefore, the first time may be a time when the data acquisition request of the target display unit is received, or may be any time after the time.
In this embodiment, after receiving the data acquisition request of the target display unit, the terminal 10 may subscribe to the first server 20 for the real-time data of the target service from the first time, so that the real-time data pushed by the first server 20 can be received. Taking stock type application as an example, the real-time data may be real-time trading price, real-time trading volume, etc. of a stock.
S102, historical data of a second moment when the target service is cut off is obtained, wherein the second moment is greater than or equal to the first moment.
In this embodiment, after receiving the data acquisition request of the target display unit, the first server 20 may subscribe to the real-time data and request the second server 30 for the historical data, where the first time and the second time are the same. Or subscribe the real-time data to the first server 20, and after receiving the real-time data pushed by the first server 20, request the historical data from the second server 30, where the second time is after the first time.
Taking a stock-type application as an example, the historical data may be a trading price, a trading volume, etc. of a stock at each time point from the opening of the disc on the day.
And S103, after the historical data is received, combining the historical data and the real-time data from the first moment to the receiving moment of the historical data to obtain the accumulated data of the target service.
In this embodiment, since the second time is greater than or equal to the first time, that is, the real-time data and the historical data are continuous or the real-time data and the historical data are overlapped, the finally obtained accumulated class data is not missing.
For example, referring to fig. 6, if a data display request of a user is received at time a, the real-time data is subscribed first, so that the real-time data from time a can be received, then a historical data acquisition request is initiated at time B, and when the historical data is received at time C, the real-time data from time B to time C is merged in the historical data, so that complete accumulated class data can be obtained.
And S104, distributing the accumulated class data to a target display unit so that the target display unit displays the accumulated class data.
In this embodiment, after the accumulated class data is obtained, the accumulated class data is distributed to the target display unit, and the target display unit analyzes and displays the accumulated class data.
The overall process of the data acquisition method provided by the embodiment of the present application is described above, and it can be known from the above process that each display unit may initiate a data acquisition request, and the data displayed by each display unit of the same service is the same. In the prior art, as long as a display unit initiates a data acquisition request, real-time data is subscribed to the first server 20. Due to the fact that each unit repeatedly subscribes to the real-time data of the same service, the first server pushes the repeated data, and therefore the redundant memory is occupied. Meanwhile, repeated subscriptions may put a great strain on the first server 20.
Therefore, in order to avoid receiving a large amount of repeated data and reduce the pressure of the first server 20, in the embodiment of the present application, for the same service, when the display unit of the service first initiates a data acquisition request, the first server 20 may subscribe to real-time data, and then the subscription is not repeated.
In this embodiment, after subscribing to the real-time data from the first server 20, the real-time data pushed by the first server 20 needs to be cached first, and after receiving the historical data sent by the second server 30, the historical data and the real-time data are merged.
In one possible implementation, the real-time data may be cached using a linked list, which is introduced below.
Referring to fig. 7, the terminal 10 may maintain n linked lists, and one linked list is used for caching real-time data of one service. Taking the linked list 1 as an example, the linked list 1 comprises a link head and n linked list nodes.
The chain head may include a key and a reference count, the key is used for uniquely characterizing a service and is calculated according to the service identifier, in the stock service, the key may be calculated by a stock code and a market code, for example, the stock code is 112233, the market code is ABC, and the key is 1; the stock code is 223344, the market code is DEF, the key value is 2, etc. The reference count represents how much display unit requested the cached real-time data of linked list 1, e.g., both display unit 1 and display unit 2 requested 112233.ABC real-time data, then the linked list with a key value of 1 is referenced by 2 requests with a reference count of 2.
One linked list node is used for caching real-time data at one moment, and the real-time data can be provided with a timestamp, so that the real-time data pushed by the first server 20 can be sequentially cached in each linked list node according to the sequence of the timestamps.
Therefore, referring to fig. 8 in addition to fig. 3, the process of obtaining real-time data of the target service from the first time point corresponding to the target display unit in response to the data acquisition request of the target display unit in step S101 may include S1011 to S1014.
And S1011, responding to the data acquisition request, and calculating key value data corresponding to the target service according to the service identifier of the target service.
For example, the service identifier is 112233.ABC, and the corresponding key-value data is calculated to be 1.
And S1012, searching whether a target linked list corresponding to the key value data exists according to the key value data.
In this embodiment, if there is a target linked list corresponding to the key-value data, S1013 is performed; if there is no target linked list corresponding to the key-value data, S1014 is performed.
And S1013, continuously receiving the real-time data of the target service pushed by the first server and caching the real-time data to a target linked list.
In this embodiment, if there is a target linked list corresponding to the key-value data, it indicates that the terminal 10 has subscribed the real-time data of the target service to the first server 20, and at this time, it is sufficient to continue to receive the real-time data pushed by the first server 20 and cache the real-time data to the target linked list without repeated subscription.
S1014, applying for a target linked list corresponding to the key value data, subscribing real-time data of the target service from the first moment to the first server, receiving the real-time data of the target service pushed by the first server, and caching the real-time data to the target linked list.
In this embodiment, if there is no target linked list corresponding to the key value data, it indicates that the display unit of the target service initiates a data acquisition request for the first time, and at this time, first applies for the target linked list corresponding to the key value data, that is, the key value data is used as the key value, and applies for a linked list for caching real-time data of the target service. Then, the real-time data of the target service is subscribed to the first server 20, and the real-time data pushed by the first server 20 is received and cached in the target linked list.
Optionally, the process of receiving the real-time data of the target service pushed by the first server and caching the real-time data to the target linked list in S1013 and S1014 may include:
firstly, receiving real-time data of a target service pushed by a first server 20, wherein the real-time data comprises a first timestamp;
and then, sequentially caching the real-time data of the target service into each linked list node of the target linked list according to the sequence of the first timestamps.
Step S102 will be described in detail below.
In one possible implementation, the terminal 10 may simultaneously subscribe to real-time data from the first server 20 and initiate a history data acquisition request to the second server 30.
Therefore, referring to fig. 9 in addition to fig. 3, the process of acquiring the historical data of the target service expiration second time in step S102 may include S1021 to S1022.
And S1021, responding to the data acquisition request, and requesting data from the second server by using the service identifier of the target service.
S1022, the historical data of the target service expiration at the second time sent by the second server is received.
In another possible implementation manner, the terminal 10 may initiate the historical data acquisition request to the second server 30 after receiving the real-time data pushed by the first server 20.
Therefore, referring to fig. 10 in addition to fig. 3, the process of acquiring the historical data of the target service at the second time of expiration in step S102 may include S102a to S102 b.
S102a, when receiving the real-time data of the target service, requests the second server for data by using the service identifier of the target service.
S102b, receiving the historical data of the target service at the second time point sent by the second server.
Step S103 will be described in detail below.
In this embodiment, both the historical data and the real-time data have time stamps, and after the historical data sent by the second server 30 is received, the historical data and the cached real-time data may be merged according to the time stamps, so as to obtain complete accumulated class data.
Therefore, the process of combining the historical data and the real-time data from the first time to the receiving time of the historical data to obtain the accumulated class data of the target service in step S103 may include S1031 to S1033.
And S1031, after receiving the historical data, acquiring the real-time data cached in the target linked list from the first time to the receiving time of the historical data, wherein the real-time data comprises a first time stamp, and the historical data comprises a second time stamp.
And S1032, comparing the first time stamp with the second time stamp to determine real-time data which is not contained in the historical data.
And S1033, merging the real-time data which are not contained in the historical data into the historical data to obtain accumulated class data.
For example, referring to fig. 6, the historical data is data from the reference time point to the time point B, and the real-time data is data from the time point a to the time point C, and it is obvious that the historical data does not include data from the time point B to the time point C, and therefore, the data from the time point B to the time point C is merged into the historical data, and the complete accumulated class data can be obtained.
The following describes in detail the process of obtaining the real-time data between the first time and the receiving time of the history data cached in the target linked list in S1031.
As can be seen from the foregoing description of the linked list, when receiving the real-time data of the target service pushed by the first server 20, the real-time data is sequentially cached in each linked list node according to the sequence of the timestamps. Correspondingly, when the real-time data is taken out from the linked list, the cached real-time data can be sequentially taken out from each linked list node according to the sequence of the timestamps.
Therefore, the process of obtaining the real-time data between the first time and the receiving time of the history data cached in the target linked list in S1031 may include S10311 to S10315.
And S10311, according to the first time stamp, determining a plurality of target linked list nodes in which the real-time data between the first time and the receiving time of the historical data are cached from the target linked list.
For example, with reference to fig. 7, if the linked list 1 caches real-time data of the target service, the first time is timestamp 1, and the receiving time of the historical data is timestamp 3, it is determined that the linked list node including timestamp 1, timestamp 2, and timestamp 3 is the target linked list node.
And S10312, sequentially taking out the cached real-time data from each target linked list node according to the sequence of the first time stamps.
And S10313, aiming at each target linked list node, after the real-time data cached by the target linked list node is taken out, detecting whether the real-time data cached by the target linked list node requested by other display units exists or not.
From the foregoing description, it can be seen that for a linked list, there may be multiple display elements requesting real-time data buffered for the linked list. Therefore, after the real-time data requested by the target display unit is taken out from one linked list node, it is required to detect whether other display units also request the real-time data cached by the linked list node. If the real-time data cached by the target linked list node requested by other display units exist, executing S10314; if there is no real-time data that the other display unit requests the target linked list node to cache, S10315 is performed.
And S10314, keeping the cache of the target linked list node unchanged.
And S10315, releasing the target linked list nodes, and placing the idle target linked list nodes at the tail of the target linked list.
For example, referring to FIG. 11, the right table of FIG. 11 represents a linked list, and a row represents a linked list node. The linked list nodes include node IDs, timestamps, service identifiers, and real-time data. It should be noted that the node ID in the linked list is only for convenience of description, and this field is not necessarily present in practice.
The linked list is composed of a dynamic crawler-type dual-link structure, as shown in fig. 11, taking request a as an example, which is initiated at 10:00:00 and completed at 10:00:02, where initiation indicates that the first server 20 is subscribed to real-time data, and completion indicates that the historical data sent by the second server 30 is received.
Obviously, 3 real-time data are received between the initiation and completion of the request a, but when the 2 nd push message is received, the request B and the request C initiate subscription, and the request B and the request C also need node ID: and (7) real-time data cached by 002-003. Therefore, in the real-time data retrieval process of request a, the node ID: 001 free, put to the end of the queue for multiplexing of other real-time data pushed by the first server 20, while keeping node ID: the buffer memory of 002-003 is not changed.
Meanwhile, when the request B is completed, the request C is not completed yet, and at this time, the node ID: the 002-003 buffer is reserved. When real-time data of 10:00:04 is received, a new node ID is required to be applied: 004. when real-time data of 10:00:05 is received, a new node ID is required to be applied: 005. when request C is complete, node ID: 002. 003, 001, ID004 and 005 are idle, and the nodes can be placed at the tail of the queue for multiplexing other real-time data.
After the request D is initiated, the real-time data pushed by the first server 20 may multiplex the node ID: 002. 003, 001, ID004, 005.
It should be noted that the requests a to D in fig. 11 refer to data acquisition requests issued by 4 display units of the same service.
In this embodiment, in order to prevent the chain table from occupying too much memory, the maximum capacity and the normal capacity may be set for the chain table, when a request is initiated, if the chain table exceeds the maximum capacity, the request response is stopped, and when the chain table nodes are recycled, if the chain table nodes exceed the normal capacity, the chain table nodes that exceed are recycled, so as to avoid system abnormality caused by too much memory.
Step S104 will be described in detail below.
In the prior art, in order to reduce the load of the data receiving thread, the real-time data pushed by the first server 20 is generally directly distributed to the display unit, and the display unit determines whether to perform processing. If a plurality of display units of a plurality of services subscribe to real-time data, the CPU of the terminal 10 may occupy a relatively high level and the delay of the real-time data received by the display units may increase due to the need to process and distribute a large amount of real-time data. Meanwhile, in order to improve the processing efficiency of the data receiving thread, a thread pool is often used for data distribution, and due to the adaptive scheduling algorithm of the thread pool, the data sequence may be disordered.
Therefore, in order to solve the problems of high CPU occupation, data receiving delay, and data timing disorder caused by multi-thread processing and data distribution, in the embodiment of the present application, historical data and real-time data are merged into accumulated data and then distributed, and meanwhile, the terminal 10 maintains a primary thread queue and a secondary thread queue, where the primary thread queue includes a plurality of primary threads and the primary threads are used for distributing data to the data presentation page. The secondary thread queue includes a plurality of secondary threads for distributing data to the display unit.
Therefore, the process of distributing the accumulated class data to the target display unit in step S104 may include S1041 to S1043.
S1041, according to the service identification of the target service, determining a primary target thread matched with the service identification from the multiple primary threads.
In this embodiment, the accumulated class data includes the service identifier of the target service and the hash value of the target display unit, so that a primary target thread matching the service identifier can be determined from the plurality of primary threads according to the service identifier of the target service.
The primary thread queue is uniquely matched with the primary thread according to the service identifier, and the accumulated class data of the same service is guaranteed to be distributed by one primary thread in order. Alternatively, the primary thread may be matched using a business identifier that is a remainder of the primary thread queue size. In practice, the service identifier is usually a character string, for example, a stock code, and the matching efficiency of the character string is relatively low, so to improve the matching efficiency, the service identifier here may be a numerical value calculated based on the original service identifier, and the calculation mode may be consistent with the aforementioned mode of calculating the key value of the linked list, which is not limited in this embodiment of the present application.
For example, referring to fig. 12, the primary thread queue has 5 primary threads, and for a service, if the service identifier of the service is 1, the accumulated class data with the service identifier of 1 is distributed by the first primary thread after the service identifier is left with the size of the primary thread queue and is 1.
S1042, the accumulated class data is distributed to each secondary thread related to the service identification by using the primary target thread.
In this embodiment, the distributing of the accumulated class data of a service by a primary thread means that the accumulated class data is distributed by the primary thread to each secondary thread associated with the service identifier of the service.
The secondary threads uniquely match the hash values of the display units, i.e., one secondary thread matches one display unit. It should be noted that the display unit matched with the secondary thread refers to a display unit that issues a data acquisition request, and if one display unit does not initiate a data acquisition request, there is no secondary thread matched with the display unit.
Thus, the accumulated class data may be distributed to each secondary thread associated with the service identification using the primary target thread.
For example, in fig. 12, the first primary thread distributes the accumulated class data with the service identifier 1, the first two secondary threads in the secondary thread queue are associated with the service identifier 1, and the first primary thread distributes the accumulated class data with the service identifier 1 to the first two secondary threads.
And S1043, distributing the accumulated class data to the target display unit by using the secondary thread matched with the hash value of the target display unit.
In this embodiment, since the hash values of the secondary threads and the display units are uniquely matched, the accumulated class data belonging to one display unit is guaranteed to be distributed orderly, so that the data is distributed efficiently and without blocking. Thus, the cumulative class data may be distributed to the target display unit using a secondary thread that matches the hash value of the target display unit.
For example, in fig. 12, if the target display unit is a display unit a/AA, the first secondary thread distributes the accumulated class data with the service identifier 1 to the display unit a/AA.
In the embodiment of the application, the data distribution structure comprising the primary thread queue and the secondary thread queue is adopted, so that the data distribution sequence of the same service identifier and the data distribution sequence of the same display unit are ensured, and the condition that other display units are blocked due to the blocking of individual display units can be avoided while the ordered distribution of data is ensured.
Compared with the prior art, the embodiment of the application has the following beneficial effects:
firstly, when a data display request of a user is received, subscribing real-time data from a first moment, then acquiring historical data ending a second moment, and simultaneously, after the historical data is received, merging the historical data and the real-time data from the first moment to the receiving moment of the historical data to obtain accumulated data for display. Because the second moment is greater than or equal to the first moment, the finally obtained accumulated data cannot be lost, so that the data loss can be effectively avoided, and the completeness of data display is ensured;
secondly, for the same service, when the display unit of the service initiates a data acquisition request for the first time, real-time data can be subscribed to the first server 20, and subsequent subscriptions are not repeated, so that a large amount of repeated data can be prevented from being received, and the pressure of the first server 20 is reduced;
and thirdly, a data distribution structure comprising a primary thread queue and a secondary thread queue is adopted, the primary thread queue is used for distributing data to the data display page, and the secondary thread queue is used for distributing data to the display units, so that the ordered distribution of the data is ensured, and the condition that other display units are blocked due to the blocking of individual display units can be avoided.
In order to perform the corresponding steps in the above method embodiments and various possible embodiments, an implementation of the data acquisition apparatus is given below.
Referring to fig. 13, fig. 13 is a block diagram illustrating a data acquisition apparatus 100 according to an embodiment of the present disclosure. The data acquisition apparatus 100 is applied to the terminal 10, and the data acquisition apparatus 100 includes: a real-time data obtaining module 101, a historical data obtaining module 102, a data merging module 103 and a data distributing module 104.
The real-time data obtaining module 101 is configured to respond to a data obtaining request of a target display unit, and obtain real-time data of a target service corresponding to the target display unit from a first time.
The historical data acquiring module 102 is configured to acquire historical data of a second time when the target service is ended, where the second time is greater than or equal to the first time.
And the data merging module 103 is configured to, after receiving the historical data, merge the historical data and the real-time data from the first time to the receiving time of the historical data to obtain the accumulated class data of the target service.
And the data distribution module 104 is configured to distribute the accumulated class data to the target display unit, so that the target display unit displays the accumulated class data.
Optionally, the terminal 10 maintains a plurality of linked lists, and one linked list is used for caching real-time data of one service; the data acquisition request comprises a service identifier of the target service;
the real-time data obtaining module 101 is specifically configured to:
responding to the data acquisition request, and calculating key value data corresponding to the target service according to the service identifier of the target service;
searching whether a target linked list corresponding to the key value data exists according to the key value data;
if yes, continuing to receive the real-time data of the target service pushed by the first server and caching the real-time data to a target linked list;
if not, applying for a target linked list corresponding to the key value data, subscribing the real-time data of the target service from the first moment to the first server, receiving the real-time data of the target service pushed by the first server, and caching the real-time data to the target linked list.
Optionally, the target linked list includes a plurality of linked list nodes, and one linked list node is used for caching real-time data of the target service at one moment;
the method for receiving the real-time data of the target service pushed by the first server and caching the real-time data to the target linked list by the real-time data obtaining module 101 includes:
receiving real-time data of a target service pushed by a first server, wherein the real-time data comprises a first timestamp;
and sequentially caching the real-time data of the target service into each linked list node of the target linked list according to the sequence of the first timestamps.
In an optional implementation manner, the historical data obtaining module 102 is specifically configured to:
responding to the data acquisition request, and requesting data from a second server by using the service identifier of the target service;
and receiving historical data of the target service at the second moment sent by the second server.
In another optional implementation manner, the historical data obtaining module 102 is specifically configured to:
when receiving real-time data of a target service, requesting data from a second server by using a service identifier of the target service;
and receiving historical data of the target service at the second moment sent by the second server.
Optionally, the data merging module 103 is specifically configured to:
after receiving the historical data, acquiring real-time data cached in a target linked list from a first moment to the receiving moment of the historical data, wherein the real-time data comprises a first time stamp, and the historical data comprises a second time stamp;
comparing the first time stamp with the second time stamp to determine real-time data which is not contained in the historical data;
and merging real-time data which are not contained in the historical data into the historical data to obtain accumulated class data.
Optionally, the data merging module 103 executes a manner of obtaining real-time data between the first time and the receiving time of the historical data cached in the target linked list, including:
according to the first time stamp, determining a plurality of target linked list nodes caching real-time data between the first time and the receiving time of the historical data from the target linked list;
according to the sequence of the first time stamps, the cached real-time data of each target linked list node is taken out from each target linked list node in sequence;
for each target linked list node, after the real-time data cached by the target linked list node is taken out, detecting whether other display units request the real-time data cached by the target linked list node exists or not;
if yes, keeping the cache of the target linked list node unchanged;
if not, releasing the target linked list nodes, and placing the idle target linked list nodes at the tail of the target linked list.
Optionally, the terminal 10 maintains a primary thread queue and a secondary thread queue, where the primary thread queue includes a plurality of primary threads, and the primary threads are used to distribute data to the data presentation page; the secondary thread queue comprises a plurality of secondary threads, and the secondary threads are used for distributing data to the display unit; the accumulated class data comprises a service identifier of the target service and a hash value of the target display unit;
the data distribution module 104 performs a manner of distributing the accumulated class data to the target display unit, and may include:
determining a primary target thread matched with the service identifier from the plurality of primary threads according to the service identifier of the target service;
distributing the accumulated class data to each secondary thread associated with the service identifier by using the primary target thread;
and distributing the accumulated class data to the target display unit by utilizing a secondary thread matched with the hash value of the target display unit.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working process of the data acquisition apparatus 100 described above may refer to the corresponding process in the foregoing method embodiment, and is not described herein again.
Referring to fig. 14, fig. 14 is a block diagram illustrating a terminal 10 according to an embodiment of the present disclosure. The terminal 10 includes a processor 11, a memory 12, and a bus 13, and the processor 11 is connected to the memory 12 through the bus 13.
The memory 12 is used for storing a program, and the processor 11 executes the program after receiving the execution instruction to implement the data acquisition method disclosed in the above embodiment.
The Memory 12 may include a Random Access Memory (RAM) and may also include a non-volatile Memory (NVM).
The processor 11 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 11. The processor 11 may be a general-purpose processor, and includes a Central Processing Unit (CPU), a Micro Control Unit (MCU), a Complex Programmable Logic Device (CPLD), a Field Programmable Gate Array (FPGA), and an embedded ARM.
The embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by the processor 11, implements the data acquisition method disclosed in the above embodiment.
To sum up, according to the data acquisition method, the data acquisition device, the terminal, and the storage medium provided in the embodiments of the present application, when a data acquisition request of a target display unit is received, the data acquisition request represents data of a target service that a user wants to view, which is displayed by the target display unit, first, real-time data of the target service from a first time is obtained, then, historical data of the target service at a second time is obtained, and after the historical data is received, the historical data and the real-time data between the first time and the reception time of the historical data are merged to obtain accumulated class data of the target service and the accumulated class data is distributed to the target display unit for display. The second moment is greater than or equal to the first moment, namely the real-time data and the historical data are continuous or the real-time data and the historical data are overlapped, so that the finally obtained accumulated data cannot be lost, the data can be effectively prevented from being lost, and the completeness of data display is ensured.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made to the present application by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (10)
1. The data acquisition method is characterized by being applied to a terminal, wherein the terminal comprises at least one data display page, the data display page comprises at least one display unit, and each display unit in the data display page is used for displaying data of the same service;
the method comprises the following steps:
responding to a data acquisition request of a target display unit, and acquiring real-time data of a target service corresponding to the target display unit from a first moment;
acquiring historical data of the target service at a second moment, wherein the second moment is greater than or equal to the first moment;
after the historical data are received, combining the historical data and the real-time data from the first moment to the receiving moment of the historical data to obtain the accumulated class data of the target service;
and distributing the accumulated class data to the target display unit so that the target display unit displays the accumulated class data.
2. The method of claim 1, wherein the terminal maintains a primary thread queue and a secondary thread queue, the primary thread queue including a plurality of primary threads, the primary threads for distributing data to the data presentation pages; the secondary thread queue comprises a plurality of secondary threads, and the secondary threads are used for distributing data to the display unit; the accumulated class data comprises a service identifier of the target service and a hash value of the target display unit;
the step of distributing the accumulated class data to the target display unit includes:
determining a primary target thread matched with the service identifier from the plurality of primary threads according to the service identifier of the target service;
distributing the accumulated class data to each secondary thread associated with the service identifier by using the primary target thread;
distributing the accumulated class data to the target display unit using a secondary thread that matches the hash value of the target display unit.
3. The method of claim 1, wherein the terminal maintains a plurality of linked lists, one of the linked lists being used for caching real-time data of one of the services; the terminal is in communication connection with a first server, and the first server is used for storing real-time data of each service; the data acquisition request comprises a service identifier of the target service;
the step of responding to the data acquisition request of the target display unit and acquiring real-time data of the target service corresponding to the target display unit from a first moment comprises the following steps:
responding to the data acquisition request, and calculating key value data corresponding to the target service according to the service identification of the target service;
searching whether a target linked list corresponding to the key value data exists according to the key value data;
if so, continuing to receive the real-time data of the target service pushed by the first server and caching the real-time data to the target linked list;
if not, applying for a target linked list corresponding to the key value data, subscribing real-time data of the target service from a first moment to the first server, receiving the real-time data of the target service pushed by the first server, and caching the real-time data to the target linked list.
4. The method of claim 3, wherein the target linked list includes a plurality of linked list nodes, one linked list node for caching real-time data of the target service at one time;
the step of receiving the real-time data of the target service pushed by the first server and caching the real-time data to the target linked list includes:
receiving real-time data of the target service pushed by the first server, wherein the real-time data comprises a first timestamp;
and sequentially caching the real-time data of the target service into each linked list node of the target linked list according to the sequence of the first timestamps.
5. The method of claim 3, wherein the step of combining the historical data and the real-time data from the first time to the time of receiving the historical data to obtain the accumulated class data of the target service after receiving the historical data comprises:
after the historical data are received, acquiring real-time data cached in the target linked list from the first moment to the receiving moment of the historical data, wherein the real-time data comprise a first time stamp, and the historical data comprise a second time stamp;
comparing the first time stamp with the second time stamp to determine real-time data which is not contained in the historical data;
and merging real-time data which are not contained in the historical data into the historical data to obtain the accumulated data.
6. The method of claim 5, wherein the target linked list includes a plurality of linked list nodes, one linked list node for caching real-time data of the target service at one time;
the step of obtaining the real-time data cached in the target linked list from the first time to the receiving time of the historical data includes:
determining a plurality of target linked list nodes caching real-time data between the first moment and the historical data receiving moment from the target linked list according to the first time stamp;
according to the sequence of the first time stamps, the cached real-time data of each target linked list node is taken out in sequence;
for each target linked list node, after the real-time data cached by the target linked list node is taken out, detecting whether other display units request the real-time data cached by the target linked list node exists or not;
if yes, keeping the cache of the target linked list node unchanged;
if not, releasing the target linked list nodes, and placing the idle target linked list nodes at the tail of the target linked list.
7. The method of claim 1, wherein the terminal is further communicatively coupled to a second server for storing historical data for each service;
the step of obtaining the historical data of the target service at the second moment comprises the following steps:
responding to the data acquisition request, and requesting data from a second server by using the service identifier of the target service;
receiving historical data of the target service at a second moment sent by the second server;
or, the step of obtaining the historical data of the target service at the second moment includes:
when receiving the real-time data of the target service, requesting data from a second server by using the service identifier of the target service;
and receiving historical data of the target service at a second moment sent by the second server.
8. The data acquisition device is characterized by being applied to a terminal, wherein the terminal comprises at least one data display page, the data display page comprises at least one display unit, and each display unit in the data display page is used for displaying data of the same service;
the device comprises:
the real-time data acquisition module is used for responding to a data acquisition request of a target display unit and acquiring real-time data of a target service corresponding to the target display unit from a first moment;
a historical data acquisition module, configured to acquire historical data of a second time when the target service is ended, where the second time is greater than or equal to the first time;
the data merging module is used for merging the historical data and real-time data between the first moment and the historical data receiving moment after receiving the historical data to obtain the accumulated data of the target service;
and the data distribution module is used for distributing the accumulated class data to the target display unit so that the target display unit displays the accumulated class data.
9. A terminal, characterized in that it comprises a processor and a memory, said memory being adapted to store a program, said processor being adapted to carry out the data acquisition method of any one of claims 1-7 when said program is executed.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the data acquisition method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210862488.3A CN115048595A (en) | 2022-07-20 | 2022-07-20 | Data acquisition method, device, terminal and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210862488.3A CN115048595A (en) | 2022-07-20 | 2022-07-20 | Data acquisition method, device, terminal and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115048595A true CN115048595A (en) | 2022-09-13 |
Family
ID=83167479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210862488.3A Pending CN115048595A (en) | 2022-07-20 | 2022-07-20 | Data acquisition method, device, terminal and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115048595A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117555905A (en) * | 2024-01-12 | 2024-02-13 | 腾讯科技（深圳）有限公司 | Service processing method, device, equipment, storage medium and program product |
-
2022
- 2022-07-20 CN CN202210862488.3A patent/CN115048595A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117555905A (en) * | 2024-01-12 | 2024-02-13 | 腾讯科技（深圳）有限公司 | Service processing method, device, equipment, storage medium and program product |
| CN117555905B (en) * | 2024-01-12 | 2024-04-02 | 腾讯科技（深圳）有限公司 | Service processing method, device, equipment, storage medium and program product |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11277469B2 (en) | Efficient and reliable host distribution of totally ordered global state | |
| US11216430B2 (en) | Next generation near real-time indexing | |
| CN108139958B (en) | System and method for processing events of an event stream | |
| US10404822B2 (en) | Predictive rollup and caching for application performance data | |
| US10409650B2 (en) | Efficient access scheduling for super scaled stream processing systems | |
| US7912949B2 (en) | Systems and methods for recording changes to a data store and propagating changes to a client application | |
| WO2020181810A1 (en) | Data processing method and apparatus applied to multi-level caching in cluster | |
| CN108111554B (en) | Control method and device for access queue | |
| US11522976B1 (en) | Method, apparatus and system for subscription management | |
| US12003595B2 (en) | Aggregated service status reporter | |
| CN109684079B (en) | Display data processing method and device and electronic equipment | |
| US20220245093A1 (en) | Enhanced search performance using data model summaries stored in a remote data store | |
| CN108319619B (en) | Data processing method and device | |
| CN114090580A (en) | Data processing method, device, equipment, storage medium and product | |
| CN113254320A (en) | Method and device for recording user webpage operation behaviors | |
| CN112068973A (en) | Asynchronous information processing method and device of policy mode, server and storage medium | |
| US20120284390A1 (en) | Guaranteed response pattern | |
| CN115048595A (en) | Data acquisition method, device, terminal and storage medium | |
| US11243979B1 (en) | Asynchronous propagation of database events | |
| CN105989065B (en) | Flash data processing method and system | |
| CN112653736A (en) | Parallel source returning method and device and electronic equipment | |
| CN106533819B (en) | Error monitoring method, device and system for online service | |
| CN114168607A (en) | Global serial number generation method, device, equipment, medium and product | |
| CN112882655A (en) | Data caching method and device, electronic equipment and storage medium | |
| US9634976B2 (en) | Systems and methods for organizing the display of messages |
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 |