G06F16/24561

REDUCED LATENCY QUERY PROCESSING

Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: receiving by primary database system a query statement that references a first table, wherein the primary database system is associated to a first accelerator database system and a second accelerator database system, wherein modifications performed on tables of the primary database system are iteratively replicated into the first accelerator database system and the second accelerator database system; examining latency data that specifies a latency with which a modification to the first table has been replicated into the first accelerator database system and a latency with which a modification to the first table has been replicated into the second accelerator database system; selecting, in dependence on the examining, the first accelerator database system for execution of the query statement; routing the query statement to the first accelerator database system for execution in response to the selecting.

ENCODING PROCESSING DEVICE, ENCODING PROCESSING METHOD, DECODING PROCESSING DEVICE, DECODING PROCESSING METHOD, AND RECORDING MEDIUM
20170300542 · 2017-10-19 · ·

A non-transitory computer-readable recording medium stores an encoding processing program that causes a computer to execute a process including: extracting processing target column information on processing target columns based on a processing instruction for a plurality of encoded tables, each of the plurality of encoded tables including a plurality of encoded column data, each of the plurality of encoded column data encoded from corresponding column data, respectively, that is delimited by a delimiter; and generating a partial encoded table including the processing target columns from the plurality of encoded tables, using the processing target column information.

EXTREME VALUE COMPUTATION

The method may include providing a plurality of synopsis techniques for determining a plurality of attribute value information indicative of the at least one attribute. The method may include determining a data characteristic describing the plurality of data rows of the current data block. The method may include selecting, based on the determined data characteristic, at least one synopsis technique of the provided plurality of synopsis techniques suitable for generating the plurality of attribute value information for the at least one attribute of the current data block. The method may include determining the plurality of attribute value information for the at least one attribute of the plurality of data rows of the current data block using the at least one selected synopsis technique. The method may include storing the determined plurality of attribute value information for the current data block to be used for query processing against the data table.

Parallel processing of data having data dependencies for accelerating the launch and performance of operating systems and other computing applications

Representative embodiments are disclosed for a rapid and highly parallel decompression of compressed executable and other files, such as executable files for operating systems and applications, having compressed blocks including run length encoded (“RLE”) data having data-dependent references. An exemplary embodiment includes a plurality of processors or processor cores to identify a start or end of each compressed block; to partially decompress, in parallel, a selected compressed block into independent data, dependent (RLE) data, and linked dependent (RLE) data; to sequence the independent data, dependent (RLE) data, and linked dependent (RLE) data from a plurality of partial decompressions of a plurality of compressed blocks, to obtain data specified by the dependent (RLE) data and linked dependent (RLE) data, and to insert the obtained data into a corresponding location in an uncompressed file. The representative embodiments are also applicable to other types of data processing for applications having data dependencies.

Storage Device, Computer System, and Control Method for Storage Device
20170293644 · 2017-10-12 ·

A storage device for storing a column store database, the storage device comprising: a column read unit which reads page data to be searched that have been read from the column store database, acquires a leading row number included in the page data, and reads each column of data in the page data, sequentially from the leading row number to the last row in the column of data; a data search unit which compares each row in each read column of data with first search criteria, from the first row to the last row, and outputs a comparison result; and a search result aggregation unit which, when a comparison result for a range of columns specified by a search request has been output, compares each row in the comparison result with second search criteria, and determines one or more rows in the comparison result that satisfy the second search criteria.

Method, System and Program Product for Mask-Based Compression of a Sparse Matrix
20170293659 · 2017-10-12 ·

A method, system and program product includes examining elements of a first matrix in a sequential fashion. Values of the examined elements are determined. A corresponding bit of a first mask is set to a first value if a determined value is zero. A corresponding bit of a first mask is set to a second value if a determined value is non-zero. The non-zero values are packed in a first vector, wherein bits of at least the first mask determine operations on packed values.

High performance real-time relational database system and methods for using same
09785668 · 2017-10-10 · ·

A database system supporting persistent queries, using a persistent query service and various data sources. On receiving a request to create a persistent query from a client software application, the persistent query service: creates a query virtual table; parses the persistent query; creates a plurality of intermediate virtual tables; establishes listeners for the query virtual table; creates a plurality of data source virtual tables; causes the plurality of data source virtual tables to retrieve initial data from data sources; and propagates data via intermediate virtual tables to the persistent query virtual table. On detection of a data change in a data source, the associated data source virtual table causes the data change to propagate via intermediate virtual tables to the persistent query virtual table, and the client software application executes client code of at least one listener.

SHELL DATABASE ARCHITECTURE FOR INVENTORY MANAGEMENT

In accordance with presently disclosed embodiments, an inventory management system and method are provided. The inventory management system and method utilize an inverted database architecture that stores all the individual information related to each inventory item with the item itself, rather than just an identification number. Successive local, regional, and enterprise databases may be constructed from the item level up. That way, each inventory item effectively becomes a database, storing all its own data, and the higher level databases may be updated to reflect the information from the lower level databases when communication is available. This inventory management system of nested databases may be of particular use in the management of bulk material (e.g., powder, granular, or liquid) inventory for remote supply, transportation, and use applications.

Bucket skiplists
09747315 · 2017-08-29 · ·

The present disclosure involves systems, software, and computer implemented methods for providing a bucket skiplist. In one example, a method comprises identifying a value to be searched for within a skiplist comprising a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, each node representing at least one memory block, wherein each node is associated with a bucket including a set of ordered values, where the first value in each bucket of each node is the relatively lowest value in the bucket, comparing the value to the first values in each bucket to identify a particular node in which the first value may be located, and, in response to determining that the first value of the particular node is not the same as the value to be searched, comparing the value to be searched with the ordered values in the bucket.

System performance logging of complex remote query processor query operations

Described are methods, systems and computer readable media for performance logging of complex query operations.