Ashish C Gupta

US Patent:

6539378, Mar 25, 2003

Filed:

Nov 30, 2001

Appl. No.:

10/000235

Inventors:

Ashish Gupta - Seattle WA
Peter Norvig - Palo Alto CA
Anand Rajaraman - Seattle WA

Assignee:

Amazon.com, Inc. - Seattle WA

International Classification:

G06F 1730

US Classification:

707 5, 707 10, 707102

Abstract:

According to the invention, a method is provided for forming an information closure of a plurality of rows in a listing stack built by a wrapper program for accessing semistructured information. This method includes removing a first row from the listing stack and computing a cross product of the fields in the first row. A step of adding this cross product to a list of accepted rows can also be part of the method. For each remaining row in the listing stack, the method includes a step of computing a selective cross product according to a plurality of steps. In one step, a result is initialized to empty. Then, for each row in the list of accepted rows, a step of determining for a first new row from the accepted row, extended with the non-empty fields of the remaining row is performed. The method can also include a step of determining a second new row from the remaining row, extended with the non-empty fields in the accepted row. Thereupon, a step of adding the two new rows to the result can be performed.

US Patent:

6571243, May 27, 2003

Filed:

Nov 30, 2001

Appl. No.:

10/000743

Inventors:

Ashish Gupta - Seattle WA
Peter Norvig - Palo Alto CA
Anand Rajaraman - Seattle WA

Assignee:

Amazon.com, Inc. - Seattle WA

International Classification:

G06F 1730

US Classification:

707 6, 707 1, 707 2, 707 3, 707 4, 707 5, 707100

Abstract:

According to the invention, a system and method for extracting information from a semistructured information source. The system includes a listing stack for holding extracted information. A means for matching at least one extractor to the semistructured information to return a list of potential matches is also included. The system can also include a means for iterating through the list of potential matches and a means for retrieving information from a particular match in the list of potential matches. A means for adding a particular match into the listing stack can also be part of the system.

US Patent:

6912547, Jun 28, 2005

Filed:

Jun 26, 2002

Appl. No.:

10/180667

Inventors:

Surajit Chaudhuri - Redmond WA, US
Ashish Kumar Gupta - Seattle WA, US
Vivek Narasayya - Redmond WA, US
Sanjay Agrawal - Kirkland WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F017/30

US Classification:

7071041, 706917, 709224, 703 21

Abstract:

Relational database applications such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importance of leveraging workloads. Often these applications are presented with large workloads, i. e. , a set of SQL DML statements, as input. A key factor affecting the scalability of such applications is the size of the workload. The invention concerns workload compression which helps improve the scalability of such applications. The exemplary embodiment is broadly applicable to a variety of workload-driven applications, while allowing for incorporation of application specific knowledge. The process is described in detail in the context of two workload-driven applications: index selection and approximate query processing.

US Patent:

7293036, Nov 6, 2007

Filed:

Dec 8, 2004

Appl. No.:

11/008335

Inventors:

Surajit Chaudhuri - Redmond WA, US
Ashish Kumar Gupta - Seattle WA, US
Vivek Narasayya - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30

US Classification:

707101, 707 2, 707100

Abstract:

Relational database applications such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importance of leveraging workloads. Often these applications are presented with large workloads, i. e. , a set of SQL DML statements, as input. A key factor affecting the scalability of such applications is the size of the workload. The invention concerns workload compression which helps improve the scalability of such applications. The exemplary embodiment is broadly applicable to a variety of workload-driven applications, while allowing for incorporation of application specific knowledge. The process is described in detail in the context of two workload-driven applications: index selection and approximate query processing.

US Patent:

7493413, Feb 17, 2009

Filed:

Mar 15, 2005

Appl. No.:

11/080897

Inventors:

Ashish Gupta - Redmond WA, US
Jeremy L. Dewey - Redmond WA, US
Padmini Chandrasekhar Iyer - Redmond WA, US
Ravi T. Rao - Redmond WA, US
Todd R. Manion - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/16

US Classification:

709238, 709232

Abstract:

The claimed method and system is an API set to support a multicast programming model for implementation on top of a service oriented framework, specifically a service oriented messaging system.

US Patent:

7543023, Jun 2, 2009

Filed:

Mar 15, 2005

Appl. No.:

11/080782

Inventors:

Ashish Gupta - Redmond WA, US
Jeremy L. Dewey - Redmond WA, US
Padmini Chandrasekhar Iyer - Redmond WA, US
Ravi T. Rao - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/16

US Classification:

709205, 709202, 709212, 709216, 709220, 709227

Abstract:

The claimed system is a service support framework for a multicast programming system implemented on top of a service oriented framework, specifically a service oriented messaging system.

US Patent:

7912959, Mar 22, 2011

Filed:

Mar 15, 2005

Appl. No.:

11/080825

Inventors:

Ashish Gupta - Redmond WA, US
Jeremy Lee Dewey - Redmond WA, US
Padmini Chandrasekhar Iyer - Redmond WA, US
Ravi T. Rao - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/16

US Classification:

709227

Abstract:

The claimed system is a multicast programming model for implementation on top of a service oriented framework, specifically a service oriented messaging system. It provides application-layer multicast capability without requiring an IP multicast infrastructure. The claimed system enables service oriented applications to implement multicasting communications easily and efficiently.

US Patent:

8145760, Mar 27, 2012

Filed:

Jul 24, 2007

Appl. No.:

11/782486

Inventors:

Peter Dinda - Evanston IL, US
Ananth Sundararaj - Redmond WA, US
John Lange - Evanston IL, US
Ashish Gupta - Evanston IL, US
Bin Lin - Hillsboro OR, US

Assignee:

Northwestern University - Evanston IL

International Classification:

G06F 15/173
G06F 9/46

US Classification:

709226, 718100

Abstract:

Certain embodiments of the present invention provide systems and method for automatic inference and adaptation of a virtualized computer environment. Certain embodiments of a system include a virtual topology and traffic inference framework tool adapted to monitor traffic for an application on a virtual network to produce a view of network demands for the application. The system also includes a monitoring tool adapted to monitor performance of an underlying physical network associated with the virtual network using traffic for the application. Further, the system includes an adaptation component adapted to automatically adapt the application to the virtual network based on the measured application traffic, the monitored network performance, and one or more adaptation control algorithms.