Hong Min

7930294, Apr 19, 2011

Aug 12, 2008

12/190187

Yefim Shuf - Ossining NY, US
Hong Min - Poughkeepsie NY, US
Terence Patrick Purcell - Springfield IL, US
Ou Jin - Morgan Hill CA, US
Fen-Ling Lin - San Jose CA, US
Brian Thinh-Vinh Tran - San Jose CA, US
Patrick Dooling Bossman - Alexandria VA, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707713, 707755

Techniques for partitioning a query are provided. The techniques include establishing one or more criterion for partitioning a query, wherein the query comprises one or more tables, materializing a first of the one or more tables, partitioning the first of the one or more tables until the one or more criterion have been satisfied, and partitioning and joining a remainder of the one or more tables of the query.

8122219, Feb 21, 2012

Jul 22, 2009

12/507419

Yefim Shuf - Millwood NY, US
Hong Min - Poughkeepsie NY, US
Hubertus Franke - Cortlandt Manor NY, US
Ulrich Alfons Finkler - Mahopac NY, US

International Business Machines Corporation - Armonk NY

G06F 13/00

711171, 711154

Techniques for storage allocation of a data record are provided. The techniques include attempting to identify a first location for storing a data record, wherein the data record comprises one or more data record attributes, if the first location is identified, selecting the first location for storing the data record, and if the first location is not identified, identifying a second location for storing the data record using a cost penalty function and selecting the second location for storing the data record based on the cost penalty function.

8631000, Jan 14, 2014

Sep 30, 2010

12/894370

Hubertus Franke - Cortlandt Manor NY, US
Hong Min - Poughkeepsie NY, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707719, 707713

A plurality of queries of an in-memory column-oriented database are obtained. Each of the queries has at least one column predicate. For each of the queries, it is determined which of a plurality of columns in the in-memory column-oriented database need to be scanned. The plurality of queries are grouped into a plurality of scan groups, based at least in part on the determining step. The column predicates are evaluated for those of the queries in a given one of the scan groups in accordance with a scheduling scheme. The grouping step and the scheduling scheme take into account real time scan information.

20100223269, Sep 2, 2010

Feb 27, 2009

12/394572

Yefim Shuf - Millwood NY, US
Hong Min - Poughkeepsie NY, US
Hubertus Franke - Cortlandt Manor NY, US
Allan B. Lebovitz - Morgan Hill CA, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707753, 707E17104

An apparatus and method for efficiently performing a query sort on a data set with duplicate key values is disclosed. The method includes identifying unique key values for a key in a data set after determining that a number of duplicate key values for the key exceed a predefined threshold. The method also includes recording an association of each unique key value with a record in the data set and sorting unique key values. The method further includes storing the unique key values in a sorted order, wherein each unique key value is associated with an appropriate record in the data set.

20130262424, Oct 3, 2013

Mar 30, 2012

13/435281

Donna N. Dillenberger - Yorktown Heights NY, US
Michel H.T. Hack - Cortlandt Manor NY, US
Hong Min - Poughkeepsie NY, US
Gong Su - New York NY, US
James Zu-Chia Teng - San Jose CA, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 17/30

707703, 707E17005

Systems, methods, and products for database system transaction management are provided herein. One aspect provides for annotating via a computing device at least one data object residing on the computing device utilizing at least one transaction tag, the at least one transaction tag being configured to indicate a status of an associated data object; processing at least one database transaction utilizing a transactional memory process, wherein access to the at least one data object is determined based on the status of the at least one data object; and updating the status of the at least one data object responsive to an attempted access of the at least one data object by the at least one database transaction. Other embodiments and aspects are also described herein.

20130318067, Nov 28, 2013

May 23, 2012

13/478507

Bharat Sukhwani - Briarcliff Manor NY, US
Sameh W. Asaad - Briarcliff Manor NY, US
Hong Min - Poughkeepsie NY, US
Matthew S. Thoennes - West Harrison NY, US
Gong Su - New York NY, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707714, 707E17017

Techniques are provided for hardware-accelerated relational joins. A first table comprising one or more rows is processed through a hardware accelerator. At least one join column in at least one of the one or more rows of the first table is hashed to set at least one bit in at least one bit vector. A second table comprising one or more rows is processed through a hardware accelerator. At least one join column in at least one of the one or more rows of the second table is hashed to generate at least one hash value. At least one bit vector is probed using the at least one hash value. A joined row is constructed responsive to the probing step. The row-construction step is performed in the hardware accelerator.

20140019422, Jan 16, 2014

Sep 14, 2012

13/617614

Hubertus Franke - Cortlandt Manor NY, US
Balakrishna R. Iyer - San Jose CA, US
Hong Min - Poughkeepsie NY, US
Terence P. Purcell - Springfield IL, US
Guogen Zhang - San Jose CA, US

International Business Machines Corporation - Armonk NY

G06F 7/00
G06F 17/30

707687, 707E17005

Techniques are provided for encoded data processing which allows for continuous data processing as encoded data changes. Data is decomposed into one or more blocks with each block containing at least one data record. At least one data record within a given block is encoded with a first encoding process selected from one or more encoding processes. The first encoding process is associated with the given data block. Techniques evaluate whether or not to implement an encoding change for a given block when updating a given data record in the given block. Responsive to the evaluation, the given block is re-encoded with a second encoding process. Responsive to the re-encoding, the association of the given block is updated. A map is formed to convert the given data record encoded with the first encoding process to the second encoding process so as to preserve comparative relationships of the given data record.

20140019472, Jan 16, 2014

Jul 10, 2012

13/545522

Hubertus Franke - Cortlandt Manor NY, US
Balakrishna R. Iyer - San Jose CA, US
Hong Min - Poughkeepsie NY, US
Terence P. Purcell - Springfield IL, US
Guogen Zhang - San Jose CA, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707769, 707E17014

Techniques for encoded data processing which allow for continuous data processing as encoded data changes. Data is decomposed into one or more blocks with each block containing at least one data record. At least one data record within a given block is encoded with a first encoding process selected from one or more encoding processes. The first encoding process is associated with the given data block. Techniques evaluate whether or not to implement an encoding change for a given block when updating a given data record in the given block. Responsive to the evaluation, the given block is re-encoded with a second encoding process. Responsive to the re-encoding, the association of the given block is updated. A map is formed to convert the given data record encoded with the first encoding process to the second encoding process so as to preserve comparative relationships of the given data record.