Brian A Tran

6389425, May 14, 2002

Jul 9, 1998

09/112464

Linda Gail DeMichiel - Los Altos CA
Gene Y. C. Fuh - San Jose CA
Bruce Gilbert Lindsay - San Jose CA
Nelson Mendonca Mattos - San Jose CA
Brian Thinh-Vinh Tran - San Jose CA
Yun Wang - Saratoga CA

International Business Machines Corporation - Armonk NY

G06F 1730

707102, 707 2, 707 3, 707103

A method, apparatus, and article of manufacture for a computer-implemented embedded storage mechanism for structured data types. A statement is stored in a database stored on a data storage device connected to a computer. At compile-time, specific methods for a structured data type are mapped to generic methods using parse trees. At run-time, an in-memory representation of the structured data type is generated using information conveyed in the parse trees. Then, linearization of the generated in-memory representation is performed.

7246115, Jul 17, 2007

Dec 19, 2002

10/324800

Guogen Zhang - San Jose CA, US
Irene Ching-Hua Liu - San Jose CA, US
Ding-Wei Chieh - Cupertino CA, US
Lee-Chin Hsu Liu - San Jose CA, US
Yao-Ching Stephen Chen - Saratoga CA, US
Hsuiying Yen Cheng - Fremont CA, US
Brian Thinh-Vinh Tran - San Jose CA, US
Yun Wang - Saratoga CA, US
Ruiping Li - San Jose CA, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707 3, 707 4, 707101, 707102

A method and system for efficiently identifying materialized view candidates for queries filters materialized views using certain criteria, using the materialized view signatures. This filtering rejects some of the unqualified materialized views prior to the performance of the query rewrite matching algorithm, resulting in a group of materialized view candidates. The query rewrite matching algorithm is then performed on the materialized view candidates. By first filtering the materialized views based on their signatures, the number of materialized views on which the query rewrite matching algorithm is performed is significantly reduced, improving performance.

7299225, Nov 20, 2007

Nov 26, 2002

10/304220

Brian T. Tran - San Jose CA, US
Hsiuying Y. Cheng - Fremont CA, US
Shuanglin Guo - San Jose CA, US
Patrick M. Malone - Campbell CA, US
Thomas A. Beavin - Milpitas CA, US
Xiazhen Wang - San Jose CA, US
Xun Li - San Jose CA, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707 5, 707 2, 707 3, 707 4

A method, apparatus, and article of manufacture for improving the performance of evaluating predicates with non-matching operands by aggressively casting the input value to the data type of the target column before the data of the target column is accessed.

7937413, May 3, 2011

May 4, 2004

10/709415

Brian Thinh-Vinh Tran - San Jose CA, US
Guogen Zhang - San Jose CA, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707803, 707790

A variable-length binary string is utilized to encode node identifiers in a tree for an XML document object model. A general prefix encoding scheme is followed; a node identifier is generated by the concatenation of encodings at each level of a tree along a path from a root node to another particular node. Arbitrary insertions are supported without change to existing node identifier encodings. In addition, the method provides for document order when unsigned binary string comparison is used to compare encoded node identifiers. In support of sub-document concurrency control, prefix encoding provides a way to derive ancestor-descendant relationships among nodes in a tree. Lastly, the encoding method provides a natural pre-order clustering sequence, also known as depth-first clustering. If a prefix is applied to an encoding with a level number, starting with zero at the root, width-first clustering will result. A mixed clustering can also be supported.

8543614, Sep 24, 2013

Aug 22, 2005

11/209997

Yao-Ching Stephen Chen - Saratoga CA, US
Yue Huang - San Jose CA, US
Fen-Ling Lin - San Jose CA, US
Brian Thinh-Vinh Tran - San Jose CA, US
Guogen Zhang - San Jose CA, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707802, 707790

A storage of nodes of hierarchically structured data uses logical node identifiers to reference the nodes stored within and across record data structures. A node identifier index is used to map each logical node identifier to a record identifier for the record that contains the node. When a sub-tree is stored in a separate record, a proxy node is used to represent the sub-tree in the parent record. The mapping in the node identifier index reflects the storage of the sub-tree nodes in the separate record. Since the references between the records are through logical node identifiers, there is no limitation to the moving of records across pages, as long as the indices are updated or rebuilt to maintain synchronization with the resulting data pages. This approach is highly scalable and has a much smaller storage consumption than approaches that use explicit references between nodes.

20110320424, Dec 29, 2011

Jun 29, 2010

12/826479

Jeff A. Zias - Los Altos CA, US
Peter C. Terrill - San Francisco CA, US
Judd C. Jacobs - San Jose CA, US
Brian A. Tran - Fremont CA, US
Hugh N. Molotsi - Cupertino CA, US

INTUIT INC. - Mountain View CA

G06F 17/30

707708, 707E17108

A parameter-selection technique that allows preferred permutations to be rapidly identified based on real-world user behavior is described. In particular, a set of web pages that include different permutations of the set of parameters are generated. Then, at least a subset of these web pages is provided to the users in response to their requests. For example, the requests may be associated with user selections of search results, which are associated with search queries provided by the users to a search engine. While the users interact with the subset of the set of web pages, their actions and the associated context (with respect to the different permutations) are tracked. Next, the tracked user actions are used to identify the web pages associated with the preferred permutations of the set of parameters.

60650133, May 16, 2000

Aug 19, 1997

8/914394

Gene Y. C. Fuh - San Jose CA
Bruce Gilbert Lindsay - San Jose CA
Nelson Mendonca Mattos - San Jose CA
Brian Thinh-Vinh Tran - San Jose CA
Yun Wang - Saratoga CA

International Business Machines Corporation - Armonk NY

G06F 1730

707103

A method, apparatus, and article of manufacture for a computer implemented storage mechanism for persistent objects in a database management system. A statement is executed in a computer. The statement is performed by the computer to manipulate data in a database stored on a data storage device connected to the computer. It is determined that an object is to be stored in an inline buffer. When the object can be entirely stored in the inline buffer, the object is stored in the inline buffer. When the object cannot be entirely stored in the inline buffer, a selected portion of the object is stored in the inline buffer and the remaining portion of the object is stored as a large object.

62789945, Aug 21, 2001

Jul 9, 1998

9/112302

Gene Y. C. Fuh - San Jose CA
Nelson Mendonca Mattos - San Jose CA
Brian Thinh-Vinh Tran - San Jose CA
Yun Wang - Saratoga CA

International Business Machines Corporation - Armonk NY

G06F 1730

707 4

A method, apparatus, and article of manufacture for a computer-implemented integrated architecture for user-defined search. A statement is executed in a database stored on a data storage device connected to a computer, and the database contains data. Under control of the database, a statement is received that requests manipulation of the data. The statement includes a user-defined function. An index of a user-defined index type is used to access the data. The user-defined function is processed with the accessed data.