Patents by Inventor Florian Waas
Florian Waas 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).
-
Patent number: 9477695Abstract: A request for a metadata object is received where the request includes an identifier. It is determined whether the metadata object is stored in a metadata cache, including by: selecting a sub-cache in the metadata cache based at least in part on the identifier and determining whether the metadata object is stored in that sub-cache. If it is determined the metadata object is not in the metadata cache, a request (in a format associated with the source) to obtain the metadata object is sent to a source with which the metadata object is associated. If the metadata object provided by the source is in a native format which is not the same as the common format, the metadata object is transformed from the native format into the common format. Access to the metadata object in the common format is provided.Type: GrantFiled: February 6, 2014Date of Patent: October 25, 2016Assignee: EMC CorporationInventors: Lyublena Antova, Florian Waas, Sivaramakrishnan Narayanan, Venkatesh Raghavan, Mohamed Soliman, Konstantinos Krikellas
-
Patent number: 9479395Abstract: A method is disclosed. A finite state machine model for a single system workflow is replicated across a plurality of distributed nodes associated with a leader election protocol. A leader is determined amongst the plurality of distributed nodes to perform a next action of the finite state machine model based at least in part on the leader election protocol. One or more nodes amongst the plurality of distributed nodes are configured to submit a timeout ticket if the next action of the finite state machine model does not appear to have been performed by the leader within a prescribed time.Type: GrantFiled: April 4, 2014Date of Patent: October 25, 2016Assignee: EMC CorporationInventors: Florian Waas, Christopher J. Pedrotti, Robbert VanRenesse
-
Patent number: 9052969Abstract: Each of a plurality of subtasks is configured to explore and assess alternative solutions for a combinatorial optimization problem by a reentrant finite state machine is represented. Each of a plurality of threads is configured to perform operations comprising a subtask until either completion or a blocked state is reached and, in the event a blocked state is reached, to move on to performing another subtask that is not currently in a blocked state.Type: GrantFiled: March 11, 2013Date of Patent: June 9, 2015Assignee: EMC CorporationInventors: Florian Waas, Mohamed Soliman, Konstantinos Krikellas
-
Patent number: 8996505Abstract: Data movement driven placement of data in a distributed database is disclosed. A set of one or more queries anticipated to be performed with respect to a data set is received. A set of statistics associated with the data set is received. The set of queries and the statistics are used to explore algorithmically a search space of distribution policy alternatives, to determine an optimal distribution policy to distribute data comprising the data set across a plurality of database servers.Type: GrantFiled: June 22, 2012Date of Patent: March 31, 2015Assignee: Pivotal Software, Inc.Inventors: Carlos Garcia-Alvarado, Venkatesh Raghavan, Sivaramakrishnan Narayanan, Florian Waas
-
Publication number: 20140304380Abstract: A method is disclosed. A finite state machine model for a single system workflow is replicated across a plurality of distributed nodes associated with a leader election protocol. A leader is determined amongst the plurality of distributed nodes to perform a next action of the finite state machine model based at least in part on the leader election protocol. One or more nodes amongst the plurality of distributed nodes are configured to submit a timeout ticket if the next action of the finite state machine model does not appear to have been performed by the leader within a prescribed time.Type: ApplicationFiled: April 4, 2014Publication date: October 9, 2014Applicant: EMC CorporationInventors: Florian Waas, Christopher J. Pedrotti, Robbert VanRenesse
-
Patent number: 8818991Abstract: A method of analyzing the performance of a query optimizer includes identifying an event trigger. A reproduction object characterizing operational parameters of the customer computer at the time of the event trigger is populated. The reproduction object is transported from the customer computer to a test computer. The reproduction object is analyzed at the test computer to characterize the performance of a query optimizer.Type: GrantFiled: December 23, 2009Date of Patent: August 26, 2014Assignee: Pivotal Software, Inc.Inventors: Brian Hagenbuch, Sivaramakrishnan Narayanan, Chad William Whipkey, Florian Waas
-
Publication number: 20140195553Abstract: A request for a metadata object is received where the request includes an identifier. It is determined whether the metadata object is stored in a metadata cache, including by: selecting a sub-cache in the metadata cache based at least in part on the identifier and determining whether the metadata object is stored in that sub-cache. If it is determined the metadata object is not in the metadata cache, a request (in a format associated with the source) to obtain the metadata object is sent to a source with which the metadata object is associated. If the metadata object provided by the source is in a native format which is not the same as the common format, the metadata object is transformed from the native format into the common format. Access to the metadata object in the common format is provided.Type: ApplicationFiled: February 6, 2014Publication date: July 10, 2014Applicant: EMC CorporationInventors: Lyublena Antova, Florian Waas, Sivaramakrishnan Narayanan, Venkatesh Raghavan, Mohamed Soliman, Konstantinos Krikellas
-
Patent number: 8732282Abstract: A method is disclosed. A finite state machine model for a single system workflow is replicated across a plurality of distributed nodes associated with a leader election protocol. A leader is determined amongst the plurality of distributed nodes to perform a next action of the finite state machine model based at least in part on the leader election protocol. One or more nodes amongst the plurality of distributed nodes are configured to submit a timeout ticket if the next action of the finite state machine model does not appear to have been performed by the leader within a prescribed time.Type: GrantFiled: September 30, 2011Date of Patent: May 20, 2014Assignee: EMC CorporationInventors: Florian Waas, Christopher Pedrotti, Robbert VanRenesse
-
Patent number: 8688703Abstract: A request for a metadata object is received. It is determined whether the metadata object is stored in a metadata cache. In the event the metadata object is not stored in the metadata cache, a request to obtain the metadata object is sent to a source with which the metadata object is associated in a format associated with the source. The metadata object is transformed from a native format of the source into a common format if the metadata object as provided by the source is in a native format that is not the same as the common format. Access to the metadata object in the common format is provided.Type: GrantFiled: December 22, 2011Date of Patent: April 1, 2014Assignee: EMC CorporationInventors: Lyublena Antova, Florian Waas, Sivaramakrishnan Narayanan, Venkatesh Raghavan, Mohamed Soliman, Konstantinos Krikellas
-
Publication number: 20130290973Abstract: Each of a plurality of subtasks is configured to explore and assess alternative solutions for a combinatorial optimization problem by a reentrant finite state machine is represented. Each of a plurality of threads is configured to perform operations comprising a subtask until either completion or a blocked state is reached and, in the event a blocked state is reached, to move on to performing another subtask that is not currently in a blocked state.Type: ApplicationFiled: March 11, 2013Publication date: October 31, 2013Inventors: Florian Waas, Mohamed Soliman, Konstantinos Krikellas
-
Patent number: 8417689Abstract: Each of a plurality of subtasks is configured to explore and assess alternative solutions for a combinatorial optimization problem by a reentrant finite state machine is represented. Each of a plurality of threads is configured to perform operations comprising a subtask until either completion or a blocked state is reached and, in the event a blocked state is reached, to move on to performing another subtask that is not currently in a blocked state.Type: GrantFiled: November 21, 2011Date of Patent: April 9, 2013Assignee: EMC CorporationInventors: Florian Waas, Mohamed Soliman, Konstantinos Krikellas
-
Publication number: 20110153594Abstract: A method of analyzing the performance of a query optimizer includes identifying an event trigger. A reproduction object characterizing operational parameters of the customer computer at the time of the event trigger is populated. The reproduction object is transported from the customer computer to a test computer. The reproduction object is analyzed at the test computer to characterize the performance of a query optimizer.Type: ApplicationFiled: December 23, 2009Publication date: June 23, 2011Inventors: Brian Hagenbuch, Sivaramakrishnan Narayanan, Chad William Whipkey, Florian Waas
-
Patent number: 7769744Abstract: 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: GrantFiled: December 2, 2005Date of Patent: August 3, 2010Assignee: Microsoft CororationInventors: Florian Waas, Jueigen Thomas, Eric N. Hanson, Cesar A. Galindo-Legaria
-
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
-
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: 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: 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
-
Publication number: 20050283458Abstract: In the course of an optimization, a query can be broken down into its sub-expressions. Materialized views may be substituted for the sub-expressions during query optimization. Encoded sub-expressions are generated and used in the comparison with stored materialized views. Instead of discarding the encoding of a query's sub-expression if no matching materialization is found, the encoding is stored. If subsequently submitted queries contain the same sub-expression, a view matching mechanism will find the previously stored encoding. Because no materialization is associated with this expression, the view is not substituted. However, usage statistics counters are updated; e.g., a counter is incremented indicating that the sub-expression was found in another query. Because view matching is applied to the sub-expression that are candidates for being materialized, the statistics accurately reflect which are the most frequently occurring candidate sub-expressions in a workload.Type: ApplicationFiled: June 22, 2004Publication date: December 22, 2005Applicant: Microsoft CorporationInventors: Cesar Galindo-Legaria, Florian Waas