Patents by Inventor Florian Michael Waas
Florian Michael 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: 9418064Abstract: A method, article of manufacture, and apparatus for processing queries, comprising receiving a query, determining a query classification for the query, assigning the query to a resource queue based on the determined query classification, and placing the query in the assigned resource queue. In some embodiments, the resource queue is divided into a plurality of slots, and the query is placed in a slot. The resource queue may be associated with a resource queue memory allocation, and each of the plurality of slots is associated with a slot memory allocation.Type: GrantFiled: March 18, 2011Date of Patent: August 16, 2016Assignee: EMC CorporationInventors: Sivaramakrishnan Narayanan, Florian Michael Waas, Joy Jie Kent
-
Patent number: 9418109Abstract: A method, article of manufacture, and apparatus for processing queries, comprising analyzing a query tree, determining at least one operator based on the query tree analysis, assigning a memory allocation for each of the at least one operator, and storing the assignment in a storage device. In some embodiments, a memory classification for each of the at least one operator is determined. In some embodiments, assigning a memory allocation for each of the at least one operator includes assigning a memory allocation based on the memory classification.Type: GrantFiled: March 18, 2011Date of Patent: August 16, 2016Assignee: EMC CorporationInventors: Sivaramakrishnan Narayanan, Florian Michael Waas, Joy Jie Kent
-
Patent number: 9323791Abstract: A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.Type: GrantFiled: June 5, 2014Date of Patent: April 26, 2016Assignee: Pivotal Software, Inc.Inventors: Brian Hagenbuch, Gavin Sherry, Jeffrey Ira Cohen, Chris Pedrotti, John Glenn Eshleman, Florian Michael Waas, Joy Kent
-
Patent number: 9275107Abstract: 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: August 22, 2014Date of Patent: March 1, 2016Assignee: Pivotal Software, Inc.Inventors: Brian Hagenbuch, Sivaramakrishnan Narayanan, Chad William Whipkey, Florian Michael Waas
-
Patent number: 9218209Abstract: A computer readable storage medium comprises executable instructions to receive a query. A graph is built to represent jobs associated with the query. The jobs are assigned to parallel threads according to the graph.Type: GrantFiled: December 31, 2008Date of Patent: December 22, 2015Assignee: Pivotal Software, Inc.Inventor: Florian Michael Waas
-
Patent number: 9171041Abstract: SQL queries are optimized to operate directly on compressed data (and obtain the correct result) rather than requiring that the data be first decompressed prior to processing a query. Certain characteristic pattern trees are mapped against a logical input query plan that includes certain logical operators such as a DECOMPRESS that precedes a JOIN or a GROUPBY in association with a COUNT to identify instances in the plan that match a characteristic pattern. Upon locating a match, the input query plan is transformed into a logically equivalent plan that operates correctly on compressed data, by analyzing the interplay of the semantics of logical query operations with the compressed data and substituting less costly structures and operations. DECOMPRESS operations are moved to operate subsequent to a JOIN or eliminated altogether, and COUNT operations are replaced by a different operation, such as SUM, that is logically equivalent for compressed data.Type: GrantFiled: September 29, 2011Date of Patent: October 27, 2015Assignee: Pivotal Software, Inc.Inventors: Sivaramakrishnan Narayanan, Florian Michael Waas
-
Patent number: 9104663Abstract: A method, article of manufacture, and apparatus for processing queries, comprising performing a query with a first memory intensive allocation, receiving an indication that a memory intensive operator spilled to a first storage device, adjusting a resource queue memory allocation based on the indication, computing a second memory intensive allocation based on the adjusted resource queue memory allocation, and storing the second memory intensive allocation in a second storage device.Type: GrantFiled: March 18, 2011Date of Patent: August 11, 2015Assignee: EMC CorporationInventors: Sivaramakrishnan Narayanan, Florian Michael Waas, Joy Jie Kent
-
Patent number: 9104500Abstract: A scalable job scheduler for a multi-thread, multi-processor system synchronizes and schedules jobs for execution by using lists and jobs counters for the numbers of active jobs. It minimizes synchronization overhead by using atomic operations for incrementing and decrementing the counters. The scheduler assigns jobs for execution, and can awake up an available thread to pick up work. A parent job spawns child jobs and maintains a job counter. Spawned jobs are added to the list for execution and the counter of waiting jobs is incremented. When execution of a job begins, the parent's counter of outstanding child jobs is decremented. A parent job is suspended until its counter of uncompleted spawned child jobs reaches zero. As a job is completed, the scheduler decrements the counter of active jobs, and assigns the next job in the queue to an available thread.Type: GrantFiled: September 29, 2011Date of Patent: August 11, 2015Assignee: EMC CorporationInventors: Konstantinos Krikellas, Florian Michael Waas, Mohamed Soliman
-
Publication number: 20150081667Abstract: 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: August 22, 2014Publication date: March 19, 2015Inventors: Brian Hagenbuch, Sivaramakrishnan Narayanan, Chad William Whipkey, Florian Michael Waas
-
Publication number: 20150006589Abstract: A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.Type: ApplicationFiled: June 5, 2014Publication date: January 1, 2015Inventors: Brian Hagenbuch, Gavin Sherry, Jeffrey Ira Cohen, Chris Pedrotti, John Glenn Eshleman, Florian Michael Waas, Joy Kent
-
Patent number: 8862606Abstract: The invention enables a correlated or multi-row subquery (CSQ) to be performed on distributed MPP and shared-nothing databases by broadcasting intermediate results, prior to a correlation operation, from subquery execution on one segment to all other segments in the distributed database so that the respective CSQs of each segment will have access to the necessary results to permit correct execution of the CSQ. Additionally, the intermediate results are saved to disk to avoid the necessity of replicating the same intermediate results multiple times during execution of a subquery plan.Type: GrantFiled: September 22, 2011Date of Patent: October 14, 2014Assignee: EMC CorporationInventors: Sivaramakrishnan Narayanan, Florian Michael Waas
-
Patent number: 8768973Abstract: A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.Type: GrantFiled: May 26, 2010Date of Patent: July 1, 2014Assignee: Pivotal Software, Inc.Inventors: Brian Hagenbuch, Gavin Sherry, Jeffrey Ira Cohen, Chris Pedrotti, John Eshleman, Florian Michael Waas, Joy Kent
-
Patent number: 8713359Abstract: Server supervisor processes in the segment nodes of a database cluster afford transparent reset mechanisms to a fault tolerant service (FTS). FTS probes only primary segments as to their status unless a primary segment does not respond, in which case FTS will probe the mirror of that primary-mirror pair, and change the state of the mirror to primary if the primary is faulty. Only a primary segment to initiate a reset of its mirror segment and then resets itself. If a mirror segment fails, it shuts down and its corresponding primary segment will report the failure to FTS. Transient communication failures are addressed by retry logic on FTS probing, and not reported to FTS. Reset is not initiated by FTS and preserves the segment state in the absence of errors.Type: GrantFiled: September 30, 2011Date of Patent: April 29, 2014Assignee: EMC CorporationInventors: Konstantinos Krikellas, Florian Michael Waas, Milena Bergant
-
Patent number: 8375047Abstract: A shared nothing distributed database system includes a master node and a set of shared nothing nodes. Each shared nothing node includes a node state table stored in memory that characterizes various statements and multiple processes implementing each statement, target resource consumption rate for each process and process activity information. A monitor module executed by a central processing unit processes information in the node state table and adjusts values in the node state table in accordance with priority criteria specifying individual user priority ascribed to a statement. A query associated with a statement is processed in the shared nothing distributed database system in accordance with the priority criteria.Type: GrantFiled: March 31, 2010Date of Patent: February 12, 2013Assignee: EMC CorporationInventors: Sivaramakrishnan Narayanan, Florian Michael Waas
-
Publication number: 20120239641Abstract: A method, article of manufacture, and apparatus for processing queries, comprising analyzing a query tree, determining at least one operator based on the query tree analysis, assigning a memory allocation for each of the at least one operator, and storing the assignment in a storage device. In some embodiments, a memory classification for each of the at least one operator is determined. In some embodiments, assigning a memory allocation for each of the at least one operator includes assigning a memory allocation based on the memory classification.Type: ApplicationFiled: March 18, 2011Publication date: September 20, 2012Applicant: EMC CORPORATIONInventors: Sivaramakrishnan Narayanan, Florian Michael Waas, Joy Jie Kent
-
Publication number: 20120173516Abstract: A method, article of manufacture, and apparatus for processing information are disclosed. In some embodiments, this includes receiving a query plan, generating a work file based on the query plan, associating the query plan with a work file, storing the association, and storing the work file in a storage device after the query plan has executed. In some embodiments, a hash of the query plan may be generated.Type: ApplicationFiled: December 31, 2010Publication date: July 5, 2012Applicant: EMC CORPORATIONInventors: Florian Michael Waas, Joy Jie Kent
-
Publication number: 20110295907Abstract: A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.Type: ApplicationFiled: May 26, 2010Publication date: December 1, 2011Inventors: Brian Hagenbuch, Gavin Sherry, Jeffrey Ira Cohen, Chris Pedrotti, John Eshleman, Florian Michael Waas, Joy Kent
-
Publication number: 20110246481Abstract: A shared nothing distributed database system includes a master node and a set of shared nothing nodes. Each shared nothing node includes a node state table stored in memory that characterizes various statements and multiple processes implementing each statement, target resource consumption rate for each process and process activity information. A monitor module executed by a central processing unit processes information in the node state table and adjusts values in the node state table in accordance with priority criteria specifying individual user priority ascribed to a statement. A query associated with a statement is processed in the shared nothing distributed database system in accordance with the priority criteria.Type: ApplicationFiled: March 31, 2010Publication date: October 6, 2011Inventors: Sivaramakrishnan Narayanan, Florian Michael Waas
-
Publication number: 20100169887Abstract: A computer readable storage medium comprises executable instructions to receive a query. A graph is built to represent jobs associated with the query. The jobs are assigned to parallel threads according to the graph.Type: ApplicationFiled: December 31, 2008Publication date: July 1, 2010Inventor: Florian Michael WAAS