Search engine with user activity memory

• US 20030123443A1
• Filed: 11/19/2002
• Published: 07/03/2003
• Est. Priority Date: 04/01/1999
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Mohammed S. Anwar
• Inventors: Anwar, Mohammed S.
• Granted Patent: US 7,565,363 B2
• Time in Patent Office: Days
• US Class Current: 370/392
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/3338 Query expansion
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

A search engine is disclosed that utilizes both record based data and user activity data to develop, update and refine ranking protocols and to identify words and phrases that give rise to search ambiguity so that the engine can interact with the user to better respond to user queries and enhance data acquisition from databases, intranets and internets.

Claims

1. A search engine implemented on a distributed network comprising:

a. a user interface or a graphics user interface;

b. a packet processing module that converts each packet to at least one transaction and processes the transaction;

c. a database including records, keywords, user activity data (UAD), and a UAD updating routine for updating UAD;

d. a ranking protocol including record specific data (RSD) and UAD for ranking retrieved records from the records database;

e. communication and I/O

2. The search engine of claim 1, wherein the database module further includes:

records, keywords, and a UAD updating routine for updating UAD.

3. The search engine of claim 1, wherein the database module further includes:

at least one records database;

a keywords database including user activity data (UAD); and

a UAD updating routine for updating UAD.

4. The engine of claims 1, further comprising a query refinement module for identifying clustering of records based on UAD and RSD so that user queries can have improved relevance and context and AI routines for refining the ranking protocol, determining clustering, and UAD updating.

5. The engine of claim 1, wherein the protocol comprising:

6. A search engine component comprising:

a. a packet processing module that converts each packet to at least one transaction and processes the transaction;

b. a database including user activity data (UAD); and

c. a ranking protocol including record specific data (RSD) and UAD for ranking retrieved records from the records database.

7. The component of claim 6, wherein the database module further includes:

records, keywords, and a UAD updating routine for updating UAD.

8. The component of claim 6, wherein the database module further includes:

at least one records database;

a keywords database including user activity data (UAD); and

a UAD updating routine for updating UAD.

9. The component of claim 6, further comprising a query refinement module for identifying clustering of records based on UAD and RSD so that user queries can have improved relevance and context and AI routines for refining the ranking protocol, determining clustering, and UAD updating.

10. The component of claim 8, wherein the transaction processing module for processing transactions includes:

a new query processing routine for retrieving records satisfying the query and ranking the retrieved records according to the ranking protocol;

a selected record processing routine including a first UAD activity value and a count incrementer,

a record range processing routine including a second UAD activity value and the count incrementer for identifying retrieved records viewed by a user;

a terminal activity processing routine including a third UAD activity value and the count incrementer.

11. The component of claim 6, wherein the protocol comprising:

12. A ranking protocol implemented in a digital processing unit comprising RSD and UAD.

13. The protocol of claim 12, wherein the protocol comprising: