Murali M Krishna

7299226, Nov 20, 2007

Jun 19, 2003

10/465148

Nicolas Bruno - Redmond WA, US
Murali Krishna - Bellevue WA, US
Ming-Chuan Wu - Redmond WA, US
Surajit Chaudhuri - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 7/00
G06F 17/30

707 5, 707 6, 707 7

A method of estimating cardinality of a join of tables using multi-column density values and additionally using coarser density values of a subset of the multi-column density attributes. In one embodiment, the subset of attributes for the coarser densities is a prefix of the set of multi-column density attributes. A number of tuples from each table that participate in the join may be estimated using densities of the subsets. The cardinality of the join can be estimated using the multi-column density for each table and the estimated number of tuples that participate in the join from each table.

7515982, Apr 7, 2009

Jun 30, 2006

11/480076

Aishwarya Varadhan - Portland OR, US
Murali Krishna - Phoenix AZ, US
Bo Li - Portland OR, US
Johnny Hsiang Wu - Portland OR, US
Chandra Mouli - Portland OR, US
Ross A. Giddings - Beaverton OR, US

Intel Corporation - Santa Clara CA

G06F 19/00

700100

In one embodiment, the present invention includes a method for receiving entries in a database, each corresponding to a semiconductor lot to be processed, automatically assigning each of the entries to a process tool, and dynamically dispatching the semiconductor lot corresponding to an assigned entry to the corresponding assigned process tool based on status information of the assigned process tool. Other embodiments are described and claimed.

7890508, Feb 15, 2011

Aug 19, 2005

11/207482

Robert H. Gerber - Bellevue WA, US
Balan Sethu Raman - Redmond WA, US
James R. Hamilton - Bellevue WA, US
John F. Ludeman - Sammamish WA, US
Murali M. Krishna - Bellevue WA, US
Samuel H. Smith - Albuquerque NM, US
Shrinivas Ashwin - Sammamish WA, US

Microsoft Corporation - Redmond WA

G06F 7/00
G06F 17/30

707736, 707756, 715227, 715229

Mechanisms and techniques for database fragment cloning and management are provided. A database object, such as a table, rowset or index, is divided into fragments. Each fragment is cloned to create cloned fragments, which operationally are substantially identical to one another. One or more of the cloned fragments may be designated as a primary cloned fragment for performing database operations or as a secondary cloned fragment for serving as backup. Updates to each fragment are implemented on the primary cloned fragment and are then propagated from the primary cloned fragment to the corresponding secondary cloned fragments. A cloned fragment can go offline, becoming unavailable to be updated. When the cloned fragment returns online, the cloned fragment is refreshed with data included in the primary cloned fragment. While being refreshed, the cloned fragment may continue to be updated.

7945558, May 17, 2011

Jan 9, 2008

12/008357

Murali Mallela Krishna - Vancouver WA, US

Hewlett-Packard Development Company, L.P. - Houston TX

G06F 7/00
G06F 17/30

707713, 707718

One embodiment relates to a computer-implemented method to estimate a cardinality of a database query. Single table cardinalities are determined after application of selection predicates. In addition, pair-wise join selectivities are estimated without assuming independence between selection and join predicates. Said pair-wise join selectivities are multiplied with said single table cardinalities after application of the selection predicates. Another embodiment relates to a computer apparatus including a cardinality estimator. The cardinality estimator includes computer-readable instructions configured to (a) determine single table cardinalities after application of selection predicates from the database query, (b) estimate pair-wise join selectivities without assuming independence between the selection predicates and join predicates of the database query, and (c) multiply said pair-wise join selectivities with said single table cardinalities after application of the selection predicates. Other embodiments, aspects and features are also disclosed.

8438153, May 7, 2013

Oct 11, 2010

12/901934

Murali Krishna - Vancouver WA, US
Harumi Kuno - Cupertino CA, US
Vijay M. Sarathy - Portland OR, US
Subrata Naskar - West Bengal, IN

Hewlett-Packard Development Company, L.P. - Houston TX

G06F 7/00

707714

A method of performing a database join includes receiving a query. The query may specify a join of a first table and a second table. The method further includes determining a new predicate based on a mapping between a first column of the first table and a second column of the second table for a plurality of tuples of the join. Further, the method includes modifying the query such that the query comprises the new predicate.

8554760, Oct 8, 2013

Oct 7, 2009

12/574911

Suresh Subbiah - Plano TX, US
Lars Fredriksen - Downers Grove IL, US
Murali Mallela Krishna - Vancouver WA, US
Hansjorg Zeller - Los Altos CA, US

Hewlett-Packard Development Company, L.P. - Houston TX

G06F 17/30

707713, 707714

There is provided a computer-implemented method of optimizing a query. An exemplary method comprises receiving a first query configured to generate a result set. The query may comprise an operation for an outer table, a first predicate, and a second predicate. The second predicate may comprise a subquery correlated to the operation. Additionally, the first predicate and the second predicate may be disjunctive. The exemplary method also comprises generating a first query tree representing the first query, and generating a second query tree representing a second query. The second query may be configured to generate the result set, and may not comprise the subquery. The exemplary method additionally comprises generating a query plan based on the second query tree.

8572068, Oct 29, 2013

Feb 2, 2009

12/364086

Goetz Graefe - Madison WI, US
Murali M. Krishna - Vancouver WA, US
Harumi Kuno - Cupertino CA, US
Janet L. Wiener - Palo Alto CA, US

Hewlett-Packard Development Company, L.P. - Houston TX

G06F 7/00

707718

Computer-implemented systems and associated operating methods use atomic query maps to identify and evaluate database query plan robustness landmarks. The computer-implemented system comprises logic that evaluates robustness of a selected atomic query by measuring performance of atomic query execution in a predetermined range of runtime conditions that include data characteristics. The logic produces a set of measurements that can be displayed as one or more performance maps and analyzes the measured performance to identify landmarks indicative of database atomic query performance degradation greater than a predetermined amount.

20050091269, Apr 28, 2005

Oct 24, 2003

10/693735

Robert Gerber - Bellevue WA, US
Holly Knight - Woodinville WA, US
Murali Krishna - Bellevue WA, US
Niranjan Nilakantan - Redmond WA, US
Shahaf Abileah - Seattle WA, US
Shyamalan Pather - Seattle WA, US

G06F007/00

70710300X

The present systems and methods disclose a system for personalizing computer functionality. End-users are provided with tools to easily write rich and complex preferences, for example, by using a plurality simple IF-THEN propositional logic. The preferences are then transformed into queries and executed efficiently on structured data. Preferences that are satisfied then execute actions such as providing notification or storing data in a particular folder. Furthermore, according to an aspect of the invention, data, logic, events, inter alia, are all schematized, thereby enabling sharing of data between application components and across applications.