Steven M Pearson

6792407, Sep 14, 2004

Mar 30, 2001

09/821973

Nicholas Kibre - Mountain View CA
Steven Pearson - Santa Barbara CA
Brian Hanson - Goleta CA
Jean-Claude Junqua - Santa Barbara CA

Matsushita Electric Industrial Co., Ltd. - Osaka

G10L 1306

704260

A new speaker provides speech from which comparison snippets are extracted. The comparison snippets are compared with initial snippets stored in a recorded snippet database that is associated with a concatenative synthesizer. The comparison of the snippets to the initial snippets produces required sound units. A greedy selection algorithm is performed with the required sound units for identifying the smallest subset of the input text that contains all of the text for the new speaker to read. The new speaker then reads the optimally selected text and sound units are extracted from the human speech such that the recorded snippet database is modified and the speech synthesized adopts the voice quality and characteristics of the new speaker.

58322035, Nov 3, 1998

Jan 23, 1995

8/377381

Franco Putzolu - San Francisco CA
Steven R. Pearson - Campbell CA
James M. Lyon - San Jose CA
Malcolm Mosher - Los Gatos CA

Tandem Computers Incorporated - San Jose CA

G06F 1100

39518218

An improved recovery method utilizes sequence numbers to order log records and reduce the excess compensating actions due to a failure during recovery. Next undo records are written to the log after a preset number of compensating actions which include the sequence number of the record currently being scanned. After a failure, all records between the next undo record and the record having the sequence number included in the next undo record are ignored during when the log is scanned backwards.

20160342635, Nov 24, 2016

Aug 3, 2016

15/227383

- Armonk NY, US
Chandrasekaran MOHAN - San Jose CA, US
Steven R. PEARSON - Portland OR, US
Richard S. SIDLE - Mountain View CA, US
Adam J. STORM - Toronto, CA
Roger L.Q. ZHENG - Richmond Hill, CA

G06F 17/30

Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

20150363440, Dec 17, 2015

Jun 11, 2014

14/301399

- Armonk NY, US
Ronald J. Barber - San Jose CA, US
Yi Ding - Beijing City, CN
Chandrasekaran Mohan - Saratoga CA, US
Steven R. Pearson - Portland OR, US
Richard S. Sidle - Mountain View CA, US
Adam J. Storm - Toronto, CA

G06F 17/30

According to one embodiment of the present invention, a method for processing a query in a column database is provided. The method for analyzing test results may include a computer, associating a first set of metadata values with a set of records in a table, wherein each record has an associated state indicated by a metadata value. The method may further include the computer receiving a query to return one or more records of the set of records. The method may further include the computer determining that one or more records in the set of records satisfies the query. The method may further include the computer determining whether at least a first record in the one or more records that satisfies the query is in a returnable state based, at least in part, on the metadata value.

20150363468, Dec 17, 2015

Mar 11, 2015

14/644264

- Armonk NY, US
Ronald J. Barber - San Jose CA, US
Yi Ding - Beijing City, CN
Chandrasekaran Mohan - Saratoga CA, US
Steven R. Pearson - Portland OR, US
Richard S. Sidle - Mountain View CA, US
Adam J. Storm - Toronto, CA

G06F 17/30

According to one embodiment of the present invention, a method for processing a query in a column database is provided. The method for analyzing test results may include a computer, associating a first set of metadata values with a set of records in a table, wherein each record has an associated state indicated by a metadata value. The method may further include the computer receiving a query to return one or more records of the set of records. The method may further include the computer determining that one or more records in the set of records satisfies the query. The method may further include the computer determining whether at least a first record in the one or more records that satisfies the query is in a returnable state based, at least in part, on the metadata value.

20150212999, Jul 30, 2015

Jan 30, 2014

14/168934

- Armonk NY, US
Chandrasekaran MOHAN - San Jose CA, US
Steven R. PEARSON - Portland OR, US
Richard S. SIDLE - Mountain View CA, US
Adam J. STORM - Toronto, CA
Roger L.Q. ZHENG - Richmond Hill, CA

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 17/24

Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

20150213071, Jul 30, 2015

Jan 30, 2014

14/168146

- Armonk NY, US
Matthew A. Huras - Ajax, CA
Sam S. Lightstone - Toronto, CA
Chandrasekaran Mohan - San Jose CA, US
Steven R. Pearson - Portland OR, US
Richard S. Sidle - Mountain View CA, US
David C. Smith - Mississauga, CA
Adam J. Storm - Toronto, CA

International Business Machines Corporation - Armonk NY

G06F 17/30

Embodiments relate to database systems. An aspect includes deferring row insert operations until occurrence of a triggering event. One method includes receiving a row insert for a tuple into a column group store table, where the tuple includes one or more tuplets and each of the tuplets corresponds to a column group in the column group store table. The method also includes copying at least one of the tuplets into an insert buffer that is specific to one of the column groups in the column group store table. The method also includes deferring the row insert into the column group store table until an occurrence of one or more triggering events. The method also includes flushing the row insert into storage associated with the column group store table, in response to the occurrence of the one or more triggering events.

20150213073, Jul 30, 2015

Nov 14, 2014

14/542248

- Armonk NY, US
Chandrasekaran MOHAN - San Jose CA, US
Steven R. PEARSON - Portland OR, US
Richard S. SIDLE - Mountain View CA, US
Adam J. STORM - Toronto, CA
Roger L.Q. ZHENG - Richmond Hill, CA

G06F 17/30

Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.