Abstract: A program receives a state change that occurred for an event created by an application. The event includes a creator of the event, a set of objects, and a set of sources. The program further identifies a schema definition in a plurality of schema definitions based on a type of the state change that occurred for the event. Each scheme definition in the plurality of schema definitions specifies a type of state change and a set of information associated with the event. The program also generates a message that includes the set of information associated with the event specified in the identified schema definition and a set of targets. The program further sends the message to a message management platform in order for the message management platform to send to an application for presentation to each target in the set of targets through a web portal provided by the application.

Abstract: Techniques and solutions are described for partitioning data among different types of computer-readable storage media, such as between RAM and disk-based storage. A measured workload can be used to estimate data access for one or more possible partition arrangements. The partitions arrangements can be automatically enumerated. Scores for the partition arrangements can be calculated, where a score can indicate how efficiently a partition arrangement places frequently accessed data into storage specified for frequently-accessed data and placed infrequently accessed data into storage specified for infrequently accessed data.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program identifies a first data structure having a first type. The first data structure is configured to store a set of geometries. The program further identifies a second data structure associated with the first data structure. The second data structure is configured to store modifications to the set of geometries. The program also perform a merge operation on the first data structure and the second data structure to form a third data structure.

Abstract: Disclosed herein are system, method, and computer program product embodiments for partition pruning via non-homogenous synopsis information. An embodiment operates by maintaining synopsis information for a data partition in accordance with a first synopsis strategy, monitoring performance of the synopsis information within a partition pruning system, determining that the performance of the synopsis information is insufficient, and updating the synopsis information in accordance with a second synopsis strategy better suited for the attributes of the data partition. In some embodiments, a first data partition of a partitioned data table may employ a first synopsis strategy and a second data partition of the partitioned data table may employ a second synopsis strategy.

Abstract: The present disclosure describes methods, systems, and computer program products for performing integration logic programming. One computer-implemented method includes receiving, by operation of a middleware system, first information in a first format corresponding to a first application, applying, by operation of the middleware system, one or more integration logic programming (ILP) patterns to the first information, the one or more ILP patterns representing application integration semantics using a logic programming language, generating, by operation of the middleware system, a second information in response to applying the one or more ILP patterns to the first information, and outputting, by operation of the middleware system, the second information in a second format corresponding to a second application.

Abstract: A first version of a document is accessed so that a corresponding contract dictionary is generated with a plurality of string tokens. Subsequently, a visual distinction is assigned to the corresponding ranking priority of each of the plurality of string tokens. A second version of the document is accessed and changed string tokens are identified by comparing the second version with the first version of the document. A corresponding ranking priority is then retrieved for each of the changed string tokens in the contract dictionary so that each of the changed string tokens can be highlighted with the visual distinction corresponding to the ranking priority. Each of the highlighted changed string tokens can then be displayed with the visual distinction and the document on a graphical user interface.

Abstract: According to some embodiments, methods and systems may be associated with an integration computing environment for an enterprise. An integration modeling design platform may receive, from an integration developer via a modeling notation, an indication that a retry component should be associated with an integration task. The integration modeling design platform may then configure the retry component for the integration task in connection with at least one of an integration adapter and an integration component (e.g., a selection of a messaging component, a quality of service, a retry period, an exponential back off option, etc.). According to some embodiments, an integration generation framework, coupled to the integration modeling design platform, may automatically construct an appropriate runtime retry representation based on the configured retry component (e.g., by creating a domain-specific language software component).

Abstract: In a streaming environment, efficient correlation between base events and relevant follow-on events is accomplished by temporarily storing events in an in-memory state for a limited time window. The in-memory state buffers the incoming stream of events to permit efficient attempted correlation. Successful correlation (e.g., by ID matching) between a follow-on event and a relevant base event, gives rise to specialized aggregation tables for matched (base, follow-on) event pairs. All events are ultimately removed from the in-memory state upon expiry of the time window. This results in correlated matched event pairs being stored in the aggregation tables for efficient querying. Events remaining uncorrelated upon expiration of the time window, are stored only in an (voluminous) log table for less-efficient (but rare) late querying and aggregation. Efficient correlation is achieved by assuming that successful event pair matching is most likely to occur within the in-memory time window, or not at all.

Abstract: A method may include generating, based on a first programming code implementing a routine in a first programming language, a second programming code implementing the routine in a second programming language associated with an offline runtime environment and a third programming code implementing the routine in a third programming language associated with an online runtime environment. The routine may include a first operation and a second operation associated with a cloud-based software application. The first operation may be capable of being performed while the cloud-based software application is operating in an offline mode but the second operation may be incapable of being performed while the cloud-based software application is operating in the offline mode. The second second programming code being generated to include the first operation and exclude the second operation. The second programming code and the third programming code may be deployed to a client.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program queries a set of databases to identify a first set of database schemas. Each database schema in the first set of database schemas is configured for a database in the set of databases. The program further queries an inventory data storage for a second set of database schemas. The program also compares the first set of database schemas and the second set of database schemas. Based on the comparison, the program further determines whether to deactivate database schemas in the set of databases.

Abstract: At each delegate device and each non-delegate device of a logical device hierarchy, a data cube is generated. The logical device hierarchy includes more than one level, and each level includes one or more groups, and each group includes one delegate device and one or more non-delegate devices. At each delegate device, data cubes are received from the one or more non-delegate devices associated with the same group. At each delegate device, data cubes are received from delegate devices of a different group, and that delegate device is the parent of the delegate devices associated with a different group. At each delegate device, the received data cubes are aggregated into a weighted data cube. From each delegate device, the weighted data cube are outputted to the parent of the delegate device.

Abstract: A method for database monitoring may include sending, to a central database, a query on a database view at the central database. The database view may include a first operational data from a first local database and a second operational data from a second local database. An operational state of the central database may be determined based on the response to the query on the database view. Moreover, in response to receiving, from the central database, a response including the first operational data, a first operational state of the first local database may be determined based on the first operational data. Alternatively and/or additionally, in response to receiving, from the central database, a response including the second operational data, a second operational state of the second local database may be determined based on the second operational data. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: An enterprise system which facilitates synchronization of offline data. Offline data created during an offline session or sessions (collectively an offline session) prior to synchronization is assigned a temporary key. Changes of offline data created during an offline session is assigned the temporary key of the data to which the change is associated. The temporary key is mapped to a new created backend key and stored in a mapping table. Using the mapping table, temporary keys associated with the changes are swapped with backend keys which the temporary keys are mapped. This maintains data persistency of newly created and change data during an offline session.

Abstract: The present disclosure provides improved systems, methods, and computer readable media for blending data from data sets that reside on different systems. This is done by generating subqueries from a main data model blend query, sending the subqueries to respective separate systems, accessing the results to all subqueries at a primary system, and performing a blend based on the main data model blend query at the primary system.

Abstract: Disclosed herein are system, method, and computer program product embodiments for non-blocking backup for tertiary initialization in a log replay only node. An embodiment operates by performing a standard log replay on a secondary server and briefly suspending the standard log replay in response to tertiary initialization. Further, the secondary server may determine backup block information and perform a page-aligned backup process from the secondary server to a tertiary server. Additionally, the secondary server may determine log replay block information, and perform a modified log replay concurrently with the backup process based on the backup block information.

Abstract: A distribution network may efficiently communicate items/item details in a private manner, with different access rights tailored to various tenants residing within a same or different customer landscape. A first input comprising a flat file with items/item details, is received. A second input comprising permissions entries for per-user, per-item direct access rights (e.g., view, read, write, delete) is also received. The first and second inputs are recursively processed to find nearest ancestors having the direct access rights, with a hash maintained including the nearest ancestors. An effective permitted structure (e.g., tree comprising root and leaf nodes) is generated by recursively adding descendant items having inherited access rights, to the nearest ancestors. Ultimately, descendant item(s) are privately distributed to a user with an access right according to the effective permitted structure. Embodiments may be particularly suited to the private distribution of analytics content (e.g.

Abstract: According to some embodiments, methods and systems may include a provisioning application platform processor to receive a user request for an integration service. The provisioning application platform processor may then transmit information to a platform resource manager processor to facilitate creation of a plurality of microservices resulting in implementation of the integration service for a tenant associated with the user. A multi-tenant keystore management service, automatically deployed upon implementation of the integration service, may automatically call a trusted authority platform. The multi-tenant keystore management service may then receive a signed security certificate from the trusted authority platform and add the signed security certificate to a keystore deployed to the tenant.

Abstract: A method for secure data exchange is provided.

Abstract: A system is provided, which may comprise: a word vector database configured to store word vectors, each of the word vectors representing a word or a phrase; a text database configured to store text data; and a processor configured to: receive a user input including a first term; obtain, for each word vector that is stored in the word vector database and that represents a word or a phrase other than the first term, a similarity between that word vector and a word vector representing the first term; select at least one second term based on the obtained similarity; perform a search in the text database using the at least one second term as a query for the search; and provide results of the search.

Abstract: A method and system include a source endpoint and a target endpoint; a mapping module; and a mapping processor in communication with the mapping module and operative to execute processor-executable process steps. An input data is received including one or more payload data values and a payload schema data. An expected target data is received. The expected target data includes one or more expected target payload values and one or more expected target schema. The expected target data are in a form receivable by the target endpoint. One or more fields of payload data values are identified in the input data for transformation. At least one function is identified to transform the input data into the expected target data. The identified at least one function and input data form an expression step. The expression step is received at a first interface. The expression step is executed in the first interface to generate a generated output in the first interface.