CN109885794B - Processing method for circularly and synchronously updating webpage based on block chain - Google Patents
Processing method for circularly and synchronously updating webpage based on block chain Download PDFInfo
- Publication number
- CN109885794B CN109885794B CN201910065895.XA CN201910065895A CN109885794B CN 109885794 B CN109885794 B CN 109885794B CN 201910065895 A CN201910065895 A CN 201910065895A CN 109885794 B CN109885794 B CN 109885794B
- Authority
- CN
- China
- Prior art keywords
- webpage
- web page
- block chain
- updated
- websites
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a processing method for circularly and synchronously updating a webpage based on a block chain, which comprises the following steps: 1) establishing a block chain consisting of a plurality of websites; 2) acquiring the web pages of the website to be managed, and converting the identified tree-shaped web page structure into a sequential web page structure; 3) determining the link relation between the web page converted into the sequential web page structure and the web pages of other websites in the block chain; 4) if no link relation exists, synchronizing the updated webpage to the corresponding node; 5) if the link relation exists, the updated webpage is synchronized to the corresponding node to replace the old link relation, the same webpage of other websites with the link relation is searched for, the webpage to be updated is updated synchronously, the link relation between the old webpage and the new webpage of other websites is updated, the updated other webpage is updated to the block chain, the method that the whole webpage can rapidly and circularly reach the webpage which does not reach the webpage is adopted, and the safe transmission performance of the block chain is utilized to ensure the safe reliability of webpage updating.
Description
Technical Field
The invention relates to the field of information management, in particular to a processing method for circularly and synchronously updating a webpage based on a block chain.
Background
Most of the current web pages are traditional web pages, which belong to a tree-shaped web page design architecture, and the structure of the traditional web pages is shown in fig. 1. In the traditional webpage updating process, developers can directly modify the webpage and confirm the butt joint relation between the upper webpage and the lower webpage. The method is effective for a single website, and has the problems that when developers manage a plurality of website processes simultaneously and want to share the same content, corresponding webpages are updated or the whole webpage is copied intuitively one by one, and the operation process needs to confirm that each webpage is updated to be free from omission, so that certain difficulty exists.
However, FIG. 4 is a tree-like web page update diagram, which generates a new version of the A-1-1' web page when the A-1-1 web page is updated. How to ensure synchronization and safe updates.
In addition, the tree structure belongs to a scattering type and a one-way selection, and the deeper the depth, the more inconvenient the step of switching the web pages. For example: a → A-1 → A-1-1 two steps, A → A-2 one step, that if A-1-1 were to go back to A-2 then the path would be the three steps A-1-1 → A-1 → A → A-2. If the next webpage is entered by using a special key without a hyperlink mode, whether another processing mechanism reaches the other end or not is determined, and the whole webpage can quickly and circularly reach the webpage which does not reach yet.
Disclosure of Invention
In order to solve the above problems, the present invention provides a processing method for circularly and synchronously updating web pages based on a block chain.
In order to achieve the above object, the present invention provides a processing method for circularly and synchronously updating a web page based on a block chain, which comprises the following steps:
1) establishing a block chain consisting of a plurality of websites, wherein any website is a node in the block chain, and updating the subordinate webpages of the website to the block chain;
2) acquiring a webpage of a website to be managed, identifying a webpage structure of the webpage, and converting the webpage into a sequential webpage structure if the webpage is identified as a tree-shaped webpage structure;
3) identifying the web pages converted into the sequential web page structure, and determining the link relation between the web pages and the web pages of other websites in the block chain;
4) if the webpage to be updated has no link relation with the webpages of other websites in the block chain, synchronizing the updated webpage to the corresponding node;
5) if the link relation exists between the web page to be updated and other websites in the block chain, the updated web page is synchronized to the corresponding node to replace the old link relation, the same web pages of other websites with the link relation are searched for, the web page to be updated is updated synchronously, the link relation between the old web page of the other websites and the new web page is updated, and the updated other web pages are updated to the block chain.
The step 2) comprises the following steps of,
firstly, establishing a tree-shaped webpage corresponding relation table;
secondly, recording the webpage nodes to the relation table in sequence;
in the second step, recording the web page nodes to the relation table from left to right in sequence;
then recording the webpage nodes to the relation table from top to bottom in sequence;
adding the recorded webpage nodes into a sequence queue;
recording the relationship table of the webpage nodes from left to right at the tail end of the same level in sequence;
adding the recorded webpage nodes into a sequence queue;
adding the webpage nodes of the first page into the sequence queue until the end webpage is finished,
and repeating the steps to complete the recording of the whole webpage node.
Each node comprises a hash tree, and the webpage structure of the corresponding node and the hash tree have a corresponding connection relation.
And 1) sequentially acquiring a plurality of websites, identifying whether the websites are newly added websites, and if the websites are newly added websites, updating the websites into a block chain to be used as new nodes.
The invention has the beneficial effects that: the method for enabling the whole webpage to rapidly and circularly reach the webpage which does not reach by adopting the circulating webpage structure ensures the safety and reliability of webpage updating by utilizing the safety transmission performance of the block chain.
Drawings
Fig. 1 is a schematic diagram of a conventional web page structure.
FIG. 2 is a schematic diagram of a circular web page structure.
Fig. 3a, 3b, 3c, 3d, 3e are operation steps of the queue structure.
FIG. 4 is a schematic diagram of tree web page update.
FIG. 5 is a schematic diagram of a recursive web page update.
FIG. 6 is a schematic diagram of tree web page relationship operation process.
FIG. 7 is a schematic diagram of a circular web page queue operation process.
FIG. 8 is a block diagram of a tree and circular update of a secure web page.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that all the directional indicators (such as up, down, left, right, front, and rear … …) in the embodiment of the present invention are only used to explain the relative position relationship between the components, the movement situation, etc. in a specific posture (as shown in the drawing), and if the specific posture is changed, the directional indicator is changed accordingly.
In the present invention, unless otherwise expressly stated or limited, the terms "connected," "secured," and the like are to be construed broadly, and for example, "secured" may be a fixed connection, a removable connection, or an integral part; can be mechanically or electrically connected; they may be directly connected or indirectly connected through intervening media, or they may be connected internally or in any other suitable relationship, unless expressly stated otherwise. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.
In addition, the descriptions related to "first", "second", etc. in the present invention are only for descriptive purposes and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present invention.
The circular web page is a new way to replace the traditional tree structure web page design structure. The web pages in a conventional website all go to one web page and then to another web page, or exist as separate web pages. This patent develops a frame and mechanism, can help the continuous endless webpage, like fig. 2, also when not having new external webpage to connect, can arrive the webpage bottom afterwards, jumps back to the topmost webpage of this arborescent relation automatically, avoids the tree structure too deeply to make the problem that is difficult for returning the first page. This is called a "circular web page". For example: when the web page nodes B-1-1 and B-1-2 of fig. 2 are the bottom, the activity of returning to the home page node B is actively performed. FIG. 5 shows a circular web page update process.
In the circular web page, the theory of the queue plays an important role in the data structure, and has the following three characteristics.
Inserted at one end and deleted at the other.
First In First Out (FIFO).
The end allowing insertion is the tail of the queue, and the end allowing deletion is the head of the queue.
Showing the operation steps of the queue structure shown in fig. 3a, 3b, 3c, 3d, and 3e, when the condition of determining the empty is that whether front and rear are equal to 0, the normal sequential queue will overflow upwards when pair is paired, and the overflow is not true overflow, and there is still an empty position in the array where the element can be stored. Therefore, it is a false overflow phenomenon. To solve this phenomenon, the sequential queue can be thought of as a ring. When the head pointer front = MAX _ SIZE-1, 0 is reached once in the forward pass (implemented by the remainder operation for MAX _ SIZE). The following four properties will be extended.
Firstly, initialization: front = rear = 0.
Secondly, enqueuing: real = (real + 1)% MAX _ SIZE.
Thirdly, pair generation: front = (front + 1)% MAX _ SIZE.
Fourthly, length in pairs: (real-front + MAX _ SIZE)% MAX _ SIZE.
Here, a situation occurs, when the judgment condition for both queue empty and queue full is front = rear, a unit space needs to be reserved to judge whether the queue empty and queue full are distinguished, that is, the next position of the head pointer of the queue at the tail pointer of the queue represents that the queue is full. Therefore, it will add more of the following two properties.
Fifthly, full team: (real + 1)% MAX _ SIZE = = front.
Sixthly, emptying the queue: front = = real.
The invention provides a processing method for circularly and synchronously updating a webpage based on a block chain, which comprises the following steps:
1) establishing a block chain consisting of a plurality of websites, wherein any website is a node in the block chain, and updating the subordinate webpages of the website to the block chain;
2) acquiring a webpage of a website to be managed, identifying a webpage structure of the webpage, and converting the webpage into a sequential webpage structure if the webpage is identified as a tree-shaped webpage structure;
3) identifying the web pages converted into the sequential web page structure, and determining the link relation between the web pages and the web pages of other websites in the block chain;
4) if the webpage to be updated has no link relation with the webpages of other websites in the block chain, synchronizing the updated webpage to the corresponding node;
5) if the link relation exists between the web page to be updated and other websites in the block chain, the updated web page is synchronized to the corresponding node to replace the old link relation, the same web pages of other websites with the link relation are searched for, the web page to be updated is updated synchronously, the link relation between the old web page of the other websites and the new web page is updated, and the updated other web pages are updated to the block chain.
The step 2) comprises the following steps of,
the algorithm for converting tree web pages to circular web pages is as follows.
And inputting, namely confirming the relation of the tree-shaped web pages.
And 1, generating a corresponding relation table of the tree-shaped web page.
2. And generating a sequential queue relation table of the circulating webpage.
And Step 1, establishing a tree-shaped webpage corresponding relation table.
Step 2-1, recording the web page nodes to the relation table from top to bottom in sequence.
And Step 2-1-1, adding the webpage nodes into the sequence queue.
Step 2-2, continuing Step 2-1 until the bottom.
Step 2-3, recording the web page nodes to the relation table from left to right in the same hierarchy end sequentially.
And Step 2-3-1, adding the webpage nodes into the sequence queue.
Step 2-4, continue Step 2-3 until the end.
And Step 2-5, adding the webpage nodes of the first page into the sequence queue until the end webpage nodes.
The following case describes the algorithm for converting tree web pages to circular web pages. There are 1-8 web pages, and the operation process of the dotted line can be generated according to the algorithm, as shown in fig. 6. In addition, the operation process of creating the circular web page queue returns to the first page after recording the web page nodes from left to right for the end of the same hierarchy, so as to repeat or select the web page in the right direction, as shown in FIG. 7.
Each node comprises a hash tree, and the webpage structure of the corresponding node and the hash tree have a corresponding connection relation.
And 1) sequentially acquiring a plurality of websites, identifying whether the websites are newly added websites, and if the websites are newly added websites, updating the websites into a block chain to be used as new nodes.
Examples
There are three servers S1, S2 and S3, each of which has a web page, and each of the web pages S1 and S2 is regarded as a node, and the web pages are in a tree structure and become a member of the hash tree. S3 stores the nodes of the sequential web page into a sequential queue structure and becomes a member of the hash tree. The blockchain internally includes S1, S2, and S3, so that when the web page 5 of S1 is updated, a new web page 5' is automatically generated. At this time, the web page 5' replaces the connection of the web page 5. Meanwhile, because of the relation of the block chain, the web pages 5' are newly added to S2 and S3 and replace the connection relation of the original web page 5. Finally, based on the above steps, the web page can be safely updated, as shown in fig. 8.
The examples should not be construed as limiting the present invention, but any modifications made based on the spirit of the present invention should be within the scope of protection of the present invention.
Claims (3)
1. A processing method for circularly and synchronously updating a webpage based on a block chain is characterized by comprising the following steps: which comprises the following steps:
1) establishing a block chain consisting of a plurality of websites, wherein any website is a node in the block chain, and updating the subordinate webpages of the website to the block chain;
2) acquiring a webpage of a website to be managed, identifying a webpage structure of the webpage, and converting the webpage into a circulating webpage structure if the webpage is identified as a tree-shaped webpage structure;
3) identifying the webpage converted into the circulating webpage structure, and determining the link relation between the webpage and the webpages of other websites in the block chain;
4) if the webpage to be updated has no link relation with the webpages of other websites in the block chain, synchronizing the updated webpage to the corresponding node;
5) if the web page to be updated has a link relation with other web sites in the block chain, synchronizing the updated web page to the corresponding node, replacing the old link relation, searching the same web page of other web sites having the link relation with the updated web page, synchronously updating the web page to be updated, updating the link relation between the old web page of other web sites and the new web page, and updating the updated other web pages to the block chain,
the step 2) comprises the following steps of,
firstly, establishing a tree-shaped webpage corresponding relation table;
secondly, recording the webpage nodes to the relation table in sequence;
in the second step, recording the web page nodes to the relation table from left to right in sequence;
then recording the webpage nodes to the relation table from top to bottom in sequence;
adding the recorded webpage nodes into a sequence queue;
recording the relationship table of the webpage nodes from left to right at the tail end of the same level in sequence;
adding the recorded webpage nodes into a sequence queue;
adding the webpage nodes of the first page into the sequence queue until the end webpage is finished,
and repeating the steps to complete the recording of the whole webpage node.
2. The processing method for cyclically and synchronously updating the web page according to claim 1, wherein the processing method comprises: each node comprises a hash tree, and the webpage structure of the corresponding node and the hash tree have a corresponding connection relation.
3. The processing method for cyclically and synchronously updating the web page according to claim 1, wherein the processing method comprises: and 1) sequentially acquiring a plurality of websites, identifying whether the websites are newly added websites, and if the websites are newly added websites, updating the websites into a block chain to be used as new nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910065895.XA CN109885794B (en) | 2019-01-24 | 2019-01-24 | Processing method for circularly and synchronously updating webpage based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910065895.XA CN109885794B (en) | 2019-01-24 | 2019-01-24 | Processing method for circularly and synchronously updating webpage based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109885794A CN109885794A (en) | 2019-06-14 |
| CN109885794B true CN109885794B (en) | 2020-10-20 |
Family
ID=66926659
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910065895.XA Active CN109885794B (en) | 2019-01-24 | 2019-01-24 | Processing method for circularly and synchronously updating webpage based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109885794B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111498356A (en) * | 2020-03-16 | 2020-08-07 | 浙江大学医学院附属第四医院(浙江省义乌医院、浙江大学医学院附属第四医院医共体) | Automatic medicine dispensing method and system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104978408A (en) * | 2015-08-05 | 2015-10-14 | 许昌学院 | Berkeley DB database based topic crawler system |
| CN105320719A (en) * | 2015-01-16 | 2016-02-10 | 焦点科技股份有限公司 | Crowdfunding website project recommendation method based on project tag and graphical relationship |
| CN105389315A (en) * | 2014-09-04 | 2016-03-09 | 阿里巴巴集团控股有限公司 | Dynamic webpage refreshing method and device |
| CN106569824A (en) * | 2016-11-07 | 2017-04-19 | 腾讯科技（深圳）有限公司 | Page data compiling method and apparatus, and page rendering method and apparatus |
| CN106598574A (en) * | 2016-11-25 | 2017-04-26 | 腾讯科技（深圳）有限公司 | Method and device for page rendering |
| CN106874339A (en) * | 2016-12-20 | 2017-06-20 | 北京华宇信息技术有限公司 | A kind of methods of exhibiting of circulant Digraph and its application |
| CN109145188A (en) * | 2018-08-03 | 2019-01-04 | 上海点融信息科技有限责任公司 | For searching for the method, equipment and computer readable storage medium of block chain data |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110191381A1 (en) * | 2010-01-29 | 2011-08-04 | Microsoft Corporation | Interactive System for Extracting Data from a Website |
| US9195778B2 (en) * | 2013-03-05 | 2015-11-24 | Qualcomm Innvoation Center, Inc. | Systems, methods, and apparatus for prefetching node data for linked data structure traversal |
| US10037384B2 (en) * | 2013-05-28 | 2018-07-31 | Tencent Technology (Shenzhen) Company Limited | Method and apparatus for notifying a user of updated content for a webpage |
| CN103927397B (en) * | 2014-05-05 | 2017-02-22 | 湖北文理学院 | Recognition method for Web page link blocks based on block tree |
| CN105701106A (en) * | 2014-11-27 | 2016-06-22 | 广州市动景计算机科技有限公司 | Web page refreshment method and device |
| CN105630902B (en) * | 2015-12-21 | 2019-03-26 | 明博教育科技股份有限公司 | A method of rendering and incremental update webpage |
| CN106844458B (en) * | 2016-12-20 | 2020-06-19 | 北京华宇信息技术有限公司 | Method, computing device and storage medium for displaying online behavior track of user |
| CN107688650B (en) * | 2017-08-31 | 2021-12-10 | 麒麟合盛网络技术股份有限公司 | Web page generation method and device |
| CN108629038A (en) * | 2018-05-11 | 2018-10-09 | 北京奇虎科技有限公司 | Webpage based on block chain deposits card method and system |
| CN109257340B (en) * | 2018-08-29 | 2021-05-04 | 北京中科锐链科技有限公司 | Website tamper-proof system and method based on block chain |
-
2019
- 2019-01-24 CN CN201910065895.XA patent/CN109885794B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105389315A (en) * | 2014-09-04 | 2016-03-09 | 阿里巴巴集团控股有限公司 | Dynamic webpage refreshing method and device |
| CN105320719A (en) * | 2015-01-16 | 2016-02-10 | 焦点科技股份有限公司 | Crowdfunding website project recommendation method based on project tag and graphical relationship |
| CN104978408A (en) * | 2015-08-05 | 2015-10-14 | 许昌学院 | Berkeley DB database based topic crawler system |
| CN106569824A (en) * | 2016-11-07 | 2017-04-19 | 腾讯科技（深圳）有限公司 | Page data compiling method and apparatus, and page rendering method and apparatus |
| CN106598574A (en) * | 2016-11-25 | 2017-04-26 | 腾讯科技（深圳）有限公司 | Method and device for page rendering |
| CN106874339A (en) * | 2016-12-20 | 2017-06-20 | 北京华宇信息技术有限公司 | A kind of methods of exhibiting of circulant Digraph and its application |
| CN109145188A (en) * | 2018-08-03 | 2019-01-04 | 上海点融信息科技有限责任公司 | For searching for the method, equipment and computer readable storage medium of block chain data |
Non-Patent Citations (2)
| Title |
|---|
| 基于区块链的电能交易平台设计与实现;张栋珀;《中国优秀硕士学位论文全文数据库 信息科技辑》;20180915(第9期);全文 * |
| 搜索引擎中大型网站的网页更新策略研究;易显;《中国优秀硕士学位论文全文数据库 信息科技辑》;20120315(第3期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109885794A (en) | 2019-06-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106446197B (en) | A kind of date storage method, apparatus and system | |
| CN106815330B (en) | Method and system for generating block chain expanded along spatial dimension | |
| CN110830539B (en) | Network storage system and method | |
| CN110928498B (en) | Directory traversal method, device, equipment and storage medium | |
| CN113360456B (en) | Data archiving method, device, equipment and storage medium | |
| US20130024649A1 (en) | Method and device for storing routing table entry | |
| CN109885794B (en) | Processing method for circularly and synchronously updating webpage based on block chain | |
| WO2018133762A1 (en) | File merging method and apparatus | |
| CN111966633A (en) | Method, device, electronic equipment and medium for inquiring child nodes under directory | |
| CN108509544B (en) | Method and device for acquiring mind map, equipment and readable storage medium | |
| CN111984732B (en) | Method, node and blockchain network for implementing decentralization search on blockchain | |
| US20100262647A1 (en) | Granular data synchronization for editing multiple data objects | |
| US20080086448A1 (en) | Method of generating node indentifier in tree structure | |
| CN105335245B (en) | Failed storage method and apparatus, trouble shoot method and apparatus | |
| CN104580183A (en) | Cross-cluster data synchronization method and device | |
| CN109558159B (en) | Method and device for updating user interface in game | |
| CN111339191A (en) | Data storage method, device, equipment and medium of block chain | |
| CN111290714B (en) | Data reading method and device | |
| Khaing et al. | A persistent labeling scheme for dynamic ordered XML trees | |
| CN112559194A (en) | Application data processing method, device and equipment | |
| KR20100022565A (en) | Method for searching an url using hash tree | |
| CN106569986B (en) | Character string replacing method and device | |
| CN113934742B (en) | Data updating method, node information storage method, electronic device and medium | |
| CN106293530B (en) | A kind of method for writing data and device | |
| CN108984780B (en) | Method and device for managing disk data based on data structure supporting repeated key value tree |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220920 Address after: Building 15, No. 20 Houhe Lane, Haishu District, Ningbo City, Zhejiang Province, 315000 Patentee after: Zhejiang KingNet Chengdu Westone Information Industry Inc. Address before: No. 57, Jingxuan West Road, Qufu, Jining City, Shandong Province Patentee before: QUFU NORMAL University |
|
| TR01 | Transfer of patent right |