Method and apparatus for searching multiple data element type files

• US 20030046299A1
• Filed: 07/15/2002
• Published: 03/06/2003
• Est. Priority Date: 07/16/2001
• Status: Active Grant

• Current Assignee: Shlomo E. Friman
• Original Assignee: Shlomo E. Friman
• Inventors: Friman, Shlomo E.
• Granted Patent: US 7,162,483 B2
• Time in Patent Office: Days
• US Class Current: 707/102
• CPC Class Codes: G06F 16/972 Access to data in other repository systems, e.g. legacy data or dynamic Web page generation
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

Method and apparatus is disclosed for constructing, and updating, a searchable database from very large data collections including diverse types of data thus enabling the data to be cataloged, data mined, indexed, parsed, cross-referenced and published for rapid location and free text retrieval of data elements from terabytes of information or millions of elements. The method and apparatus enables full text searches with the aid of an Internet browser using very complex search criteria without special skills. The full text searches are performed on a searchable database developed from the data collections in a large data storage system and wherein data type elements are identified, hyperlinked when possible, and stored in a retrievable format. In addition to the searchable database, a database is constructed that shows graphically the relationships between a current module being viewed and any other modules the current module may reference or be referenced by.

Claims

1. A method for constructing a searchable database from a collection of information having multiple data types, comprising the steps of:

a. identifying all data types within the collection

b. identifying all data elements within each data type, each data element comprising a plurality of words;

c. removing non-printable characters from the identified data elements;

d. associating each data element with a unique identifier;

e. saving each data element;

f. hyperlinking all data elements containing a common word; and

g. indexing the data elements.

2. The method of claim 1 wherein identifying all data elements further comprises sequentially scanning the collection to identify all data elements within a data type on each scan.

3. The method of claim 1 wherein identifying all data elements further comprises grouping all data elements of a given type

4. The method of claim 3 wherein grouping all data elements further comprises separating the data elements by a separator identifier.

5. The method of claim 1 wherein saving each data element further comprises saving each data element

6. The method of claim 1 wherein hyperlinking all data elements further comprises hyperlinking data elements of a first data type with data elements of a second data type.

7. The method of claim 1 wherein hyperlinking all data elements further comprises hyperlinking all data elements of a first type with all data elements of all data types.

8. The method of claim 1 and further comprising displaying the results of a search

9. The method of claim 8 and further comprising displaying the results of a search in html format

10. The method of claim 8 and further comprising displaying the results of a search in ascii text format.

11. The method of claim 1 and further comprising monitoring usage of the searchable database.

12. The method of claim 11 wherein monitoring usage further comprises monitoring the identity of persons accessing the searchable database.

13. The method of claim 11 wherein monitoring usage further comprises monitoring the location from which a search is initiated.

14. The method of claim 11 wherein monitoring usage further comprises recording prior searches performed by persons accessing the searchable database.

15. The method of claim 1 wherein saving each data element further comprises saving each data element as an html file.

16. A method for updating a searchable database constructed from a collection of information having multiple data types as of a first point in time with the collection of data as of a second, later point in time, the first and second points in time defining a time interval;

comprising the steps of;

a. at the first point in time

i. identifying all data types within the collection;

ii. identifying all data elements within each data type, each data element comprising a plurality of words;

iii. removing nonprintable characters from the identified data elements;

iv. associating each data element with a unique identifier;

v. hyperlinking all data elements containing a common word; and

vi. indexing the data elements; and

b. at the second point in time

i. identifying all data elements within each data type;

ii. removing nonprintable characters from the identified data elements;

iii. identifying those data elements that were removed from the collection during the time interval;

vii. identifying those data elements that were changed in the collection during the time interval;

viii. identifying those data elements that were added to the collection during the time interval;

ix. associating each of the removed, changed and added data elements w with a unique identifier;

x. hyperlinking all removed, changed and added data elements containing a common word; and

iv. indexing the removed, changed and added data elements data elements with the previously indexed data elements.

17. An apparatus for constructing a searchable database from a collection of information having multiple data types, comprising:

a. means for identifying all data types within the collection

b. means for identifying all data elements within each data type, each data element comprising a plurality of words;

c. means for removing nonprintable characters from the identified data elements;

d. means for associating each data element with a unique identifier;

e. means for hyperlinking all data elements containing a common word; and

f. means for indexing the data elements.

18. An apparatus for updating a searchable database constructed from a collection of information having multiple data types as of a first point in time with the collection of data as of a second, later point in time, the first and second points in time defining a time interval, comprising:

a. at the first point in time

i. means for identifying all data types within the collection;

ii. means for identifying all data elements within each data type, each data element comprising a plurality of words;

iii. means for removing nonprintable characters from the identified data elements;

iv. means for associating each data element with a unique identifier;

v. means for hyperlinking all data elements containing a common word; and

vi. means for indexing the data elements; and

b. at the second point in time

i. means for identifying all data elements within each data type at the second point in time;

ii. means for removing nonprintable characters from the identified data elements;

iii. means for identifying those data elements that were removed from the collection during the time interval;

iv. means for identifying those data elements that were changed in the collection during the time interval;

v. means for identifying those data elements that were added to the collection during the time interval;

vi. means for associating each of the removed, changed and added data elements with a unique identifier;

vii. means for hyperlinking all removed, changed and added data elements containing a common word; and

viii. means for indexing the removed, changed and added data elements data elements with the previously indexed data elements.

19. The apparatus of claim 18 wherein the collection of information is a single database.

20. The apparatus of claim 18 wherein the collection of information is a plurality of remotely accessible databases.