Abstract: In an example embodiment, a method for performing event stream processing is provided. An event stream is received, the event stream comprising a real time indication of one or more events occurring. Then it is determined that the event stream is identified in a streaming publish service inside a database. The event stream may then be inserted directly into one or more database tables in the database based on the determining.

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: Disclosed herein are system, method, and computer program product embodiments for generating a histogram used to optimize a query plan. An embodiment operates by initializing a first thread and a second thread, such that the first thread processes a first section of a column and the second thread processes a second section of the column, concurrently with the first thread. The first thread generates a first hash table and the second thread generates a second hash table. The first and second hash tables represent data distribution stored in the respective first and second sections of the column. The first and second tables are merged into a histogram that represents data distribution in the column.

Abstract: A system, method, and computer program product are provided for efficiently fetching and displaying large datasets on mobile devices, such as devices running the iPhone™ operating system. The method fetches data for a mobile device from a server and displays a plurality of data rows in a ListView within a user interface on the mobile device. The method stores primary keys on the mobile device until their corresponding data rows are to be displayed. The method reacts to user inputs such as scrolling actions and touch screen gestures to efficiently fetch and display list view subsets of large datasets. The method facilitates quick response times when navigating through large lists of data on a mobile device by: fetching displayable or visible rows of data in a data list view, preloading the visible rows on the mobile device; and binding the visible rows to user interface elements on the mobile device.

Abstract: A system and method to generate an improved layout of a data grid in a database environment is provided. The data grid is a clustered in-memory database cache comprising one or more data fabrics, where each data fabric includes multiple in-memory database cache nodes. A data grid advisor capability can be used by application developers and database administrators to evaluate and design the data grid layout so as to optimize performance based on resource constraints and the needs of particular database applications.

Abstract: Disclosed herein are system, method, and computer program product embodiments for rollover strategies in an n-bit dictionary compressed column store. An embodiment operates by receiving a new value for addition to a compressed column store, determining that a current memory block of a most recently added token to the compressed column store is the insertion block. It is determined that the maximum token value has been reached for the current memory block. A new virtual memory block is created using the current insertion block, and a token corresponding to the new value is stored in the new virtual memory block. In another embodiment, when it is determined a maximum number of token values that may be stored in a compressed column store has been reached for a data dictionary, the compressed column store is converted into a composite store include a flat store where the new value is stored.

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: The current subject matter describes static partitioning and sub-partitioning of a row identifier space associated with a table in a delta memory store of a database so as to allow data to be concurrently inserted into rows identified by the corresponding sub-partitions. A server system associated with the database can receive data to be inserted into a database. The server system can select a sub-fragment of a row identifier space identifying identifiers of rows stored in the database for the table. The sub-fragment can be selected based on a preference specified by an insert operation used for insertion of the data into the columnar database and on availability of the sub-fragment. The server system can insert the data in rows identified by the selected sub-fragment while other data is being concurrently inserted in rows identified by other one or more sub-fragments of the row identifier space.

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.

Abstract: Disclosed herein are system, method, and computer program product embodiments for accelerating database queries containing bitmap-based conditions. An embodiment operates by determining a bitmap, where the bitmap represents a set of rows that have satisfied a conjunct that precedes a negated condition in a query expression and restricting the evaluation of the negated condition to the set of rows represented by the bitmap.

Abstract: Systems and methods are presented for reducing load database time in a database backup process. In some embodiments, a computer-implemented method may include marking a checkpoint in a log of the database; generating a backup of the database for data up to the checkpoint; recording first changes in the database while generating the backup of the database; adding to the backup of the database an additional backup of the recording of the first changes; recording second changes in the database while adding the additional backup; determining if a number of second changes satisfies a criterion; and if the number of second changes satisfies the criterion, then adding to the backup of the database a backup of the recorded second changes. Recording these changes can enable a database dump process to contain more recent page images, so that the amount of recovery at load time is reduced.

Abstract: Disclosed herein are system, method, and computer program product embodiments for multilevel synchronization of database table partition states. An embodiment operates by retrieving a partition from a partition lookup structure and determining whether the partition is in an active state. Based on a determination that the partition is in the active state an embodiment increments a counter associated with the partition using a compare-and-swap instruction accesses the partition.

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: Bloom filter cost estimation engine for improved performance and accuracy is described. An example method includes building an execution plan for a join operation having a plurality of levels, where the execution plan includes a top join operator at a top level, a leaf scan operator on a bottom level, and one or more intermediate operators between the top level and the bottom level. A row reduction effect of applying a Bloom filter is determined by simulating a semi-join operation over table statistic representation at each of the plurality of levels of the execution plan. A cost savings of the join operation is calculated based on the row reduction effect at the each of the plurality of the levels.

Abstract: In an optimizer within a Relational Database Management System improved ways in which a search space (the universe of possible join combinations) is generated and managed and improved ways in which the elements of a search space are evaluated so that among other things unpromising elements are efficiently dropped (pruned).

Abstract: A method for dynamically modifying a database schema in a streaming database management system receives a new database schema, compares the new schema to an existing schema, identifies the differences between the new schema and the existing schema, and applies the identified differences to the database in a single transaction, thereby producing a database organized according to the new database schema.

Abstract: A flexible, extensible, and dynamically configurable message service gateway that offers inter alia a façade through which a Content Provider (CP), among others, may invoke services to simply and easily complete among other things opt-in and opt-out activities in connection with a CP campaign or initiative. Among other things such a façade may hide various of the complexities, technical aspects, etc. of different communication paradigms including for example Short Message Service, Multimedia Message Service, Internet Protocol Multimedia Subsystem, Wireless Application Protocol, Electronic Mail, Instant Messaging, Unstructured Supplementary Service Data, etc. Such a façade may be offered by a centrally-located, full-featured Messaging Inter-Carrier Vendor.

Abstract: Various embodiments of systems and methods to provide memory management of a device accessing applications are described herein. In one aspect, a request is received to access an application on a device. Further, a check is performed to determine whether the application is enterprise application or personal use application. When the application is personal use application, access to the application is provided by installing the personal use application on the device. The personal use application utilizes at least a portion of an available general memory and a portion of an available corporate memory in the device.

Abstract: Disclosed herein are system, method, and computer program product embodiments for constructing an index for a database table. An index that comprises a data structure may be created. The index can then be populated with data from the database table. When a request to modify the database table is received, the method may determine that the request to modify the database table relates to a portion of the database table corresponding to a portion of the index that has yet to be populated. An entry indicating the requested modification can be inserted into the portion of the index that has yet to be populated.