MICHAEL BRUCE HOROWITZ
Medical Practice in Pittsburgh, PA

6505198, Jan 7, 2003

Aug 21, 2001

09/933937

Michael L. Horowitz - Pittsburgh PA

Claritech Corporation - Pittsburgh PA

G06F 1700

707 7, 707 3

The present invention is a method for operating a computer system to retrieve information from a computer database. This method decomposes documents from the database into subdocuments and then inverts the database. Also, a query for retrieving documents from a database is decomposed into terms. The subdocuments from the inverted database and the terms from the query are then used to compute a score that indicates a quantitative relation between terms in the query and the subdocuments. The resulting list of the subdocuments and their scores is then reorganized into a heap form. The highest ranking subdocument is then selected by the computer and the text associated with this subdocument is displayed. The remainder of the subdocument score list is concurrently reheapified.

6446066, Sep 3, 2002

Aug 25, 2000

09/645953

Michael L. Horowitz - Pittsburgh PA

Claritech Corporation - Pittsburgh PA

G06F 1730

707 5, 707 3, 707101

The present invention provides a method and apparatus for generating a database search result. The creation of the search result is achieved by representing the subdocument lists of an inverted database with encoded bit strings. The encoded bit strings are space efficient methods of storing the correspondence between terms in the database and their occurrence in subdocuments. Logical combinations of these bit strings are then obtained by identifying the intersection, union, and/or inversion of a plurality of the bit strings. Since keywords for a database search can be identified by selecting the terms of the inverted database, the logical combinations of bit strings represent search results over the database. This technique for method for generating a search result is computationally efficient because computers combine bit strings very efficiently. Also, the search elements of the present invention are not just limited to keywords.

6418455, Jul 9, 2002

Oct 17, 2000

09/690184

Michael L. Horowitz - Pittsburgh PA
Michael J. McInerny - Pittsburgh PA
Stewart M. Clamen - Pittsburgh PA

Claritech Corporation - Pittsburgh PA

G06F 1730

707202, 707 8, 707 10, 707102

The present invention is a computer system for modifying a database which comprises a computer that modifies records stored in a database. In the process for modifying records in the database, addresses to memory locations in a disk storage unit are accessed during the commit phase by first checking the address space in a transaction log. The computer system of the present invention operates by committing transactions without locking out readers. This is possible because any changed data in the database is reflected in the transaction log and the log must be accessed prior to reading from the disk storage unit. As a result, the user sees changed data when the log is accessed, or if data has not been changed, the log merely directs the computer to the address in the original database storage where unchanged data is stored.

6112204, Aug 29, 2000

Dec 2, 1998

9/203408

Michael L. Horowitz - Pittsburgh PA

Claritech Corporation - Pittsburgh PA

G06F 1730

707 5

The present invention provides a method and apparatus for generating a database search result. The creation of the search result is achieved by representing the subdocument lists of an inverted database with encoded bit strings. The encoded bit strings are space efficient methods of storing the correspondence between terms in the database and their occurrence in subdocuments. Logical combinations of these bit strings are then obtained by identifying the intersection, union, and/or inversion of a plurality of the bit strings. Since keywords for a database search can be identified by selecting the terms of the inverted database, the logical combinations of bit strings represent search results over the database. This technique for method for generating a search result is computationally efficient because computers combine bit strings very efficiently. Also, the search elements of the present invention are not just limited to keywords.

6134562, Oct 17, 2000

Sep 3, 1999

9/390244

Michael L. Horowitz - Pittsburgh PA
Michael J. McInerny - Pittsburgh PA
Stewart M. Clamen - Pittsburgh PA

Claritech Corporation - Pittsburgh PA

G06F 1730

707202

The present invention is a computer system for modifying a database which comprises a computer that modifies records stored in a database. In the process for modifying records in the database, addresses to memory locations in a disk storage unit are accessed during the commit phase by first checking the address space in a transaction log. The computer system of the present invention operates by committing transactions without locking out readers. This is possible because any changed data in the database is reflected in the transaction log and the log must be accessed prior to reading from the disk storage unit. As a result, the user sees changed data when the log is accessed, or if data has not been changed, the log merely directs the computer to the address in the original database storage where unchanged data is stored.

5995962, Nov 30, 1999

Jul 25, 1997

8/900637

Michael L. Horowitz - Pittsburgh PA

Claritech Corporation - Pittsburg PA

G06F 1730

707 5

The present invention is a method for operating a computer system to minimize the number of disk storage access operations used in creating an inverted database. This method divides a database into several smaller subdatabases. The documents of the subdatabases are decomposed into subdocuments. A postings list for each subdatabase is then created in which all the terms for the subdatabase are associated with the identity of each subdocument of the subdatabase in which the terms occur. The resulting postings lists for the subdatabases are then merged. The merge process sorts the postings of the subdatabases and merges common terms. The non-common terms are merged after the common terms. The process of sorting the postings list and then merging the common terms followed by the non-common terms minimizes the number of disk storage access operations required for creating the inverted database from a series of inverted subdatabases.

6915308, Jul 5, 2005

Apr 6, 2000

09/544121

Davis A. Evans - Pittsburgh PA, US
Michael L. Horowitz - Pittsburgh PA, US
Christopher C. Lichti - Pittsburgh PA, US
Thomas P. Neuendorffer - Wexford PA, US

Claritech Corporation - Pittsburgh PA

G06F007/00

7071041, 707 2, 707 10, 707102, 715500, 715512, 715503, 345853, 345854, 345855

The present invention combines a data processing structure with a graphical user interface (GUI) to create an information analysis tool wherein multiple functions are combined in a network to extract information from multiple data sources. The functional network is created, and graphically represented to the user, by linking individual operations together. The combination of individual operations is not limited by the input or output characteristic of any single operation. The form of the input to or output from a by individual operation, whether from a database or from another operation, is the same. That is, both the input to and the output from an analysis function is a list of document identifiers and corresponding document characteristics. Because the form of the input and output from each operation is the same, arbitrary combinations into of operations may be created. Moreover, functional networks of individual operations can then be used for database retrieval as well as to filter data streams.

6278990, Aug 21, 2001

Jul 25, 1997

8/900548

Michael L. Horowitz - Pittsburgh PA

Claritech Corporation - Pittsburgh PA

G06F 1730

707 3

The present invention is a method for operating a computer system to retrieve information from a computer database. This method decomposes documents from the database into subdocuments and then inverts the database. Also, a query for retrieving documents from a database is decomposed into terms. The subdocuments from the inverted database and the terms from the query are then used to compute a score that indicates a quantitative relation between terms in the query and the subdocuments. The resulting list of the subdocuments and their scores is then reorganized into a heap form. The highest ranking subdocument is then selected by the computer and the text associated with this subdocument is displayed. The remainder of the subdocument score list is concurrently reheapified.