Patent US2189455A successfully refreshed from Google Patents.
Patent US5659732A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5659732A Expired / Lapsed US ⏱️ 0.0 years remaining

Document retrieval over networks wherein ranking and relevance scores are computed at the client for multiple database documents

Assignee: Google LLC
•
Filing: 1995-05-17
•
Granted: 1997-08-19
•
Expires: 2015-05-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A document search method using a plurality of databases available from one or more servers using one or more search engines. For each database, the number of records is determined and reported, as well as frequency of search query term occurances or hits, together with identification of database records corresponding to the hits. Reports from a plurality of databases are furnished to a user terminal, a client, where client software computes a relevance score for each record based upon the number of records in the database, the number of records having at least one hit and the number of hits for each record. This local computation from uniform data allows all documents to be ranked consistently as if coming from a single database.

Inventors

  • 👤 Steven T. Kirsch

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 22:42
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/95; G06F16/953; G06F16/9538; G06F16/951; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99934; Y10S707/99935; Y10S707/99939

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 129 words
A method for searching a plurality of databases which are distributed and accessible to a client through one or more search servers comprising, (a) applying a search query from the client to each server associated with each database, (b) determining at each server a list of relevant documents, (c) obtaining, at the client from each server, statistics about each database, (d) obtaining, at the client from each server, information about the relevant documents resulting from application of the query to the associated database, and (e) computing, at the client, a relevance score for each document using said statistics and said information whereby the computed relevance score is used in determining how the relevant documents from all of the databases should be ordered in a list of merged relevant documents.
Claim 2
Independent Claim 129 words
A method for searching a plurality of databases which are distributed and accessible to a client through one or more search servers comprising, (a) applying a search query from the client to each server associated with each database, (b) determining at each server a list of relevant documents, (c) obtaining, at the client from each server, statistics about each database, (d) obtaining, at the client from each server, information about the relevant documents resulting from application of the query to the associated database, and (e) computing, at the client, a relevance score for each document using said statistics and said information whereby the computed relevance score is used in determining how the relevant documents from all of the databases should be ordered in a list of merged relevant documents.
Claim 3
Dependent Claim 24 words
The method of claim 1 wherein the statistics about said collection include the size of the collection in terms of the number of records.
Claim 4
Dependent Claim 23 words
The method of claim 1 wherein the information about each document includes the number of times each search term appeared in the document.
Claim 5
Dependent Claim 20 words
The method of claim 1 wherein the information about each database includes the number of documents containing each search term.
Claim 6
Independent Claim 139 words
A method for searching a plurality of databases which are distributed and accessible to a client through one or more servers comprising, (a) accessing each database from the client, (b) applying a search query from the client to the server associated with each database, (c) obtaining, at the client, statistics about each database, (d) obtaining, at the client, statistical information about the relevant documents resulting from application of the query to the database, including term count information for each document, and (e) computing, at the client, a global score for the relevant documents in a list of merged relevant documents from all of the databases using said statistics and said information whereby the computed relevance score is used in determining how the relevant documents from all of the databases should be ordered in a list of merged relevant documents.
Claim 7
Independent Claim 139 words
A method for searching a plurality of databases which are distributed and accessible to a client through one or more servers comprising, (a) accessing each database from the client, (b) applying a search query from the client to the server associated with each database, (c) obtaining, at the client, statistics about each database, (d) obtaining, at the client, statistical information about the relevant documents resulting from application of the query to the database, including term count information for each document, and (e) computing, at the client, a global score for the relevant documents in a list of merged relevant documents from all of the databases using said statistics and said information whereby the computed relevance score is used in determining how the relevant documents from all of the databases should be ordered in a list of merged relevant documents.
Claim 8
Independent Claim 147 words
A method for searching text documents among a plurality of databases accessible through a server, in response to a search query at a client, (a) applying a search query at the client to each database accessed through a server, (b) for each database determining the total number of documents, (c) for each of said databases, determining at the server the number of hits of each search query term for each relevant database document, (d) for each of said databases, and for each query term, counting the documents having at least one hit, and (e) computing at the client a relevance score of each record with respect to the search query, using the results of steps (b), (c) and (d) whereby the computed relevance score is used in determining how the relevant documents from all of the databases should be ordered in a list of merged relevant documents.
Claim 9
Independent Claim 147 words
A method for searching text documents among a plurality of databases accessible through a server, in response to a search query at a client, (a) applying a search query at the client to each database accessed through a server, (b) for each database determining the total number of documents, (c) for each of said databases, determining at the server the number of hits of each search query term for each relevant database document, (d) for each of said databases, and for each query term, counting the documents having at least one hit, and (e) computing at the client a relevance score of each record with respect to the search query, using the results of steps (b), (c) and (d) whereby the computed relevance score is used in determining how the relevant documents from all of the databases should be ordered in a list of merged relevant documents.
Claim 10
Dependent Claim 32 words
The method of claim 6 further defined by selecting a number of databases, having more than one search engine for the databases, prior to applying the same search query to all databases.
Claim 11
Dependent Claim 31 words
The method of claim 7 by selecting a number of records to be reviewed from among said number of databases, said number having the highest relevance scores for the search query.
Claim 12
Dependent Claim 19 words
The method of claim 8 further defined by preselecting a number of records prior to computing a relevance score.
Claim 13
Independent Claim 141 words
A method for searching a plurality of databases which are distributed and accessible to a client through one or more search servers comprising, providing a plurality of search engines each associated with a server storing a database, applying a search query from the client to each search engine associated with a server storing a database, the search engines determining at each server a list of relevant documents, obtaining, at the client from each server, statistical information about the relevant documents resulting from application of the query to the associated database, and computing, at the client, on a single pass, a relevance score for each document using said statistical information about the relevant documents whereby the computed relevance score is used in determining how the relevant documents from all of the databases should be ordered in a list of merged relevant documents.
Claim 14
Independent Claim 141 words
A method for searching a plurality of databases which are distributed and accessible to a client through one or more search servers comprising, providing a plurality of search engines each associated with a server storing a database, applying a search query from the client to each search engine associated with a server storing a database, the search engines determining at each server a list of relevant documents, obtaining, at the client from each server, statistical information about the relevant documents resulting from application of the query to the associated database, and computing, at the client, on a single pass, a relevance score for each document using said statistical information about the relevant documents whereby the computed relevance score is used in determining how the relevant documents from all of the databases should be ordered in a list of merged relevant documents.
Claim 15
Independent Claim 113 words
A method for searching a plurality of diverse databases which are distributed over a network and accessible to a client through one or more search servers using a plurality of search engines each associated with a server storing a database comprising, obtaining, at the client from each search server, statistical information about relevant documents resulting from application of a query to a database associated with a search engine, and computing, at the client, on a single pass, a relevance score for each document using said statistical information whereby the computed relevance score is used in determining how the relevant documents from diverse databases should be ordered in a list of merged relevant documents.
Claim 16
Independent Claim 113 words
A method for searching a plurality of diverse databases which are distributed over a network and accessible to a client through one or more search servers using a plurality of search engines each associated with a server storing a database comprising, obtaining, at the client from each search server, statistical information about relevant documents resulting from application of a query to a database associated with a search engine, and computing, at the client, on a single pass, a relevance score for each document using said statistical information whereby the computed relevance score is used in determining how the relevant documents from diverse databases should be ordered in a list of merged relevant documents.

References Cited (Backward Citations)

US4805134A Cited
EP0304191A2 Cited
US5107419A Cited
US5333312A Cited
US5544352A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-08-18 2001-02-17 2001-08-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-08-18 2005-02-17 2005-08-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-08-18 2009-02-17 2009-08-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag