Abstract: A locking mechanism in a delta-store-based database to support long running transactions across multiple RID spaces is described. An example method includes establishing a column-based in-memory database including a main store and a delta store. A delete or an update statement is executed with a transaction on a table having plurality of table versions. The table versions are represented by bitmaps in the delta store and the bitmaps and table fragments corresponding to the table versions implement RID spaces for the table. A lock on a row of the table manipulated by the delete or the update statement is requested to preclude other transaction from deleting or updating an obsolete version of data. Upon a successful validation that the row to be locked is not the obsolete version in the RID spaces of the table, a lock is granted to the transaction.

Abstract: Disclosed herein are system, method, and computer program product embodiments for implementing a bitmap for a column store database. An embodiment operates by creating, by at least one processor, a bitmap identifying rows in a column store database. The bitmap may include a list of bit chunks, a bit chunk including an offset being a natural number indicating a chunk size, and a bit specification including one of an ordered row id list, a contiguous row id sequence, and a bit vector. In addition, the embodiment includes performing database operations using the bitmap.

Abstract: Disclosed herein are system, method, and computer program product embodiments for populating a hash index and returning a handle to the hash index. An embodiment operates by determining, by at least one processor, during query optimization that a first database query has a query execution plan comprising a sub-query which executes N times a correlated predicate having an operator being one of equal and not equal to a base column. A cost of creating and probing the hash index N times and a cost of fully scanning the base column N times are compared based on the correlated predicate. Based on the comparing, it is determined whether to create on-demand a hash index.

Abstract: Disclosed herein are system, method, and computer program product embodiments for storing and accessing data in a shared disk database system using a timestamp range to improve cache efficiency. An embodiment operates by retrieving, by a node, from a shared storage. a blockmap identity and a root page associated with a data request, based on a determination that the blockmap identity associated with a data request is present in a cache. The embodiment continues, retrieving, by the node, the logical page by copying a stored logical page from the shared storage and setting a lower timestamp value of the logical page to a timestamp associated with the stored logical page and an upper timestamp value of the logical page to a timestamp associated with the data request, based on a determination that the logical page is not present in the cache.

Abstract: Object inheritance is a programming feature that allows developers to designate a programming object as a “descendent” of one or more “ancestors.” Disclosed herein are system, method, and computer program product embodiments for supporting inheritance in a programming language. In an embodiment, a first programming object is received from a first document, inheritance information about the first programming object is received and analyzed, a second programming object based on the first programming object and the inheritance information is created, the second programming object is sent to an editor for editing, a third programming object is received from the editor, a fourth programming object based on the first or second programming object, the third programming object, and the inheritance information is created, and the fourth programming object is stored in a second document.

Abstract: A query inserter receives data elements having individual priority types for placement in a queue, and utilizes the priority types of the received data elements to determine placement in the queue relative to an initial location established when a first data element is placed in an empty queue in order to manage the queue with a combination of first-in first-out and last-in first-out queue functionality.

Abstract: Freeing memory safely with low performance overhead in a concurrent environment is described. An example method includes creating a reference count for each sub block in a global memory block, and each global memory block includes a plurality of sub blocks aged based on respective allocation time. A reference count for a first sub block is incremented when a thread operates a collection of data items and accesses the first sub block for a first time. Reference counts for the first sub block and a second sub block are lazily updated. Subsequently, the sub blocks are scanned through in the order of their age until a sub block with a non-zero reference count is encountered. Accordingly, one or more sub blocks whose corresponding reference counts are equal to zero are freed safely and with low performance overhead.

Abstract: A method, system and computer readable storage medium for replicating database data of heterogeneous data type are disclosed. The method includes determining the data type of an element of heterogeneous data type to be replicated. The element is packed into a predetermined transfer format as an opaque data type, based on the determined data type, and replicated to a replication server. The replication server is instructed to not modify the element noted as opaque.

Abstract: System and methodology for automatic tuning of database query optimizer is described.

Abstract: A flexible, extensile, and dynamically configurable back-end Application Server environment that efficiently supports the ever-increasing range of activities for which mobile subscribers employ their wireless devices. The environment may operate within any number of entities within a messaging ecosystem including for example a service provider.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for protection of encryption keys in a database are described herein. An embodiment includes a master key and a dual master key, both of which are used to encrypt encryption keys in a database. To access encrypted data, the master key and dual master key must be supplied to a database server by two separate entities, thus requiring dual control of the master and dual master keys. Furthermore, passwords for the master and dual master keys must be supplied separately and independently, thus requiring split knowledge to access the master and dual master keys. In another embodiment, a master key and a key encryption key derived from a user password is used for dual control. An embodiment also includes supplying the secrets for the master key and dual master key through server-private files.

Abstract: A distributed database system providing data and space management methodology. In one embodiment a system for allocating resources amongst a plurality of database servers sharing resources comprises: an input module for receiving user input for allocating resources shared amongst a plurality of database servers and establishing thresholds for utilization of resources at each database server; a monitoring module at each database server for monitoring local resource utilization at each database server and sending a request for balancing resources to a second database server when local resource utilization reaches an established threshold at a first database server; and a load balancing module for receiving the request for balancing resources and determining whether to adjust resources allocated to the first database server and the second database server in response to the request.

Abstract: A system and methodology providing workload management in a database cluster. In one embodiment, for example, a method for allocating workload amongst a plurality of database servers sharing access to data comprises steps of: periodically collecting information about workload at each database server; distributing the workload information to each of the plurality of database servers; in response to a client connected to a first database server requesting that work be performed, examining the workload information to determine whether the requested work should be performed at a second database server having a lower workload than the first database server; if it is determined that the work should be performed at the second database server, automatically transferring the client connection to the second database server and performing the requested work at the second database server; and otherwise, performing the requested work at the first database server.

Abstract: A system, method, and computer program product for character data compression for reducing data storage requirements in a database system are described. Embodiments include identifying data of a particular character type in a full data page, and identifying usage frequency of each character of the particular character type. Each character is encoded based on the identified usage frequency and stored, with storage requirements for most frequently used characters are reduced.

Abstract: Methods, systems, and computer program products for cache conflict detection are provided. A computer-implemented method may include providing a partial graph of data to an application executing on a mobile device where the partial graph is derived from a document comprising a graph of data having a plurality of nodes, receiving a modified partial graph from the application where the modified partial graph includes one or more changes to the partial graph, and determining a document version used to derive the partial graph is no longer a most recent version of the document.

Abstract: A system, method, and computer program product are provided for performing a join operation between a local table at a local server and a remote table at a remote server. In accordance with an embodiment of the present invention, a query instruction to join the local table and the remote table is received at the remote server. Qualifying rows of the local table are then retrieved to the remote server, and the remote table is joined with the qualifying rows to generate a result table, which is then sent to the local server.

Abstract: An operator tree is formed for a data processing plan, the operator tree containing a plurality of interconnected nodes and including a grouping of two or more duplicative portions, each of the two or more duplicative portions having identical nodes and structure such that when the operator tree is executed, operators executed in a first duplicative portion using a first thread perform same functions use different data than operators in a second duplicative portion using a second thread. One or more operators in the first portion and one or more operators in the second portion to be synchronized with each other are identified. A synchronization point is created for the identified operators in the first thread and one or more subsequent threads, wherein the synchronization point receives information from each of the identified operators to build an artifact to deliver to one or more operators that depend on the artifact.

Abstract: As individuals increasingly employ their wireless devices to engage in different types of activities they face a growing threat from, possibly among other things, identity theft, financial fraud, information misuse, etc. and the serious consequences or repercussions of same. Leveraging the ubiquitous nature of wireless devices and the popularity of (Short Message Service, Multimedia Message Service, etc.) messaging, an infrastructure that enhances the security of the different types of activities within which a wireless device user may participate through dynamically configurable levels of authentication. The infrastructure may optionally leverage the capabilities of a centrally-located Messaging Inter-Carrier Vendor.

Abstract: Embodiments relate to a computer-implemented method for visualizing expressions for dynamic analytics. A graphical user interface control is generated for each of one or more variables of an expression. Each of the one or more variables is bound to the corresponding graphical interface control generated previously. Then, the generated graphical user interface control for each of the one or more variables of the expression is graphically output using a display device. A user may input an adjusted value of each of the one or more variables of the expression using the corresponding graphical user interface control.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for data exchange and exception handling in a data processing environment are described. Aspects include providing a generic data structure to store a value object and a collection of value Objects based upon built-in programming capabilities of a client system and a server system that achieve a rich Internet application experience within a data processing network, and utilizing the generic data structure to exchange data between the client system and the server system of the data processing network. A specialized result form of the generic data structure is also provided and utilized to manage generated exceptions of the data exchanges.