Liping Z Zhang, 56Seattle, WA

8615503, Dec 24, 2013

Jul 1, 2011

13/174823

Naresh K Chainani - Portland OR, US
Raghupathi K Murthy - Union City CA, US
Sitaram Vemulapalli - San Jose CA, US
Liping Zhang - Portland OR, US

International Business Machines Corporation - Armonk NY

G06F 17/30

707703, 707704, 707769, 707830

Method for attaching one or more tables online to a range partitioned table, includes: starting a child transaction; obtaining an exclusive lock on a source table; obtaining an intent exclusive lock on a target table; soft invalidating queries on the target table where compiled form of queries are cached for reuse; attaching the source table(s) to the target table as a new partition(s) of the target table; modifying indices and table structure of the target table to reflect the attaching of the new partition; committing the child transaction; and releasing the exclusive lock and the intent exclusive lock, where concurrently running queries over the target table continue to run without considering the partition until the intent exclusive lock and the exclusive lock are released. Queries on the target table only consider existing partitions when the attaching is in progress. The new partition is available once the attach operation is complete.

2011015, Jun 23, 2011

Dec 21, 2009

12/643284

Venson Shaw - Kirkland WA, US
Steven Carlson - Atlanta GA, US
Leland Yu - Kirkland WA, US
Liping Zhang - Redmond WA, US

AT&T MOBILITY II LLC - Atlanta GA

H04W 24/08

455425

Field testing, performance monitoring, and resource management are performed via a communications device, automatically and autonomously, without user intervention. Abnormal conditions are automatically detected while the communications device is performing a service and adjustments are automatically made to network resources in order to improve service performance. Upon initiation of a request for service (e.g., IM, MMS, SMS, etc.), the communications device automatically begins to monitor the performance of the service session (e.g., send time, receive time, etc.). During or after the service session, the communications device stores the performance data associated with the performance of the service. The performance data is analyzed in accordance with a subscriber's user profile information, to detect any problems with the service. If problems are detected, necessary adjustments and/or reallocation of resources are made automatically and autonomously, without user intervention.

2011032, Dec 29, 2011

Jun 24, 2010

12/822215

Naresh K. Chainani - Beaverton OR, US
Michael J. Winer - Markham, CA
Liping Zhang - Beaverton OR, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 17/30

707769, 707803, 707E17005, 707E17014

A method, computer program product, and system for providing access to a database object during modification of that object. Upon receipt of a data definition language (DDL) operation specifying a modification to the database object, currently executing database transactions are invalidated in a two-step process of a soft invalidation followed by a hard invalidation. The soft invalidation permits the current database transactions to continue executing while modifying the logical structure of the database object in accordance with the DDL operation, and the hard invalidation waits for the database transactions started prior to the DDL operation to finish execution before modifying the physical structure of the database object in accordance with the DDL operation. After the modification to the logical structure is complete, new database transactions are allowed to execute against the modified database object, thus improving the availability of the object while it is being modified.

2019013, May 2, 2019

Nov 1, 2017

15/800195

- Armonk NY, US
Liping Zhang - Portland OR, US
Calisto Zuzarte - Pickering, CA

G06F 17/30

Embodiments described herein provide a solution for optimizing a generating of query search results. A filtering search term (e.g., a search term that is used in a query to perform filtering aggregations of the query search results) is identified. A filtering bitmap that has a plurality of mapped locations corresponding to data values for the filtering search term is created. As a data value in the filtering search term is encountered during a scan of the query search results, the corresponding mapped location is updated. Each mapped location in the filtering bitmap is read to determine whether the value corresponding to the mapped location satisfies the filtering aggregation. The filtering aggregation can then be performed (e.g., prior to any grouping aggregation) by removing any of the query search results determined, based on the filtering bitmap, as having data values for which the filtering aggregation is not satisfied.

2018027, Sep 27, 2018

Mar 22, 2017

15/465684

- Armonk NY, US
Vincent Kulandaisamy - Portland OR, US
Wenbin Ma - Vaughan, CA
Liping Zhang - Portland OR, US
Calisto P. Zuzarte - Pickering, CA

G06F 17/30

Provided herein are techniques for processing a database query aggregating data. Data tuples of a database object each including a grouping element and a data element are analyzed to determine a length of the data element for each data tuple. A plurality of tables each accommodate a successively greater length for the data element. A corresponding table of the plurality of tables to store each data tuple is determined based on the length of the data element of that data tuple relative to the accommodated lengths of the plurality of tables. Each data tuple in the determined corresponding table is stored to group the data tuples within each of the plurality of tables based on the grouping element, and an indication of corresponding tables containing members for each group is provided. The groups are combined across the plurality of tables to aggregate the data tuples for a database query.

2018024, Aug 30, 2018

Feb 28, 2017

15/444769

- Armonk NY, US
Ronald J. Barber - San Jose CA, US
Vijayshankar Raman - Sunnyvale CA, US
Liping Zhang - Portland OR, US

G06F 12/02
G06F 3/06
G06F 11/30
G06F 11/34

To manage memory in a multi-processing system, a memory budget is assigned to each of a number of agents within the multi-processing system. A portion of memory is allocated to each the agents within the memory budget. Metrics are collected for each agent during processing of data by the agents; the metrics include an amount of data processed and an amount of memory used for each agent. Memory efficiency is determined for each agent based on the collected metrics and another memory budget is determined based on the memory efficiency. The portion of the memory is reallocated to the agents within the other memory budget in response to data stored in the memory relative to the assigned memory budget meeting a criterion.

2018022, Aug 9, 2018

Apr 24, 2018

15/960890

- Armonk NY, US
Vijayshankar Raman - Cupertino CA, US
David C. Sharpe - St. Catharines, CA
Richard S. Sidle - Ottawa, CA
Liping Zhang - Portland OR, US

G06F 17/30

A computer-implemented method includes receiving a query plan. The method includes identifying a plurality of qualified relevant rows and one or more encoding candidate payload columns. The method includes analyzing the relevant rows in the encoding candidate payload columns to yield a count of distinct contents and a payload column width. The method includes estimating a cost and determining whether the cost is larger than an amount of available memory for on-the-fly encoding all of the plurality of encoding candidate payload columns. The method is responsive to the estimated cost being less than the amount of available memory, by on-the-fly encoding the encoding candidates and responsive to the estimated cost being greater than the amount of available memory by on-the-fly encoding fewer than all of the encoding candidates so as not to exceed the available memory, and leaving alone one or more remaining encoding candidate payload columns unencoded.

2018022, Aug 9, 2018

Apr 24, 2018

15/961007

- Armonk NY, US
Vijayshankar Raman - Cupertino CA, US
David C. Sharpe - St. Catharines, CA
Richard S. Sidle - Ottawa, CA
Liping Zhang - Portland OR, US

G06F 17/30

A computer-implemented method includes receiving a query plan. The method includes identifying a plurality of qualified relevant rows and one or more encoding candidate payload columns. The method includes analyzing the relevant rows in the encoding candidate payload columns to yield a count of distinct contents and a payload column width. The method includes estimating a cost and determining whether the cost is larger than an amount of available memory for on-the-fly encoding all of the plurality of encoding candidate payload columns. The method is responsive to the estimated cost being less than the amount of available memory, by on-the-fly encoding the encoding candidates and responsive to the estimated cost being greater than the amount of available memory by on-the-fly encoding fewer than all of the encoding candidates so as not to exceed the available memory, and leaving alone one or more remaining encoding candidate payload columns unencoded.