Browse Prior Art Database

Method To Find A Web Page Or Data Element In The Future Disclosure Number: IPCOM000207280D
Publication Date: 2011-May-24
Document File: 3 page(s) / 23K

Publishing Venue

The Prior Art Database


Disclosed is a method to recall a web page or data element by using search terms generated by the search engine and operator tags.

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

Page 01 of 3

Method To Find A Web Page Or Data Element In The Future

Following are the steps a user/operator typically takes when performing a query with a search engine and reviewing the results:
1. Operator goes to search engine and enters search terms.
2. Search engine returns a list of results.
3. Operator clicks on several search results.

As an example, at the sixth result, the operator may click on several related links

to drill down from the sixth result page. The user is now twelve links deep/away from the search results page, and each of the twelve links jumps to a completely different website.
5. The operator has found something interesting and is likely to return to this page in the future (e.g., one week later). The operator has several options to do this:
• Bookmark the page to the local browser. This leaves the bookmark unusable if the operator is not at their own terminal.

• Save the link to some web page (or send himself an on-line email), then recall the link by visiting that web page in the future. In the future, if the operator is at another unknown/not trusted terminal, going to a web page may reveal all of his links, or using an account-based program (on-line email) may expose a user's identification/password.

Verbally tell another user how to find this web page. Some URLs may

have tens or hundreds of characters that are difficult to remember and verbally communicate.

Search engine results change over time. Web links change over time. It may not be possible for the operator to perform the same steps in the future (i.e., enter these search terms, pick the sixth search result (

which has since moved to the

58th result),

click the top link (

which is no longer there), etc.)

End-users need a method to leverage the search engine to find the web page or data in the future.

The disclosed solution is a method to recall a previously-located search result. The operator submits the previously-loaded web page (URL) or data result element to the search engine, and asks for the search terms to find it again in the future. The complexity of the search terms returned may be based in part on operator custom preferences.

In a typical embodiment, the operator's custom preferences could be:
• Provide the search terms that will return this web page or data element as the best result (

with likely higher complexity). For example, the search engine may

state: "

Apple iPod* yellow February 2009"

will open to this page. The operator

can request that the search engine use easy to remember words, case insensitive, no symbols. The search engine will comply within its capabilities.
• Provide the search terms that will likely return this web page in the top 25 search results (

with possibly lower complexity). For example, the search engine states


Page 02 of 3

"yellow iPod 2009"

will get this page in the top

                              25 search results. The complexity is based on the maturity and stability of the page. If the page has a solid footing in the search engine...