APPARATUS AND METHOD FOR SEARCH AND RETRIEVAL OF DOCUMENTS

• US 20100114880A1
• Filed: 11/06/2009
• Published: 05/06/2010
• Est. Priority Date: 09/27/1998
• Status: Abandoned Application

• Current Assignee: Uber Technologies, Inc.
• Original Assignee: Uber Technologies, Inc.
• Inventors: Melman, Haim Zvi
• Application Number:
  US12/613,547
• Publication Number:
  US 20100114880A1
• Time in Patent Office: Days
• US Class Current: 707/723
• CPC Class Codes: G06F 16/2425 Iterative querying; Query formulation based on the results of a preceding query
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 16/3322 using system suggestions G06F16/3325 takes precedence
• CPC Class Codes: G06F 16/3341 using boolean model
• CPC Class Codes: G06F 16/338 Presentation of query results
• CPC Class Codes: G06F 16/93 Document management systems
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 16/9538 Presentation of query results

Abstract

A system for the support and management of search for documents is presents. The system includes knowledge-database, query interface and communication to a database of documents to be searched. Information generated during a search session is collected by the system and is added to the knowledge-database. The information is ranked automatically according to the usage of that information by the user. During successive search session, or during search made by other users, the system uses the knowledge-database to support the users with keywords, queries and reference to documents.

Claims

1. A computer based automated method of selecting at least one query from stored-queries stored in a storage device comprising the steps of

submitting, by a user a search-query;

automatically searching, in said stored-queries, at least one query that contains at least a part of said search-query;

automatically selecting, from said stored-queries, at least one of the following;

a. at least one query containing at least a part of said search-query; and

b. at least one stored-query that is related to at least one other stored-query that contains at least a part of said search-query.

2. The method of claim 1, wherein at least one of said stored-queries is stored with reference to at least one of the following stored attributes:

a. registration of said at least one stored-query to the current user;

b. registration of said at least one stored-query to at least one another user;

c. registration of said at least one stored-query to the current user and also to at least one another-user;

d. registration of said at least one stored-query to any user;

e. with which user can said at least one stored-query be shared;

f. relation of said at least one stored-query to at least one other stored-query;

g. ranking of said at least one stored-query; and

h. relation of said at least one stored-query to at least one representation of a document.

3. The method of claim 2, additionally comprising the step of ranking said selected stored-queries.

4. The method of claim 3 wherein the ranking step uses at least one of the following values:

a. stored rank of said at least one of said stored-queries;

b. number of representations of documents related to said at least one of said stored-queries;

c. number of representations of documents related to said at least one of said stored-queries that are ranked over a certain value;

d. the sum of ranks of representations of documents related to said at least one of said stored-queries;

e. the sum of ranks of representations of documents related to said at least one of said stored-queries that are ranked over a certain value;

f. number of representations of documents related to said at least one of said stored-queries that are ranked at a certain value;

g. number of representations of documents related to said at least one of said stored-queries that are ranked lower th an a certain value;

h. the sum of ranks of representations of documents related to said at least one of said stored-queries that are ranked lower then a certain value;

i. number of times said at least one of said stored-queries was submitted for a search process;

j. number of representations of documents retrieved using said at least one of said stored-queries;

k. ranking of at least one representation of a document retrieved using said at least one of said stored-queries;

l. number of representations of documents retrieved using said at least one of said stored-queries where the user made a relevancy indication;

m. number of representations of documents related to said at least one of said stored-queries;

n. ranking of at least one representation of a document related to said at least one of said stored-queries; and

o. number of terms of the search-query that are present in said at least one of said stored-queries.

5. The method according to claim 2, additionally comprising the step of using at least one of said selected stored-queries for additional processing.

6. The method according to claim 2, additionally comprising the steps of using a ranking of said selected stored-queries to determine which of said selected stored-queries will be used for additional processing.

7. The method of claim 2, additionally comprising the steps of selecting said at least one of said stored-queries according to at least one of the following criteria:

a. said at least one of said stored-queries is selected from queries that are registered to users included in a predetermined list of at least one user;

b. said at least one of said stored-queries is selected from queries that are registered to users included in at least one of multiple predetermined lists of at least one user each; and

c. said at least one of said stored-queries is selected only from queries that are allowed for sharing with the current user.

8. The method according to claim 2, additionally comprising the step of displaying at least one representation of a document that is related to said at least one of said stored-queries.

9. The method of claim 8, additionally comprising the step of ranking said at least one representation of a document using at least one of the following criteria:

a. said at least one representation of a document is marked as relevant to said at least one of said stored-queries, said marking is independent of the text of said at least one representation of a document and said at least one of said stored-queries;

b. said at least one representation of a document is marked as irrelevant to said at least one of said stored-queries;

c. said at least one representation of a document has been reviewed;

d. said at least one representation of a document has been printed;

e. said at least one representation of a document has been saved on a storage device;

f. said at least one representation of a document has a document summary;

g. said at least one representation of a document generation date;

h. said at least one representation of a document update date;

i. time of search for said at least one representation of a document;

j. who reviewed said at least one representation of a document; and

k. time said at least one representation of a document was introduced to the system.

10. The method of claim 1, wherein selecting said at least one stored-query is made only if said at least one said stored-query was used by at least one another predetermined user;

and

said at least one another predetermined user is determined by said user.

11. The method according to claim 1, additionally comprising the step of displaying said selected at least one of said stored-queries.

12. The method according to claim 11, additionally comprising the step of displaying at least representation of a document that is related to said displayed at least one of said stored-queries.

13. The method of claim 12, additionally comprising the step of ranking said at least one representation of a document using at least one of the following values:

a. said at least one representation of a document is marked as related to said at least one of said stored-queries; and

said relation is independent of the text of said at least one representation of a document and said at least one of said stored-queries;

b. said at least one representation of a document is marked as irrelevant to said at least one of said stored-queries;

c. said at least one representation of a document has been reviewed;

d. said at least one representation of a document has been printed;

e. said at least one representation of a document has been saved on a storage device;

f. said at least one representation of a document has a document summary;

g. said at least one representation of a document generation date;

h. said at least one representation of a document update date;

i. time of search for said at least one representation of a document;

j. who reviewed said at least one representation of a document; and

k. time said at least one representation of a document was introduced to the system.

14. The method of claim 12, additionally comprising the steps of displaying at least one reference to at least one another user who interacted with said at least one representation of a document.

15. The method according to claim 11, additionally comprising the steps of:

selecting at least one of said at least one displayed queries; and

using said at least one selected stored-query for additional processing.

16. The method according to claim 11, additionally comprising the step of considering at least one of said attributes in said selection process.