Patents by Inventor Kouhorng Allen Yang

Kouhorng Allen Yang has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Off-loading star join operations to a storage server
    Patent number: 7885953
    Abstract: A method, storage server, and computer readable medium for off-loading star-join operations from a host information processing system to a storage server. At least a first and second set of keys from a first and second dimension table, respectively are received from a host system. Each of the first and second set of keys is associated with at least one fact table. A set of locations associated with a set of foreign key indexes are received from the host system. A set of fact table indexes are traversed. At least a first set of Row Identifiers (“RIDs”) associated with the first set of keys and at least a second set of RIDs associated with the second set of keys are identified. An operation is performed on the first and second sets of RIDs to identify an intersecting set of RIDs. The intersecting set of RIDs are then stored.
    Type: Grant
    Filed: October 3, 2007
    Date of Patent: February 8, 2011
    Assignee: International Business Machines Corporation
    Inventors: Ying-lin Chen, You-Chin Fuh, Wei Han, Fen-Ling Lin, Inderpal Singh Narang, Lin Qiao, Vijayshankar Raman, Kouhorng Allen Yang
  • OFF-LOADING STAR JOIN OPERATIONS TO A STORAGE SERVER
    Publication number: 20090094258
    Abstract: A method, storage server, and computer readable medium for off-loading star-join operations from a host information processing system to a storage server. At least a first and second set of keys from a first and second dimension table, respectively are received from a host system. Each of the first and second set of keys is associated with at least one fact table. A set of locations associated with a set of foreign key indexes are received from the host system. A set of fact table indexes are traversed. At least a first set of Row Identifiers (“RIDs”) associated with the first set of keys and at least a second set of RIDs associated with the second set of keys are identified. An operation is performed on the first and second sets of RIDs to identify an intersecting set of RIDs. The intersecting set of RIDs are then stored.
    Type: Application
    Filed: October 3, 2007
    Publication date: April 9, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: YING-LIN CHEN, You-Chin Fuh, Wei Han, Fen-Ling Lin, Inderpal Singh Narang, Lin Qiao, Vijayshankar Raman, Kouhorng Allen Yang
  • Apportioning a work unit to execute in parallel in a heterogeneous environment
    Patent number: 6496823
    Abstract: A method, apparatus, and article of manufacture for a computer-implemented apportioning system. Work is distributed to processors in a multi-processor system. Initially, during bind-time, a scaling factor is determined for each processor. The scaling factor represents relative processing power in relation to each other processor. Then, portions of a total amount of work are distributed to each processor based on the determined scaling factor of that processor and a determined amount of work for an average processor.
    Type: Grant
    Filed: September 24, 1998
    Date of Patent: December 17, 2002
    Assignee: International Business Machines Corporation
    Inventors: Ted Eric Blank, Tammie Dang, Fen-Ling Lin, Randy Mitchell Nakagawa, Bryan Frederick Smith, Craig Leonard Sutton, Darren Benjamin Swank, Hong Sang Tie, Dino Carlo Tonelli, Annie S. Tsang, Kouhorng Allen Yang, Kathryn Ruth Zeidenstein
  • APPORTIONING A WORK UNIT TO EXECUTE IN PARALLEL IN A HETEROGENEOUS ENVIRNOMENT
    Publication number: 20020023069
    Abstract: A method, apparatus, and article of manufacture for a computer-implemented apportioning system. Work is distributed to processors in a multi-processor system. Initially, during bind-time, a scaling factor is determined for each processor. The scaling factor represents relative processing power in relation to each other processor. Then, portions of a total amount of work are distributed to each processor based on the determined scaling factor of that processor and a determined amount of work for an average processor.
    Type: Application
    Filed: September 24, 1998
    Publication date: February 21, 2002
    Inventors: TED ERIC BLANK, TAMMIE DANG, FEN-LING LIN, RANDY MITCHELL NAKAGAWA, BRYAN FREDERICK SMITH, CRAIG LEONARD SUTTON, DARREN BENJAMIN SWANK, HONG SANG TIE, DINO CARLO TONELLI, ANNIE S. TSANG, KOUHORNG ALLEN YANG, KATHRYN RUTH ZEIDENSTEIN