Patents by Inventor Jung-hsin Hu

Jung-hsin Hu 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).

  • Patent number: 9535952
    Abstract: A method, apparatus, and article of manufacture for optimizing a query in a computer system. Grouping operations are optimized during execution of the query in the computer system by: (1) translating the grouping operations into a plurality of levels, wherein each of the levels is comprised of one or more grouping sets with the same number of grouping expressions; (2) deriving the grouping sets on a level-by-level basis, wherein the grouping sets in a base level are obtained from the database and the grouping sets in a next one of the levels are derived by selecting as an input a smallest one of the grouping sets in a previous one of the levels with which it has a derivation relationship; and (3) combining the derived grouping sets into an output for the query.
    Type: Grant
    Filed: April 11, 2012
    Date of Patent: January 3, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Guogen Zhang, Fen-Ling Lin, Jung-Hsin Hu, Yao-Ching S. Chen, Yun Wang, Glenn M. Yuki
  • Publication number: 20120226693
    Abstract: A method, apparatus, and article of manufacture for optimizing a query in a computer system. During compilation of the query, a GROUP BY clause with one or more GROUPING SETS, ROLLUP or CUBE operations is maintained in its original form until after query rewrite. The GROUP BY clause with the GROUPING SETS, ROLLUP or CUBE operations is then translated into a plurality of levels having one or more grouping sets. After compilation of the query, a grouping sets sequence is dynamically determined for the GROUP BY clause with the GROUPING SETS, ROLLUP or CUBE operations based on intermediate grouping sets, in order to optimize the grouping sets sequence. The execution of the grouping sets sequence is optimized by selecting a smallest grouping set from a previous one of the levels as an input to a grouping set on a next one of the levels. Finally, a UNION ALL operation is performed on the grouping sets.
    Type: Application
    Filed: April 11, 2012
    Publication date: September 6, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Guogen Zhang, Fen-Ling Lin, Jung-Hsin Hu, Yao-Ching S. Chen, Yun Wang, Glenn M. Yuki
  • Publication number: 20050027690
    Abstract: A method, apparatus, and article of manufacture for optimizing a query in a computer system. During compilation of the query, a GROUP BY clause with one or more GROUPING SETS, ROLLUP or CUBE operations is maintained in its original form until after query rewrite. The GROUP BY clause with the GROUPING SETS, ROLLUP or CUBE operations is then translated into a plurality of levels having one or more grouping sets. After compilation of the query, a grouping sets sequence is dynamically determined for the GROUP BY clause with the GROUPING SETS, ROLLUP or CUBE operations based on intermediate grouping sets, in order to optimize the grouping sets sequence. The execution of the grouping sets sequence is optimized by selecting a smallest grouping set from a previous one of the levels as an input to a grouping set on a next one of the levels. Finally, a UNION ALL operation is performed on the grouping sets.
    Type: Application
    Filed: July 29, 2003
    Publication date: February 3, 2005
    Inventors: Guogen Zhang, Fen-Ling Lin, Jung-Hsin Hu, Yao-Ching Chen, Yun Wang, Glenn Yuki
  • Patent number: 6182151
    Abstract: The present invention is directed to a storage management system. More particularly if relates to a client/server library system for storing objects in the library system in batches by avoiding storing those objects in an intermediary storage, such as in a client storage space or in a cache, before storing them in the library system. The invention includes a library server, object server and library client, in which an application program interacts with the library client for storing objects, or binary large objects (blobs), in the object server under control of the library server. The present invention provides for an application program to read in objects into a memory space allocated and managed by the application program, or into an application program memory space allocated and managed by the library client.
    Type: Grant
    Filed: July 29, 1996
    Date of Patent: January 30, 2001
    Assignee: International Business Machines Corporation
    Inventors: Hsiuying Cheng, Jung-hsin Hu, Kyung B. Lee