Ramakumar V Kosuru

8190598, May 29, 2012

Oct 30, 2008

12/261058

Awny K Al-Omari - Cedar Park TX, US
Ramakumar Kosuru - Austin TX, US
Renu Varshneya - Cupertino CA, US
Robert L. Wall - Austin TX, US

Hewlett-Packard Development Company, L.P. - Houston TX

G06F 17/30

707718

One embodiment is a method that determines skew to predict costs for query plans for a database query. The method selects a query plan that accounts for the skew to evenly distribute processing load among multiple processors and then executes the query with the selected query plan.

8549004, Oct 1, 2013

Sep 30, 2010

12/895683

Choudur Lakshminarayan - Austin TX, US
Ramakumar Kosuru - Austin TX, US

Hewlett-Packard Development Company, L.P. - Houston TX

G06F 7/00
G06F 17/30

707737

Estimation of unique values in a database can be performed where a data field having multiple information values is provided in the database. The data field can be partitioned into multiple intervals such that each interval includes a range of information values. An interval specific Bloom filter can be calculated for each of the multiple intervals. A binary Bloom filter value can be calculated for an information value within an interval specific Bloom filter. The binary Bloom filter value can represent whether the information value is unique. A number of unique values in the database can be determined based on calculated binary Bloom filter values.

20060200451, Sep 7, 2006

Mar 7, 2005

11/074343

Ramakumar Kosuru - Cupertino CA, US
Awny Al-Omari - Cedar Park TX, US

G06F 17/30

707003000

Methods and systems receive a query, receive a control statement that represents at least a portion of a desired execution plan associated with the query, and produce an execution plan that conforms to the desired plan to the extent that the produced plan preserves the semantics of the query, without requiring an exhaustive search. These methods also enable realization of bushy shaped plans that are outside the scope of the optimizer search space.

20110145220, Jun 16, 2011

Dec 10, 2009

12/635272

Ramakumar Kosuru - Austin TX, US
Robert M. Wehrmeister - Austin TX, US

G06F 17/30

707718, 707E17136, 707E17017

There is provided a computer-implemented method of executing a query. An exemplary method comprises optimizing the query. The query may specify multiple operations on corresponding multiple column sets of a table in a database. The exemplary method further comprises partitioning data of the table based on the operations within a single pass of the table. Additionally, the exemplary method comprises performing the operations on the partitioned data in parallel.

20130226941, Aug 29, 2013

Feb 28, 2012

13/407540

Ramakumar Kosuru - Austin TX, US
Choudur Lakshminarayan - Austin TX, US

G06F 17/30

707754, 707E17134

The present disclosure generally relates to data processing. Bloom filters are used to process data at high speed. A Bloom filter that is initialized based on a source string can be used to quickly determine the similarity between the source string and a query string.

20130226972, Aug 29, 2013

Feb 27, 2012

13/406478

Ramakumar Kosuru - Austin TX, US
Chetan Kumar Gupta - San Mateo CA, US
Choudur Lakshminarayan - Austin TX, US

G06F 7/00

707802, 707E17044

The present disclosure relates to computing techniques. Data arrays are processed using Bloom filters to determine aggregate count, maximum, and minimum. These methods can be used on different types of data, including data groups, partial groups, data cubes, hypercubes, and others.

20130290378, Oct 31, 2013

Apr 30, 2012

13/460072

Ramakumar Kosuru - Austin TX, US

G06F 7/00
G06F 17/30

707803, 707E17044

A method of indexing in a skip list is disclosed. Key/value pairs are randomly inserted at an appropriate page in a skip list. A new page is created at the lowest level in the skip list. When creating the new page, the page is incremented to a higher level with a write probability. Reading the new page during a search. When reading the new page, the page is incremented to a higher level with a read probability. The read probability is not equal to the write probability.

20160342667, Nov 24, 2016

Jan 31, 2014

15/115006

- Houston TX, US
Ramakumar Kosuru - Austin TX, US
Choudur Lakshminarayan - Austin TX, US

HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP - Houston TX

G06F 17/30

A method of managing a database including creating an initial counting bloom filter (CBF) instance having an array of counters and hash functions that map an inserted value to the array of counters, and designating the initial CBF instance as a current CBF instance, and sequentially inserting each value of a sample data set of a table column into the hash functions of the current CBF instance and incrementing counters of the array of counters to which the value is mapped. The method further includes, prior to inserting each value into the hash functions of the current CBF instance, when a number of counters of the array of counters having non-zero values is at least at a threshold level, designating the current CBF instance as an old CBF instance, creating a new CBF instance having an array of counters and hash functions that map an inserted value to the array counters, and designating the new CBF instance as the current CBF instance.