Information retrieving and storing system and method

• US 7,752,196 B2
• Filed: 05/13/2005
• Issued: 07/06/2010
• Est. Priority Date: 05/13/2004
• Status: Active Grant

• Current Assignee: Robert John Rogers
• Original Assignee: Robert John Rogers
• Inventors: Rogers, Robert John
• Primary Examiner(s): Rones; Charles
• Assistant Examiner(s): Mueller; Kurt
• Application Number:
  US11/568,607
• Publication Number:
  US 20070233660A1
• Time in Patent Office: 1,880 Days
• Field of Search: 707/716
• US Class Current: 707/716
• CPC Class Codes: G06F 40/205 Parsing

Abstract

A computer and implemented process for retrieving and storing information to manage information in a computer system. The computer implemented process uses an input and a processing means, with the input arranged to obtain a statement. The processing means is arranged to select a first record based on an element of the statement. Then select a second record that references the first record. Next, examine the second record to identify a third record, and then retrieve the information by using the third record.

Claims

1. A computer implemented process for retrieving information, said computer implemented process comprising:

obtaining a statement by an input comprising a user interface coupled to a computer, said user interface being arranged to obtain said statement; and

providing a processing means using said computer and arranged to;

select a first record based on an element of said statement;

select a second record that references said first record;

examine said second record to identify a third record; and

retrieve said information by using said third record;

wherein said processing means is arranged to select said first record by;

locating a fourth record that comprises information corresponding to said element;

obtaining an identifier of said fourth record; and

determining whether said first record comprises said identifier, wherein said first record is selected when said first record is determined that said first record comprises said identifier;

wherein said processing means is arranged to retrieve said information by;

examining said third record to identify at least one fifth record; and

obtaining said information from said fifth record;

wherein said third record is associated with said first record;

wherein said input further comprising;

said user interface arranged to receive a natural language statement; and

a parser arranged to create an intermediate language statement based on a parsing of said natural language statement, wherein said processing means is arranged to use said intermediate language statement as said statement;

wherein said first, second, third, fourth and fifth records each contain multiple fields.

2. The computer implemented process as set forth in claim 1, wherein said first, said second, said third, said fourth and said fifth record are contained in a single table.

12. The computer implemented process as set forth in claim 2, wherein said fields being labeled as at least the following comprising:

an Id field identifying said first, second, third, fourth and fifth record respectively;

a Relationship field indicating a relationship between said first, second, third, fourth and fifth record containing said field with a collection of said first, second, third, fourth and fifth records;

a Negate field creating a negative style relationships to negate said Relationship field;

a Parent Id field linking said first, second, third, fourth and fifth records together;

a Concept Id field being a pointer that points to at least one of said first, second, third, fourth and fifth records;

a Value Id field being a pointer that points to at least one of said first, second, third, fourth and fifth records;

a Value field being binary data; and

a Valid field being a flag clearable when information stored in said First, second, third, fourth and fifth records respectively is no longer valid, said flag being storable.

3. A computer implemented method of retrieving information, said method comprising the steps of:

obtaining a statement;

selecting a first record based on an element of said statement;

selecting a second record that references said first record;

examining said second record to identify a third record;

retrieving said information by using said third record;

locating a fourth record that comprises information corresponding to said element;

obtaining an identifier of said fourth record;

determining whether said first record comprises said identifier, wherein said first record is selected when said first record is determined that when said first record comprises said identifier;

examining said third record to identify at least one fifth record; and

obtaining said information from said fifth record;

wherein said third record is associated with said first record;

wherein said step of obtaining said statement further comprises the steps of;

receiving a natural language statement;

creating an intermediate language statement based on a parsing of said natural language statement; and

using said intermediate language statement as said statement;

wherein said first, second, third, fourth and fifth records each contain multiple fields.

4. The method as set forth in claim 3, wherein said first, said second, said third, said fourth and said fifth record are contained in a single table.

13. The method as set forth in claim 4, wherein said fields being labeled as at least the following comprising:

an Id field identifying said first, second, third, fourth and fifth record respectively;

a Relationship field indicating a relationship between said first, second, third, fourth and fifth record containing said field with a collection of said first, second, third, fourth and fifth records;

a Negate field creating a negative style relationships to negate said Relationship field;

a Parent Id field linking said first, second, third, fourth and fifth records together;

a Concept Id field being a pointer that points to at least one of said first, second, third, fourth and fifth records;

a Value Id field being a pointer that points to at least one of said first, second, third, fourth and fifth records;

a Value field being binary data; and

a Valid field being a flag clearable when information stored in said First, second, third, fourth and fifth records respectively is no longer valid, said flag being storable.

5. A computer readable storage medium comprising a plurality of instructions, which when executed, causes the computer to perform the steps of:

obtaining a statement;

selecting a first record based on an element of said statement;

selecting a second record that references said first record;

examining said second record to identify a third record;

retrieving said information by using said third record;

locating a fourth record that comprises information corresponding to said element;

obtaining an identifier of said fourth record;

determining whether said first record comprises said identifier, wherein said first record is selected when said first record is determined that when said first record comprises said identifier;

examining said third record to identify at least one fifth record; and

obtaining said information from said fifth record;

wherein said step of obtaining said statement further comprises the steps of;

receiving a natural language statement;

creating an intermediate language statement based on a parsing of said natural language statement; and

using said intermediate language statement as said statement;

wherein said third record is associated with said first record;

wherein said first, second, third, fourth and fifth records each contain multiple fields.

6. The computer readable storage medium as set forth in claim 5, wherein said first, said second, said third, said fourth and said fifth record are contained in a single table.

14. The computer as set forth in claim 6, wherein said fields being labeled as at least the following comprising:

an Id field identifying said first, second, third, fourth and fifth record respectively;

a Relationship field indicating a relationship between said first, second, third, fourth and fifth record containing said field with a collection of said first, second, third, fourth and fifth records;

a Negate field creating a negative style relationships to negate said Relationship field;

a Parent Id field linking said first, second, third, fourth and fifth records together;

a Concept Id field being a pointer that points to at least one of said first, second, third, fourth and fifth records;

a Value Id field being a pointer that points to at least one of said first, second, third, fourth and fifth records, a Value field being binary data; and

a Valid field being a flag clearable when information stored in said First, second, third, fourth and fifth records respectively is no longer valid, said flag being storable.

7. The computer implemented process for storing information, said computer implemented process comprising:

obtaining a statement by an input comprising a user interface coupled to a computer, said user interface being arranged to obtain said statement;

providing a processing means using said computer and arranged to;

create a first record that is identified based on an element of said statement;

create a second record that references said first record and which is examined to identify a third record; and

arranging said third record such that said third record is used to retrieve said information;

wherein said processing means is arranged to create said first record by;

creating a fourth record that comprises information corresponding to said element;

obtaining an identifier of said fourth record; and

setting said first record such that said first record comprises said identifier;

wherein said processing means is arranged to arrange said third record such that said third record is examined to identify at least one fifth record, said processing means operable to create said fifth record such that said fifth record comprises said information;

wherein said input further comprising;

said user interface arranged to receive a natural language statement; and

a parser arranged to create an intermediate language statement based on a parsing of said natural language statement, wherein said processing means is arranged to use said intermediate language statement as said statement;

wherein said third record is associated with said first record;

wherein said first, second, third, fourth and fifth records each contain multiple fields.

8. The computer implemented process as set forth in claim 7, wherein said first, said second, said third, said fourth and said fifth record are contained in a single table.

15. The computer implemented process as set forth in claim 8, wherein said fields being labeled as at least the following comprising:

an Id field identifying said first, second, third, fourth and fifth record respectively;

a Relationship field indicating a relationship between said first, second, third, fourth and fifth record containing said field with a collection of said first, second, third, fourth and fifth records;

a Negate field creating a negative style relationships to negate said Relationship field;

a Parent Id field linking said first, second, third, fourth and fifth records together;

a Concept Id field being a pointer that points to at least one of said first, second, third, fourth and fifth records;

a Value Id field being a pointer that points to at least one of said first, second, third, fourth and fifth records;

a Value field being binary data; and

a Valid field being a flag clearable when information stored in said First, second, third, fourth and fifth records respectively is no longer valid, said flag being storable.

9. A computer implemented method of storing information, the method comprising the steps of:

obtaining a statement;

creating a first record that is identified based on an element of said statement;

creating a second record that references said first record and which is examined to identify a third record;

arranging said third record such that said third record is used to retrieve said information;

creating a fourth record that comprises information corresponding to said element;

obtaining an identifier of said fourth record;

setting said first record such that said first record comprises said identifier;

arranging said third record such that said third record identifies at least one fifth record; and

arranging said fifth record such that said fifth record comprises said information;

wherein said step of obtaining the statement further comprises the steps of;

receiving a natural language statement;

creating an intermediate language

statement based on a parsing of said natural language statement; and

using said intermediate language statement as said statement;

wherein said third record is associated with said first record;

wherein said first, second, third, fourth and fifth records each contain multiple fields.

10. The computer implemented method as set forth in claim 9, wherein said first, said second, said third, said fourth and said fifth record are contained in a single table.

11. The computer implemented method as set forth in claim 10, wherein said fields being labeled as at least the following comprising:

an Id field identifying said first, second, third, fourth and fifth record respectively,

a Relationship field indicating a relationship between said first, second, third, fourth and fifth record containing said field with a collection of said first, second, third, fourth and fifth records;

a Negate field creating a negative style relationships to negate said Relationship field;

a Parent Id field linking said first, second, third, fourth and fifth records together;

a Concept Id field being a pointer that points to at least one of said first, second, third, fourth and fifth records;

a Value Id field being a pointer that points to at least one of said first, second, third, fourth and fifth records;

a Value field being binary data; and

a Valid field being a flag clearable when information stored in said First, second, third, fourth and fifth records respectively is no longer valid, said flag being storable.