Browse data loading method, product, computer equipment and storage medium

Abstract

The invention relates to a browsing data loading method, a product, computer equipment and a storage medium. According to the method, the storage data corresponding to the target page number is loaded preferentially, the loading display speed of the browse data is increased, then when the paging sub-level data corresponding to the target page number is loaded, the updating time, the name and the access frequency of the sub-level data are obtained, and the page number of the sub-level data is increased. And loading the sub-level data according to the descending order of the updating time, the name and the loading weight of the access times of the sub-level data, so that the latest updated data and the frequently accessed data can be loaded preferentially, the viewing requirement of a user during data browsing is met, the time of waiting for page loading by the user is shortened, and the user experience and the system stability are improved.

Description

Technical Field

[0001] The present application relates to the technical field of page loading, and in particular to a browsing data loading method, product, computer device and storage medium. Background Art

[0002] Storage systems provide web-based (web-based) services so that users can monitor and manage storage systems. These services are implemented by calling the storage system's command line interface (CLI). With the expansion of storage resource specifications and the increase in data volume, web-based services are facing increasing pressure. This leads to problems such as interface timeouts, browsing data loading timeouts, page freezes, and even browser crashes.

[0003] At present, the commonly used solutions are to dynamically adjust the timeout strategy and load the stored data in pages. However, these two methods are effective for storage data with simple structures, but have limited rendering effects on storage data with complex structures, such as a tree structure with a large number of child data. In this case, access interface timeouts, page loading timeouts, or freezes may still occur. In summary, for the page display of storage data with complex structures in the storage system, it is necessary to further optimize the front-end and back-end data interaction methods and rendering mechanisms to avoid access interface timeouts and slow page loading problems, reduce the time users wait for page loading, and improve user experience and system stability. Summary of the invention

[0004] Based on this, a browsing data loading method, device, computer equipment and storage medium are provided, which can avoid the occurrence of access interface timeout and slow page loading problems, reduce the time users wait for page loading, and improve user experience and system stability.

[0005] On the one hand, a browsing data loading method is provided, which is used for a server, and the method comprises: In response to obtaining a data reading request sent by the web page, obtaining a single-page sub-level data amount and a sub-level truncation position value carried in the data reading request; Acquire the tree-shaped storage data corresponding to the data read request, identify the total number of child data of the tree-shaped storage data, and determine whether the child truncation position value is less than the total number of child data, wherein the tree-shaped storage data includes parent data and child data; In response to the sub-level truncation position value being less than the total amount of the sub-level data, the sub-level data is located according to the sub-level truncation position value and the amount of the sub-level data on a single page, and paging is performed to form paging sub-level data, and an updated sub-level truncation position value is obtained by summing the current sub-level truncation position value and the amount of the sub-level data on a single page, and the paging sub-level data is returned to the web page end together with the updated sub-level truncation position value; In response to the sub-level truncation position value being greater than or equal to the total amount of sub-level data, the current sub-level truncation position value is modified to a preset end value as an updated sub-level truncation position value, and empty paginated sub-level data is returned to the web page along with the updated sub-level truncation position value, thereby ending the process.

[0006] Furthermore, before determining whether the sub-level cutoff position value is less than the total amount of sub-level data, the method further includes: Determine whether the total number of child data of the tree-shaped storage data is less than a first threshold; In response to the total number of child data of the tree-shaped storage data being less than a first threshold, returning the tree-shaped storage data to the web page end; In response to the total number of child data of the tree-shaped storage data being greater than or equal to a first threshold, weight calculation is performed on the child data of the tree-shaped storage data, and the child data of the tree-shaped storage data are sorted in descending order of weight.

[0007] Furthermore, the weight calculation of the child data of the tree-shaped storage data and sorting the child data of the tree-shaped storage data in descending order of weight includes: Acquire the update time of the sub-level data, and set the first loading weight value of the sub-level data according to the update time; Obtaining the name of the sub-level data, and setting the second loading weight value of the sub-level data according to the first letter of the name of the sub-level data; Obtaining the number of accesses to the sub-level data, and setting a third loading weight value of the sub-level data according to the number of accesses; The first loading weight value, the second loading weight value and the third loading weight value are summed to obtain a sub-level loading weight for each sub-level data; The sub-level data are sorted in descending order of the sub-level loading weights.

[0008] Further, the obtaining the update time of the sub-level data and setting the first loading weight value of the sub-level data according to the update time includes: Determine whether the update time of the sub-level data is within the first time period, if so, set the first loading weight value to a first value, otherwise set the first loading weight value to a second value, and the first value is greater than the second value.

[0009] Further, the obtaining the name of the child data and setting the second loading weight value of the child data according to the first letter of the name of the child data includes: The first letter of the name of the sub-level data is obtained, and the second loading weight value is set to the third numerical value / ASCII (the first letter of the name).

[0010] Further, the obtaining the number of accesses to the sub-level data and setting the third loading weight value of the sub-level data according to the number of accesses includes: Determine whether the number of accesses to the sub-level data is greater than a preset access number threshold within the second time period. If so, set the third loading weight value to a fourth value. Otherwise, set the third loading weight value to a fifth value, and the fourth value is greater than the fifth value.

[0011] Furthermore, when returning the paging sub-level data to the web page, it also includes: The number of redundant sub-level data is set, and the number of redundant sub-level data sub-level data after the paged sub-level data is synchronously returned to the web page end.

[0012] Furthermore, the method further comprises: Calculate the total number of pages of the tree-shaped stored data according to the total number of sub-level data and the amount of sub-level data on a single page, use the sub-level data of the amount of sub-level data on a single page after the sub-level cutoff position value as the current page sub-level data, and obtain the page number corresponding to the current page sub-level data as the target page number; In response to returning the paging sub-level data corresponding to the target page number to the web page end, a page number adjacent to the target page number is obtained, and the paging sub-level data corresponding to the page number adjacent to the target page number is returned to the web page end.

[0013] On the other hand, a browsing data loading method is provided, which is used on a web page, and includes: In response to obtaining browsing data through the browser, the number of sub-level data browsed per page is calculated according to the size of the browser visualization window as the amount of sub-level data per page; Sending a data read request to the server, the data read request carrying a single-page sub-level data amount and a sub-level truncation position value, and setting the sub-level truncation position value returned to the server for the first time to be zero; In response to receiving the paging sub-level data fed back by the server, the paging sub-level data carries the updated sub-level cutoff position value, performs page rendering on the paging sub-level data, and displays the rendered paging sub-level data in the browser visualization window; Determine whether the updated sub-level cutoff position value is a preset end value; if not, determine that the browsing data is not fully fed back, start timed polling, obtain the next page of paging sub-level data and perform page rendering; if yes, determine that the browsing data has been fully fed back, and end polling.

[0014] Furthermore, the method further comprises: Store the paginated sub-level data returned from the server in the front-end database; In response to obtaining browsing data through the browser, determining whether the front-end database contains paging sub-level data corresponding to the browsing data; In response to the front-end database containing the paging sub-level data corresponding to the browsing data, reading the contained paging sub-level data from the front-end database and performing page rendering; In response to the front-end database not containing the paging sub-level data corresponding to the browsing data, obtaining the paging sub-level data corresponding to the browsing data from the server, updating the paging sub-level data obtained from the server to the front-end database, reading the paging sub-level data corresponding to the browsing data from the front-end database and performing page rendering; In response to the front-end database containing part of the paginated sub-level data corresponding to the browsing data, the sub-level data contained in the front-end is read from the front-end database and displayed after page rendering, and the sub-level data not contained in the front-end is obtained from the server and page rendering is performed.

[0015] Further, updating the paging sub-level data obtained from the server to the front-end database includes: After the front-end database obtains the paging sub-level data obtained from the server, redundant information in the paging sub-level data is identified and deleted by compression and deduplication.

[0016] Furthermore, the method further comprises: In response to detecting that a page is scrolled down in the browser, obtaining the paging sub-level data of the next page after scrolling from the front-end database and performing page rendering; In response to the updated sub-level cutoff position value not being the preset end value and the rendered paging sub-level data being greater than a second threshold, the displayed page sub-level data is cleared.

[0017] In another aspect, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps: In response to obtaining a data reading request sent by the web page, obtaining a single-page sub-level data amount and a sub-level truncation position value carried in the data reading request; Acquire the tree-shaped storage data corresponding to the data read request, identify the total number of child data of the tree-shaped storage data, and determine whether the child truncation position value is less than the total number of child data, wherein the tree-shaped storage data includes parent data and child data; In response to the sub-level truncation position value being less than the total amount of the sub-level data, the sub-level data is located according to the sub-level truncation position value and the amount of the sub-level data on a single page, and paging is performed to form paging sub-level data, and an updated sub-level truncation position value is obtained by summing the current sub-level truncation position value and the amount of the sub-level data on a single page, and the paging sub-level data is returned to the web page end together with the updated sub-level truncation position value; In response to the sub-level truncation position value being greater than or equal to the total amount of sub-level data, the current sub-level truncation position value is modified to a preset end value as an updated sub-level truncation position value, and empty paginated sub-level data is returned to the web page along with the updated sub-level truncation position value, thereby ending the process.

[0018] In another aspect, a computer device is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the following steps are implemented: In response to obtaining a data reading request sent by the web page, obtaining a single-page sub-level data amount and a sub-level truncation position value carried in the data reading request; Acquire the tree-shaped storage data corresponding to the data read request, identify the total number of child data of the tree-shaped storage data, and determine whether the child truncation position value is less than the total number of child data, wherein the tree-shaped storage data includes parent data and child data; In response to the sub-level truncation position value being less than the total amount of the sub-level data, the sub-level data is located according to the sub-level truncation position value and the amount of the sub-level data on a single page, and paging is performed to form paging sub-level data, and an updated sub-level truncation position value is obtained by summing the current sub-level truncation position value and the amount of the sub-level data on a single page, and the paging sub-level data is returned to the web page end together with the updated sub-level truncation position value; In response to the sub-level truncation position value being greater than or equal to the total amount of sub-level data, the current sub-level truncation position value is modified to a preset end value as an updated sub-level truncation position value, and empty paginated sub-level data is returned to the web page along with the updated sub-level truncation position value, thereby ending the process.

[0019] In another aspect, a computer-readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented: In response to obtaining a data reading request sent by the web page, obtaining a single-page sub-level data amount and a sub-level truncation position value carried in the data reading request; Acquire the tree-shaped storage data corresponding to the data read request, identify the total number of child data of the tree-shaped storage data, and determine whether the child truncation position value is less than the total number of child data, wherein the tree-shaped storage data includes parent data and child data; In response to the sub-level truncation position value being less than the total amount of the sub-level data, the sub-level data is located according to the sub-level truncation position value and the amount of the sub-level data on a single page, and paging is performed to form paging sub-level data, and an updated sub-level truncation position value is obtained by summing the current sub-level truncation position value and the amount of the sub-level data on a single page, and the paging sub-level data is returned to the web page end together with the updated sub-level truncation position value; In response to the sub-level truncation position value being greater than or equal to the total amount of sub-level data, the current sub-level truncation position value is modified to a preset end value as an updated sub-level truncation position value, and empty paginated sub-level data is returned to the web page along with the updated sub-level truncation position value, thereby ending the process.

[0020] The above-mentioned browsing data loading method, product, computer equipment and storage medium return the sub-level data of the tree-shaped storage data of the server to the web page in a truncated manner, and simultaneously use the sub-level truncation position value to count the number of sub-level data returned until all are returned. It can quickly provide the sub-level data with the minimum data volume that adapts to the size of the browser window of the web page, improve the loading and display speed of browsing data, meet the viewing needs of users when browsing data, reduce the time users wait for page loading, and improve user experience and system stability. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0022] Figure 1 An interactive diagram for browsing data loading methods in the prior art; Figure 2 An interactive diagram of browsing a data loading method in an embodiment of the present application; Figure 3 A flowchart of a method for loading browsing data for a server in one embodiment of the present application; Figure 4 A schematic diagram of a process flow of a sub-level data paging process in a browsing data loading method on a server in one embodiment of the present application; Figure 5 This is a flow chart of a method for loading browsing data on a web page in one embodiment of the present application; Figure 6 This is a flow chart of the front-end database reading and writing process steps in one embodiment of the present application; Figure 7This is a structural block diagram of a browsing data loading device in one embodiment of the present application; Figure 8 This is an internal structure diagram of a computer device in one embodiment of the present application; Fig. 9 This is a diagram of the internal structure of another computer device in one embodiment of the present application. DETAILED DESCRIPTION

[0023] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0024] As described in the background technology, Figure 1 In the storage data under the tree structure, the page loading is performed according to the parent level. However, when there is a large amount of child data under the parent level, the amount of data interaction between the front-end and back-end is too large, which may cause response timeout. In addition, during the front-end rendering process, the browser memory consumption increases, which may cause the rendering speed to slow down or even fail.

[0025] To solve the above problems, the embodiment of the present invention creatively proposes a browsing data loading method, which realizes rapid data positioning response by automatically polling and transmitting a large amount of sub-level data in batches and automatically recording the data interception location identifier, thereby reducing the amount of data rendered by the browser and the amount of data saved, read and stored in the front-end database, effectively improving the data loading rate, reducing browser memory consumption, and reducing the browser burden, thereby shortening the page response waiting time and improving the user experience.

[0026] The browsing data loading method provided in this application can be applied to Figure 2 In the application environment shown in the figure, Figure 1 Add a data processing module to load sub-level data in batches. The web page communicates with the server through the network. The web page can be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, and portable wearable devices. The server can be implemented with an independent server or a server cluster composed of multiple servers. The server includes a service, a data processing module, and a storage data module for storing and storing data. Figure 2As shown in the figure, after the full tree-shaped storage data is obtained from the command line interface (CLI) and the result data is returned to the server (Service), it will be received and intercepted by the newly added data processing module, and then intercepted and returned through its sub-level data paging processing process. The sub-level data paging processing process truncates and pages the stored data according to the interception location identifier (LOC) and page number passed by the browser through threshold judgment, sorting, positioning, interception, etc., and then returns it to the server, and then returns it to the web page (web page).

[0027] In one embodiment, Figure 3 , Figure 4 As shown, a browsing data loading method is provided, which is used for a server, and the method comprises the following steps: Step S1, in response to obtaining a data reading request sent by a web page, obtaining a single-page sub-level data volume and a sub-level truncation position value carried in the data reading request; Step S2, obtaining the tree-shaped storage data corresponding to the data read request, identifying the total number of child data of the tree-shaped storage data, and determining whether the child truncation position value is less than the total number of child data, wherein the tree-shaped storage data includes parent data and child data; Step S3, in response to the sub-level truncation position value being less than the total amount of sub-level data, the sub-level data is located according to the sub-level truncation position value and the amount of sub-level data on a single page, and paging is performed to form paging sub-level data, and an updated sub-level truncation position value is obtained by summing the current sub-level truncation position value and the amount of sub-level data on a single page, and the paging sub-level data is returned to the web page end together with the updated sub-level truncation position value; Step S4, in response to the sub-level truncation position value being greater than or equal to the total amount of sub-level data, the current sub-level truncation position value is modified to a preset end value as an updated sub-level truncation position value, and empty paginated sub-level data is returned to the web page along with the updated sub-level truncation position value, thereby ending the process.

[0028] Among them, the sub-level data of the tree-shaped storage data of the server is truncated and returned to the web page, and the sub-level truncation position value is used to count the number of sub-level data returned until all are returned. This can quickly provide the sub-level data with the minimum data volume that adapts to the browser window size of the web page, improve the loading and display speed of browsing data, meet the viewing needs of users when browsing data, reduce the time users wait for page loading, and improve user experience and system stability.

[0029] In this embodiment, before determining whether the sub-level cutoff position value is less than the total amount of sub-level data, the method further includes: Determine whether the total number of child data of the tree-shaped storage data is less than a first threshold; In response to the total number of child data of the tree-shaped storage data being less than a first threshold, returning the tree-shaped storage data to the web page end; In response to the total number of child data of the tree-shaped storage data being greater than or equal to a first threshold, weight calculation is performed on the child data of the tree-shaped storage data, and the child data of the tree-shaped storage data are sorted in descending order of weight.

[0030] Among them, when the total amount of sub-level data is less than the first threshold, all data is returned, otherwise the sub-level data is sorted in descending order of weight, and after the sorting is completed, the amount of sub-level data and the truncation position are determined. In this way, whether the total amount of sub-level data is suitable for all to be returned can be effectively considered.

[0031] In this embodiment, the weight calculation of the child data of the tree-shaped storage data and sorting the child data of the tree-shaped storage data in descending order of weight includes: Acquire the update time of the sub-level data, and set the first loading weight value of the sub-level data according to the update time; Obtaining the name of the sub-level data, and setting the second loading weight value of the sub-level data according to the first letter of the name of the sub-level data; Obtaining the number of accesses to the sub-level data, and setting a third loading weight value of the sub-level data according to the number of accesses; The first loading weight value, the second loading weight value and the third loading weight value are summed to obtain a sub-level loading weight for each sub-level data; The sub-level data are sorted in descending order of the sub-level loading weights.

[0032] Intelligently identify the weight of sub-level data, provide a strong basis for the sorting of sub-level data, and ensure that customers can quickly obtain the storage data they expect. Through the data weight algorithm, intelligently identify the weight of sub-level data, provide a strong basis for the sorting of sub-level data, and ensure that customers can quickly obtain the storage data they expect.

[0033] In this embodiment, the obtaining of the update time of the sub-level data and setting the first loading weight value of the sub-level data according to the update time includes: Determine whether the update time of the sub-level data is within the first time period, if so, set the first loading weight value to a first value, otherwise set the first loading weight value to a second value, and the first value is greater than the second value.

[0034] In this embodiment, the obtaining of the name of the sub-level data and setting the second loading weight value of the sub-level data according to the first letter of the name of the sub-level data includes: The first letter of the name of the sub-level data is obtained, and the second loading weight value is set to the third numerical value / ASCII (the first letter of the name).

[0035] ASCII is the American Standard Code for Information Interchange. ASCII code uses a specified 7-bit or 8-bit binary number combination to represent 128 or 256 possible characters. The ASCII code table is shown in Table 1. For example, in decimal operation, ASCII (A) = 65. The meaning of the first letter of the name is the first letter of the pinyin of the name.

[0036] Table 1 ASCII code table

[0037] In this embodiment, the obtaining of the number of accesses to the sub-level data and setting the third loading weight value of the sub-level data according to the number of accesses includes: Determine whether the number of accesses to the sub-level data is greater than a preset access number threshold within the second time period. If so, set the third loading weight value to a fourth value. Otherwise, set the third loading weight value to a fifth value, and the fourth value is greater than the fifth value.

[0038] Specifically, in the process of implementing the sub-level data paging processing, in order to ensure the orderliness of the data and the correctness of the truncation position, the stored data is intelligently and effectively sorted.

[0039] Assume that the feature weights are w1, w2, and w3, corresponding to the importance of update time, name, and number of visits, respectively. The calculation is as follows: Time weight: If the data has been updated within 1 month, the first loading weight is , otherwise ; Name order weight: The second loading weight is w2 / ASCII (the first letter of the name); Visits weight: If the number of visits in the last three days is greater than 100, the third loading weight is , otherwise w3; The calculation formula for the final child loading weight is: .

[0040] The weight of the data is calculated through the above formula, and the data is sorted from large to small according to the weight. The data with large weight is returned first and displayed on the web page to ensure that customers can quickly obtain the storage data they expect.

[0041] In this embodiment, when returning the paging sub-level data to the web page, it also includes: The number of redundant sub-level data is set, and the number of redundant sub-level data sub-level data after the paged sub-level data is synchronously returned to the web page end.

[0042] Preferably, the number of redundant sub-level data is 5, and the single-page sub-level data volume pageSize = Int (H / h), and when loading the single-page sub-level data volume, the redundant sub-level data number of sub-level data is additionally loaded to realize the existence of a scroll bar to display the data behind.

[0043] In this embodiment, the method further includes: Calculate the total number of pages of the tree-shaped stored data according to the total number of sub-level data and the amount of sub-level data on a single page, use the sub-level data of the amount of sub-level data on a single page after the sub-level cutoff position value as the current page sub-level data, and obtain the page number corresponding to the current page sub-level data as the target page number; In response to returning the paging sub-level data corresponding to the target page number to the web page end, a page number adjacent to the target page number is obtained, and the paging sub-level data corresponding to the page number adjacent to the target page number is returned to the web page end.

[0044] It is understandable that after the paging sub-level data corresponding to the target page number is loaded, the user may still view the data of the remaining pages, so the data of the remaining pages needs to be loaded in time to improve the loading speed when viewing the data of the remaining pages.

[0045] By loading only the last two pages of data in the visual view of the window, new page display data will be automatically loaded when the page is scrolled, replacing the original page data display.

[0046] like Figure 5 As shown, a browsing data loading method is provided, which is used for a web page, and includes: Step S11, in response to obtaining browsing data through a browser, calculating the number of sub-level data browsed per page according to the size of the browser visualization window as the amount of sub-level data per page; Step S12, sending a data read request to the server, the data read request carrying a single-page sub-level data amount and a sub-level truncation position value, and setting the sub-level truncation position value returned to the server for the first time to zero; Step S13, in response to receiving the paging sub-level data fed back by the server, the paging sub-level data carrying the updated sub-level cutoff position value, performing page rendering on the paging sub-level data, and displaying the rendered paging sub-level data in the browser visualization window; Step S14, determining whether the updated sub-level cutoff position value is a preset end value; if not, determining that the browsing data is not fully fed back, starting timed polling, obtaining the next page of paging sub-level data and performing page rendering; if yes, determining that the browsing data is fully fed back, ending polling.

[0047] Among them, it is executed from the first page data loading form, and the number of loaded sub-level data is counted in the form of cumulative sub-level truncation position values ​​to realize truncated paging return data. The sub-level truncation position value returned to the server for the first time is set to zero; if the amount of sub-level data on a single page is 10, then the paging sub-level data fed back by the server each time is 10 sub-level data, and the sub-level truncation position value is updated to 10 when the sub-level data is returned for the first time, and the sub-level truncation position value is updated to 20 when the sub-level data is returned for the second time, and so on, until the server feeds back all the browsing data, at which time the server updates the sub-level truncation position value to a preset end value, and the preset end value is preferably -1. The web page end can recognize that the server feeds back all the browsing data based on the preset end value and end the polling.

[0048] When the web page receives the response data, it will use the interception position identification bit value of the result data to determine whether there is any remaining storage data to be requested. If so, it will start polling to obtain the subsequent data to be processed, so as to achieve the purpose of loading and storing data in batches. Reduce the risk of response timeout due to excessive data interaction between the front-end and back-end.

[0049] Among them, the web page receives the stored data for display in batches and renders and displays them in sequence, avoiding rendering all the data at one time, preventing the problem of slow page rendering or timeout caused by excessive factor-level data, and improving the page rendering rate.

[0050] like Figure 6 As shown, in this embodiment, the method further includes: Store the paginated sub-level data returned from the server in the front-end database; In response to obtaining browsing data through the browser, determining whether the front-end database contains paging sub-level data corresponding to the browsing data; In response to the front-end database containing the paging sub-level data corresponding to the browsing data, reading the contained paging sub-level data from the front-end database and performing page rendering; In response to the front-end database not containing the paging sub-level data corresponding to the browsing data, obtaining the paging sub-level data corresponding to the browsing data from the server, updating the paging sub-level data obtained from the server to the front-end database, reading the paging sub-level data corresponding to the browsing data from the front-end database and performing page rendering; In response to the front-end database containing part of the paginated sub-level data corresponding to the browsing data, the sub-level data contained in the front-end is read from the front-end database and displayed after page rendering, and the sub-level data not contained in the front-end is obtained from the server and page rendering is performed.

[0051] Among them, the front-end storage module reduces the number of interactions between the web page and the server, increases the speed at which the page obtains stored data, effectively reduces user waiting time, and improves user experience.

[0052] Understandably, see Figure 6 , it can also be set: in response to the front-end database containing part of the pagination sub-level data corresponding to the browsing data, the browsing data is divided into the sub-level data contained in the front-end and the sub-level data not contained in the front-end, the sub-level data not contained in the front-end is obtained from the server and updated to the front-end database to be merged with the front-end sub-level data contained, the pagination sub-level data corresponding to the browsing data is read from the front-end database, and the pagination sub-level data read from the front-end database is rendered in the browser visualization window.

[0053] In this way, all the paging sub-level data corresponding to the browsing data can be loaded into the front-end database first, and then the paging sub-level data read from the front-end database can be uniformly rendered in the browser visualization window, which can avoid the situation where only part of the content is displayed in the browsing window and reduce the number of rendering times.

[0054] In this embodiment, updating the paging sub-level data obtained from the server to the front-end database includes: After the front-end database obtains the paging sub-level data obtained from the server, redundant information in the paging sub-level data is identified and deleted by compression and deduplication.

[0055] Because the paginated sub-level data obtained from the server may contain the number of redundant sub-level data, the storage capacity of the front-end database can be effectively reduced by compressing and deduplicating the number of redundant sub-level data, further reducing the consumption of browser memory and improving page response speed.

[0056] In this embodiment, the method further includes: In response to detecting that a page is scrolled down in the browser, obtaining the paging sub-level data of the next page after scrolling from the front-end database and performing page rendering; In response to the updated sub-level cutoff position value not being the preset end value and the rendered paging sub-level data being greater than a second threshold, the displayed page sub-level data is cleared.

[0057] When the data scrolls down the page, the web page obtains the paging data from the front-end database, and sets the web page to clear the originally displayed page sub-level data in time to avoid data accumulation.

[0058] like Figure 6 As shown in the figure, due to the large amount of stored data, in order to reduce the number of front-end and back-end interactions and time consumption, a front-end storage module is added. After the front-end obtains the stored data, it uses compression and deduplication to identify redundant information in the data to reduce storage occupancy. The compressed data is small in size and has a faster transmission speed. Then it is asynchronously written to the front-end database. When the subsequent page data is refreshed and obtained, the stored data is no longer obtained from the back-end server, but is directly read from the front-end database, which improves the response rate of the page and improves the user experience.

[0059] By effectively displaying the page data and displaying only the data of the last two pages according to the position and height of the visualization window, the rendering and display of all the data is avoided, which greatly reduces the memory usage of the page and reduces the occurrence of browser freezing or crashes. In addition, the data in the front-end database is compressed and deduplicated to further reduce the consumption of browser memory, improve the page response speed, and ensure the stability of the browser. The acquired storage data is written asynchronously to the front-end storage database through compression and deduplication. When the web page reads the data, it is read from the front-end database first, which reduces the number of interactions between the web page and the server, improves the speed of the page to obtain storage data, and reduces the page waiting time.

[0060] See also Figure 2 , Figure 4 When the full storage data loading method is implemented, the following steps are included: 1) The user first accesses the storage page data in the tree structure, such as the remote replication page (parent level: remote replication consistency group, child level: remote replication relationship, the child level data volume is 10,000).

[0061] 2) The web page obtains the height H of the current visualization window, and calculates the number of child virtual pages based on the height h of each row of data: Page Size = Int (H / h) + 5. Note: Adding 5 is to ensure that the number of loaded remote replication relationship rows can cover the entire visualization window.

[0062] 3) The web page carries the request parameters page Size value, sub-level page number page Num (initialized to 1), and sub-level sub-level truncation position value (initialized to 0), and sends a Service interface request.

[0063] 4) After receiving the request from the web page, the Service sends a request to the data processing module to obtain the stored data, carrying the parameters of the web page.

[0064] 5) The data processing module issues a CLI command to obtain the full amount of stored data (the parent - level remote replication consistency group G1 and its child - level remote replication relationships R1 - R n , n>10000). This step only issues the CLI command and writes it to the memory when executed for the first time. Subsequently, the full amount of stored data is directly obtained from the memory.

[0065] 6) The data processing module truncates and pages the child - level stored data through the child - level paging process according to the input parameters.

[0066] For example Figure 2 , the implementation steps of the child - level paging process are as follows: The child - level paging process receives input parameters: tree - shaped stored data, child - level truncation position value LOC, and the number of items per page pageSize.

[0067] Judge the amount of child - level data under the parent level: For example, the total number of children is Size, and the magnitude threshold is set as threshold M. Size>=M: Continue to execute according to the following process c). Size<M: Return all child - level stored data, modify LOC to - 1, and end the process.

[0068] Calculate the weights of the child - level stored data according to the data weight algorithm formula, and then sort them from largest to smallest according to the weights.

[0069] After the sorting is completed, judge the amount of child - level data and the child - level truncation position value: LOC>=Size: Return that the child - level stored data is empty, modify LOC to - 1, and end the process.

[0070] LOC<Size: Continue to execute according to the following step e).

[0071] Quickly locate the child - level stored data according to the child - level truncation position value, and perform truncation paging.

[0072] Return the paged child - level data, and modify LOC to LOC + page Size.

[0073] End the process.

[0074] 7) The data processing module obtains according to the child - level paging process: the parent - level remote replication consistency group G1, the child - level data after paging truncation , the child - level truncation position value .

[0075] 8) The data processing module returns the obtained result to the server.

[0076] 9) The server returns the result to the web page.

[0077] 10) After the web page receives the response result, when it receives the first response data, the following three events are triggered at the same time: Render the page display data for the first response, and only render and display the page data of the first two pages.

[0078] The result data is compressed and deduplicated, and then written into the front-end database.

[0079] When it is determined that LOC>-1, start the scheduled polling, and follow steps 3-10 to obtain and process the subsequent sub-level data. When LOC=-1, it means that all sub-level data requests have been completed, and the polling ends.

[0080] 11) When the user scrolls down the page, the web page obtains the paginated sub-level data from the front-end database.

[0081] 12) After the web page obtains the paginated sub-level data, it clears the originally displayed page sub-level data and renders the newly added paginated sub-level data for display.

[0082] Through all the above steps, the web page can quickly and stably load a large amount of sub-level data for rendering and display.

[0083] In the above browsing data loading method, the sub-level data of the tree-shaped storage data of the server is returned to the web page in a truncated manner, and the sub-level truncation position value is used to simultaneously count the number of sub-level data returned until all are returned. This can quickly provide the sub-level data with the minimum data volume that adapts to the size of the browser window on the web page, improve the loading and display speed of the browsing data, meet the viewing needs of users when browsing data, reduce the time users wait for page loading, and improve user experience and system stability.

[0084] In one embodiment, Figure 7 As shown, a browsing data loading device 10 is provided, comprising: a data reading request module 1, a data processing module 2, a target page number data loading module 3, and a loading sequence control module 4.

[0085] The data reading request module 1 is used for obtaining the single-page sub-level data volume and the sub-level truncation position value carried in the data reading request in response to obtaining the data reading request sent by the web page.

[0086] The data processing module 2 is used to obtain the tree-shaped storage data corresponding to the data read request, identify the total number of child data of the tree-shaped storage data, and determine whether the child truncation position value is less than the total number of child data, wherein the tree-shaped storage data includes parent data and child data; in response to the child truncation position value being less than the total number of child data, the child data is positioned according to the child truncation position value and the amount of child data on a single page, and paging is performed to form paged child data, and the updated child truncation position value is obtained by summing the current child truncation position value and the amount of child data on a single page, and the paged child data is returned to the web page end together with the updated child truncation position value; in response to the child truncation position value being greater than or equal to the total number of child data, the current child truncation position value is modified to a preset end value as the updated child truncation position value, and empty paged child data is returned to the web page end together with the updated child truncation position value, and the process ends.

[0087] In this embodiment, the loading order control module 4 is used for, before determining whether the sub-level cutoff position value is less than the total amount of sub-level data: Determine whether the total number of child data of the tree-shaped storage data is less than a first threshold; In response to the total number of child data of the tree-shaped storage data being less than a first threshold, returning the tree-shaped storage data to the web page end; In response to the total number of child data of the tree-shaped storage data being greater than or equal to a first threshold, weight calculation is performed on the child data of the tree-shaped storage data, and the child data of the tree-shaped storage data are sorted in descending order of weight.

[0088] In this embodiment, the weight calculation of the child data of the tree-shaped storage data and sorting the child data of the tree-shaped storage data in descending order of weight includes: Acquire the update time of the sub-level data, and set the first loading weight value of the sub-level data according to the update time; Obtaining the name of the sub-level data, and setting the second loading weight value of the sub-level data according to the first letter of the name of the sub-level data; Obtaining the number of accesses to the sub-level data, and setting a third loading weight value of the sub-level data according to the number of accesses; The first loading weight value, the second loading weight value and the third loading weight value are summed to obtain a sub-level loading weight for each sub-level data; The sub-level data are sorted in descending order of the sub-level loading weights.

[0089] In this embodiment, the obtaining of the update time of the sub-level data and setting the first loading weight value of the sub-level data according to the update time includes: Determine whether the update time of the sub-level data is within the first time period, if so, set the first loading weight value to a first value, otherwise set the first loading weight value to a second value, and the first value is greater than the second value.

[0090] In this embodiment, the obtaining of the name of the sub-level data and setting the second loading weight value of the sub-level data according to the first letter of the name of the sub-level data includes: The first letter of the name of the sub-level data is obtained, and the second loading weight value is set to the third numerical value / ASCII (the first letter of the name).

[0091] In this embodiment, the obtaining of the number of accesses to the sub-level data and setting the third loading weight value of the sub-level data according to the number of accesses includes: Determine whether the number of accesses to the sub-level data is greater than a preset access number threshold within the second time period. If so, set the third loading weight value to a fourth value. Otherwise, set the third loading weight value to a fifth value, and the fourth value is greater than the fifth value.

[0092] In this embodiment, when returning the paging sub-level data to the web page, it also includes: The number of redundant sub-level data is set, and the number of redundant sub-level data sub-level data after the paged sub-level data is synchronously returned to the web page end.

[0093] In this embodiment, the target page number data loading module 3 is used to: Calculate the total number of pages of the tree-shaped stored data according to the total number of sub-level data and the amount of sub-level data on a single page, use the sub-level data of the amount of sub-level data on a single page after the sub-level cutoff position value as the current page sub-level data, and obtain the page number corresponding to the current page sub-level data as the target page number; In response to returning the paging sub-level data corresponding to the target page number to the web page end, a page number adjacent to the target page number is obtained, and the paging sub-level data corresponding to the page number adjacent to the target page number is returned to the web page end.

[0094] On the other hand, a browsing data loading system 10 is provided, which is used for a web page, and includes: a data reading request sending module 5 and a page rendering module 6.

[0095] The module 5 for sending a data reading request is used for, in response to obtaining browsing data through a browser, calculating the number of sub-level data browsed per page as the amount of sub-level data for a single page according to the size of the visual window of the browser; sending a data reading request to a server, wherein the data reading request carries the amount of sub-level data for a single page and a sub-level cutoff position value, and setting the sub-level cutoff position value returned to the server for the first time to zero.

[0096] The page rendering module 6 is used to respond to the receipt of paging sub-level data fed back by the server, the paging sub-level data carrying an updated sub-level truncation position value, perform page rendering on the paging sub-level data, and display the rendered paging sub-level data in the browser visualization window; determine whether the updated sub-level truncation position value is a preset end value; if not, determine that the browsing data has not been fully fed back, start timed polling, obtain the next page of paging sub-level data and perform page rendering; if yes, determine that the browsing data has been fully fed back, and end polling.

[0097] In this embodiment, the browsing data loading system 10 further includes: a front-end storage module 7 .

[0098] The front-end storage module 7 is used to store the paging sub-level data returned from the server in the front-end database; in response to obtaining browsing data through the browser, it is determined whether the front-end database contains the paging sub-level data corresponding to the browsing data.

[0099] The page rendering module 6 is used for, in response to the front-end database containing paging sub-level data corresponding to the browsing data, reading the included paging sub-level data from the front-end database and rendering the page; in response to the front-end database not containing the paging sub-level data corresponding to the browsing data, obtaining the paging sub-level data corresponding to the browsing data from the server, updating the paging sub-level data obtained from the server to the front-end database, reading the paging sub-level data corresponding to the browsing data from the front-end database and rendering the page; in response to the front-end database containing part of the paging sub-level data corresponding to the browsing data, reading the sub-level data contained in the front-end from the front-end database, rendering the page and displaying it, and obtaining the sub-level data not contained in the front-end from the server and rendering the page.

[0100] In this embodiment, updating the paging sub-level data obtained from the server to the front-end database includes: After the front-end database obtains the paging sub-level data obtained from the server, redundant information in the paging sub-level data is identified and deleted by compression and deduplication.

[0101] In this embodiment, the page rendering module 6 is used to: in response to detecting that the page is scrolled down in the browser, obtain the paging sub-level data of the next page after scrolling from the front-end database and render the page; in response to the updated sub-level truncation position value not being a preset end value, and the rendered paging sub-level data is greater than a second threshold, clear the displayed page sub-level data.

[0102] In the above-mentioned browsing data loading device, the sub-level data of the tree-shaped storage data of the server are truncated and returned to the web page, and the sub-level truncation position value is used to count the number of sub-level data returned until all are returned. This can quickly provide the sub-level data with the minimum data volume that adapts to the browser window size of the web page, improve the loading and display speed of browsing data, meet the viewing needs of users when browsing data, reduce the time users wait for page loading, and improve user experience and system stability.

[0103] Among them, a data processing module is added to realize intelligent batch loading of sub-level data: the sub-level automatic truncation and paging are recorded, and the sub-level truncation position value is returned to the web page in batches, which improves the efficiency of front-end and back-end interaction. A data weight algorithm is added to realize effective sorting of sub-level data: the weight of sub-level data is intelligently identified through the data weight algorithm, providing a strong basis for the sorting of sub-level data, and ensuring that customers can quickly obtain the storage data they expect. A front-end storage module is added to realize fast reading and writing of storage data: a front-end storage database module is added to reduce storage occupancy by compressing and deduplicating the acquired storage data, identifying redundant information in the data, and then improving transmission efficiency. Then, the data is asynchronously written to the front-end storage database. When the web page reads data, it is read from the front-end database first, which reduces the number of interactions between the web page and the server, improves the speed of the page obtaining storage data, and reduces the page waiting time. According to the position and height of the page visualization window, the storage data of the corresponding page is automatically matched and rendered: through the effective display of page data, according to the position and height of the visualization window, only the amount of data of the last two pages is displayed, avoiding the rendering and display of all data, greatly reducing the page memory usage, and reducing the occurrence of browser jamming or flash back problems.

[0104] The specific definition of the browsing data loading device can be found in the definition of the browsing data loading method above, which will not be repeated here. Each module in the above browsing data loading device can be implemented in whole or in part by software, hardware and a combination thereof. Each of the above modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory in the computer device in the form of software, so that the processor can call and execute the operations corresponding to each of the above modules.

[0105] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Figure 8 As shown. The computer device includes a processor, a memory, a network interface and a database connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store browsing data paging sub-level data. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a browsing data loading method is implemented.

[0106] In one embodiment, a computer device is provided. The computer device may be a web page terminal, and its internal structure diagram may be as follows: Fig. 9 As shown. The computer device includes a processor, a memory, a network interface, a display screen and an input device connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a browsing data loading method is implemented. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covered on the display screen, or a key, trackball or touchpad set on the computer device housing, or an external keyboard, touchpad or mouse, etc.

[0107] Those skilled in the art will understand that Figure 8 , Fig. 9 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0108] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps: In response to obtaining a data reading request sent by the web page, obtaining a single-page sub-level data amount and a sub-level truncation position value carried in the data reading request; Acquire the tree-shaped storage data corresponding to the data read request, identify the total number of child data of the tree-shaped storage data, and determine whether the child truncation position value is less than the total number of child data, wherein the tree-shaped storage data includes parent data and child data; In response to the sub-level truncation position value being less than the total amount of the sub-level data, the sub-level data is located according to the sub-level truncation position value and the amount of the sub-level data on a single page, and paging is performed to form paging sub-level data, and an updated sub-level truncation position value is obtained by summing the current sub-level truncation position value and the amount of the sub-level data on a single page, and the paging sub-level data is returned to the web page end together with the updated sub-level truncation position value; In response to the sub-level truncation position value being greater than or equal to the total amount of sub-level data, the current sub-level truncation position value is modified to a preset end value as an updated sub-level truncation position value, and empty paginated sub-level data is returned to the web page along with the updated sub-level truncation position value, thereby ending the process.

[0109] For specific limitations on the steps implemented when the computer program is executed by the processor, please refer to the limitations on the method for loading browsing data above, which will not be repeated here.

[0110] In one embodiment, a computer device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the following steps when executing the computer program: In response to obtaining a data reading request sent by the web page, obtaining a single-page sub-level data amount and a sub-level truncation position value carried in the data reading request; Acquire the tree-shaped storage data corresponding to the data read request, identify the total number of child data of the tree-shaped storage data, and determine whether the child truncation position value is less than the total number of child data, wherein the tree-shaped storage data includes parent data and child data; In response to the sub-level truncation position value being less than the total amount of the sub-level data, the sub-level data is located according to the sub-level truncation position value and the amount of the sub-level data on a single page, and paging is performed to form paging sub-level data, and an updated sub-level truncation position value is obtained by summing the current sub-level truncation position value and the amount of the sub-level data on a single page, and the paging sub-level data is returned to the web page end together with the updated sub-level truncation position value; In response to the sub-level truncation position value being greater than or equal to the total amount of sub-level data, the current sub-level truncation position value is modified to a preset end value as an updated sub-level truncation position value, and empty paginated sub-level data is returned to the web page along with the updated sub-level truncation position value, thereby ending the process.

[0111] For the specific limitations on the steps implemented when the processor executes the computer program, please refer to the limitations on the method for loading browsing data above, which will not be repeated here.

[0112] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented: In response to obtaining a data reading request sent by the web page, obtaining a single-page sub-level data amount and a sub-level truncation position value carried in the data reading request; Acquire the tree-shaped storage data corresponding to the data read request, identify the total number of child data of the tree-shaped storage data, and determine whether the child truncation position value is less than the total number of child data, wherein the tree-shaped storage data includes parent data and child data; In response to the sub-level truncation position value being less than the total amount of the sub-level data, the sub-level data is located according to the sub-level truncation position value and the amount of the sub-level data on a single page, and paging is performed to form paging sub-level data, and an updated sub-level truncation position value is obtained by summing the current sub-level truncation position value and the amount of the sub-level data on a single page, and the paging sub-level data is returned to the web page end together with the updated sub-level truncation position value; In response to the sub-level truncation position value being greater than or equal to the total amount of sub-level data, the current sub-level truncation position value is modified to a preset end value as an updated sub-level truncation position value, and empty paginated sub-level data is returned to the web page along with the updated sub-level truncation position value, thereby ending the process.

[0113] For specific limitations on the steps implemented when the computer program is executed by the processor, please refer to the limitations on the method for loading browsing data above, which will not be repeated here.

[0114] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application may include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0115] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0116] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.

Claims

1. A browsing data loading method, used in a server, characterized in that: include: In response to obtaining a data reading request sent by the web page, obtaining a single-page sub-level data amount and a sub-level truncation position value carried in the data reading request; Acquire the tree-shaped storage data corresponding to the data read request, identify the total number of child data of the tree-shaped storage data, and determine whether the child truncation position value is less than the total number of child data, wherein the tree-shaped storage data includes parent data and child data; In response to the sub-level truncation position value being less than the total amount of the sub-level data, the sub-level data is located according to the sub-level truncation position value and the amount of the sub-level data on a single page, and paging is performed to form paging sub-level data, and an updated sub-level truncation position value is obtained by summing the current sub-level truncation position value and the amount of the sub-level data on a single page, and the paging sub-level data is returned to the web page end together with the updated sub-level truncation position value; In response to the sub-level truncation position value being greater than or equal to the total amount of sub-level data, the current sub-level truncation position value is modified to a preset end value as an updated sub-level truncation position value, and empty paginated sub-level data is returned to the web page along with the updated sub-level truncation position value, thereby ending the process.

2. The browsing data loading method according to claim 1, characterized in that: Before determining whether the sub-level cutoff position value is less than the total amount of sub-level data, the method further includes: Determine whether the total number of child data of the tree-shaped storage data is less than a first threshold; In response to the total number of child data of the tree-shaped storage data being less than a first threshold, returning the tree-shaped storage data to the web page end; In response to the total number of child data of the tree-shaped storage data being greater than or equal to a first threshold, weight calculation is performed on the child data of the tree-shaped storage data, and the child data of the tree-shaped storage data are sorted in descending order of weight.

3. The browsing data loading method according to claim 2, characterized in that: The step of calculating weights of the child data of the tree-shaped storage data and sorting the child data of the tree-shaped storage data in descending order of weights includes: Acquire the update time of the sub-level data, and set the first loading weight value of the sub-level data according to the update time; Obtaining the name of the sub-level data, and setting the second loading weight value of the sub-level data according to the first letter of the name of the sub-level data; Obtaining the number of accesses to the sub-level data, and setting a third loading weight value of the sub-level data according to the number of accesses; The first loading weight value, the second loading weight value and the third loading weight value are summed to obtain a sub-level loading weight for each sub-level data; The sub-level data are sorted in descending order of the sub-level loading weights.

4. The browsing data loading method according to claim 3, characterized in that: The obtaining the update time of the sub-level data and setting the first loading weight value of the sub-level data according to the update time includes: Determine whether the update time of the sub-level data is within the first time period, if so, set the first loading weight value to a first value, otherwise set the first loading weight value to a second value, and the first value is greater than the second value.

5. The browsing data loading method according to claim 3, characterized in that: The obtaining the name of the child data and setting the second loading weight value of the child data according to the first letter of the name of the child data includes: The first letter of the name of the sub-level data is obtained, and the second loading weight value is set to the third numerical value / ASCII (the first letter of the name).

6. The browsing data loading method according to claim 3, characterized in that: The obtaining the number of accesses to the sub-level data and setting the third loading weight value of the sub-level data according to the number of accesses includes: Determine whether the number of accesses to the sub-level data is greater than a preset access number threshold within the second time period. If so, set the third loading weight value to a fourth value. Otherwise, set the third loading weight value to a fifth value, and the fourth value is greater than the fifth value.

7. The browsing data loading method according to claim 1, characterized in that: When returning the paging sub-level data to the web page, it also includes: The number of redundant sub-level data is set, and the number of redundant sub-level data sub-level data after the paged sub-level data is synchronously returned to the web page end.

8. The browsing data loading method according to claim 1, characterized in that: The method further comprises: Calculate the total number of pages of the tree-shaped stored data according to the total number of sub-level data and the amount of sub-level data on a single page, use the sub-level data of the amount of sub-level data on a single page after the sub-level cutoff position value as the current page sub-level data, and obtain the page number corresponding to the current page sub-level data as the target page number; In response to returning the paging sub-level data corresponding to the target page number to the web page end, a page number adjacent to the target page number is obtained, and the paging sub-level data corresponding to the page number adjacent to the target page number is returned to the web page end.

9. A browsing data loading method, used in a web page, characterized in that: include: In response to obtaining browsing data through the browser, the number of sub-level data browsed per page is calculated according to the size of the browser visualization window as the amount of sub-level data per page; Sending a data read request to the server, the data read request carrying a single-page sub-level data amount and a sub-level truncation position value, and setting the sub-level truncation position value returned to the server for the first time to be zero; In response to receiving the paging sub-level data fed back by the server, the paging sub-level data carries the updated sub-level cutoff position value, performs page rendering on the paging sub-level data, and displays the rendered paging sub-level data in the browser visualization window; Determine whether the updated sub-level cutoff position value is a preset end value; if not, determine that the browsing data is not fully fed back, start timed polling, obtain the next page of paging sub-level data and perform page rendering; if yes, determine that the browsing data has been fully fed back, and end polling.

10. The browsing data loading method according to claim 9, characterized in that: The method further comprises: Store the paginated sub-level data returned from the server in the front-end database; In response to obtaining browsing data through the browser, determining whether the front-end database contains paging sub-level data corresponding to the browsing data; In response to the front-end database containing the paging sub-level data corresponding to the browsing data, reading the contained paging sub-level data from the front-end database and performing page rendering; In response to the front-end database not containing the paging sub-level data corresponding to the browsing data, obtaining the paging sub-level data corresponding to the browsing data from the server, updating the paging sub-level data obtained from the server to the front-end database, reading the paging sub-level data corresponding to the browsing data from the front-end database and performing page rendering; In response to the front-end database containing part of the paginated sub-level data corresponding to the browsing data, the sub-level data contained in the front-end is read from the front-end database and displayed after page rendering, and the sub-level data not contained in the front-end is obtained from the server and page rendering is performed.

11. The browsing data loading method according to claim 10, characterized in that: The updating of the paging sub-level data obtained from the server to the front-end database includes: After the front-end database obtains the paging sub-level data obtained from the server, redundant information in the paging sub-level data is identified and deleted by compression and deduplication.

12. The browsing data loading method according to claim 10, characterized in that: The method further comprises: In response to detecting that a page is scrolled down in the browser, obtaining the paging sub-level data of the next page after scrolling from the front-end database and performing page rendering; In response to the updated sub-level cutoff position value not being the preset end value and the rendered paging sub-level data being greater than a second threshold, the displayed page sub-level data is cleared.

13. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 12 are implemented.

14. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 12 are implemented.

15. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 12 are implemented.

Images