Piyush C Goel, Age 6315566 Dorado Ln, Los Gatos, CA 95030

6446098, Sep 3, 2002

Jan 22, 2002

10/055060

Prakash Iyer - San Jose CA
Piyush Goel - Monte Sereno CA
Rajeev Mohindra - Castro Valley CA
Amitabh Sinha - Los Altos CA
Prasad Krothapalli - San Jose CA
Ronald Mak - San Jose CA
Shashi Vittal - Santa Clara CA

Everypath, Inc. - San Jose CA

G06F 1723

707513, 707523

A method is provided for converting two-dimensional data, particularly information in HTML format, into a canonical representation for rendering in aural or other visual forms wherein each element of interest is selected based on it being part of a mathematically regular expression, namely any expression that can be parsed in a tree. To perform the selection, the container of the element is located, and then the local route of the element within the parsed tree is followed, such that a signature of the element built upon this identification can be constructed and stored for later use in retrieving and rendering the value of the element of interest. The element of interest can thereafter be rendered through an appropriate language translator of interest to the querier. As a further refinement of the invention. the method searches for repeated elements and then stores only one of the selected repeated elements, such as the first repeated element.

6569208, May 27, 2003

Jan 22, 2002

10/055115

Prakash Iyer - San Jose CA
Piyush Goel - Monte Sereno CA
Rajeev Mohindra - Castro Valley CA
Amitabh Sinha - Los Altos CA
Prasad Krothapalli - San Jose CA
Ronald Mak - San Jose CA
Shashi Vittal - Santa Clara CA

Everypath, Inc. - San Jose CA

G06F 1721

715513, 7155011

A system and method are provided for converting two-dimensional data, particularly information in HTML format, into a canonical representation for rendering in aural or other visual forms wherein each element of interest is selected based on it being part of a mathematically regular expression, namely any expression that can be parsed in a tree. To perform the selection, the container of the element is located, and then the local route of the element within the parsed tree is followed, such that a signature of the element built upon this identification can be constructed and stored for later use in retrieving and rendering the value of the element of interest. The element of interest can thereafter be rendered through an appropriate language translator of interest to the querier. As a further refinement of the invention, the method searches for repeated elements and then stores only one of the selected repeated elements, such as the first repeated element.

5855012, Dec 29, 1998

Jul 31, 1997

8/904414

Gautam Bhargava - Cupertino CA
Piyush Goel - Monte Sereno CA
Balakrishna Ragmavendra Iyer - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1730

707 2

A method and apparatus for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations.

5832477, Nov 3, 1998

May 14, 1997

8/856198

Gautam Bhargava - Cupertino CA
Piyush Goel - Monte Sereno CA
Balakrishna Ragmavendra Iyer - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1730

707 2

A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative re-orderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.

5864847, Jan 26, 1999

Jul 30, 1997

8/902975

Piyush Goel - Monte Sereno CA
Balakrishna Raghavendra Iyer - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1730

707 4

A method, apparatus, and article of manufacture for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations. The disclosed transformations and enumeration method unify and solve the problems of 1) unnesting join aggregate queries, and 2) complete enumeration of queries containing outer joins, when the outer join predicate references an aggregated value, or the predicate references more than two base relations in a query subtree. The system first eliminates redundant sub-expressions and modifies expensive binary operations to inexpensive binary operations, then converts complex predicates to simple predicates by application of a generalized selection (GS) operator.

6038562, Mar 14, 2000

Sep 5, 1996

8/708512

Vaishnavi Anjur - Emeryville CA
Atul Chadha - Milpitas CA
Piyush Goel - Monte Sereno CA
Balakrishna Raghavendra Iyer - San Jose CA
Venkatachary Srinivasan - Santa Clara CA
Steven John Watts - Morgan Hill CA

International Business Machines Corporation - Armonk NY

G06F 1730

707 10

Many web applications require access to a relational database. The requirements of such web applications are different from conventional applications that access a database. Web applications need to have selective recoverability and need to have support for different transaction structures, other than the flat transaction structure of conventional database applications, including nested and chained transactions. To achieve this, an interface between the application and database has the following functional features: 1) the interface to the database is connection oriented, i. e. , the connection is retained across several invocations of the application; 2) the backend of the interface is long living, i. e. , it exists across multiple invocations; 3) state information about a session in progress is maintained, and more specifically, it is distributed between the backend of the interface and the hidden fields of the HTML output document.

5724568, Mar 3, 1998

Jun 5, 1995

8/464268

Gautam Bhargava - Cupertino CA
Piyush Goel - Monte Sereno CA
Balakrishna Ragmavendra Iyer - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1730

395602

A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative reorderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.

5978792, Nov 2, 1999

Jan 13, 1998

9/006745

Gautam Bhargava - Cupertino CA
Paramesh Sampatrai Desai - San Jose CA
Piyush Goel - Monte Sereno CA
Peter Hoa - Los Altos CA
Fen-Ling Lin - San Jose CA
Balakrishna Raghavendra Iyer - San Jose CA
Jerry Mukai - San Jose CA
William Samuel Perlman - San Jose CA
Hong Sang Tie - Morgan Hill CA

International Business Machines Corporation - Armonk NY

G06F 1730

707 2

A method and apparatus for generating static, dynamic and hybrid sparse indices for use with workfiles used by SQL queries in a relational database management system.