Christian L Lang

US Patent:

7174328, Feb 6, 2007

Filed:

Sep 2, 2003

Appl. No.:

10/653550

Inventors:

Ioana Stanoi - Bronx NY, US
Christian Lang - New York NY, US
Sriram Padmanabhan - Briarcliff Manor NY, US

Assignee:

International Business Machines Corp. - Armonk NY

International Classification:

G06F 17/30
G06F 12/00

US Classification:

707 3, 707200

Abstract:

A method of utilizing one or more hints for query processing over a hierarchical tagged data structure having a plurality of nodes in a computing system having memory, the hint being positive if there is a tag accessible in top-down traversal from a child node, and otherwise negative. For each tag in the data structure, the method calculates a bitmap for a current node with all bits set to 1 and for each child node, followed by AND-ing all child bitmaps and setting a bit corresponding to a tag ID of a current tag to zero if such current tag exists. The method further sets a bit of a current tag to 0, calculates a plurality of possible non-redundant hints for each child node, and refreshes a hint list.

US Patent:

7496683, Feb 24, 2009

Filed:

Jul 27, 2006

Appl. No.:

11/494331

Inventors:

Christian A. Lang - New York NY, US
George Andrei Mihaila - Yorktown Heights NY, US
Themis Palpanas - Dobbs Ferry NY, US
Ioana Stanoi - White Plains NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/173

US Classification:

709241, 709232, 709238

Abstract:

A system, method, and computer readable medium for optimizing throughput of a stream processing system are disclosed. The method comprises analyzing a set of input streams and creating, based on the analyzing, an input profile for at least one input stream in the set of input streams. The input profile comprises at least a set of processing requirements associated with the input stream. The method also comprises generating a search space, based on an initial configuration, comprising a plurality of configurations associated with the input stream. A configuration in the plurality of configurations is identified that increases throughput more than the other configurations in the plurality of configurations based on at least one of the input profile and system resources.

US Patent:

7512282, Mar 31, 2009

Filed:

Aug 31, 2005

Appl. No.:

11/217784

Inventors:

Christian A. Lang - New York NY, US
Min Wang - Cortlandt Manor NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06K 9/36

US Classification:

382240

Abstract:

Methods and apparatus are provided for incremental approximate nearest neighbor searching. An approximate nearest neighbor is incrementally retrieved from a data set having a plurality of objects and cells of objects in a hierarchical organization based on a query object. The present invention maintains an object priority queue to organize the objects based on a distance to the query object and a cell priority queue to organize the cells of objects based on a distance to the query object. The next approximate nearest neighbor is incrementally retrieved based on a state of one or more of the object priority queue and the cell priority queue.

US Patent:

7512747, Mar 31, 2009

Filed:

Apr 14, 2006

Appl. No.:

11/404966

Inventors:

Bishwaranjan Bhattacharjee - Yorktown Heights NY, US
Christian Alexander Lang - New York NY, US
Timothy Ray Malkemus - Round Rock TX, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 12/06

US Classification:

711150, 711168, 711148

Abstract:

An embodiment of the present invention provides a computer system including a first memory and a second memory, where the first memory is substantially faster than the second memory. A method includes steps of: inspecting a request queue for block requests from a plurality of concurrent calling processes, the request queue including a plurality of block requests not yet processed by any of the plurality of concurrent calling processes; retrieving one of the plurality of block requests, wherein each block is accessed at most once by each calling process; determining whether the retrieved block request can be fulfilled from the first memory; and returning the retrieved block to the calling process whose state indicates that the block is needed if the retrieved block request can be fulfilled from the first memory.

US Patent:

7529849, May 5, 2009

Filed:

Jul 27, 2006

Appl. No.:

11/495312

Inventors:

Christian A. Lang - New York NY, US
Ioana Stanoi - White Plains NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/173
G06F 15/16
G06F 5/00
G06F 3/00

US Classification:

709238, 709234, 710 29, 710 60

Abstract:

A system, method, and computer readable medium for reducing message flow on a message bus are disclosed. The method includes determining if at least one logical operator in a plurality of logical operators requires processing on a given physical processing node in a group of physical nodes. In response to determining that the logical operator requires processing on the given physical processing node, the logical operator is pinned to the given physical processing node. Each logical operator in the plurality of logical operators is assigned to an initial physical processing node in the group of physical processing nodes on a message bus.

US Patent:

7676739, Mar 9, 2010

Filed:

Nov 26, 2003

Appl. No.:

10/723344

Inventors:

Christian Alexander Lang - New York NY, US
Ching-Yung Lin - Forest Hills NY, US
John R. Smith - New Hyde Park NY, US
Belle L. Tseng - Forest Hills NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/00

US Classification:

715231

Abstract:

Improved document annotation techniques are provided. For example, in one aspect of the invention, a technique for determining an annotation for a document includes the following steps/operations. A user-proposed annotation to be associated with the document is obtained. Then, the technique automatically determines, in accordance with a knowledge base, whether the user-proposed annotation matches at least one allowed annotation.

US Patent:

7836036, Nov 16, 2010

Filed:

Sep 21, 2007

Appl. No.:

11/859384

Inventors:

Bishwaranjan Bhattacharjee - Yorktown Heights NY, US
Christian A. Lang - New York NY, US
Timothy R. Malkemus - Leander TX, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 7/00

US Classification:

707705

Abstract:

A method and processor to determine distances between multiple index driven scan operations. A first anchor index entry is identified during a first index scan and stored. A first number of index entries between the first anchor index entry and a first index scan location being processed by a first index scan is determined based on information maintained external to an index structure. A determination is made of second number of index entries between the first anchor index entry and a second index scan location being processed by a second index scan executing concurrently with the first index scan based on information maintained external to the index structure. A distance between the first index scan location and the second index scan location is calculated as equal to a difference between the first number of index entries and the second number of index entries.

US Patent:

7894627, Feb 22, 2011

Filed:

Mar 31, 2008

Appl. No.:

12/058976

Inventors:

Christian A. Lang - New York NY, US
Min Wang - Cortlandt Manor NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06K 9/00

US Classification:

382100

Abstract:

Methods and apparatus are provided for incremental approximate nearest neighbor searching. An approximate nearest neighbor is incrementally retrieved from a data set having a plurality of objects and cells of objects in a hierarchical organization based on a query object. The present invention maintains an object priority queue to organize the objects based on a distance to the query object and a cell priority queue to organize the cells of objects based on a distance to the query object. The next approximate nearest neighbor is incrementally retrieved based on a state of one or more of the object priority queue and the cell priority queue.