Abstract: A system for managing database logging, the comprises a processor; and a user task executing in a database server process and executable by the processor, the user task to: receive in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system; obtain a lock on the portion of the database; create a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database; enqueue the first log record to a queue; and release the lock on the portion of the database after copying the first log record to the queue.

Abstract: Increasing the efficiency of performing queries on databases by eliminating partitions during a database query. The database query configured to access a database table having one or more columns and one or more rows, the database query including a condition on a specified basis column. The database table being partitioned on the basis of the specified column, the specified column having one or more distinct values and the partitioning including mapping, by the at least one programmable processor, individual ones of the one or more distinct values to individual partitions causing each row in the table to be mapped to a specific partition. Candidate partitions and guaranteed partitions can be identified. The database query can be applied only to candidate partitions. All rows which satisfy the database query and all the rows of the guaranteed partition can be forward for processing.

Abstract: A method may include accepting a database query including an operator requesting two or more incoming tuple streams be combined into a result tuple stream. At least one data value in the incoming tuple streams may be represented by an enumeration value. The method may include generating a query execution plan for the database query. The query execution plan may include encoding the enumeration value and a corresponding source identifier into a composite union enumeration. The source identifier may identify which of the two or more tuple streams corresponds to the enumeration value. The method may further include executing the database query according to the query execution plan to obtain the data value and providing the data value in response to the database query.

Abstract: Disclosed herein are system, method, and computer program product embodiments for generating a native access plan from a query execution plan for dynamic entity calling. An embodiment operates by receiving the query execution plan comprising at least one call to an entity, the entity being implemented by a plurality of classes, and generating source code of a native access plan that implements the query execution plan. The source code of the native access plan includes instructions to translate a run-time call to the entity to a call to a corresponding implementation of the entity based on an identifier of the called implementation of the entity.

Abstract: A database query may include an operator requesting two or more incoming tuple streams be combined into a result tuple stream. Generating a query execution plan may include constructing an equivalence union enumeration lookup table for a result domain of an element within the result tuple stream by taking a set union of incoming tuple domains, wherein each distinct value within that result domain is assigned an enumeration value. Generating the query execution plan may include constructing a secondary enumeration for each incoming tuple stream, wherein each secondary enumeration maps enumerated values within the incoming tuple stream into secondary ordinal values that correspond to equivalence union enumeration values.

Abstract: Disclosed herein are methods for retrieving data from a database. An embodiment operates searching for a key in a first index. The method determines that the searching will require a storage access request and issues the storage access request. The method continues searching for the key in a second index.

Abstract: A message identifier collector may collect message identifiers identifying sent messages having been sent by originating devices and identifying received messages of the sent messages that have been received at corresponding recipient devices. A message identifier matcher may match a sent message identifier for a sent message of the sent messages with a received message identifier for a corresponding received message of the received messages at a corresponding recipient device, and a delivery notification generator may send a delivery notification to an originating device of the originating devices that originally sent the sent message, thereby indicating receipt of the message at the corresponding recipient device. A delivery notification network path along which the message identifiers and the delivery notification are sent is different from a message delivery network path along which the message is sent.

Abstract: A plurality of reserve and commit log operations are initiated in a database system. Thereafter, at least a portion of the database operations are logged in a log such that transient data structures are kept in-memory of the database system and persistent data structures are kept in byte-addressable memory. Next, each of one or more clients concurrently accessing the log are registered to enable such clients to access the log.

Abstract: Creation of an index for a table of sorted data for use by a data storage application is initiated. Thereafter, N+1 logical partition of rows of the table are defined so that each logical partition has a corresponding worker process. Each worker process then builds a sub-index based on the corresponding logical partition which are later merged to form the index. Related apparatus, systems, techniques and articles are also described.

Abstract: Disclosed herein are technologies that give a disproportionate amount of screen real estate (or container real estate) to one of a group of user interface (UI) subcontainers to which a user is giving his or her attention. More particularly, in response to an indication that the user is focused and/or interested on a particular subcontainer, the device enlarges that subcontainer to occupy more (and perhaps all) of the available screen (or container) real estate. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: A system includes a database that stores data on one or more memory devices and a business object layer that receives a request for data associated with a user stored on the database. The system includes a first cache that reads and stores the requested data from the database in response to the request from the business object layer, where the first cache is partitioned into different segments and the different segments are stored across multiple different computing devices. The system includes a second cache that reads and stores the requested data from the first cache. The business object layer filters and applies business logic to the data before the second cache reads the requested data from the first cache. The second cache is stored on a single computing device that received the request. The business object layer delivers the requested data from the second cache.

Abstract: A delta store giving row-level versioning semantics to a non-row-level versioning underlying store is described. An example method includes establishing a column-based in-memory database including a main store and a delta store, where the main store allows only non-concurrent transactions on a same table and the delta store has a plurality of row-visibility bitmaps implementing a row-level versioning mechanism that allows concurrent transactions on the same table. A local RID space is established for a table fragment, that for each table in the database, the data of the table is stored in one or more main table fragment in the main store and in one or more delta table fragments in the delta store. Each table fragment has a local RID space, and the local RID space is a collection of one-based contiguous integer local RIDs (Row IDs) describing local positions of the rows of the table fragment.

Abstract: A system includes a gateway that is configured to receive a message from a source for transmission to a destination and multiple communication channels on which to transmit the message to the destination, where the communication channels include different types of communication channels. The system includes a decision engine that is operably coupled to the gateway and the communication channels. The decision engine is configured to select a first communication channel from the communication channels to route the message for transmission to the destination. The decision engine is configured to select a second communication channel from the communication channels to route the message for transmission to the destination in response to a period of time expiring without receiving an acknowledgement from the destination via the first communication channel, where the second communication channel is a different type of communication channel than the first communication channel.

Abstract: A method, a system and a computer program product for maintaining a pre-computed result set are disclosed. A server coupled to a data source determines whether an object stored in the data source received an update. The server identifies at least one identifier associated with a pre-computed result set based on that determination. The pre-computed result set is computed based on the object. The server computes an updated pre-computed result set using the identifier by applying the received update to the pre-computed result set.

Abstract: Systems, methods, computer program product embodiments are provided for locking retained resources of database information in a distributed shared disk cluster environment. An embodiment includes providing a request on demand for physical access to a page by a task of a node among a cluster of nodes, managing selective bypassing of waiting access requests to the page at intranode and internode levels in response to the request on demand, and handling requests for page ownership to prioritize a request on demand. Further included are determining whether another node holds a lock on the page and identifying an access type for the waiting access requests in order to coordinate transfer of the lock to the node.

Abstract: Synchronization of metadata structures in a multi-threaded system includes receiving, by a first thread of a processing device, a request for a metadata structure located in a first cache associated with an object, obtaining, by the first thread of the processing device, a synchronization mechanism associated with the first cache, holding, by the first thread of the processing device, the metadata structure associated with the object, receiving, by a second thread of the processing device, a request for the metadata structure in a second cache associated with the object, obtaining, by the second thread of the processing device, a synchronization mechanism associated with the second cache and informing the second thread of the processing device that the metadata structure associated with the object is not available.

Abstract: Multi-pass parallel merging in a database includes identifying characteristics of non-final pages during database query operations. A phase of page consolidation is triggered based on the identified characteristics and a final page is stored.

Abstract: Methods and systems configured to facilitate smart pre-fetching for sequentially accessing tree structures such as balanced trees (b-trees) are described herein. According to various described embodiments, a pre-fetch condition can be determined to have been met for a first cache associated with a first level of a tree such as a b-tree. A link to a bock of data to be read into the cache can be read into the cache by accessing a second level of the tree. The data elements associated with the retrieved link can subsequently read into the cache.

Abstract: High performance index creation using parallel query plans with repartitioning scan and vector-based repartitioning scan is described. An example method includes extracting index key columns from data rows of the database table to build a set of index rows, wherein the index on the database table is defined by a plurality of index key columns including a first index key column and a second index key column. Partition boundary values are generated to divide up the index rows into range-partitioned sets, and the index rows are sorted based on values of the index key columns. A repartitioning scan, including a SARG-based or a vector-based partitioning scan is performed on the index rows, using a plurality of worker threads executing in parallel to build sub-indexes. Subsequently, each range-partitioned set of index rows are assigned to a worker thread in the plurality of worker threads. Accordingly, the sub-indexes generated from the plurality of work threads are merged to build the index for the database table.

Abstract: A system, method, and computer program product are provided for abstracting data in a remote data source. A method operates by defining the data source, defining a data synchronization methodology for communication with the data source, and providing an abstraction layer for accessing data in the data source. The abstraction layer implements the data synchronization methodology when data is accessed through the abstraction layer is presented.