Browse Prior Art Database

A method to quickly find those pages interested and accessed before from search engine Disclosure Number: IPCOM000246928D
Publication Date: 2016-Jul-15
Document File: 4 page(s) / 72K

Publishing Venue

The Prior Art Database


Usually it's not easy for users to find those pages they accessed before from search engine. Our disclosure provides a way to help users to quickly find those recently accessed web pages. That is, to list those browsed web page links in the top N places of search results if user searches the same keywords in the search engine again. It will help the users to easily get those accessed page links in short time. Our method also provides an algorithm to calculate the priority value of each accessed webpage according to the page visiting duration, which is used as page link sort.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 52% of the total text.

Page 01 of 4

A method to quickly find those pages interested and accessed before from search engine

When users are doing some search through the search engine, they may need to browse so many different web page from different web site. User may want to go back and find the web page that they have browsed before when they find something that is useful. They need a quick method to help them find the old

web page that they have browsed precisely and sort the old web page according to the time they have been browsed. Some search engine providers have produced a web based bookmark service which can help the user to store all the web pages that they may be interested in in the server side. Customers can use them when they log in to the search engine website. The difference between our new method and the existing service is we have new features which will sort the old web pages according to the algorithm, which will help the user to find what they need more quickly.


This invention is meant to help customer find one or more recently accessed web pages quickly. Currently, most of search web site would mark web pages those you had read with dark color when display search result. But that kind of web pages may not be listed on the top since search web site has other certain search strategy, while not care if the web page had been browsed. So customer need to find the web page from all returned search result. Another method is to find the web page from your browse history. But you may have forget the link string, or there are too many records to find it quickly.

Our invention is to list browsed web page at the top of search result. For example, at one search web site, I enter word "hello world". 100 links are returned about "hello world". I open the third, the fifteenth and the twentieth links, those are most like what I expect. Serval days later, I wish to find the third links again. Then I enter the word "hello world" again, at this time, the third, the fifteenth and twentieth links are listed at the top of search result. Usually, the browse information including clicked URL(Uniform Resource Locator) and page access duration may be saved to customer account on the search web site, or your computer for search engine to make decision.


The workflow diagram is displayed as below.


Page 02 of 4


Page 03 of 4

And the algorithm for our invention is described as below.

For the logged-in user,

1. Record keywords input by the user, the clicked URL, the open datetime and close datetime of the opened page into the user's...