Abstract: For a communication channel having a first endpoint in a customer on-premise network and a second endpoint on a primary host machine in a cloud service provider infrastructure, the primary host machine determines a change in a state information of the communication channel and identifies a backup host machine for the communication channel. The primary host machine causes the change in the state information to be replicated to the backup host machine, wherein the replicated state information stored by the backup host machine is usable by the backup host machine after a failover causes the backup host machine to become the second endpoint of the communication channel.

Abstract: Conventional internet routing is handled using routing protocols such as the Border Gateway Protocol (BGP). However, simple BGP does not account for latency, packet loss, or cost. To address this problem, smart routing systems that route traffic fast and in a cost-effective manner are implemented. In one approach, smart routing systems measure, compare, and analyze round-trip latencies and other metrics between a customer premises and one or more endpoints. Optimal inbound and outbound transit providers are selected for each endpoint based on these measurements. Other smart routing systems collect and analyze Real User Monitoring (RUM) data to predict latency performance of different content origins for serving data to a particular client based on the client's IP address and the content origins' IP addresses, which are ranked by performance.

Abstract: In an embodiment, estimated costs are used to pick the best refresh technique (e.g., method) for a given MV. In another embodiment, estimated costs are used to schedule the refresh of a set MVs in an order such that overall time to refresh is reduced, or in an order that uses the smallest overall time, for refreshing when compared to other alternative refresh schedules. In another embodiment, the estimated cost of refreshing each of a set of MVs is used to select the set of CPU resources to allocate to refreshing each MV. Based on the estimated costs, the allocation of CPU resources is chosen to be more optimal (e.g., use less CPU time) than other available sets of CPU resources. In an embodiment, when refreshing an MV, delayed index maintenance is chosen if a significant portion of the base table and/or the partitions of the table has changed.

Abstract: In one embodiment, a method for handling subtasks within a business task includes providing a plurality of user interfaces (UIs) pertaining to the business task having at least one subtask step. The subtask step has a subtask defined within the business task by an intermediate user to reuse a portion of another business task. The method further includes allowing an end user to navigate back and forth through the plurality of UIs.

Abstract: Techniques are provided for servicing requests that are issued in a protocol other than the protocol expected by the service. For example, many people want to use their mobile devices to interact with services, which require the ability to have multiple related messages in a session. However, their mobile devices do not have protocols that support interacting with such services. One technique provided herein is to interpose an intermediary between the mobile devices and the services to provide session capabilities on behalf of the mobile devices.

Abstract: In one embodiment, a method for providing a transient data facility for database applications includes creating a definition of transient data that corresponds to a unit of work to be performed by an application, and mapping the definition of transient data to a temporary storage table. The method further includes storing the transient data in the temporary storage table while the application performs the unit of work spanning one or more user sessions, and deleting the transient data after the application completes the unit of work.

Abstract: A method, involving placing code on a first device, wherein the code is associated with a code position, accessing properties associated with a second device, wherein the second device is detected by the first device, and transferring the code to the second device, if criteria based on a current position and properties of the second device, and the code position are met.

Abstract: By establishing a correspondence account in each Financial Service Provider (FSP) of a group of FSPs and a secure inter-FSP messaging mechanism, transfers of funds entirely within member FSPs (FSP 1, FSP 2, FSP 3, FSP 4) may be combined with secure messaging to effectively transfer funds between buyers in one FSP (FSP 2) and sellers in another FSP (FSP 1) without actual transfer of funds between FSP's.

Abstract: Activity Duration Locking (ADL) provides an efficient simple solution to manage a potentially large number of concurrently active lock groups. The ADL scheme allows a transaction fine control over creation of lock groups and classification of locks into lock groups enabling faster releasing of locks in groups. The life time that the lock group is active defines a new lock duration. This allows a large number of lock durations to be defined with the creation of each new lock group and any number of lock durations can be active for a given transaction. A very general concept of lock duration is supported without using any a priori semantics to individual lock durations and the duration of a lock group may be determined by the transaction as desired.

Abstract: An implementation of SVM functionality improves efficiency, time consumption, and data security, reduces the parameter tuning challenges presented to the inexperienced user, and reduces the computational costs of building SVM models. A system for support vector machine processing comprises data stored in the system, a client application programming interface operable to provide an interface to client software, a build unit operable to build a support vector machine model on at least a portion of the data stored in the system, based on a plurality of model-building parameters, a parameter estimation unit operable to estimate values for at least some of the model-building parameters, and an apply unit operable to apply the support vector machine model using the data stored in the system.

Abstract: The present invention provides techniques by which updates may be incorporated in database indexes without causing deadlocks of user transactions. In deferred-incorporate update, the updates are propagated to the index only at transaction commit time. A method of handling transactions including updates in a database management system comprises the steps of receiving an update to a database maintained by the database management system, the update operable to cause an index of the database to be modified, recording the update in a log, and receiving an indication that the transaction is to be committed and in response, incorporating the update from the log into an index of the database. The update may comprise an insert operation and/or a delete operation.

Abstract: A method allows a query, which contains an inline view, to be rewritten to use a materialized view. The materialized view has an inline view that is equivalent to the inline view of the query. However, the inline view of the materialized view varies textually from the inline view of the query.

Abstract: A query statement, issued to a local database server, is re-written. The query references at least one of a first or a second object. The first object is remote with respect to the local database server, for accessing a first materialized view that is local or remote with respect to the local database server. The second object is local with respect to the local database server, to access a second materialized view that is remote with respect to the local database server. Rewriting the query can include dynamically tracking a staleness state associated with one or more of the materialized views.

Abstract: A mechanism of specification of business process templates, to capture commonly performed business activities/workflows/projects within a business organization and encourage reuse of best practices. Long transaction workspaces based business process template execution mechanism are presented, which have several advantages over existing business process execution mechanisms in web collaboration frameworks. This execution approach provides support for an isolated environment for business process execution. This isolates the changes made on different resources while executing a business process from the external world until the business process completes. It enables the ability to concurrently manipulate same resources in different components of a business process, and later resolve conflicts if any and merge the different views of the same resource manipulated by different components of a business process.

Abstract: Described is a hierarchical index that captures the hierarchical relationship of a hierarchy emulated by a relational database system. The hierarchical index is implemented, using a database table which contains rows that serve as entries of the hierarchical index. Another table has rows that are associated with nodes in the hierarchy. Each entry in the hierarchal index maps to a row that corresponds to a node in the hierarchy. A node in the hierarchy may be a parent node with one or more child nodes. In this case, the corresponding entry in the hierarchical index contains identifiers which identify other entries in the index, where the other entries correspond to rows associated with child nodes of the parent node.

Abstract: Techniques for debugging a computer program that includes multiple modules executing on multiple machines include receiving, at a unifying component, first data from a first machine. The first data indicates debugging information generated by the first machine. Second data is also received at the unifying component from a second machine. The second data indicates debugging information generated by the second machine. Based on the first data and the second data, third data is formed indicating a single integrated representation of debugging information for the computer program. The unifying component allows debugging information from several machines to be integrated and then presented to a user through a single debugger client.

Abstract: A method of facilitating the reproduction of a presenter's desktop for attendees of a real-time collaboration. A bound portion of the desktop (the portion shared with the attendees) is logically divided into clusters. When the content of a cluster changes, the cluster is analyzed and one or more objects describing the content may be identified. Each object that is not already cached is cached and assigned a cache ID. Each object in the cluster is described in an object primitive to be sent to the attendees. Actions for reproducing the object on the attendees' clients are sent as action primitives. The object and action primitives allow the content of the presenter's desktop to be sent incrementally instead of sending the entire desktop.

Abstract: In a multidimensional database, an aggregation operation is performed in an optimal manner by storing the values included in the/aggregation operation on the same disk page. A sparsity manager determines aggregate values that are computed from other data values during the aggregation operation. Each aggregate value is associated with one or more data values that are used during the aggregation operation to compute the aggregate value. The sparsity manager stores the associated data values in proximity to each other, such as on the same disk page, so that multiple disk page fetches may not be required for the same set of data values during the aggregation operation. The data values used in the aggregation operation can therefore be fetched once from a disk page, and thereafter are found in memory, such as on a cache page corresponding to the disk page. In this manner, multiple fetches for the same disk page during the aggregation operation are avoided.

Abstract: An executable computer program is dynamically constructed by tightly coupling a plurality of dynamically loadable modules. Each modules includes a fully encapsulated function which is typically called from another module. A registration system is employed to associate a pointer with each defined function. In the modules, at run time, each function call is resolved using the associated pointer from the registration system. In particular, each function call is dereferenced by the associated pointer. Consequently, the resulting executable computer program is both flexible and efficient.

Abstract: The present invention is an automated method and system of labeling of the axes of a graph with time based data. The present invention uses multi-level time labels to label the time axis of a graph. The invention generates a set of time labels by processing the input data; the time axis labels stores the set of data in a multi-level data structure. The multi-level data structure is processed to refine the time labels. The refining step includes adjusting the time labels so that they fit in the space provided along the axis and refining the multi-level time labels to make the labeled axis more readable. The time labels are then used to generate multi-level time labels. These multi-level time labels are used to label the axis of the graph. The invention automatically provides an effective, elegant, labeled time based graph.