Michael L Mccool

US Patent:

7096235, Aug 22, 2006

Filed:

Mar 27, 2003

Appl. No.:

10/401303

Inventors:

Michael McCool - Pasadena CA, US
Linda Ann Wald - Los Angeles CA, US

Assignee:

Sand Technology Systems International, Inc. - Quebec

International Classification:

G06F 17/30

US Classification:

707201, 707100, 707 3, 707 7

Abstract:

A method and apparatus for storage, insertion, deletion, and searching of a database index using a compact representation of a 0-complete binary tree. The compact representation, termed a C-trie, is represented in a computer memory as a set of layered vectors with the layering of the vectors corresponding to the depths of the C-trie. Insertion and deletion processes maintain the representation of the C-trie remains in a well-formed and taut state at the end of each operation, thus providing subsequent efficient manipulations of the C-trie in computer memory.

US Patent:

7467155, Dec 16, 2008

Filed:

Jul 12, 2005

Appl. No.:

11/180053

Inventors:

Michael McCool - Pasadena CA, US
Linda Ann Wald - Los Angeles CA, US

Assignee:

Sand Technology Systems International, Inc. - Westmount, Quebec

International Classification:

G06F 17/30

US Classification:

707102, 707 2, 707 3, 707101

Abstract:

Method and apparatus providing a binary representation of a document storing unstructured data. A unique word identifier is obtained for each word included in the document. A word select vector includes positions identified by different word identifiers. A 1-bit value is stored at positions identified by the word identifiers of the words included in the document. A unique position identifier is further assigned to each word appearing in the document. A word use set includes vectors for each unique word identifier for which a 1-bit is stored in the word select vector. Each vector in the word use set indicates the position identifiers of the instances of a particular word included in the document. Once the binary representation is generated, it may be efficiently searched to determine whether particular words appear in the document.

US Patent:

59744111, Oct 26, 1999

Filed:

Feb 18, 1997

Appl. No.:

8/801317

Inventors:

Michael W. McCool - Pasadena CA
Jean A. Marquis - Sierra Madre CA

Assignee:

Sand Technology Systems International, Inc. - Westmont

International Classification:

G06F 500
H03M 730

US Classification:

707 3

Abstract:

A method of processing bit vectors or raw bit strings wherein the bit vectors or raw bit strings are input to a binary tree structure of processing elements. Each processing element performs a boolean "OR" operation on a pair of inputs to produce an output stream of compressed bit string fragments. Processing takes place according to dataflow principles, wherein the processing element is activated when data is available at its inputs. The output compressed bit string fragments are buffered in a FIFO before being input to another processing element at a lower level of the binary tree. A resultant bit vector or raw bit string is output from the processing element representing the root node of the binary tree. The resultant bit vector or raw bit string is a representation of the result of the boolean "OR" of all inputs.

US Patent:

58359591, Nov 10, 1998

Filed:

Dec 1, 1995

Appl. No.:

8/565862

Inventors:

Michael W. McCool - Pasadena CA
Scott J. Kurman - Wenatchee WA

Assignee:

Sand Technology Systems International, Inc. - Westmount

International Classification:

G06F 1208

US Classification:

711171

Abstract:

An embodiment of the present invention is a memory management system. A storage device is organized into at least one file comprising numbered data frames of stored data for swapping into a memory. Each frame contains storage blocks of space. A memory is connected to the storage device and comprises a cache comprising numbered pages for storing swapped frames and a page list heads list comprising at least one list head entry. Each numbered page contains data frames that contain memory blocks for data storage or header frames that contain frame meta data. Each such list head entry stores a page number identifying a first of the numbered pages that contains free memory blocks of a given block size. A processor is connected to the memory and comprises means for allocating the one memory block responsive to a memory request by looking up the numbered page identified by the page number stored in the one list head entry.

US Patent:

60353112, Mar 7, 2000

Filed:

Nov 12, 1997

Appl. No.:

8/968051

Inventors:

Michael W. McCool - Pasadena CA
Jean A. Marquis - Pasadena CA

Assignee:

Sand Technology Systems International, Inc. - Westmount

International Classification:

G06F 738

US Classification:

708231

Abstract:

A system and a method using a computer for performing a boolean operation on bit strings to form a resultant bit string. Each such bit string is divided into input bit slices. The resultant bit string is divided into a resultant bit slices. An action is determined according to the boolean operation based on a first such input bit slice from a first such bit string and on a second such input bit slice from a second such bit string. The input bit slice with a longer bit length is selected from between the first input bit slice and the second input bit slice. The longer input bit slice and a plurality of the input bit slices in the bit string having the input bit slice with a shorter bit length are processed according to the determined action for up to a number of bits in at least one such bit string equaling the longer bit length to form at least one such resultant bit slice.