Hewlett Packard Enterprise Development LP

Hewlett-packard Development Company, L.P.

Micro Focus Lcc

Ramakumar Kosuru

Choudur K Lakshminarayan

QiFan Chen

Awny Kayed Al-Omari

Hansjorg Zeller

Robert L Wall

Renu Varshneya

Kailash Sati

Clifford Earl Gray

Joseph Stanley Kosinski, Jr

In some examples, a system determines whether a chain of functions violates a constraint, based on accessing a tracking structure populated with entries as the functions are invoked by respective server processes launched during execution of a database operation, where each entry of the entries of the tracking structure identifies a respective invoked function that is associated with a corresponding program instance, and detecting, using the tracking structure, related functions that form the chain, the related functions being identified as related if associated with a same program instance. In response to determining that the chain of the functions violates the constraint, the system blocks an invocation of a further function to be added to the chain.

Detecting chains of functions that violate a constraint

In one implementation, a system for multi-column statistic generation of a multi-dimensional tree includes a sampling engine to generate a sample of values from a set of data values, wherein the data values include multi-dimensional inputs. In addition, the system includes generating engine to generate a multi-dimensional tree utilizing the sample values. In addition, the system includes a filtering engine to determine a number of unique values at each node of the multi-dimensional tree utilizing a filter for the set of data values. Furthermore, the system includes an implementing engine to implement the multi-dimensional tree for a query of the set of data values.

Multi-column statistic generation of a multi-dimensional tree

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.

Managing database with counting bloom filters

Incrementally updating statistics includes sampling rows from a database column in a database to generate a first sample, sampling a subset of modified rows from the database column after generating the first sample to generate a second sample, determining whether distribution changes occurred to the database column based on the first and second samples, and updating a database statistic about the database column in response to determining that a distribution change exists.

Incrementally updating statistics

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.

Adaptive probabilistic indexing with skip lists

A method of estimating a number of unique entry counts of an attribute in a database comprises, with a processor: identifying a sample of entries from an attribute database, determining frequencies of a number of input observations of the sample of entries, determining a number of high frequency values of the sample of entries, and estimating a number of unique entry counts of an attribute within the attribute database using a counting Bloom filter and based on the frequencies of the input observations and the high frequency values.

Estimating unique entry counts using a counting bloom filter

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.

Estimation of unique database values

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.

Skew-based costing for database queries

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.

Growing community of inventors

Austin, TX, United States of America

Ramakumar Kosuru