Page data management method and device, equipment, storage medium and program product

Abstract

The invention provides a page data management method and device, equipment, a storage medium and a program product. The embodiment of the invention can be applied to page data management scenes of Internet, browsers and the like; the method comprises the following steps: in response to a webpage access request sent by a target object for a target webpage, extracting a page cache chain table corresponding to the target object and a hash table corresponding to the page cache chain table in a memory space; generating reference information for the page data of the target webpage, and querying the page data in the hash table through the reference information to obtain a query result; when the query result represents that the page data of the target webpage exists in the hash table, extracting the page data of the target webpage from the hash table; and returning the page data of the target webpage to the target object. Through the method and the device, the response speed to the webpage access request can be improved.

Description

Technical Field

[0001] The present application relates to Internet technology, and in particular to a page data management method, device, equipment, storage medium and program product. Background Art

[0002] It takes a certain amount of time and computing resources to obtain page data from the service site of the web page or the disk space, which will cause the terminal to take a long time to obtain the page data. In this regard, in the related art, there is a solution to cache page data in the memory space, such as caching the page data of different web pages through a page cache linked list, and reading the corresponding page data from the page cache linked list when needed, so that the page data can be quickly returned to the terminal. However, it still takes a certain amount of time to query data in the page cache linked list, which causes the extraction of page data to still take a long time to complete, which ultimately affects the response speed to web page access requests. Summary of the invention

[0003] Embodiments of the present application provide a page data management method, device, electronic device, computer-readable storage medium, and computer program product, which can improve the response speed to web page access requests.

[0004] The technical solution of the embodiment of the present application is implemented as follows:

[0005] The present application embodiment provides a page data management method, including:

[0006] In response to a web page access request sent by a target object for a target web page, a page cache linked list corresponding to the target object and a hash table corresponding to the page cache linked list are extracted in a memory space; the page cache linked list is used to store page data of the web page in a time sequence of access within a capacity limit, and the hash table is used to record the page data existing in the page cache linked list;

[0007] Generate reference information for the page data of the target web page, and query the page data in the hash table using the reference information to obtain a query result;

[0008] When the query result indicates that the page data of the target webpage exists in the hash table, extracting the page data of the target webpage from the hash table;

[0009] Return the page data of the target web page to the target object.

[0010] The present application embodiment provides a page data management device, including:

[0011] An information acquisition module, configured to respond to a web page access request sent by a target object for a target web page, extract a page cache linked list corresponding to the target object and a hash table corresponding to the page cache linked list in a memory space; the page cache linked list is used to store page data of the web page in a time sequence of access within a capacity limit, and the hash table is used to record the page data existing in the page cache linked list;

[0012] A data query module, used to generate reference information for the page data of the target web page, and query the page data in the hash table through the reference information to obtain a query result;

[0013] A data processing module, configured to extract the page data of the target webpage from the hash table when the query result indicates that the page data of the target webpage exists in the hash table;

[0014] The data sending module is used to return the page data of the target web page to the target object.

[0015] In some embodiments of the present application, the page data management device also includes: a data update module, used to locate the storage node where the page data of the target web page is located from the page cache linked list; move the page data of the target web page from the storage node to the head node of the page cache linked list; wherein the head node is used to store the page data of the web page most recently visited by the target object.

[0016] In some embodiments of the present application, the data processing module is further configured to, when the query result indicates that the page data of the target webpage does not exist in the hash table, obtain the page data of the target webpage from the data source of the target webpage; and determine the cache margin for the page cache linked list;

[0017] The data updating module is further used to update the page cache linked list and the hash table in combination with the cache margin and the page data of the target web page.

[0018] In some embodiments of the present application, the data update module is also used to remove the tail node of the page cache linked list when the cache balance reaches the balance threshold, and insert the node created for the page data of the target web page into the head position of the page cache linked list; generate the reference information for the page data of the target web page, and write the page data of the target web page to the storage location corresponding to the reference information in the hash table; remove the web page data stored in the tail node of the page cache linked list from the hash table.

[0019] In some embodiments of the present application, the data update module is also used to, when the cache balance does not reach the balance threshold, insert the node created for the page data of the target web page into the head position of the page cache linked list; generate the reference information for the page data of the target web page, and write the page data of the target web page to the storage location corresponding to the reference information in the hash table.

[0020] In some embodiments of the present application, the data source of the target webpage includes: a service site of the target webpage, and at least one of a disk space for storing page data of the target webpage.

[0021] In some embodiments of the present application, the data processing module is also used to extract the original data of the target web page from the data source of the target web page; perform content noise reduction on the original data of the target web page, and determine the noise reduction result as the page data of the target web page, thereby completing the acquisition of the page data of the target web page.

[0022] In some embodiments of the present application, the page data of the target web page includes: summary information of the target web page, title information of the target web page, fingerprint information of the target web page, graphic elements of the target web page, and at least one of preprocessing results of dynamic special effects of the target web page.

[0023] In some embodiments of the present application, the information acquisition module is also used to obtain the link address of the target web page, and to perform hash encoding on the access link address of the target web page, and to use the encoding result as reference information of the page data of the target web page, thereby completing the generation of reference information for the page data of the target web page.

[0024] An embodiment of the present application provides an electronic device, including:

[0025] A memory for storing computer executable instructions or computer programs;

[0026] The processor is used to implement the page data management method provided in the embodiment of the present application when executing the computer executable instructions or computer programs stored in the memory.

[0027] An embodiment of the present application provides a computer-readable storage medium storing computer-executable instructions or a computer program for causing a processor to execute and implement the page data management method provided in the embodiment of the present application.

[0028] An embodiment of the present application provides a computer program product, including a computer program or computer executable instructions, which, when executed by a processor, implements the page data management method provided in the embodiment of the present application.

[0029] The embodiments of the present application have the following beneficial effects: after receiving a web page access request from a target object, the electronic device will directly extract the page cache linked list corresponding to the target object from the memory space, and at the same time extract the hash table corresponding to the page cache linked list, and determine whether the page data of the target web page exists in the hash table, that is, whether it exists in the page cache linked list. When the page data exists in the hash table, the process of directly extracting the page data of the target web page from the hash table replaces the process of traversing the page cache linked list to extract the web page data of the target web page, thereby reducing the extraction time of the page data of the target web page. In this way, the time required to feed back the page data of the target web page to the target object can be reduced, thereby improving the response speed to the web page access request. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 It is a schematic diagram of the architecture of the page data management system provided in the embodiment of the present application;

[0031] Figure 2 The embodiment of this application provides Figure 1 A schematic diagram of the structure of the server in FIG.

[0032] Figure 3 This is a schematic diagram of the process of the page data management method provided in the embodiment of the present application. Figure 1 ;

[0033] Figure 4 This is a schematic diagram of the process of the page data management method provided in the embodiment of the present application. Figure 2 ;

[0034] Figure 5 This is a schematic diagram of the process of the page data management method provided in the embodiment of the present application. Figure 3 ;

[0035] Figure 6 This is a schematic diagram of the replacement process of the cache file provided in the embodiment of the present application Figure 1 ;

[0036] Figure 7 This is a schematic diagram of the replacement process of the cache file provided in the embodiment of the present application Figure 2 ;

[0037] Figure 8 This is a processing flow chart for managing cache files;

[0038] Fig. 9 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 1 ;

[0039] Fig.10 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 2 ;

[0040] Fig.11 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 3 ;

[0041] Fig.12 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 4 ;

[0042] Fig.13 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 5 ;

[0043] Fig.14 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 6 ;

[0044] Fig.15 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 7 ;

[0045] Fig.16 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 8 . DETAILED DESCRIPTION

[0046] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings. The described embodiments should not be regarded as limiting the present application. All other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of this application.

[0047] In the following description, reference is made to “some embodiments”, which describe a subset of all possible embodiments, but it will be understood that “some embodiments” may be the same subset or different subsets of all possible embodiments and may be combined with each other without conflict.

[0048] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein are only for the purpose of describing the embodiments of this application and are not intended to limit this application.

[0049] Before further describing the embodiments of the present application in detail, the nouns and terms involved in the embodiments of the present application are explained. The nouns and terms involved in the embodiments of the present application are subject to the following interpretations.

[0050] 1) Page data is data used to parse and display web pages. Page data may include basic visual elements of web pages, such as images, text, etc., and data that controls the layout of visual elements.

[0051] 2) The page cache linked list is a file set in the memory space for caching the page data of the web page.

[0052] 3) A hash table refers to a file set in the memory space for recording the mapping relationship between the page data of a web page and the reference information of the web page.

[0053] 4) In response to, it is used to indicate the conditions or states on which the executed operations depend. When the conditions or states on which the operations depend are met, the executed one or more operations may be executed in real time or with a set delay. Unless otherwise specified, there is no restriction on the order in which the multiple operations executed are executed.

[0054] Web pages can provide users with rich information and are a common information carrier on the Internet. When a website server receives a web page access request sent by a user's terminal, the website server will obtain the page data of the web page from the web page's service site or disk space, and return the page data to the user's terminal.

[0055] However, obtaining page data from the service site of the web page or the disk space requires a certain amount of time and computing resources to complete, which will cause the terminal to take a long time to obtain the page data. In this regard, in the related art, there is a solution to cache page data in the memory space, such as caching the page data of different web pages through a page cache linked list, and reading the corresponding page data from the page cache linked list when needed, so that the page data can be quickly returned to the terminal. However, it still takes a certain amount of time to query data in the page cache linked list (usually it is necessary to traverse the page cache linked list to complete), which results in the extraction of page data still taking a long time to complete, which ultimately affects the response speed to web page access requests.

[0056] In addition, the memory space is limited. When the page data cached in the page cache linked list increases, it is very likely that the memory space will be overused, which will cause storage pressure on the memory space.

[0057] The embodiments of the present application provide a page data management method, device, electronic device, computer-readable storage medium, and computer program product, which can improve the response speed to web page access requests. The following describes an exemplary application of the electronic device provided by the embodiments of the present application. The electronic device provided by the embodiments of the present application can be implemented as various types of terminals such as laptops, tablet computers, desktop computers, set-top boxes, mobile devices, etc., and can also be implemented as a server. The following describes an exemplary application when the electronic device is implemented as a server.

[0058] See also Figure 1 , Figure 1 Schematic diagram of the architecture of the page data management system provided in the embodiment of the present application. In order to support a page data management application, in the page data management system 100, the terminal (terminal 400-1 and terminal 400-2 are shown as examples) is connected to the server 200 via the network 300, and the network 300 can be a wide area network or a local area network, or a combination of the two. In the page data management system 100, a database 500 is also provided for providing data support to the server 200. Among them, the database 500 can be configured in the server 200, or it can be independent of the server 200. Figure 1 The illustrated case is that the database 500 is independent of the server 200 .

[0059] Terminals 400 - 1 and 400 - 2 are respectively used to generate web page access requests in response to target objects' access operations on graphical interfaces 410 - 1 and 410 - 2 for target web pages, and send the web page access requests to server 200 through network 300 .

[0060] The server 200 is used to respond to a web page access request sent by a target object for a target web page, extract a page cache linked list corresponding to the target object and a hash table corresponding to the page cache linked list in the memory space; generate reference information for the page data of the target web page, and query the page data in the hash table through the reference information to obtain a query result; when the query result indicates that the page data of the target web page exists in the hash table, extract the page data of the target web page from the hash table; return the page data of the target web page to the target object, that is, send it to the terminal 400-1 and the terminal 400-2.

[0061] Terminal 400 - 1 and terminal 400 - 2 will parse the page data respectively and display the specific content of the target web page on graphical interface 410 - 1 and graphical interface 410 - 2 .

[0062] The embodiments of the present application can be implemented with the help of cloud technology. Cloud technology refers to a hosting technology that unifies a series of resources such as hardware, software, and network within a wide area network or a local area network to achieve data computing, storage, processing, and sharing.

[0063] Cloud computing is a general term for network technology, information technology, integration technology, management platform, and application technology based on the cloud computing business model. It can form a resource pool, which is used on demand and flexible and convenient. Cloud computing technology will become an important support. The system background services of the technical network require a large amount of computing and storage resources, which need to be realized through cloud computing.

[0064] Exemplarily, server 200 may be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. Terminals 400-1 and 400-2 may be smart phones, tablet computers, laptop computers, desktop computers, smart speakers, smart watches, smart home appliances, car terminals, etc., but are not limited thereto. The terminals and servers may be directly or indirectly connected via wired or wireless communications, which is not limited in the embodiments of the present invention.

[0065] See also Figure 2 , Figure 2 The embodiment of this application provides Figure 1 A schematic diagram of the structure of a server (an implementation of an electronic device) in FIG. Figure 2 The server 200 shown includes: at least one processor 210, a memory 250, at least one network interface 220 and a user interface 230. The various components in the server 200 are coupled together via a bus system 240. It is understood that the bus system 240 is used to achieve connection and communication between these components. In addition to the data bus, the bus system 240 also includes a power bus, a control bus and a status signal bus. However, for the sake of clarity, the bus system 240 is not described in detail. Figure 2 Various buses are labeled as bus system 240 .

[0066] The processor 210 can be an integrated circuit chip with signal processing capabilities, such as a general-purpose processor, a digital signal processor (DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., where the general-purpose processor can be a microprocessor or any conventional processor, etc.

[0067] The user interface 230 includes one or more output devices 231 that enable presentation of media content, including one or more speakers and / or one or more visual display screens. The user interface 230 also includes one or more input devices 232, including user interface components that facilitate user input, such as a keyboard, mouse, microphone, touch screen display, camera, other input buttons and controls.

[0068] The memory 250 may be removable, non-removable, or a combination thereof. Exemplary hardware devices include solid-state memory, hard disk drives, optical disk drives, etc. The memory 250 may optionally include one or more storage devices that are physically remote from the processor 210.

[0069] The memory 250 includes a volatile memory or a non-volatile memory, and may also include both volatile and non-volatile memories. The non-volatile memory may be a read-only memory (ROM), and the volatile memory may be a random access memory (RAM). The memory 250 described in the embodiments of the present application is intended to include any suitable type of memory.

[0070] In some embodiments, memory 250 can store data to support various operations, examples of which include programs, modules, and data structures, or a subset or superset thereof, as exemplarily described below.

[0071] Operating system 251, including system programs for processing various basic system services and performing hardware-related tasks, such as a framework layer, a core library layer, a driver layer, etc., for implementing various basic services and processing hardware-based tasks;

[0072] A network communication module 252, used to reach other computing devices via one or more (wired or wireless) network interfaces 220, exemplary network interfaces 220 include: Bluetooth, Wireless Compatibility Certification (WiFi), and Universal Serial Bus (USB);

[0073] a presentation module 253 for enabling presentation of information via one or more output devices 231 (e.g., display screen, speaker, etc.) associated with the user interface 230 (e.g., a user interface for operating peripherals and displaying content and information);

[0074] The input processing module 254 is used to detect one or more user inputs or interactions from one of the one or more input devices 232 and translate the detected inputs or interactions.

[0075] In some embodiments, the page data management device provided in the embodiments of the present application can be implemented in a software manner. Figure 2 The page data management device 255 stored in the memory 250 is shown, which can be software in the form of a program and a plug-in, etc., including the following software modules: an information acquisition module 2551, a data query module 2552, a data processing module 2553, a data sending module 2554 and a data update module 2555. These modules are logical, so they can be arbitrarily combined or further split according to the functions implemented. The functions of each module will be explained below.

[0076] In other embodiments, the page data management device provided in the embodiments of the present application can be implemented in hardware. As an example, the page data management device provided in the embodiments of the present application can be a processor in the form of a hardware decoding processor, which is programmed to execute the page data management method provided in the embodiments of the present application. For example, the processor in the form of a hardware decoding processor can adopt one or more application-specific integrated circuits (ASICs), DSPs, programmable logic devices (PLDs), complex programmable logic devices (CPLDs), field-programmable gate arrays (FPGAs) or other electronic components.

[0077] In some embodiments, a terminal or a server (both are possible implementations of electronic devices) can implement the page data management method provided in the embodiments of the present application by running a computer program. For example, the computer program can be a native program or software module in the operating system; it can be a native application (APP, Application), that is, a program that needs to be installed in the operating system to run, such as a browser APP; it can also be a small program, that is, a program that can be run only by downloading it to a browser environment; it can also be a small program that can be embedded in any APP. In short, the above-mentioned computer program can be any form of application, module or plug-in.

[0078] The embodiments of the present application can be applied to page data management scenarios of the Internet, browsers, etc. Below, the page data management method provided by the embodiments of the present application is described. As mentioned above, the electronic device that implements the page data management method of the embodiments of the present application can be implemented as a terminal, a server, or a combination of the two. Therefore, the execution subject of each step will not be repeatedly described below.

[0079] Below, the page data management method provided by the embodiment of the present application will be described in combination with the exemplary application and implementation of the electronic device provided by the embodiment of the present application.

[0080] See also Figure 3 , Figure 3 This is a schematic diagram of the process of the page data management method provided in the embodiment of the present application. Figure 1 , will combine Figure 3 The steps shown are explained.

[0081] S101 . In response to a web page access request sent by a target object to a target web page, extracting a page cache linked list corresponding to the target object and a hash table corresponding to the page cache linked list in a memory space.

[0082] The embodiment of the present application is implemented in the scenario of accessing a web page to a target object. When the target object needs to access a web page, a corresponding web page access request is generated for the target web page that it needs to access, that is, the target, and the web page access request is sent to the electronic device through the network. After receiving the web page access request, the electronic device responds to the web page access request, extracts the page cache linked list allocated to the target object in the memory space, and simultaneously extracts the hash table corresponding to the page cache linked list.

[0083] It should be noted that the page cache linked list is used to store the page data of the web page in the order of access time within the capacity limit. That is, in the page cache linked list, the page data of different web pages will be arranged in the order of access time. For example, if the head node of the page cache linked list stores the page data of the web page that was accessed most recently, then the next node of the head node will store the page data of the web page that was accessed before the web page; conversely, if the head node of the page cache linked list stores the page data of the web page that was accessed the farthest from the current time, then the next node of the head node will store the page data of the web page that was accessed after the web page.

[0084] In an embodiment of the present application, in order to avoid the problem that the memory space occupied by the page cache linked list becomes larger and larger as the number of visited web pages increases, a certain capacity limit is set for the page cache linked list, that is, when the rated capacity is reached, the page cache linked list cannot be extended any further.

[0085] The hash table corresponding to the page cache linked list is used for the page data existing in the page cache linked list, that is, the hash table can be regarded as a data copy of the page cache linked list, so the page data existing in the page cache linked list will also exist in the hash table, but the hash table does not store the time sequence between different web pages when they are accessed, and the page data of each web page will have corresponding reference information, that is, the page data has corresponding reference information, so based on this mapping, the query of the web page data can be completed.

[0086] It is understandable that the target object refers to any object that initiates a web page access, that is, a user that performs a web page access. The target web page refers to the web page that the target object currently wants to access, which can be any web page.

[0087] In the embodiment of the present application, at least one page cache linked list may exist in the memory space. Objects and page cache linked lists may correspond one to one, that is, each object may use a page cache linked list alone, or multiple objects may correspond to the same page cache linked list, for example, 5 objects may share one page cache linked list. Of course, all objects may share the same page cache linked list, which is not limited in the embodiment of the present application.

[0088] The electronic device can determine the page cache linked list corresponding to the target object according to the mapping relationship between the page cache linked list and the object. For example, the table name of the page cache linked list can be named after the object identifier, so that the electronic device can find the corresponding page cache linked list for the target object according to the object identifier of the target object, such as ID, nickname, etc.

[0089] S102: Generate reference information for the page data of the target web page, and query the page data in a hash table using the reference information to obtain a query result.

[0090] After obtaining the page cache linked list and the hash table corresponding to the page cache linked list, the electronic device will generate corresponding reference information for the target web page, and determine whether the reference information hits the hash table, that is, whether there is an element corresponding to the reference information in the hash table, so as to query the page data and obtain the corresponding query result. The query result is used to indicate whether there is web page data of the target web page in the hash table.

[0091] It can be understood that by mapping the reference information and the page data of the target web page, the time complexity of querying the page data of the target web page can be reduced to O(1). Therefore, compared with the page cache linked list, the hash table can more quickly determine whether the page data of a certain web page is stored in the page cache linked list, that is, the query result can be obtained faster.

[0092] It should be noted that the reference information of the web page data of the target web page can be generated only based on the link address of the target web page, or it can be generated in combination with the object identifier of the target object and the link address of the target web page, or it can be generated in combination with the link address of the target web page and an access timestamp, which is not limited in the embodiments of the present application.

[0093] In some embodiments of the present application, Figure 3 S102, i.e. generating reference information for the page data of the target web page, can be achieved by the following processing: obtaining the link address of the target web page, performing hash encoding on the access link address of the target web page, and using the encoding result as the reference information for the page data of the target web page, thereby completing the generation of reference information for the page data of the target web page.

[0094] It is understandable that the link addresses of different web pages are different, and the hash code is unique, that is, different encoding results will be generated for different link URLs. Therefore, hash encoding the link address of the target web page can generate unique reference information for the page data of the target web page.

[0095] S103: When the query result indicates that the page data of the target webpage exists in the hash table, extract the page data of the target webpage from the hash table.

[0096] When the query result indicates that the page data of the target webpage exists in the hash table, it also means that the page data of the target webpage also exists in the page cache linked list. However, in the embodiment of the present application, the electronic device does not directly obtain the page data of the target webpage from the page cache linked list, but directly extracts the page data of the target webpage from the hash table, so as to return the page data to the target object later.

[0097] It should be noted that compared to obtaining the page data of the target web page from the page cache linked list, it is more convenient to obtain the page data of the target web page from the hash table (this is because when obtaining the web page data from the page cache linked list, the page cache linked list needs to be traversed, which has a higher time complexity). In this way, the electronic device can obtain the page data of the target web page more quickly.

[0098] In the embodiment of the present application, the specific content of the page data of the target webpage is not limited, that is, the page data of the target webpage may include any data used for displaying the target webpage.

[0099] In some embodiments of the present application, the page data of the target web page includes: summary information of the target web page, title information of the target web page, fingerprint information of the target web page, graphic elements of the target web page, and at least one of preprocessing results of dynamic special effects of the target web page.

[0100] Among them, the summary information of the target web page is used to provide a brief summary of the target web page to the target object; the title information of the target web page is used to provide the target object with the specific title of the target web page; the fingerprint information of the target web page can be used as a unique identifier of the target web page to distinguish it from other web pages; the graphic elements of the target web page are used for rendering during display to provide visual effects to the target object; the predicted processing results of the dynamic special effects of the target web page refer to the results obtained after pre-processing such as light source calculation and shadow calculation for the dynamic special effects in the target web page, and these results can be used directly after subsequent rendering.

[0101] S104: Return the page data of the target web page to the target object.

[0102] After obtaining the page data of the target webpage, the electronic device will send the page data of the target webpage to the target object through the network, so that the target object can access the target webpage.

[0103] It is understandable that, compared with the related art, it still takes a certain amount of time to query page data in the page cache linked list, resulting in that the extraction of page data still takes a long time to complete, which ultimately affects the response speed to web page access requests. In the embodiment of the present application, the electronic device will directly extract the page cache linked list corresponding to the target object from the memory space after receiving the web page access request of the target object, and at the same time extract the hash table corresponding to the page cache linked list, and determine whether the page data of the target web page exists in the hash table, that is, whether it exists in the page cache linked list. When the page data exists in the hash table, the process of directly extracting the page data of the target web page from the hash table replaces the process of traversing the page cache linked list to extract the web page data of the target web page, thereby reducing the extraction time of the page data of the target web page. In this way, the time required to feed back the page data of the target web page to the target object can be reduced, thereby improving the response speed to the web page access request.

[0104] based on Figure 3 , see Figure 4 , Figure 4 This is a schematic diagram of the process of the page data management method provided in the embodiment of the present application. Figure 2 In some embodiments of the present application, Figure 3 After S104, that is, after returning the page data of the target webpage to the target object, the method may further include the processing of S105-S106, as follows:

[0105] S105: Locate the storage node where the page data of the target web page is located from the page cache linked list.

[0106] After the electronic device sends the page data of the target web page to the target object, the web page that the target object visited most recently is likely to have changed, for example, from another web page to the target web page. Therefore, in the embodiment of the present application, the electronic device also needs to update the page cache linked list so that the page cache linked list always stores the page data of different web pages in the order of access time. At this time, the electronic device will first locate the storage node corresponding to the page data of the target web page in the page cache linked list, that is, locate the position where the page data of the target web page was originally located in the page cache linked list.

[0107] For example, the target object's most recent visited web page is web page A, and the target web page was visited before visiting web page A. At this time, the storage node where the page data of the target web page is located is the second node starting from the head node of the page cache linked list.

[0108] It should be noted that, in the embodiment of the present application, the head node is used to store the page data of the web page most recently visited by the target object.

[0109] S106: Move the page data of the target web page from the storage node to the head node of the page cache linked list.

[0110] The electronic device moves the page data of the target webpage from the original storage node to the head node of the page cache linked list, so that the page data of the target webpage becomes the page data of the webpage most recently visited by the target object.

[0111] More specifically, the electronic device may delete the original storage node and the data therein, then recreate a node for the page data of the target web page, and add the node to the head of the page cache linked list to complete the process of moving the page data of the target web page.

[0112] It is understandable that in the embodiment of the present application, the electronic device will update the page cache linked list in a timely manner after feeding back the page data of the target web page to the target object, so that the page cache linked list is always kept in the latest state.

[0113] based on Figure 3 , see Figure 5 , Figure 5 This is a schematic diagram of the process of the page data management method provided in the embodiment of the present application. Figure 3 In some embodiments of the present application, Figure 3 After S102 and before S104, that is, generating reference information for the page data of the target webpage, and querying the page data in the hash table through the reference information, after obtaining the query result, before returning the page data of the target webpage to the target object, the method may further include the processing of S107-S108, as follows:

[0114] S107 . When the query result indicates that the page data of the target webpage does not exist in the hash table, the page data of the target webpage is obtained from the data source of the target webpage.

[0115] When the query result indicates that the target webpage's page data does not exist in the hash table, it means that the target webpage's page data does not exist in the page cache linked list, so the target webpage may be a webpage that the target object has never visited before, or a webpage that has not been visited for quite some time, so the target webpage's page data does not exist in the memory space of the electronic device. At this time, the electronic device will directly obtain the target webpage's page data from the data source of the target webpage.

[0116] It should be noted that in the embodiment of the present application, the data source of the target webpage is the source for providing the page data of the target webpage. The data source of the target webpage includes: the service site of the target webpage, and at least one of the disk spaces for storing the page data of the target webpage.

[0117] The service site of the target webpage refers to the website where the target webpage is located. At this time, when the electronic device obtains the page data of the target webpage, it will send a data request to the background server of the website and receive the page data returned by the data source in response to the data request, thereby completing the acquisition of the page data of the target webpage. The disk space used to store the page data of the target webpage refers to the disk space specially set for the target webpage in the electronic device for storing the memory data. At this time, when the electronic device obtains the page data of the target webpage, it will access the disk space and read the page data of the target webpage therefrom, thereby completing the acquisition of the page data of the target webpage.

[0118] It should be noted that since the page data obtained by the electronic device from the data source of the target web page is very likely to contain certain duplicate and useless content, if the redundant page data is directly written into the page cache linked list and hash table, it will cause a waste of memory space. Therefore, in some embodiments of the present application, obtaining the page data of the target web page from the data source of the target web page can be achieved by the following processing: extracting the original data of the target web page from the data source of the target web page; performing content noise reduction on the original data of the target web page, and determining the noise reduction result as the page data of the target web page, and completing the acquisition of the page data of the target web page.

[0119] Among them, content denoising for raw data refers to the process of processing raw data to obtain pure data without duplication or redundancy. This process can be achieved by deduplicating the raw data and removing irrelevant information. Among them, data deduplication can be achieved by generating fingerprint information for each data component in the raw data and retaining one of the data components with the same fingerprint information, while irrelevant information removal can be achieved by calculating the principal component features for the raw data and deleting the content corresponding to other features except the principal component features.

[0120] After completing the noise reduction of the original data of the target webpage, the electronic device uses the noise reduction result as the page data of the target webpage, so as to make the page data of the target webpage more concise, thereby helping to save memory space.

[0121] S108: Determine the cache margin for the page cache linked list.

[0122] After obtaining the page data of the target web page, the electronic device calculates the difference between the used capacity and the rated capacity for the page cache linked list, and determines the difference as the cache margin of the page cache linked list. In other words, the cache margin of the page cache linked list is used to indicate whether the page cache linked list can continue to add nodes and the number of nodes that can be added.

[0123] Among them, the rated capacity of the page cache linked list can be set manually according to actual conditions, or set by the electronic device according to the available size of the memory space, and the embodiments of the present application are not limited here.

[0124] For example, when the rated capacity of the page cache linked list is 100, it indicates that the page cache linked list can have a maximum of 100 nodes. If the current page cache linked list already has 80 nodes, then the cache margin of the page cache linked list is 20, that is, the page cache linked list can have a maximum of 20 more nodes.

[0125] Continue to see Figure 5 In the embodiment of the present application, Figure 3 After S104, that is, after returning the page data of the target webpage to the target object, the method may further include the processing of S109:

[0126] S109: Update the page cache linked list and hash table based on the cache margin and the page data of the target web page.

[0127] After obtaining the page data of the target webpage, the electronic device needs to determine how to add the page data of the target webpage to the page cache linked list and the hash table in combination with the cache margin to complete the update of the page cache linked list and the hash table.

[0128] In some embodiments of the present application, the page cache linked list and the hash table are updated in combination with the cache balance and the page data of the target web page, which can be achieved through the following processing: when the cache balance reaches the balance threshold, the tail node of the page cache linked list is removed, and the node created for the page data of the target web page is inserted into the head position of the page cache linked list; reference information is generated for the page data of the target web page, and the page data of the target web page is written to the storage location corresponding to the reference information in the hash table; the web page data stored in the tail node of the page cache linked list is removed from the hash table.

[0129] That is to say, after the electronic device determines that the cache margin reaches the margin threshold, that is, the node cannot be directly added to the page cache linked list, it will first delete the node at the tail of the page cache linked list from the page cache linked list, and at the same time create a new node for the page data of the target web page, and insert the created node into the head of the page cache linked list. After that, the electronic device will generate reference information for the page data of the target web page, and the reference information can correspond to a storage location in the hash table. The electronic device writes the page data of the target web page to the storage location, so that the mapping relationship between the reference information and the page data of the target web page can be established. At the same time, the electronic device also needs to delete the node at the tail of the page cache linked list, so that the page data of the web page that the target object has not visited for a long time will not continue to be stored. In this way, it can be achieved that when the cache margin of the page cache linked list is insufficient, only the page data of the web page that has been frequently visited recently is saved in the page cache linked list, thereby avoiding the unlimited growth of the page cache linked list and causing the memory space to be overused.

[0130] Among them, the margin threshold can be set manually according to actual conditions, for example, it can be set to 0, or set to 10, and the embodiment of the present application does not make specific limitations here.

[0131] In other embodiments of the present application, the page cache linked list and the hash table are updated in combination with the cache balance and the page data of the target web page, which can also be achieved through the following processing: when the cache balance does not reach the balance threshold, the node created for the page data of the target web page is inserted into the head position of the page cache linked list; reference information is generated for the page data of the target web page, and the page data of the target web page is written to the storage location corresponding to the reference information in the hash table.

[0132] That is, when the cache margin does not reach the margin threshold, that is, nodes can continue to be added to the page cache linked list, the electronic device will directly insert the node created for the page data of the target web page into the head position of the page cache linked list to update the page cache linked list. At the same time, the electronic device will also directly write the page data of the target web page to the storage location corresponding to its reference information, thereby completing the update of the hash table.

[0133] The following is an explanation of an exemplary application of the embodiments of the present application in a practical application scenario.

[0134] The embodiment of the present application is implemented in a scenario where a user (referred to as a target object) accesses a web page.

[0135] In an embodiment of the present application, when the user's terminal detects that the user has opened a web page, it will send a network request (called a web page access request) to the web server through the Web server (called an electronic device). At this time, the Web server will first query its memory space to determine whether there is a cache file (called web page data) of the web page (called the target web page). If so, the Web server will intercept the network request and return the cache file to the terminal. If not, it will request the corresponding data from the web server.

[0136] In an embodiment of the present application, the cache files of the web pages are stored through a bidirectional linked list (referred to as a page cache linked list). The head of the bidirectional linked list is used to store the cache files of the page most recently accessed by the user, and the tail is used to store the cache files of the page that the user has not accessed for the longest time. In order to avoid excessive occupation of memory space, in an embodiment of the present application, the bidirectional linked list has a certain capacity limit, so that when the page accessed by the user changes, the cache files in the bidirectional linked list will also be replaced.

[0137] For example, Figure 6 This is a schematic diagram of the replacement process of the cache file provided in the embodiment of the present application Figure 1 . Assume that the bidirectional linked list 6-1 can only store 5 cache files, and the new cache file will be inserted into the head of the bidirectional linked list 6-1. After the 5 cache files A, B, C, D, and E are inserted in sequence, for the new cache file F, each cache file needs to be moved backward by one position, so that the cache file A at the end of the bidirectional linked list 6-1 is eliminated. Afterwards, when the cache file B is read again, the cache file B will be moved to the head of the bidirectional linked list 6-1, and the cache file C will be at the end of the bidirectional linked list 6-1. Afterwards, when the new cache file G needs to be inserted, each cache file in the bidirectional linked list 6-1 needs to be moved backward by one position, so that the cache file C will be eliminated. In this way, the replacement process of the cache files in the bidirectional linked list can be completed.

[0138] More detailed, Figure 7 This is a schematic diagram of the replacement process of the cache file provided in the embodiment of the present application Figure 2. The cache space 7-1 set in the memory can store a total of 3 cache files. When the user has not visited any page, the cache space 7-1 in the memory used to store cache files is empty. When the user visits web page A, cache file A of web page A is inserted into the head of the bidirectional linked list to enter cache space 7-1. When the user visits web page B, cache file B will be inserted into the head of the bidirectional linked list to enter cache space 7-1, and cache file A will serve as the second node of the bidirectional linked list. When the user visits page C, cache file C will serve as the head of the bidirectional linked list and enter cache space 7-1. At this time, cache space 7-1 is full. Afterwards, if the user visits web page D, cache file D will be inserted into the head of the bidirectional linked list to enter cache space 7-1, and cache file A will be eliminated. After that, if the user visits webpage B again, cache file B will be moved from the end of the chain to the beginning of the chain, that is, cache file C becomes the least used. After that, if the user visits page E, cache file E will be inserted into the beginning of the bidirectional linked list to enter cache space 7-1, and cache file C will be eliminated. Finally, there are three cache files in cache space 7-1: cache file E, cache file B, and cache file D.

[0139] Next, the cache file management process is described. In a cache space of size N, a bidirectional linked list is used to store cache files. The head of the linked list is the cache file used most recently, and the tail of the linked list is the cache file that has not been used for the longest time. It should be noted that in the embodiment of the present application, a hash table is used to quickly query cache files.

[0140] See also Figure 8 , Figure 8 This is a flowchart for managing cache files. After the process starts, it includes the following processing steps:

[0141] S201. Obtain a hash table.

[0142] S202, determine whether there is a cache file in the hash table. If yes, proceed to S203, otherwise, proceed to S204.

[0143] S203, moving the cache file to the head of the bidirectional linked list (called the head node), and then ending the process.

[0144] S204: Determine whether the cache space has reached the capacity threshold. If so, proceed to S205, otherwise, proceed to S206.

[0145] S205, remove the node at the end of the bidirectional linked list (called the tail node), and remove the cached file in the hash table at the same time.

[0146] S206: Create a new node, insert the new node into the head of the chain, and update the hash table synchronously. Then, end the process.

[0147] The following is an example to illustrate the cache file management process.

[0148] That is, after the process starts, there is no cache file in the cache space, so the cache is empty. Fig. 9 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 1 The bidirectional linked list has only two nodes: the head node 9-1 indicating the start of the linked list and the tail node 9-2 indicating the end of the linked list.

[0149] Assume that a user accesses data with (key, value) = (1, 7) (where 1 represents the index of the cached file (called reference information) and 7 represents the cached file), and then accesses a web page. At this time, the Web server will insert a node with (key, value) = (1, 7) in the bidirectional linked list and add the node to the hash table. For example, Fig.10 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 2 It can be seen that at this time, there is a node for caching "7" between the head node 9-1 and the tail node 9-2 in the bidirectional linked list.

[0150] Assume that the user accesses the data of (key, value) = (2, 0) again, and then closes the webpage, so the web server will insert a node of (key, value) = (2, 0) into the bidirectional linked list and insert the node into the hash table. For example, Fig.11 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 3 It can be seen that at this time, there is a node for caching "0" before the node corresponding to "7" in the bidirectional linked list.

[0151] Assume that the user accesses the data of (key, value) = (3, 1) again. After closing the webpage, the web server will insert a node of (key, value) = (3, 1) in the bidirectional linked list and add the node to the hash table. After inserting the node, the cache space is full. Fig.12 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 4 At this time, in addition to the head node 9-1 and the tail node 9-2, the bidirectional linked list also has a node corresponding to "1", a node corresponding to "0", and a node corresponding to "7" in sequence.

[0152] When the cache space is full, the user accesses the data of (key, value) = (4, 2). After the related web page, the Web server will insert the node of (key, value) = (4, 2) and add the node to the hash table. The original node (key, value) = (1, 7) will be deleted from the bidirectional linked list and the hash table. Fig.13 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 5 At this time, in addition to the head node 9-1 and the tail node 9-2, the bidirectional linked list has a node corresponding to "2", a node corresponding to "1", and a node corresponding to "0".

[0153] For data writing operations, there are the following situations:

[0154] 1. If the data to be written already exists in the doubly linked list, the Web server will delete the old data in the doubly linked list and insert the new data into the head of the doubly linked list.

[0155] For example, when the cache space is full, the user accesses the data with (key, value) = (2, 0) again, and the Web server searches the hash table for data with value = 0. If found, the Web server retrieves the data from the hash table and moves it to the head of the doubly linked list. Fig.14 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 6 At this time, in addition to the head node 9-1 and the tail node 9-2, the double-flow linked list includes, starting from the head, the node corresponding to "0", the node corresponding to "2", and the node corresponding to "1".

[0156] 2. If the data to be written does not exist in the doubly linked list, the Web server determines whether the cache space is full. If the cache space is full, the node at the tail of the doubly linked list is deleted and the new data is inserted into the head of the doubly linked list. If the cache space is not full, the data is directly inserted into the head of the doubly linked list.

[0157] For example, when the cache space is full, the user accesses the data with (key, value) = (6, 3), and the Web server searches the hash table for the data with value = 3. If there is no hit in the hash table, the Web server inserts a node with (key, value) = (6, 3) into the doubly linked list, adds the node to the hash table, and deletes the last node in the doubly linked list from the doubly linked list and the hash table. Fig.15 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 7At this time, in addition to the head node 9-1 and the tail node 9-2, the bidirectional linked list includes, starting from the head, the node corresponding to "3", the node corresponding to "0", and the node corresponding to "2".

[0158] For data read operations, there are the following situations:

[0159] 1. If the data to be read already exists in the bidirectional linked list, the Web server will return the data and delete the node where the data originally resides (called the storage node), and then insert the data into the head of the linked list.

[0160] For example, assuming that data with value=0 is read, the Web server will search for data with value=0 in the hash table, return the data, delete the node where the data originally resides from the doubly linked list, and then insert the data into the head of the doubly linked list. Fig.16 This is a schematic diagram of a bidirectional linked list provided in an embodiment of the present application. Figure 8 In the bidirectional linked list, except for the head node 9-1 and the tail node 9-2, the nodes corresponding to "0", "3" and "2" are listed in order from the head.

[0161] 2. If the data to be read does not exist in the bidirectional linked list, it will directly return -1, which is used to indicate that the data does not exist in the cache. At this time, the web server will request the data from the web server of the data.

[0162] From the above content, it can be seen that when the cache file accessed by the user exists in the cache space, the Web server can quickly query the cache file and return it to the user, and at the same time, only the cache files of the most recently used web pages can be stored in the cache space to avoid excessive use of memory space.

[0163] It is understandable that in the embodiments of the present application, user information is involved, such as relevant data such as web pages that users need to visit. When the embodiments of the present application are applied to specific products or technologies, user permission or consent is required, and the collection, use and processing of relevant data need to comply with relevant laws, regulations and standards of relevant countries and regions.

[0164] The following is a description of an exemplary structure of the page data management device 255 provided in the embodiment of the present application implemented as a software module. In some embodiments, Figure 2 As shown, the software modules stored in the page data management device 255 of the memory 250 may include:

[0165] The information acquisition module 2551 is used to respond to a web page access request sent by a target object for a target web page, and to extract a page cache linked list corresponding to the target object and a hash table corresponding to the page cache linked list in the memory space; the page cache linked list is used to store the page data of the web page in the order of access time within the capacity limit, and the hash table is used to record the page data existing in the page cache linked list;

[0166] A data query module 2552 is used to generate reference information for the page data of the target web page, and query the page data in the hash table through the reference information to obtain a query result;

[0167] A data processing module 2553 is configured to extract the page data of the target webpage from the hash table when the query result indicates that the page data of the target webpage exists in the hash table;

[0168] The data sending module 2554 is used to return the page data of the target web page to the target object.

[0169] In some embodiments of the present application, the page data management device 255 also includes: a data update module 2555, which is used to locate the storage node where the page data of the target web page is located from the page cache linked list; move the page data of the target web page from the storage node to the head node of the page cache linked list; wherein the head node is used to store the page data of the web page most recently visited by the target object.

[0170] In some embodiments of the present application, the data processing module 2553 is further configured to obtain the page data of the target webpage from the data source of the target webpage when the query result indicates that the page data of the target webpage does not exist in the hash table; determine the cache margin for the page cache linked list;

[0171] The data updating module 2555 is further used to update the page cache linked list and the hash table in combination with the cache margin and the page data of the target web page.

[0172] In some embodiments of the present application, the data update module 2555 is also used to remove the tail node of the page cache linked list when the cache balance reaches the balance threshold, and insert the node created for the page data of the target web page into the head position of the page cache linked list; generate the reference information for the page data of the target web page, and write the page data of the target web page to the storage location corresponding to the reference information in the hash table; remove the web page data stored in the tail node of the page cache linked list from the hash table.

[0173] In some embodiments of the present application, the data update module 2555 is also used to insert the node created for the page data of the target web page into the head position of the page cache linked list when the cache balance does not reach the balance threshold; generate the reference information for the page data of the target web page, and write the page data of the target web page to the storage location corresponding to the reference information in the hash table.

[0174] In some embodiments of the present application, the data source of the target webpage includes: a service site of the target webpage, and at least one of a disk space for storing page data of the target webpage.

[0175] In some embodiments of the present application, the data processing module 2553 is also used to extract the original data of the target web page from the data source of the target web page; perform content noise reduction on the original data of the target web page, and determine the noise reduction result as the page data of the target web page, thereby completing the acquisition of the page data of the target web page.

[0176] In some embodiments of the present application, the page data of the target web page includes: summary information of the target web page, title information of the target web page, fingerprint information of the target web page, graphic elements of the target web page, and at least one of preprocessing results of dynamic special effects of the target web page.

[0177] In some embodiments of the present application, the information acquisition module 2551 is also used to obtain the link address of the target web page, and to perform hash encoding on the access link address of the target web page, and to use the encoding result as reference information of the page data of the target web page, thereby completing the generation of reference information for the page data of the target web page.

[0178] The embodiment of the present application provides a computer program product, which includes a computer program or a computer executable instruction, and the computer program or the computer executable instruction is stored in a computer readable storage medium. The processor of the electronic device reads the computer executable instruction from the computer readable storage medium, and the processor executes the computer executable instruction, so that the electronic device executes the page data management method described in the embodiment of the present application.

[0179] The embodiment of the present application provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, the processor will be caused to execute the page data management method provided by the embodiment of the present application, for example, Figure 3 The page data management method shown.

[0180] In some embodiments, the computer-readable storage medium may be a memory such as FRAM, ROM, PROM, EP ROM, EEPROM, flash memory, magnetic surface storage, optical disk, or CD-ROM; or it may be various devices including one or any combination of the above memories.

[0181] In some embodiments, computer executable instructions may be in the form of a program, software, software module, script or code, written in any form of programming language (including compiled or interpreted languages, or declarative or procedural languages), and may be deployed in any form, including as a stand-alone program or as a module, component, subroutine or other unit suitable for use in a computing environment.

[0182] As an example, computer-executable instructions may, but need not, correspond to a file in a file system, may be stored as part of a file storing other programs or data, such as in one or more scripts in a HyperText Markup Language (HTML) document, in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files storing one or more modules, subroutines, or code portions).

[0183] As an example, computer executable instructions may be deployed to be executed on one electronic device, or on multiple electronic devices located at one site, or on multiple electronic devices distributed at multiple sites and interconnected by a communication network.

[0184] In summary, through the embodiments of the present application, the time for extracting page data of the target web page can be reduced. In this way, the time required for feeding back the page data of the target web page to the target object can be reduced, thereby improving the response speed to the web page access request; it can be achieved that when the cache margin of the page cache linked list is insufficient, only the page data of the web pages that are frequently visited recently are saved in the page cache linked list, thereby avoiding unlimited growth of the page cache linked list and excessive use of memory space.

[0185] The above is only an embodiment of the present application and is not intended to limit the protection scope of the present application. Any modifications, equivalent substitutions and improvements made within the spirit and scope of the present application are included in the protection scope of the present application.

Claims

1. A page data management method, characterized in that: The method comprises: In response to a web page access request sent by a target object for a target web page, a page cache linked list corresponding to the target object and a hash table corresponding to the page cache linked list are extracted in a memory space; the page cache linked list is used to store page data of the web page in a time sequence of access within a capacity limit, and the hash table is used to record the page data existing in the page cache linked list; Generate reference information for the page data of the target web page, and query the page data in the hash table using the reference information to obtain a query result; When the query result indicates that the page data of the target webpage exists in the hash table, extracting the page data of the target webpage from the hash table; Return the page data of the target web page to the target object.

2. The method according to claim 1, characterized in that After returning the page data of the target webpage to the target object, the method further includes: Locate the storage node where the page data of the target web page is located from the page cache linked list; Moving the page data of the target web page from the storage node to the head node of the page cache linked list; The head node is used to store the page data of the web page most recently visited by the target object.

3. The method according to claim 1, characterized in that The method further comprises: generating reference information for the page data of the target webpage, and querying the page data in the hash table through the reference information, and obtaining the query result before returning the page data of the target webpage to the target object. When the query result indicates that the page data of the target webpage does not exist in the hash table, acquiring the page data of the target webpage from a data source of the target webpage; Determining a cache margin for the page cache linked list; After returning the page data of the target webpage to the target object, the method further includes: The page cache linked list and the hash table are updated in combination with the cache margin and the page data of the target web page.

4. The method according to claim 3, characterized in that The updating of the page cache linked list and the hash table in combination with the cache margin and the page data of the target web page includes: When the cache margin reaches a margin threshold, the tail node of the page cache linked list is removed, and the node created for the page data of the target web page is inserted into the head position of the page cache linked list; Generate the reference information for the page data of the target web page, and write the page data of the target web page into the storage location corresponding to the reference information in the hash table; The web page data stored in the tail node of the page cache linked list is removed from the hash table.

5. The method according to claim 3, characterized in that: The updating of the page cache linked list and the hash table in combination with the cache margin and the page data of the target web page includes: When the cache balance does not reach the balance threshold, inserting the node created for the page data of the target web page into the head position of the page cache linked list; The reference information is generated for the page data of the target web page, and the page data of the target web page is written into a storage location corresponding to the reference information in the hash table.

6. The method according to claim 3 or 4, characterized in that: The data source of the target webpage includes: a service site of the target webpage, and at least one of a disk space for storing page data of the target webpage.

7. The method according to any one of claims 3 to 5, characterized in that: The step of acquiring page data of the target webpage from the data source of the target webpage includes: Extracting original data of the target webpage from a data source of the target webpage; Content noise reduction is performed on the original data of the target webpage, and the noise reduction result is determined as the page data of the target webpage, thereby completing the acquisition of the page data of the target webpage.

8. The method according to any one of claims 1 to 5, characterized in that: The page data of the target webpage includes at least one of summary information of the target webpage, title information of the target webpage, fingerprint information of the target webpage, graphic elements of the target webpage, and preprocessing results of dynamic special effects of the target webpage.

9. The method according to any one of claims 1 to 5, characterized in that: The generating reference information for the page data of the target web page includes: The link address of the target webpage is obtained, and hash coding is performed on the access link address of the target webpage, and the coding result is used as the reference information of the page data of the target webpage, thereby completing the generation of the reference information of the page data of the target webpage.

10. A page data management device, characterized in that: The device comprises: An information acquisition module, configured to respond to a web page access request sent by a target object for a target web page, extract a page cache linked list corresponding to the target object and a hash table corresponding to the page cache linked list in a memory space; the page cache linked list is used to store page data of the web page in a time sequence of access within a capacity limit, and the hash table is used to record the page data existing in the page cache linked list; A data query module, used to generate reference information for the page data of the target web page, and query the page data in the hash table through the reference information to obtain a query result; A data processing module, configured to extract the page data of the target webpage from the hash table when the query result indicates that the page data of the target webpage exists in the hash table; The data sending module is used to return the page data of the target web page to the target object.

11. An electronic device, characterized in that: The electronic device comprises: A memory for storing computer executable instructions or computer programs; The processor is used to implement the page data management method according to any one of claims 1 to 9 when executing the computer executable instructions or computer programs stored in the memory.

12. A computer-readable storage medium storing computer-executable instructions or a computer program, characterized in that: When the computer executable instructions or computer programs are executed by a processor, the page data management method according to any one of claims 1 to 9 is implemented.

13. A computer program product comprising a computer program or computer executable instructions, characterized in that: When the computer program or computer executable instructions are executed by a processor, the page data management method according to any one of claims 1 to 9 is implemented.

Images