Apparatus and method for search and retrieval of documents

• US 9,081,813 B2
• Filed: 11/24/2014
• Issued: 07/14/2015
• Est. Priority Date: 09/27/1998
• Status: Expired due to Term

• Current Assignee: Uber Technologies, Inc.
• Original Assignee: Haim Zvi Melman
• Inventors: Melman, Haim Zvi
• Primary Examiner(s): Arjomandi, Noosha
• Application Number:
  US14/552,017
• Publication Number:
  US 20150081677A1
• Time in Patent Office: 232 Days
• Field of Search: 707/706, 707/723, 707/737
• US Class Current: 1/1
• 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 system implementing a method for creating a terms database and using said terms database for the composition of queries, comprising the steps of:

storing terms that are included in at least one first query received in search processes;

storing, for at least one of said stored terms, a relation to at least one other said stored term, the relation being generated when both said terms appeared in the same query;

received terms submitted within a second query for a search process;

searching said terms database for at least one of said stored term that is not included in said second query but is related to at least one term in said second query;

automatically modifying said second query by adding at least one of said related terms that is not included in said second query to said second query;

automatically submitting said modified query for a search process; and

displaying search results of said modified query.

2. The computer system of claim 1 whereas the decision for automatic modifying of said second query and submitting said modified query for a search process is executed automatically, based on the number of terms included in said second query.

3. The computer system of claim 1 whereas an automatic selection of a part of said related stored terms for automatic modifying of said second query and submitting said modified query for a search process is made in accordance to the ranking of the relation of said at least one related stored term.

4. The computer system of claim 1 whereas said datebase access is limited based on selection of a users group that includes any mix of users selected individually and other user groups, each such users group includes at least two users.

5. The computer system of claim 1 whereas said second query is modified using said related terms with their Boolean association.

6. The computer system of claim 1 whereas no search process is made with said second query;

the search process is made only with said modified query.