CN109857786B - Page data filling method and device - Google Patents
Page data filling method and device Download PDFInfo
- Publication number
- CN109857786B CN109857786B CN201811559994.5A CN201811559994A CN109857786B CN 109857786 B CN109857786 B CN 109857786B CN 201811559994 A CN201811559994 A CN 201811559994A CN 109857786 B CN109857786 B CN 109857786B
- Authority
- CN
- China
- Prior art keywords
- data
- filling
- execution
- queue
- page
- 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.)
- Active
Links
Images
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
The embodiment of the application provides a page data filling method and device, and the specific implementation principle is as follows: acquiring page data to be filled to a current page from a server according to a received data query request; judging whether the data volume of the page data is larger than the total fillable data volume of each filling execution queue at present; if the data volume of the page data is not larger than the total data volume which can be filled in each filling execution queue at present, sequentially distributing the page data to the filling execution queues in the corresponding execution sequence according to the data priority of the page data; and sequentially filling the page data into the current page according to the execution sequence of each filling execution queue. Therefore, by adopting the incremental data filling mode, the inquired page data can be filled according to the data priority of the page data and the execution sequence of the filling execution queue, the page display abnormity caused by one-time filling of a large amount of data is avoided, and the user experience is improved.
Description
Technical Field
The application relates to the technical field of computers, in particular to a page data filling method and device.
Background
At present, when a data report is queried, when the data volume of one query is large, a large amount of data is filled in a display component of a page at one time, which may cause that the page cannot be normally displayed, and user experience is influenced.
Disclosure of Invention
In order to overcome the above-mentioned deficiencies in the prior art, the present application provides a method and an apparatus for page data padding to solve or improve the above-mentioned problems.
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 page data filling method, which is applied to an electronic device, and the method includes:
acquiring page data to be filled to a current page from a server according to a received data query request;
judging whether the data volume of the page data is larger than the total fillable data volume of each filling execution queue at present;
if the data volume of the page data is not greater than the total fillable data volume of each filling execution queue, sequentially distributing the page data to the filling execution queues in the corresponding execution sequence according to the data priority of the page data;
and sequentially filling the page data into the current page according to the execution sequence of each filling execution queue.
In a possible implementation manner, the step of obtaining page data to be filled to a current page from a server according to a received data query request includes:
after a data query request is received, obtaining a data acquisition address of page data to be filled to a current page from the data query request;
sending a data acquisition request to a server according to the data acquisition address so that the server responds to the data acquisition request to search the page data to be filled to the current page;
and acquiring the page data to be filled to the current page searched by the server.
In one possible embodiment, the method further comprises:
each of the fill execution queues is preconfigured with an execution order and a fillable data volume for each of the fill execution queues.
In a possible implementation manner, the step of sequentially allocating the page data to the filling execution queues in the corresponding execution order according to the data priority of the page data includes:
determining the queue data volume distributed to each filling execution queue in the page data according to the sequence of the data priority of the page data from high to low, the execution sequence of each filling execution queue and the fillable data volume;
and sequentially distributing the determined queue data volume to the filling execution queues in the corresponding execution sequence.
In one possible embodiment, the method further comprises:
if the data volume of the page data is greater than the total fillable data volume of each filling execution queue at present, determining the queue data volume of each filling execution queue allocated to be allocated in the page data according to the sequence from high priority to low priority and the execution sequence and fillable data volume of each filling execution queue currently available for allocation, and sequentially allocating the determined queue data volumes to the filling execution queues in the corresponding execution sequence;
filling the queue data volume into the current page in sequence according to the execution sequence of each filling execution queue available for distribution;
for each filling execution queue available for allocation, after the filling of the queue data volume in the filling execution queue is completed, determining the filling execution queue as a candidate filling execution queue and temporarily setting the execution sequence of the candidate filling execution queue behind the execution sequence of each filling execution queue;
the unallocated page data is allocated to the candidate fill execution queue.
In a second aspect, an embodiment of the present application further provides a page data filling apparatus, which is applied to an electronic device, and the apparatus includes:
the page data acquisition module is used for acquiring page data to be filled to a current page from the server according to the received data query request;
the judging module is used for judging whether the data volume of the page data is larger than the total quantity of the fillable data of each filling execution queue at present;
the allocation module is used for sequentially allocating the page data to the filling execution queues in the corresponding execution sequence according to the data priority of the page data if the data amount of the page data is not greater than the total amount of the fillable data of each filling execution queue at present;
and the data filling module is used for sequentially filling the page data into the current page according to the execution sequence of each filling execution queue.
In a third aspect, an embodiment of the present application further provides a readable storage medium, on which a computer program is stored, where the computer program, when executed, implements the above-mentioned page data filling method.
Compared with the prior art, the method has the following beneficial effects:
the embodiment of the application provides a page data filling method and device, and the specific implementation principle is as follows: acquiring page data to be filled to a current page from a server according to a received data query request; judging whether the data volume of the page data is larger than the total fillable data volume of each filling execution queue at present; if the data volume of the page data is not larger than the total data volume which can be filled in each filling execution queue at present, sequentially distributing the page data to the filling execution queues in the corresponding execution sequence according to the data priority of the page data; and sequentially filling the page data into the current page according to the execution sequence of each filling execution queue. Therefore, by adopting the incremental data filling mode, the inquired page data can be filled according to the data priority of the page data and the execution sequence of the filling execution queue, the page display abnormity caused by one-time filling of a large amount of data is avoided, and the user experience is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and it will be apparent to those skilled in the art that other related drawings can be obtained from the drawings without inventive effort.
Fig. 1 is a schematic flowchart of a page data filling method according to an embodiment of the present application;
FIG. 2 is a functional block diagram of a page data filling apparatus according to an embodiment of the present application;
FIG. 3 is a block diagram of another embodiment of the present disclosure;
fig. 4 is a block diagram schematically illustrating a structure of an electronic device for implementing the page data filling method according to an embodiment of the present application.
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, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. 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 application.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
Please refer to fig. 1, which is a schematic flow chart of a page data filling method according to an embodiment of the present application, and it should be noted that the page data filling method according to the embodiment of the present application is not limited by the specific sequence shown in fig. 1 and described below. The method comprises the following specific processes:
step S210, obtaining the page data to be filled to the current page from the server according to the received data query request.
In this embodiment, after receiving a data query request, a data acquisition address of page data to be filled into a current page is obtained from the data query request, and then a data acquisition request is sent to a server according to the data acquisition address, so that the server responds to the data acquisition request to search for the page data to be filled into the current page. And then, acquiring the page data to be filled to the current page searched by the server.
Step S220, determining whether the data amount of the page data is greater than the total fillable data amount of each filling execution queue.
If the data volume of the page data is not greater than the total fillable data volume of each filling execution queue, executing:
step S230, sequentially allocating the page data to the filling execution queues in the corresponding execution sequence according to the data priority of the page data.
In this embodiment, each of the fill execution queues, the execution order of each of the fill execution queues, and the fillable data amount may be configured in advance. On this basis, the queue data amount allocated to each filling execution queue in the page data may be determined according to the order of the data priority of the page data from high to low, the execution order of each filling execution queue, and the fillable data amount, and the determined queue data amounts may be sequentially allocated to the filling execution queues in the corresponding execution order.
Step S240, sequentially filling the page data into the current page according to the execution sequence of each filling execution queue.
In this embodiment, after the determined queue data amount is sequentially allocated to the filling execution queues in the corresponding execution order, the page data may be sequentially filled into the current page according to the execution order of each filling execution queue.
For example, it is assumed that the fill execution queue sequentially includes a fill execution queue a, a fill execution queue B, a fill execution queue C, a fill execution queue D, and a fill execution queue E according to the execution order, the amount of data that can be filled in the fill execution queue a is 10 units, the amount of data that can be filled in the fill execution queue B is 9 units, the amount of data that can be filled in the fill execution queue C is 8 units, the amount of data that can be filled in the fill execution queue D is 7 units, and the amount of data that can be filled in the fill execution queue E is 6 units. In addition, 10 units of queue data may be sequentially allocated to the fill execution queue a, 9 units of queue data may be sequentially allocated to the fill execution queue B, 8 units of queue data may be sequentially allocated to the fill execution queue C, 7 units of queue data may be sequentially allocated to the fill execution queue D, and 6 units of queue data may be sequentially allocated to the fill execution queue E according to the data priority of the page data. And then, sequentially filling corresponding 10 units of queue data, 9 units of queue data, 8 units of queue data, 7 units of queue data and 6 units of queue data into the current page according to the execution sequence of the filling execution queue A, the filling execution queue B, the filling execution queue C, the filling execution queue D and the filling execution queue E.
Therefore, by adopting an incremental data filling mode, the inquired page data can be filled according to the data priority of the page data and the execution sequence of the filling execution queue, the page display abnormity caused by one-time filling of a large amount of data is avoided, and the user experience is improved.
Further, still referring to fig. 1, if the data amount of the page data is greater than the total fillable data amount of each of the current fillable execution queues, then:
step S250, determining the queue data amount allocated to each padding execution queue available for allocation in the page data according to the order of priority from high to low and the execution order and the padding data amount of each padding execution queue currently available for allocation, and sequentially allocating the determined queue data amount to the padding execution queues in the corresponding execution order.
Step S260, sequentially filling the queue data amount into the current page according to the execution order of each available filling execution queue.
Step S270, for each available filling execution queue, after the completion of filling the queue data amount in the filling execution queue, determining the filling execution queue as a candidate filling execution queue and temporarily setting the execution order of the candidate filling execution queue after the execution order of the current filling execution queues.
In step S280, unallocated page data is allocated to the candidate fill execution queue.
Still taking the above example as an example, 10 units of queue data may be sequentially allocated to the fill execution queue a, 9 units of queue data may be allocated to the fill execution queue B, 8 units of queue data may be allocated to the fill execution queue C, 7 units of queue data may be allocated to the fill execution queue D, and 6 units of queue data may be allocated to the fill execution queue E according to the data priority of the page data from high to low, where 20 units of data remain in the page data. And then, sequentially filling corresponding 10 units of queue data, 9 units of queue data, 8 units of queue data, 7 units of queue data and 6 units of queue data into the current page according to the execution sequence of the filling execution queue A, the filling execution queue B, the filling execution queue C, the filling execution queue D and the filling execution queue E. In the above process, after the filling execution queue a fills 10 units of queue data into the current page, the filling execution queue a is determined as a candidate filling execution queue, and the execution order of the filling execution queue a is temporarily adjusted to be after the filling execution queue E, and then 10 units of queue data in the remaining 20 units of data in the page data are allocated to the filling execution queue a.
Therefore, the abnormal page display caused by one-time filling of a large amount of data is avoided, the user experience is improved, and meanwhile, when the data volume of the page data is larger than the total data volume which can be filled in each filling execution queue at present, the distribution mode of the queue data is optimized, and the effect of uninterrupted data increment filling in the whole process is achieved.
Further, referring to fig. 3, an embodiment of the present invention further provides a page data padding apparatus 200, where the page data padding apparatus 200 may include:
the page data obtaining module 210 is configured to obtain, from the server, page data to be filled into the current page according to the received data query request.
The determining module 220 is configured to determine whether the data amount of the page data is greater than the total fillable data amount of each of the filling execution queues at present.
The allocating module 230 is configured to, if the data amount of the page data is not greater than the total fillable data amount of each of the filling execution queues at present, sequentially allocate the page data to the filling execution queues in the corresponding execution order according to the data priority of the page data.
A data filling module 240, configured to sequentially fill the page data into the current page according to the execution order of each filled execution queue.
In a possible implementation manner, the page data obtaining module 210 may specifically obtain the page data to be filled into the current page from the server in the following manner:
after a data query request is received, obtaining a data acquisition address of page data to be filled to a current page from the data query request;
sending a data acquisition request to a server according to the data acquisition address so that the server responds to the data acquisition request to search the page data to be filled to the current page;
and acquiring the page data to be filled to the current page searched by the server.
In a possible embodiment, the apparatus may further include:
the configuration module 209 is configured to pre-configure each of the fill execution queues and the execution order and the fillable data amount of each of the fill execution queues.
In a possible implementation manner, the allocating module 230 may specifically allocate the page data to the filling execution queue in the corresponding execution order in the following manner:
determining the queue data volume distributed to each filling execution queue in the page data according to the sequence of the data priority of the page data from high to low, the execution sequence of each filling execution queue and the fillable data volume;
and sequentially distributing the determined queue data volume to the filling execution queues in the corresponding execution sequence.
In a possible implementation manner, the allocating module 230 may be further configured to: if the data volume of the page data is greater than the total fillable data volume of each filling execution queue at present, determining the queue data volume of each filling execution queue allocated to be allocated in the page data according to the sequence from high priority to low priority and the execution sequence and fillable data volume of each filling execution queue currently available for allocation, and sequentially allocating the determined queue data volumes to the filling execution queues in the corresponding execution sequence;
the data filling module 240 may be further configured to sequentially fill the queue data size into the current page according to an execution order of each available filling execution queue;
for each filling execution queue available for allocation, after the filling of the queue data volume in the filling execution queue is completed, determining the filling execution queue as a candidate filling execution queue and temporarily setting the execution sequence of the candidate filling execution queue behind the execution sequence of each filling execution queue;
the unallocated page data is allocated to the candidate fill execution queue.
It can be understood that, for the specific operation method of each functional module in this embodiment, reference may be made to the detailed description of the corresponding step in the foregoing method embodiment, and no repeated description is provided herein.
Further, please refer to fig. 4, which is a block diagram illustrating a structure of an electronic device 100 for the page data filling method according to the embodiment of the present application. In this embodiment, the electronic device 100 may be implemented by a bus 110 as a general bus architecture. Bus 110 may include any number of interconnecting buses and bridges depending on the specific application of electronic device 100 and the overall design constraints. Bus 110 connects various circuits together, including processor 120, storage medium 130, and bus interface 140. Alternatively, the electronic apparatus 100 may connect a network adapter 150 or the like via the bus 110 using the bus interface 140. The network adapter 150 may be used to implement signal processing functions of a physical layer in the electronic device 100 and implement transmission and reception of radio frequency signals through an antenna. The user interface 160 may connect external devices such as: a keyboard, a display, a mouse or a joystick, etc. The bus 110 may also connect various other circuits such as timing sources, peripherals, voltage regulators, or power management circuits, which are well known in the art, and therefore, will not be described in detail.
Alternatively, the electronic device 100 may be configured as a general purpose processing system, for example, commonly referred to as a chip, including: one or more microprocessors providing processing functions, and an external memory providing at least a portion of storage medium 130, all connected together with other support circuits through an external bus architecture.
Alternatively, the electronic device 100 may be implemented using: an ASIC (application specific integrated circuit) having a processor 120, a bus interface 140, a user interface 160; and at least a portion of the storage medium 130 integrated in a single chip, or the electronic device 100 may be implemented using: one or more FPGAs (field programmable gate arrays), PLDs (programmable logic devices), controllers, state machines, gate logic, discrete hardware components, any other suitable circuitry, or any combination of circuitry capable of performing the various functions described throughout this application.
Among other things, processor 120 is responsible for managing bus 110 and general processing (including the execution of software stored on storage medium 130). Processor 120 may be implemented using one or more general-purpose processors and/or special-purpose processors. Examples of processor 120 include microprocessors, microcontrollers, DSP processors, and other circuits capable of executing software. Software should be construed broadly to mean instructions, data, or any combination thereof, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.
The processor 120 may execute the above embodiments, specifically, the storage medium 130 may store the page data filling apparatus 200 therein, and the processor 120 may be configured to execute the page data filling apparatus 200.
Further, an embodiment of the present application also provides a non-volatile computer storage medium, where the computer storage medium stores computer-executable instructions, and the computer-executable instructions may execute the page data filling method in any of the above method embodiments.
To sum up, the embodiment of the present application provides a page data filling method and device, and the specific implementation principle is as follows: acquiring page data to be filled to a current page from a server according to a received data query request; judging whether the data volume of the page data is larger than the total fillable data volume of each filling execution queue at present; if the data volume of the page data is not larger than the total data volume which can be filled in each filling execution queue at present, sequentially distributing the page data to the filling execution queues in the corresponding execution sequence according to the data priority of the page data; and sequentially filling the page data into the current page according to the execution sequence of each filling execution queue. Therefore, by adopting the incremental data filling mode, the inquired page data can be filled according to the data priority of the page data and the execution sequence of the filling execution queue, the page display abnormity caused by one-time filling of a large amount of data is avoided, and the user experience is improved.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The apparatus and method embodiments described above are illustrative only, as the flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
Alternatively, all or part of the implementation may be in software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as an electronic device, server, data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It should be noted that, in this document, 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.
It will be evident to those skilled in the art that the present application is not limited to the details of the foregoing illustrative embodiments, and that the present application may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the application being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned.
Claims (6)
1. The page data filling method is applied to electronic equipment, and comprises the following steps:
acquiring page data to be filled to a current page from a server according to a received data query request;
judging whether the data volume of the page data is larger than the total fillable data volume of each filling execution queue at present;
if the data volume of the page data is not greater than the total fillable data volume of each filling execution queue, sequentially distributing the page data to the filling execution queues in the corresponding execution sequence according to the data priority of the page data;
sequentially filling the page data into the current page according to the execution sequence of each filling execution queue;
the method further comprises the following steps:
pre-configuring each filling execution queue and the execution sequence and the fillable data volume of each filling execution queue;
if the data volume of the page data is greater than the total fillable data volume of each filling execution queue at present, determining the queue data volume of each filling execution queue allocated to be allocated in the page data according to the sequence from high priority to low priority and the execution sequence and fillable data volume of each filling execution queue currently available for allocation, and sequentially allocating the determined queue data volumes to the filling execution queues in the corresponding execution sequence;
filling the queue data volume into the current page in sequence according to the execution sequence of each filling execution queue available for distribution;
for each filling execution queue available for allocation, after the filling of the queue data volume in the filling execution queue is completed, determining the filling execution queue as a candidate filling execution queue and temporarily setting the execution sequence of the candidate filling execution queue behind the execution sequence of each filling execution queue;
the unallocated page data is allocated to the candidate fill execution queue.
2. The method for filling page data according to claim 1, wherein the step of obtaining the page data to be filled to the current page from the server according to the received data query request comprises:
after a data query request is received, obtaining a data acquisition address of page data to be filled to a current page from the data query request;
sending a data acquisition request to a server according to the data acquisition address so that the server responds to the data acquisition request to search the page data to be filled to the current page;
and acquiring the page data to be filled to the current page searched by the server.
3. The method for filling page data according to claim 1, wherein the step of sequentially allocating the page data to the filling execution queues in the corresponding execution order according to the data priority of the page data includes:
determining the queue data volume distributed to each filling execution queue in the page data according to the sequence of the data priority of the page data from high to low, the execution sequence of each filling execution queue and the fillable data volume;
and sequentially distributing the determined queue data volume to the filling execution queues in the corresponding execution sequence.
4. The page data filling device is applied to electronic equipment, and comprises:
the page data acquisition module is used for acquiring page data to be filled to a current page from the server according to the received data query request;
the judging module is used for judging whether the data volume of the page data is larger than the total quantity of the fillable data of each filling execution queue at present;
the allocation module is used for sequentially allocating the page data to the filling execution queues in the corresponding execution sequence according to the data priority of the page data if the data amount of the page data is not greater than the total amount of the fillable data of each filling execution queue at present;
the data filling module is used for sequentially filling the page data into the current page according to the execution sequence of each filling execution queue;
the device further comprises:
the configuration module is used for pre-configuring each filling execution queue, and the execution sequence and the fillable data volume of each filling execution queue;
the allocation module is specifically further configured to: if the data volume of the page data is greater than the total fillable data volume of each filling execution queue at present, determining the queue data volume of each filling execution queue allocated to be allocated in the page data according to the sequence from high priority to low priority and the execution sequence and fillable data volume of each filling execution queue currently available for allocation, and sequentially allocating the determined queue data volumes to the filling execution queues in the corresponding execution sequence;
the data filling module is specifically configured to sequentially fill the queue data amount into the current page according to the execution order of each available filling execution queue;
for each filling execution queue available for allocation, after the filling of the queue data volume in the filling execution queue is completed, determining the filling execution queue as a candidate filling execution queue and temporarily setting the execution sequence of the candidate filling execution queue behind the execution sequence of each filling execution queue;
the unallocated page data is allocated to the candidate fill execution queue.
5. The page data filling apparatus according to claim 4, wherein the page data obtaining module obtains the page data to be filled to the current page from the server specifically by:
after a data query request is received, obtaining a data acquisition address of page data to be filled to a current page from the data query request;
sending a data acquisition request to a server according to the data acquisition address so that the server responds to the data acquisition request to search the page data to be filled to the current page;
and acquiring the page data to be filled to the current page searched by the server.
6. The device for filling page data according to claim 4, wherein the allocating module sequentially allocates the page data to the filling execution queues in the corresponding execution order by:
determining the queue data volume distributed to each filling execution queue in the page data according to the sequence of the data priority of the page data from high to low, the execution sequence of each filling execution queue and the fillable data volume;
and sequentially distributing the determined queue data volume to the filling execution queues in the corresponding execution sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811559994.5A CN109857786B (en) | 2018-12-19 | 2018-12-19 | Page data filling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811559994.5A CN109857786B (en) | 2018-12-19 | 2018-12-19 | Page data filling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109857786A CN109857786A (en) | 2019-06-07 |
| CN109857786B true CN109857786B (en) | 2020-10-30 |
Family
ID=66891759
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811559994.5A Active CN109857786B (en) | 2018-12-19 | 2018-12-19 | Page data filling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109857786B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103546505A (en) * | 2012-07-12 | 2014-01-29 | 百度在线网络技术（北京）有限公司 | Method, system and device for displaying page blocks in priority order |
| CN103838720A (en) * | 2012-11-20 | 2014-06-04 | 腾讯科技（深圳）有限公司 | Page file loading execution method and device |
| US9123069B1 (en) * | 2008-02-11 | 2015-09-01 | Amazon Technologies, Inc. | Moving transaction details forward in buying process |
| CN105138698A (en) * | 2015-09-25 | 2015-12-09 | 百度在线网络技术（北京）有限公司 | Dynamic layout method and device for webpages |
| CN105512295A (en) * | 2015-12-10 | 2016-04-20 | 网易（杭州）网络有限公司 | Information representation method and device and information system |
| CN107306192A (en) * | 2016-04-18 | 2017-10-31 | 中国移动通信集团广东有限公司 | A kind of service data transmission method, device and system |
| CN107341138A (en) * | 2017-06-29 | 2017-11-10 | 珠海市魅族科技有限公司 | A kind of information fill method and device, computer installation and readable storage medium storing program for executing |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI519955B (en) * | 2010-03-29 | 2016-02-01 | 威盛電子股份有限公司 | Prefetcher, method of prefetch data and computer program product |
| US10296643B2 (en) * | 2016-01-12 | 2019-05-21 | Sugarcrm Inc. | Mobile background listener influenced search results prioritization |
| CN106528156B (en) * | 2016-11-10 | 2019-07-19 | 腾讯科技（深圳）有限公司 | A kind of page data processing method and device |
| CN108009145A (en) * | 2017-12-18 | 2018-05-08 | 深圳市康必达控制技术有限公司 | Report form generation method and device |
| CN108415782A (en) * | 2018-02-23 | 2018-08-17 | 携程旅游网络技术（上海）有限公司 | Control communication means, device, electronic equipment, the storage medium of application program |
-
2018
- 2018-12-19 CN CN201811559994.5A patent/CN109857786B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9123069B1 (en) * | 2008-02-11 | 2015-09-01 | Amazon Technologies, Inc. | Moving transaction details forward in buying process |
| CN103546505A (en) * | 2012-07-12 | 2014-01-29 | 百度在线网络技术（北京）有限公司 | Method, system and device for displaying page blocks in priority order |
| CN103838720A (en) * | 2012-11-20 | 2014-06-04 | 腾讯科技（深圳）有限公司 | Page file loading execution method and device |
| CN105138698A (en) * | 2015-09-25 | 2015-12-09 | 百度在线网络技术（北京）有限公司 | Dynamic layout method and device for webpages |
| CN105512295A (en) * | 2015-12-10 | 2016-04-20 | 网易（杭州）网络有限公司 | Information representation method and device and information system |
| CN107306192A (en) * | 2016-04-18 | 2017-10-31 | 中国移动通信集团广东有限公司 | A kind of service data transmission method, device and system |
| CN107341138A (en) * | 2017-06-29 | 2017-11-10 | 珠海市魅族科技有限公司 | A kind of information fill method and device, computer installation and readable storage medium storing program for executing |
Non-Patent Citations (1)
| Title |
|---|
| 《Web报表开发中的若干关键技术研究与应用》;高红艳;《中国优秀硕士学位论文全文数据库 信息科技辑》;20130430;I138-193 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109857786A (en) | 2019-06-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108549583B (en) | Big data processing method and device, server and readable storage medium | |
| US10831654B2 (en) | Cache management using multiple cache history lists | |
| US20120159116A1 (en) | Apparatus for processing remote page fault and method thereof | |
| US20180196603A1 (en) | Memory Management Method, Apparatus, and System | |
| CN110019496B (en) | Data reading and writing method and system | |
| CN109711190B (en) | Data table batch authorization method and device | |
| CN111950857A (en) | Index system management method and device based on service indexes and electronic equipment | |
| KR20220025746A (en) | Dynamic allocation of computing resources | |
| US10521381B2 (en) | Self-moderating bus arbitration architecture | |
| CN108319504B (en) | Memory occupation optimization method and device and readable storage medium | |
| US9311348B2 (en) | Method and system for implementing an array using different data structures | |
| CN110545313A (en) | message push control method and device and electronic equipment | |
| CN109543169B (en) | Report processing method and device | |
| CN110333843B (en) | Method and device for realizing high-precision timer of virtual machine and electronic equipment | |
| CN109857786B (en) | Page data filling method and device | |
| CN115237589A (en) | SR-IOV-based virtualization method, device and equipment | |
| CN109670324B (en) | Data access method and device | |
| CN111324258B (en) | Method, device, equipment and medium for generating contents of configuration items of multilevel pull-down menu | |
| CN117217977B (en) | GPU data access processing method, device and storage medium | |
| CN113742376A (en) | Data synchronization method, first server and data synchronization system | |
| CN110209466B (en) | Resource allocation method, resource allocation device and storage medium | |
| CN108804568B (en) | Method and device for storing copy data in Openstack in ceph | |
| CN113986134B (en) | Method for storing data, method and device for reading data | |
| CN111459411B (en) | Data migration method, device, equipment and storage medium | |
| CN109670114B (en) | Drawing rule recommendation method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |