Abstract: In updating a synopsis table of a database system, a database management unit performs a transaction to insert row(s) in a section of the base table and determines whether a synopsis entry for the section is stored in the memory. If stored in the memory, the in-memory synopsis entry is retrieved and metadata values in the in-memory synopsis entry are updated with data from the row(s) to be inserted. If not stored in the memory, the in-memory synopsis entry is generated and the metadata values in the in-memory synopsis entry are updated with data from the row(s). The insert transaction is then committed. Synopsis entry on-disk updates are thus avoided, significantly reducing the cost of updating the synopsis entries from the insert transaction. This yields enhanced performance especially for inserts of a small number of rows, while the benefits of synopsis entries are still available.

Abstract: Reorganizing a data table to improve analytical database performance. Attribute value information for data blocks of the data table is determined. One or more queries having respective query predicates involving the attribute may be received and processed. Data blocks having attribute value information matching a query predicate are selected. The selected data blocks are evaluated for the query predicate of the query. For each part of a set of the parts a false positive rate may be determined. The false positive rate may indicate the fraction of data blocks of the selected data blocks of the part, that each contains less than a determined maximum number of rows that satisfy the query predicate. In response to determining the false positive rate, determining a subset of parts including the sorted part that fit into a level of granularity higher than the selected level of granularity and sorting the subset of parts.

Abstract: The present disclosure relates to a method for processing data blocks of a data table. The data blocks comprise an attribute representing multidimensional spatial data objects, where the attribute has multiple values representing respective dimensions of the multidimensional spatial data object. The method comprises creating for each data block of the data blocks, a respective attribute metadata. The attribute metadata comprises attribute value information defining a multidimensional minimum bounding rectangle that covers attribute values of the attribute comprised in the data block. A query is processed on the multidimensional spatial data objects associated with a query area using the multidimensional minimum bounding rectangle to check whether a data block of the data blocks contains attribute values of the attribute in the query area.

Abstract: In an approach to storing data elements in a database, a database management unit provides a table-mapping file for enabling access to a table of a plurality of tables in a storage medium, the table-mapping file comprising a plurality of map records of a single table, a map record comprising information indicative of the table, a column of the table, a data section of the table, and a range of values of data elements included in the data section of the column. The unit receives a data element at the database via a communication interface, determines the table, column, and data section the data element is to be stored in, and stores the data element in the section file corresponding to the determined table, column and data section. The unit then updates the table-mapping file corresponding to the table, columns and data section the data element has been stored in.

Abstract: Reorganizing a data table to improve analytical database performance is presented. Attribute value information for data blocks of the data table is determined. One or more queries having respective query predicates involving the attribute may be received and processed. Data blocks having attribute value information matching a query predicate are selected. The selected data blocks are evaluated for the query predicate of the query. For each part of a set of the parts a false positive rate may be determined. The false positive rate may indicate the fraction of data blocks of the selected data blocks of the part, that each contains less than a determined maximum number of rows that satisfy the query predicate. In response to determining for each part of the set of the parts that the determined false positive rates of the part meet a predefined condition sorting the part by the attribute.

Abstract: The present disclosure relates to a method for processing a data table. The data table is divided into a plurality of data blocks, and a multidimensional data structure for representing the plurality of data blocks is generated. For each data block of at least part of the plurality of data blocks, a respective data element is added into the multidimensional data structure. The data element has multiple values indicative of a first attribute of the data block. The multidimensional data structure is stored for selectively processing a portion of the data blocks using the multidimensional data structure.

Abstract: Reorganizing a data table to improve analytical database performance. Attribute value information for data blocks of the data table is determined. One or more queries having respective query predicates involving the attribute may be received and processed. Data blocks having attribute value information matching a query predicate are selected. The selected data blocks are evaluated for the query predicate of the query. For each part of a set of the parts a false positive rate may be determined. The false positive rate may indicate the fraction of data blocks of the selected data blocks of the part, that each contains less than a determined maximum number of rows that satisfy the query predicate. In response to determining the false positive rate, determining a subset of parts including the sorted part that fit into a level of granularity higher than the selected level of granularity and sorting the subset of parts.

Abstract: The present disclosure relates to a method for processing data blocks of a data table. The data blocks comprise an attribute representing multidimensional spatial data objects, where the attribute has multiple values representing respective dimensions of the multidimensional spatial data object. The method comprises creating for each data block of the data blocks, a respective attribute metadata. The attribute metadata comprises attribute value information defining a multidimensional minimum bounding rectangle that covers attribute values of the attribute comprised in the data block. A query is processed on the multidimensional spatial data objects associated with a query area using the multidimensional minimum bounding rectangle to check whether a data block of the data blocks contains attribute values of the attribute in the query area.

Abstract: In an approach to storing data elements in a database, a database management unit provides a table-mapping file for enabling access to a table of a plurality of tables in a storage medium, the table-mapping file comprising a plurality of map records of a single table, a map record comprising information indicative of the table, a column of the table, a data section of the table, and a range of values of data elements included in the data section of the column. The unit receives a data element at the database via a communication interface, determines the table, column, and data section the data element is to be stored in, and stores the data element in the section file corresponding to the determined table, column and data section. The unit then updates the table-mapping file corresponding to the table, columns and data section the data element has been stored in.

Abstract: The method may include providing, in accordance with a column-oriented storage technique, the data table as columns corresponding to the plurality of attributes, whereby each column includes a plurality of separate data blocks. The method may also include determining the plurality of records of the provided data table for which a plurality of attribute values of at least one selected column is contained in a plurality of predetermined data blocks. The method may further include determining, for each column of at least a part of the plurality of columns within the determined plurality of records, a plurality of attribute value information descriptive of an associated attribute within the column and providing an indication of the one or more data blocks for which the plurality of attribute value information is determined. The method may also include storing the determined plurality of attribute value information for enabling query processing.

Abstract: In updating a synopsis table of a database system, a database management unit performs a transaction to insert row(s) in a section of the base table and determines whether a synopsis entry for the section is stored in the memory. If stored in the memory, the in-memory synopsis entry is retrieved and metadata values in the in-memory synopsis entry are updated with data from the row(s) to be inserted. If not stored in the memory, the in-memory synopsis entry is generated and the metadata values in the in-memory synopsis entry are updated with data from the row(s). The insert transaction is then committed. Synopsis entry on-disk updates are thus avoided, significantly reducing the cost of updating the synopsis entries from the insert transaction. This yields enhanced performance especially for inserts of a small number of rows, while the benefits of synopsis entries are still available.

Abstract: The present disclosure relates to a method for processing data blocks of a data table. The data blocks comprise an attribute representing multidimensional spatial data objects, where the attribute has multiple values representing respective dimensions of the multidimensional spatial data object. The method comprises creating for each data block of the data blocks, a respective attribute metadata. The attribute metadata comprises attribute value information defining a multidimensional minimum bounding rectangle that covers attribute values of the attribute comprised in the data block. A query is processed on the multidimensional spatial data objects associated with a query area using the multidimensional minimum bounding rectangle to check whether a data block of the data blocks contains attribute values of the attribute in the query area.

Abstract: The method may include providing, in accordance with a column-oriented storage technique, the data table as columns corresponding to the plurality of attributes, whereby each column includes a plurality of separate data blocks. The method may also include determining the plurality of records of the provided data table for which a plurality of attribute values of at least one selected column is contained in a plurality of predetermined data blocks. The method may further include determining, for each column of at least a part of the plurality of columns within the determined plurality of records, a plurality of attribute value information descriptive of an associated attribute within the column and providing an indication of the one or more data blocks for which the plurality of attribute value information is determined. The method may also include storing the determined plurality of attribute value information for enabling query processing.

Abstract: Reorganizing a data table to improve analytical database performance is presented. Attribute value information for data blocks of the data table is determined. One or more queries having respective query predicates involving the attribute may be received and processed. Data blocks having attribute value information matching a query predicate are selected. The selected data blocks are evaluated for the query predicate of the query. For each part of a set of the parts a false positive rate may be determined. The false positive rate may indicate the fraction of data blocks of the selected data blocks of the part, that each contains less than a determined maximum number of rows that satisfy the query predicate. In response to determining for each part of the set of the parts that the determined false positive rates of the part meet a predefined condition sorting the part by the attribute.

Abstract: In an approach to storing data elements in a database, a database management unit provides a table-mapping file for enabling access to a table of a plurality of tables in a storage medium, the table-mapping file comprising a plurality of map records of a single table, a map record comprising information indicative of the table, a column of the table, a data section of the table, and a range of values of data elements included in the data section of the column. The unit receives a data element at the database via a communication interface, determines the table, column, and data section the data element is to be stored in, and stores the data element in the section file corresponding to the determined table, column and data section. The unit then updates the table-mapping file corresponding to the table, columns and data section the data element has been stored in.

Abstract: In updating a synopsis table of a database system, a database management unit performs a transaction to insert row(s) in a section of the base table and determines whether a synopsis entry for the section is stored in the memory. If stored in the memory, the in-memory synopsis entry is retrieved and metadata values in the in-memory synopsis entry are updated with data from the row(s) to be inserted. If not stored in the memory, the in-memory synopsis entry is generated and the metadata values in the in-memory synopsis entry are updated with data from the row(s). The insert transaction is then committed. Synopsis entry on-disk updates are thus avoided, significantly reducing the cost of updating the synopsis entries from the insert transaction. This yields enhanced performance especially for inserts of a small number of rows, while the benefits of synopsis entries are still available.

Abstract: In an approach to storing data elements in a database, a database management unit provides a table-mapping file for enabling access to a table of a plurality of tables in a storage medium, the table-mapping file comprising a plurality of map records of a single table, a map record comprising information indicative of the table, a column of the table, a data section of the table, and a range of values of data elements included in the data section of the column. The unit receives a data element at the database via a communication interface, determines the table, column, and data section the data element is to be stored in, and stores the data element in the section file corresponding to the determined table, column and data section. The unit then updates the table-mapping file corresponding to the table, columns and data section the data element has been stored in.

Abstract: Embodiments relate to managing resource consumption in a computing system. An aspect includes providing a resource policy by defining a plurality of threshold values relating to the resource consumption, wherein the resources are consumed by a plurality of user-defined functions performing tasks for a database management system, wherein the user-defined functions are executed by a plurality of processes external to the database management system. Another aspect includes performing an action, as defined by the resource policy, on at least one of the user-defined functions.

Abstract: Reorganizing a data table to improve analytical database performance is presented. Attribute value information for data blocks of the data table is determined. One or more queries having respective query predicates involving the attribute may be received and processed. Data blocks having attribute value information matching a query predicate are selected. The selected data blocks are evaluated for the query predicate of the query. For each part of a set of the parts a false positive rate may be determined. The false positive rate may indicate the fraction of data blocks of the selected data blocks of the part, that each contains less than a determined maximum number of rows that satisfy the query predicate. In response to determining for each part of the set of the parts that the determined false positive rates of the part meet a predefined condition sorting the part by the attribute.

Abstract: In a shared data system comprising one or more primary nodes and a plurality of secondary nodes, global lock manager on a primary node manages locks for shared resources by exchanging an abstract lock state with local lock managers on the secondary nodes. The abstract lock state includes a particular representation of all of the applications on the nodes that are requesting or are granted locks. The exchange of these particular lock states instead of individual requests improves performance by increasing concurrency and reducing off-machine communication. A global deadlock detector on a node detects and resolves global deadlocks, in conjunction with local deadlock detectors on the secondary nodes.