Patents by Inventor Mengchu Cai

Mengchu Cai 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).

  • Cost-based subquery correlation and decorrelation
    Publication number: 20060287979
    Abstract: Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.
    Type: Application
    Filed: June 17, 2005
    Publication date: December 21, 2006
    Inventors: Thomas Beavin, Mengchu Cai, Yao-Ching Chen, Hsiuying Cheng, Fen-Ling Lin, Irene Liu, Jerry Mukai, Demai Ni, Yoichi Tsuji, Li Xia, Ying Zeng
  • Method, system, and program for optimizing processing of nested functions
    Patent number: 7124137
    Abstract: Disclosed is a method, system, and program for processing a function. A set of nested functions are received. A composite function is generated for the set of nested functions. A tagging template is generated for the set of nested functions that corresponds to the composite function. A result is produced by evaluating the composite function using the tagging template.
    Type: Grant
    Filed: December 19, 2002
    Date of Patent: October 17, 2006
    Assignee: International Business Machines Corporation
    Inventors: Fen-Ling Lin, Yao Ching Stephen Chen, Yun Wang, Guogen Zhang, Mengchu Cai, Jason Alexander Cu, Li-Mey Lee
  • Eliminating superfluous namespace declarations and undeclaring default namespaces in XML serialization processing
    Patent number: 7120864
    Abstract: In one embodiment, at least a portion of an object model having at least one namespace is serialized. An ancestor namespace is searched for based on a current namespace declaration. The ancestor namespace is associated with an ancestor prefix and an ancestor uniform resource indicator (URI). The current namespace is associated with a current prefix and current URI. The search is performed to find an ancestor prefix matches the current prefix. When the current namespace is an implicit no default namespace and the ancestor namespace is an explicit default namespace based on, at least in part, the ancestor prefix, a serialized namespace declaration is generated for the current namespace.
    Type: Grant
    Filed: January 27, 2004
    Date of Patent: October 10, 2006
    Assignee: International Business Machines Corporation
    Inventors: Mengchu Cai, Jason Alexander Cu, Yue Huang, Guogen Zhang
  • Eliminating superfluous namespace declarations and undeclaring default namespaces in XML serialization processing
    Publication number: 20050166140
    Abstract: In one embodiment, at least a portion of an object model having at least one namespace is serialized. An ancestor namespace is searched for based on a current namespace declaration. The ancestor namespace is associated with an ancestor prefix and an ancestor uniform resource indicator (URI). The current namespace is associated with a current prefix and current URI. The search is performed to find an ancestor prefix matches the current prefix. When the current namespace is an implicit no default namespace and the ancestor namespace is an explicit default namespace based on, at least in part, the ancestor prefix, a serialized namespace declaration is generated for the current namespace.
    Type: Application
    Filed: January 27, 2004
    Publication date: July 28, 2005
    Inventors: Mengchu Cai, Jason Cu, Yue Huang, Guogen Zhang
  • Method, system, and program for optimizing aggregate processing
    Publication number: 20040122815
    Abstract: Disclosed is a method, system, and program for processing an aggregate function. Rows that contain a reference to intermediate result structures are grouped to form groups. For each group, aggregate element structures are formed from the intermediate result structures and, if the aggregate function specifies ordering, the aggregate element structures are sorted based on a sort key.
    Type: Application
    Filed: December 19, 2002
    Publication date: June 24, 2004
    Applicant: International Business Machines Corporation
    Inventors: Yun Wang, Fen-Ling Lin, Yao Ching Stephen Chen, Mengchu Cai, Jason Alexander Cu, Allan Benjamin Lebovitz, Li-Mey Lee, Guogen Zhang
  • Method, system, and program for optimizing processing of nested functions
    Publication number: 20040122795
    Abstract: Disclosed is a method, system, and program for processing a function. A set of nested functions are received. A composite function is generated for the set of nested functions. A tagging template is generated for the set of nested functions that corresponds to the composite function. A result is produced by evaluating the composite function using the tagging template.
    Type: Application
    Filed: December 19, 2002
    Publication date: June 24, 2004
    Inventors: Fen-Ling Lin, Yao Ching Stephen Chen, Yun Wang, Guogen Zhang, Mengchu Cai, Jason Alexander Cu, Li-Mey Lee