Abstract: Example methods and systems are directed to existence checks on rows within a database. A page data structure stores bitmap data for the rows in the page. A row within the page corresponds to a single bit in the bitmap data. To determine if a row has been deleted, the page data structure for the page containing the row is located and the bit for the row in the page data structure is checked. An array of page data structures is created, indexed by a hash of the page identifier. In the event of a hash collision, a linked list of page data structures is used, sorted by page identifier.

Abstract: According to some embodiments, a system, method and non-transitory, computer readable medium are provided comprising a memory storing processor-executable program code; and a processing unit to cause the system to: receive a range of persistent volume disk size values from a cloud service provider; receive a value for an upper bound of a number of persistent volume disks attachable to a virtual machine per the cloud service; determine a number of persistent volume disks based on the upper bound, wherein the number is at least two; generate a plurality of configurations of the determined number of persistent volume disks, wherein a configuration is provided for each persistent volume disk size value, and each configuration divides the persistent volume disk size value between two or more persistent volume disks; and aggregate the generated plurality of configurations in a decision table. Numerous other aspects are provided.

Abstract: Various embodiments for providing a data transfer and management system are described herein. An embodiment operates by determining that data of a column is stored in a column loadable format in which all of the data of the column is moved from the disk storage location to a memory responsive to a data request. A data vector that identifies a plurality of value IDs corresponding to at least a subset of the plurality of rows of the column, is identified. A page format that provides that a portion of the data of the column across a subset of the plurality of rows is moved from the second disk storage location into the memory responsive to the data request is determined. The entries of the data vector are requested, converted from column loadable format into the page persistent format, and stored across one or more memory pages.

Abstract: Various embodiments for providing a data transfer and management system are described herein. An embodiment operates by determining that data of a column is stored in a column loadable format in which all of the data of the column is moved from the disk storage location to a memory responsive to a data request. A data vector that identifies a plurality of value IDs corresponding to at least a subset of the plurality of rows of the column, is identified. A page format that provides that a portion of the data of the column across a subset of the plurality of rows is moved from the second disk storage location into the memory responsive to the data request is determined. The entries of the data vector are requested, converted from column loadable format into the page persistent format, and stored across one or more memory pages.

Abstract: Various embodiments for providing a data transfer and management system are described herein. An embodiment operates by determining that data of a column is stored in a column loadable format in which all of the data of the column is moved from the disk storage location to a memory responsive to a data request. A data vector that identifies a plurality of value IDs corresponding to at least a subset of the plurality of rows of the column, is identified. A page format that provides that a portion of the data of the column across a subset of the plurality of rows is moved from the second disk storage location into the memory responsive to the data request is determined. The entries of the data vector are requested, converted from column loadable format into the page persistent format, and stored across one or more memory pages.

Abstract: Example methods and systems are directed to existence checks on rows within a database. A page data structure stores bitmap data for the rows in the page. A row within the page corresponds to a single bit in the bitmap data. To determine if a row has been deleted, the page data structure for the page containing the row is located and the bit for the row in the page data structure is checked. An array of page data structures is created, indexed by a hash of the page identifier. In the event of a hash collision, a linked list of page data structures is used, sorted by page identifier.

Abstract: Example methods and systems are directed to existence checks on rows within a database. A page data structure stores bitmap data for the rows in the page. A row within the page corresponds to a single bit in the bitmap data. To determine if a row has been deleted, the page data structure for the page containing the row is located and the bit for the row in the page data structure is checked. An array of page data structures is created, indexed by a hash of the page identifier. In the event of a hash collision, a linked list of page data structures is used, sorted by page identifier.

Abstract: Various examples are directed to systems and methods for managing resources in a multi-core computing system. A first thread executing at a first core of a multi-core processor unit may allocate a first element of a resource. The first thread may increment a first thread counter for a first metric describing the resource. The first thread may determine that the first thread counter is greater than a first thread counter threshold and update a first metric global value based at least in part on the first thread counter. The first thread may also reset the first thread counter.

Abstract: Systems and methods may include execution of a database workload on a plurality of database tables, collection of execution statistics associated with execution of the database workload, determination of an in-memory row storage cache size for multi-version concurrency control based on the collected execution statistics, and configuration of a database system to allocate the in-memory row storage cache size for multi-version concurrency control.

Abstract: Various embodiments for providing a data transfer and management system are described herein. An embodiment operates by determining that data of a column is stored in a column loadable format in which all of the data of the column is moved from the disk storage location to a memory responsive to a data request. A data vector that identifies a plurality of value IDs corresponding to at least a subset of the plurality of rows of the column, is identified. A page format that provides that a portion of the data of the column across a subset of the plurality of rows is moved from the second disk storage location into the memory responsive to the data request is determined. The entries of the data vector are requested, converted from column loadable format into the page persistent format, and stored across one or more memory pages.

Abstract: Systems and methods may include execution of a database workload on a plurality of database tables, collection of execution statistics associated with execution of the database workload, determination of an in-memory row storage cache size for multi-version concurrency control based on the collected execution statistics, and configuration of a database system to allocate the in-memory row storage cache size for multi-version concurrency control.

Abstract: Example methods and systems are directed to existence checks on rows within a database. A page data structure stores bitmap data for the rows in the page. A row within the page corresponds to a single bit in the bitmap data. To determine if a row has been deleted, the page data structure for the page containing the row is located and the bit for the row in the page data structure is checked. An array of page data structures is created, indexed by a hash of the page identifier. In the event of a hash collision, a linked list of page data structures is used, sorted by page identifier.

Abstract: Various examples are directed to systems and methods for managing resources in a multi-core computing system. A first thread executing at a first core of a multi-core processor unit may allocate a first element of a resource. The first thread may increment a first thread counter for a first metric describing the resource. The first thread may determine that the first thread counter is greater than a first thread counter threshold and update a first metric global value based at least in part on the first thread counter. The first thread may also reset the first thread counter.

Abstract: Disclosed herein are system, method, and computer program product embodiments for visualizing code execution of a multi-threaded server. An embodiment operates by receiving a log of contents of a plurality of thread stacks over a time period of code execution and receiving a rule for populating a graphical interface with thread stack contents. It also includes populating the graphical interface with a representation of the thread stack contents over time.