Abstract: A business intelligence (BI) server is described that supports data and schemas stored in multiple languages. The BI server implements a lookup table and lookup function that allows users to work with queries in different languages. When the user logs in, a session object is created for the user, which maintains the state information. A session variable specifies the language currently being used by the user. The BI server can inspect this session variable to determine the language of the user and perform the lookup translations as necessary. For example, if the language used by the session is different from the language of the base table storing the necessary information, the BI server can perform a translation by invoking a lookup function. The execution of the lookup can include performing a join operation of the base table with the lookup table to yield a translated value requested by the query.

Abstract: Processing is provided for operating an in-memory database, wherein transaction data is stored by a persistence buffer in an FIFO queue, and update processor subsequently: waits for a trigger; extracts the last transactional data associated with a single transaction of the in-memory database from the FIFO memory queue; determines if the transaction data includes updates to data fields in the in-memory database which were already processed; and if not, then stores the extracted transaction data to a store queue, remembering the fields updated in the in-memory database, or otherwise updates the store queue with the extracted transaction data. The process continues until the extracting is complete, and the content of the store queue is periodically written into a persistent storage device.

Abstract: Described herein are techniques for reading data from a distributed storage system and for writing data to a distributed storage system. The disclosed techniques make use of efficient computing task and thread usage to minimize or reduce overhead and improve read or write efficiency. For example, read or write tasks may handle multiple read or write operations instead of just a single operation, which may reduce overhead associated with task creation and termination. Additionally, operations within a single task may be processed in parallel. For example, the disclosed techniques provide MapReduce implementations useful in Apache Hadoop that perform better than previous MapReduce implementations.

Abstract: Described herein are techniques for reading data from a distributed storage system and for writing data to a distributed storage system. The disclosed techniques make use of efficient computing task and thread usage to minimize or reduce overhead and improve read or write efficiency. For example, read or write tasks may handle multiple read or write operations instead of just a single operation, which may reduce overhead associated with task creation and termination. Additionally, operations within a single task may be processed in parallel. For example, the disclosed techniques provide MapReduce implementations useful in Apache Hadoop that perform better than previous MapReduce implementations.

Abstract: A process may utilize multiple garbage collector threads, each having the capability to steal partially-marked object references from an accessible mark stack having additional work that has yet to be processed. A partially-marked object reference may be represented as a pair of entries on a mark stack. A garbage collector thread may utilize an atomic operation to access the pair of entries in a prescribed manner to steal an unprocessed partially-marked object reference. In this manner, the workload of an overloaded garbage collector thread is offloaded to another garbage collector thread that may be idle thereby balancing the workload more evenly among multiple garbage collector threads.

Abstract: Techniques are described for scaling an in-memory data grid to satisfy the needs of client applications requesting data from the in-memory data grid. The in-memory data grid may monitor a variety of factors, such as data traffic or number of received queries from a particular geographical region, to determine whether to create a proximity grid. A proximity grid is an extension of the in-memory data grid that services queries originating from a defined geographic region. Each proximity grid stores data objects relevant to the proximity grid's assigned geographic region. Queries originating from the client applications within the geographic regions are then routed to the corresponding proximity grid for execution. The proximity grid may be terminated when the need of the client applications within the geographic region has subsided.

Abstract: Persistent data, such as disks associated with virtual machines, are migrated between and across data stores using mirrored input-output operations (IOs). The migration technique employs a data mover to copy selected regions of the virtual machine disk to a target data store while the virtual machine is executing. If the virtual machine issues a write IO, the write IO is selectively mirrored on the target data store depending on whether or not the write IO is in a region of the virtual machine disk that has already been copied.

Abstract: Methods and systems for deriving a scoring function, for use in ordering a set of search results, are described. Consistent with some embodiments, a simulation platform includes an offline simulator module that receives search result sets for search queries that result in the conclusion of a transaction. The result set is then processed by the offline simulation platform to derive a set of weighting factors for use with one or more parameters in a parametric scoring function. The weighting factors are determined, for example, by specifying an equation setting one or more constraints and then solving the equation for the weighting factors.

Abstract: At least one user table in a relational database management system (RDBMS) using a first operator within a structured query language (SQL) command is identified. The first operator within the SQL command is utilized to transfer one or more data items from the at least one user table to a data array within the RDBMS. The data array is processed within the RDBMS, and one or more output values are generated based on the processing.

Abstract: A technique for applying hardware transaction memory to an arbitrarily large data structure is disclosed. A data updater traverses the data structure to locate an update point using a lockless synchronization technique that synchronizes the data updater with other updaters that may be concurrently updating the data structure. At the update point, the updater performs an update on the data structure using a hardware transactional memory transaction that operates at the update point.

Abstract: A method for automatically presenting digital content to a user of a computer computes task-related metadata from data which may include i) a most recent event record, ii) a most recent specification received from the user of a task being performed by the user, iii) an automatic prediction of the current task being executed by the user, iii) past event records and associated task identifiers stored in a database and/or iv) content in resources associated with a given task. The task-related metadata is communicated to a digital content service provider. Digital content relevant to the user based on the task-related metadata is then selected, sent to the computer, and presented to the user. Rules and filters control the metadata going out and the content coming in, allowing automatic adaptation based on the current task, characteristics of the content, and other factors.