Abstract: A system, method and computer-readable mediums for replicating data, are provided. A replication logic description describing how data is replicated in a replication path and a resource description describing a replication environment are specified. The replication logic description is bound to at least one resource in the resource description. Once bound, an object representing a bound replication logic description and the resource description is generated and deployed in the replication environment. Once deployed the object replicates data in the replication path while ensuring transaction consistency and delivery during replication of the data.

Abstract: Systems and methods are presented for auto-starting and auto-stopping databases in a cloud server environment. In some embodiments, a method includes accessing, by an initial server in a network-based system, a request to connect to a target database located in a target server of the network-based system. The method can include determining, by an administrative database residing in the initial server, a location of the target database residing in the target server, switching an execution context from no database in the target server to a copy of the administrative database in the target server, performing an auto-start procedure to auto-start the target database in the target server, switching the execution context from the administrative database in the target server to the target database in the target server, and transmitting a completion acknowledgement indicating the target server is connected to the target database.

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 system, method, and computer program product embodiments for stream optimized data processing. An embodiment operates by receive a stream of data in a streaming data format. A query associated both with the stream of data and one or more records of a database is determined. It is determined whether the one or more records of the database are stored in a local cache. Those records not stored in the local cache are retrieved from the database and converted into the streaming data format. A query response, including references to each of the one or more records stored in the local cache in the streaming data format, is provided for execution of the query.

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, computer-implemented method, and computer-program product embodiments for determining a cardinality estimate for a query. A cardinality estimator identifies a predicate in a query, where the predicate is split into a plurality of equivalence classes. The cardinality estimator then generates a plurality of equivalence graphs from the plurality of equivalence classes, one equivalence graph for an equivalence class. Spanning trees are identified from the plurality of equivalence graphs, and the cardinality estimator then determines the cardinality estimate for the query from the spanning trees.

Abstract: In an example embodiment, performance is optimized in a complex event stream (CEP) system. Information about a plurality of CEP threads is obtained. Then nearness among the plurality of CEP threads is determined, wherein nearness between a first and a second CEP thread indicates how much interaction is expected to occur between the first and second CEP thread. Based on the determined nearness, the plurality of CEP threads are organized into a plurality of CEP thread groups. Then, each of the plurality of CEP thread groups are assigned to a different processing node, with each processing node having one or more processors and a memory.

Abstract: Techniques of implementing partition level operations with concurrent activities are disclosed. A first operation can be performed on a first partition of a table of data. The first partition can be one of a plurality of partitions of the table, where each partition has a plurality of rows. A first partition level lock can be applied to the first partition for a period in which the first operation is being performed on the first partition, thereby preventing any operation other than the first operation from being performed on the first partition during the period the first partition level lock is being applied to the first partition. A second operation can be performed on a second partition of the table at a point in time during which the first operation is being performed on the first partition.

Abstract: Methods, systems, and computer program products for decompressing data are described. An ordinal column number of columnar data to be accessed is obtained, the ordinal column number identifying a location of the columnar data in a corresponding uncompressed row, the columnar data being stored in a first data structure. A breakpoint value in a breakpoint field of the at least partially compressed row is determined, the breakpoint value indicating a location of an end of a common prefix in the corresponding uncompressed row, the common prefix being stored in a second data structure. The ordinal column number of the columnar data to be accessed and a column number indicated by the breakpoint value are compared, the comparison identifying one or more locations of the columnar data to be accessed.

Abstract: Systems and methods are presented for completing transactions in a synchronous replication environment. In some embodiments, a computer-implemented method can include generating in a database server, an identifier to identify a database transaction. The method can also include transmitting the identifier to a replication server; receiving acknowledgement that the identifier is acknowledged by the replication server; storing the transaction in the database server; and executing the transaction after receiving acknowledgement from the replication server and after determining the transaction is stored in the database server; wherein transmitting the identifier to the replication server occurs in parallel with storing the transaction in the database server.

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 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: Various embodiments of systems and methods for replicating data included in a portable electronic device to a new portable electronic device are described herein. Initially a copy of data, including an application, stored in the portable electronic device is generated. Next a determination is made whether the application is included in an application distribution platform corresponding to an operating system of the new portable electronic device. Finally based on the determination, the application is downloaded from the application distribution platform to the new portable electronic device.

Abstract: A system and method for processing a database query is described. The method can, in response to detection that a database query involves a star or snowflake join operation, determine a selectivity ratio for each of a plurality of dimension tables. The selectivity ratio having a lower value can correspond to a more restrictive dimension table. Thereafter, a table ordering can be created beginning with a fact table and continuing with each of the dimension tables in ascending order of their corresponding selectivity ratios. Then a query plan involving join operations between successive tables in the table ordering can be created.

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 system and method for processing a database query is described. In response to detection that a database query involves a star or snowflake join operation, a join operator in a preliminary query plan can be split into a build operator and a probe operator. The probe operator can be placed in a final query plan in the same place as the join operator in the preliminary query plan, while the build operator can be placed beneath the probe operator in the final query plan, between an exchange operator and the exchange operator's child from the preliminary query plan.

Abstract: Disclosed in some examples is a method of database replication, the method including at a Relational Database Management System (RDMS), determining a first replication mode; identifying a triggering event; determining that the triggering event indicates a change in the first replication mode; responsive to determining that the triggering event indicates a change in the first replication mode, determining a second replication mode, the second replication mode being a different replication mode than the first replication mode; identifying a database change made by one or more database tasks; and replicating the database change to an external replication component according to the second replication mode.

Abstract: As individuals increasingly engage in different types of transactions 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 transactions within which a wireless device user may participate through a Second Factor Authentication facility. The infrastructure may optionally leverage the capabilities of a centrally-located Messaging Inter-Carrier Vendor.

Abstract: Various embodiments of systems and methods to generate native access plan source code are described herein. In one aspect, a database query is received. A query execution plan, including a parent operator and one or more descendent operators, corresponding to the database query is retrieved. Further, a check is made to determine whether the parent operator and the one or more descendent operators include at least one loop. When both the parent operator and the one or more descendent operators include at least one loop, consume points for the at least one loop are defined. The parent operator and the one or more descendent operators are merged based on consume point types to generate native access plan source code.

Abstract: In an example embodiment, a method of operating a task scheduler for one or more processors is provided. A topology of one or more processors is obtained, the topology indicating a plurality of execution units and physical resources associated with each of the plurality of execution units. A task to be performed by the one or more processors is received. Then a plurality of available execution units from the plurality of execution units is identified. An optimal execution unit is then determined, from the plurality of execution units, to which to assign the task, based on the topology. The task is then assigned to the optimal execution unit, after which the task is sent to the optimal execution unit for execution.