Patents by Inventor Cesar A. Galindo-Legaria
Cesar A. Galindo-Legaria 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).
-
Publication number: 20080313131Abstract: Systems and methods that generate specialized plans for compiling SQL queries. A plan generator component scans the query representation for parameter sensitive predicates and evaluates each predicate individually based on the parameter values. Accordingly, queries can be identified not only based on their structures, but also based on their parameter conditions. The specialized plans are more efficient for particular values, wherein queries that employ such values are optimally executed.Type: ApplicationFiled: June 15, 2007Publication date: December 18, 2008Applicant: MICROSOFT CORPORATIONInventors: Marc T. Friedman, Cesar A. Galindo-Legaria, Erik Ismert, Milind Madhukar Joshi, Naveen Prakash
-
Patent number: 7464071Abstract: A suggested query execution plan is used as a constraint on a guided optimization process such that all execution plans that do not conform to the suggested execution plan are eliminated as possible alternatives. If the guided optimization process successfully generates a resulting execution plan, then the result will conform to the suggested execution plan. If the guided optimization process fails to generate a resulting execution plan, then it may be determined that the suggested execution plan is invalid.Type: GrantFiled: April 28, 2005Date of Patent: December 9, 2008Assignee: Microsoft CorporationInventors: Cesar Galindo-Legaria, Ganapathy Krishnamoorthy, Eric N. Hanson, Wei Yu, Milind Joshi
-
Patent number: 7444344Abstract: Systems and methods are provided to increase the scalability of subscriptions in an electronic database environment. In an illustrative implementation, a computing application comprises at least one instruction set to cooperate with a data environment to optimize the processing of subscriptions by the data environment when communicating with cooperating services and/or applications. In operation, a subscription is identified. A subscription template is created for the subscription and the subscription template is parameterized to create a parameter table containing parameters (e.g. subscription constants). A join is then performed between the parameters of the parameter table and the parameterized subscription templates to generate application and/or service data required by the cooperating services and/or applications. The data is then processed by the applications and/or services.Type: GrantFiled: June 27, 2003Date of Patent: October 28, 2008Assignee: Microsoft CorporationInventors: Cesar A. Galindo-Legaria, Goetz Graefe, Florian M. Waas
-
Patent number: 7376656Abstract: A database system and method allows a user to write program code in a high-level programming language that implements a class that defines the structure of a user-defined aggregate and methods that can be invoked on instances of the user-defined aggregate. The class is then registered with the database system, which enforces a specific contract for user-defined aggregates against the class. The contract comprises the following requirements. First, the class must specify one of a plurality of different formats for persisting instances of the user-defined aggregate in a database store. Second, the class must comprise certain specified methods that can be invoked on an instance of the class. Once these requirements are satisfied, the database system enables instances of the user-defined aggregate to be created. Preferably, the database system stores metadata about the user-defined aggregate for subsequent use in creating instances of the aggregate.Type: GrantFiled: February 10, 2004Date of Patent: May 20, 2008Assignee: Microsoft CorporationInventors: Jose A. Blakeley, Hongang Zhang, Balaji Rathakrishnan, Ramachandran Venkatesh, Beysim Sezgin, Alexios Boukouvalas, Cesar A. Galindo-Legaria, Peter A. Carlin
-
Patent number: 7349897Abstract: Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table.Type: GrantFiled: February 4, 2005Date of Patent: March 25, 2008Assignee: Microsoft CorporationInventors: Conor J. Cunningham, Eric N. Hanson, Milind M. Joshi, Cesar A. Galindo-Legaria, Florian M. Waas
-
Patent number: 7340445Abstract: Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table.Type: GrantFiled: February 4, 2005Date of Patent: March 4, 2008Assignee: Microsoft CorporationInventors: Conor J. Cunningham, Eric N. Hanson, Milind M. Joshi, Cesar A. Galindo-Legaria, Florian M. Waas
-
Patent number: 7337169Abstract: Validation of large numbers of alternative execution plans for a database query, either an exhaustive enumeration of the complete space of alternatives, or else an unbiased random sample, is performed by efficiently constructing execution trees from a data structure having groups alternative operators that are ranked in a directory. Each global rank of a plan identifies that plan uniquely among all the alternative plans. The operators are unranked from the directory according to a specification that characterizes the desired plans.Type: GrantFiled: September 23, 2005Date of Patent: February 26, 2008Assignee: Microsoft CorporationInventors: Cesar A. Galindo-Legaria, Florian Waas
-
Patent number: 7272598Abstract: Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table.Type: GrantFiled: March 31, 2005Date of Patent: September 18, 2007Assignee: Microsoft CorporationInventors: Conor J. Cunningham, Eric N. Hanson, Milind M. Joshi, Cesar A. Galindo-Legaria, Florian M. Waas
-
Patent number: 7254574Abstract: Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table.Type: GrantFiled: March 8, 2004Date of Patent: August 7, 2007Assignee: Microsoft CorporationInventors: Conor J. Cunningham, Eric N. Hanson, Milind M. Joshi, Cesar A. Galindo-Legaria, Florian M. Waas
-
Publication number: 20070168324Abstract: When two or more scalar subtrees in an execution plan are directed towards the same data set, but request different data from the data set, the two subtrees are replaced in the execution plan with a new subtree which queries the data set only once. This new query to the data set covers all data required by the different subtrees. A pivoting step then is used to separate the data which would have been sought by each subtree. The pivoting step also yields data in the same form as would have resulted from the original subtrees.Type: ApplicationFiled: January 18, 2006Publication date: July 19, 2007Applicant: Microsoft CorporationInventors: Torsten Grabs, Adrian Baras, Cesar Galindo-Legaria
-
Publication number: 20070130107Abstract: A method of accumulating and aggregating statistics concerning the use of database table indexes includes using a plurality of counters to register index use. The plurality of counters allow multiple instances of index usage to be recorded simultaneously. A missing index may be detected using an optimal index in a query plan. The optimal index is compared against the available indexes to determine if an index is missing. Statistics may be gathered against the used and missing indexes.Type: ApplicationFiled: December 2, 2005Publication date: June 7, 2007Applicant: Microsoft CorporationInventors: Florian Waas, Jueigen Thomas, Eric Hanson, Cesar Galindo-Legaria
-
Patent number: 7194452Abstract: Validation of large numbers of alternative execution plans for a database query, either an exhaustive enumeration of the complete space of alternatives, or else an unbiased random sample, is performed by efficiently constructing execution trees from a data structure having groups alternative operators that are ranked in a directory. Each global rank of a plan identifies that plan uniquely among all the alternative plans. The operators are unranked from the directory according to a specification that characterizes the desired plans.Type: GrantFiled: November 24, 2004Date of Patent: March 20, 2007Assignee: Microsoft CorporationInventors: Cesar A. Galindo-Legaria, Florian Waas
-
Patent number: 7162472Abstract: A client submits a subscription to a database specifying selected data within a data set. A subscription plan is generated based on the subscription. A query is submitted to the database changing selected data within the data set. A query plan is generated based on the query. The subscription is matched to the query based on the data set, and the query plan is supplemented with the subscription plan to generate a notification of the change to the client.Type: GrantFiled: June 24, 2003Date of Patent: January 9, 2007Assignee: Microsoft CorporationInventors: Cesar A. Galindo-Legaria, Goetz Graefe, Christian Kleinerman, Florian M. Waas
-
Patent number: 7158963Abstract: Validation of large numbers of alternative execution plans for a database query, either an exhaustive enumeration of the complete space of alternatives, or else an unbiased random sample, is performed by efficiently constructing execution trees from a data structure having groups alternative operators that are ranked in a directory. Each global rank of a plan identifies that plan uniquely among all the alternative plans. The operators are unranked from the directory according to a specification that characterizes the desired plans.Type: GrantFiled: March 24, 2005Date of Patent: January 2, 2007Assignee: Microsoft CorporationInventors: Cesar A. Galindo-Legaria, Florian Waas
-
Patent number: 7146363Abstract: During query execution, statistics associated with expressions are observed. Such observed statistics preferably include the cardinality of each expression. The observed statistics are submitted to an expression manager as feedback from the executed query. The statistics are preferably stored for use in estimating the cardinality of execution plans for future queries.Type: GrantFiled: May 20, 2003Date of Patent: December 5, 2006Assignee: Microsoft CorporationInventors: Florian M. Waas, Cesar A. Galindo-Legaria, Milind M. Joshi
-
Patent number: 7133858Abstract: A partial pre-aggregation database operation improves processing efficiency of database queries by reducing the number of records input into a subsequent database operation, provided the query includes a final aggregation. A query optimizer is provided to determine when it is economical to partially pre-aggregate data records and when it is not. The partial pre-aggregation creates a record store in memory as input records are received. The record store is then used by another database operator, which saves the other database operator from having to re-create the record store.Type: GrantFiled: June 30, 2000Date of Patent: November 7, 2006Assignee: Microsoft CorporationInventors: Per-Ake Larson, Cesar A. Galindo-Legaria
-
Publication number: 20060248046Abstract: A suggested query execution plan is used as a constraint on a guided optimization process such that all execution plans that do not conform to the suggested execution plan are eliminated as possible alternatives. If the guided optimization process successfully generates a resulting execution plan, then the result will conform to the suggested execution plan. If the guided optimization process fails to generate a resulting execution plan, then it may be determined that the suggested execution plan is invalid.Type: ApplicationFiled: April 28, 2005Publication date: November 2, 2006Applicant: Microsoft CorporationInventors: Cesar Galindo-Legaria, Ganapathy Krishnamoorthy, Eric Hanson, Wei Yu, Milind Joshi
-
Publication number: 20060224563Abstract: A system and method for creation, modification and/or use of plan guide(s) is provided. Plan guide(s) can be employed to optimize the performance of query(ies) when it is not possible and/or desirable to change the text of the query directly. Plan guides can be useful, for example, when a small subset of queries in a database application deployed from a third-party vendor is not performing as expected. Plan guides influence optimization of queries by attaching query hints to them. In accordance with an aspect of the subject invention, a query plan execution system is provided. The system includes an execution component, a query optimizer, and, a plan cache. Plan guides and other associated metadata are stored in a plan guide metadata store.Type: ApplicationFiled: April 5, 2005Publication date: October 5, 2006Applicant: Microsoft CorporationInventors: Eric Hanson, Cesar Galindo-Legaria, Lubor Kollar, Ganapathy Krishnamoorthy, Sameer Verkhedkar, Evgueni Zabokritski, Erik Ismert
-
Patent number: 7010524Abstract: Validation of large numbers of alternative execution plans for a database query, either an exhaustive enumeration of the complete space of alternatives, or else an unbiased random sample, is performed by efficiently constructing execution trees from a data structure having groups alternative operators that are ranked in a directory. Each global rank of a plan identifies that plan uniquely among all the alternative plans. The operators are unranked from the directory according to a specification that characterizes the desired plans.Type: GrantFiled: February 24, 2004Date of Patent: March 7, 2006Assignee: Microsoft CorporationInventors: Cesar A. Galindo-Legaria, Florian Waas
-
Publication number: 20060020573Abstract: Validation of large numbers of alternative execution plans for a database query, either an exhaustive enumeration of the complete space of alternatives, or else an unbiased random sample, is performed by efficiently constructing execution trees from a data structure having groups alternative operators that are ranked in a directory. Each global rank of a plan identifies that plan uniquely among all the alternative plans. The operators are unranked from the directory according to a specification that characterizes the desired plans.Type: ApplicationFiled: September 23, 2005Publication date: January 26, 2006Applicant: Microsoft CorporationInventors: Cesar Galindo-Legaria, Florian Waas