Abstract: Example embodiments for master data synchronization for multiple applications are described. In an example embodiment, master data to be employed by a plurality of applications, as well as schema for the master data, are accessed. One or more publication requests to store the master data and the schema of the master data to a master data store accessible by the plurality of applications are generated. The schema may be cached locally to one or more of the applications.

Abstract: The present disclosure involves systems, software, and computer implemented methods for optimizing continuous queries for hybrid execution over a stream processing engine and an in-memory database. In one example, a method may include identifying a continuous query executed at a stream processing engine, the continuous query including a plurality of operators. An optimal plan for execution of the identified continuous query at the stream processing engine is determined. For each of the plurality of operators in the determined optimal plan, an optimized placement decision for executing a particular operator in the stream processing engine or at a database system is determined. An optimized continuous query is generated from the identified continuous query based on the determined optimal placement decisions for each of the plurality of operators in the determined optimal plan. The optimized continuous query is then executed at the stream processing engine and the database system.

Abstract: Embodiments automatically create an axis break in a bar chart or waterfall chart to promote data visualization. For a bar chart with positive bars, a maximum axis break point is determined relative to a lowest datapoint (D1) in the selected bar(s). A minimum axis break point is found from a value (D2) outside selection which is between D1 and zero, and which is closest to D1. The inclusion of padding on either side of a break prevents the break from lying at zero or a bar end. A different procedure creates axis breaks in a waterfall chart. Certain embodiments store only bar selection metadata with a chart. The location of the axis break then is recalculated each time the chart is rendered (e.g., with updated data). Embodiments may retain axis break data for reference in various stages of a user interaction (e.g., filtering/expanding, drilling-down/up, etc.) with a rendered chart.

Abstract: A system and method to develop a harmonized UI application is presented, giving the teams the freedom of having their own code repository and bringing the functionality together during build steps to have one consistent application facing the external consumers. Multiple applications are reachable via the same web address in the same context without having each team to contribute to the same code repository. Team-specific development processes are isolated from a central build process, allowing each team to develop and test their part of the overall application.

Abstract: An integration service layer is provided for interaction between applications and platform services. The platform services may be cloud services deployed on one or more cloud platforms. The integration service layer provides a set of instantiated interfaces correspondingly defined for the cloud service. The integration service layer may provide one or more interfaces for a cloud service. An application is created to run on a cloud platform. The application is implemented to consume one or more platform services from the provided platform services. The application is connected with the ISL to consume resources provided by one or more platform services from the platform services that are associated with the ISL. Connections between objects from a user interface of the created application and corresponding interfaces defined at the ISL for the one or more platform services included in the application are defined.

Abstract: Technologies are described for facilitating database system recovery in a distributed database environment having a master node and at least one slave node. The at least one slave node receives a preliminary slave log backup position. The at least one slave node replays at least a portion of one or more log backups until the preliminary log backup position is reached. The at least one slave node receives a final slave log backup position. The slave node replays at least a portion of one or more log backups until the final slave log backup position is reached.

Abstract: In one embodiment, a method determines one or more records that are added, updated, or deleted for an entity. One or more effective from dates for the one or more records and a last effective from date for the entity in a database table for the entity is analyzed to classify the one or more records in one or more scenarios in a plurality of scenarios. The method selects a scenario in the plurality of scenarios based on the one or more effective from dates for the one or more scenarios and the last effective from date for the entity. Then, an update process associated with the scenario is performed to update a portion of records in the database table using the one or more records.

Abstract: Various embodiments included herein include at least one of systems, methods, and software for explanatory animation generation. Some embodiments include receiving data representative of at least two data items, each data item to be presented as a node. Relationships between these data items are discovered in an interrelated dataset and the relationship is illustrated as a set of sequential nodes on a canvas. A text-script descriptive of each of the nodes is then generated. Finally, such embodiments include generating a visualization with a synchronized voiceover based on the sequence nodes and the text-script, the visualization including each node with a synchronized voiceover of each node.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a log entry instance for creating a definition for a log entry type. The program further generates a markup associated with the log entry instance. The program also generates a document based on the markup associated with the log entry instance. The program further retrieves a set of reference documents. Each reference document is associated with a particular type of event. The program also generates a ranked list of types of events based on the document and the set of reference documents.

Abstract: Database searching is optimized utilizing a graph community structure. A graph is created from transaction data based upon adjacent value occurrences. This may be done by scanning transaction data from top to bottom, and creating an edge between a current index value and a previous index value. Next, algorithms identify communities in the graph to create a graph community structure. These communities comprise blocks of patterns of similar value-ids distributed in the transaction data. Scanning and transition indices may be created with an eye toward reducing memory usage and enhancing performance. Query searching is then executed in an efficient manner on a per-community basis. For example, exact queries, range queries, and/or “AND” queries may be executed more efficiently upon communities of records, skipping those not belonging to the same community. Embodiments are suited to search an in-memory database having large volumes of column-oriented data stored in RAM.

Abstract: Embodiments implement a minispace concept to dynamically manage layout of a robotics warehouse system. The warehouse space is divided into a plurality of equally sized minispaces, each corresponding to a standard rack footprint. Each minispace is identified by tagging with a unit location ID and attribute(s) such as coordinates. Minispaces may be referenced in a task planning process flow that initially comprises determining stock and rack, followed by determining a relevant workstation. The task is then assigned to an appropriate robot, and a travel route is planned (e.g., shortest path in minispace layout). Robot actions within the route are then planned and executed by the warehouse management system according to the minispace layout. Minispaces allow a robot to identify each minispace by the tagging, and to plan the next movement accordingly. The use of minispaces may facilitate collision avoidance by grouping actions together and allowing performance of minispace locking/checking procedures.

Abstract: The present disclosure involves systems, software, and computer implemented methods for managing and persisting application interfaces and windows into reusable arrangements. In one example, a method may include identifying a work area of a first user, the work area including a presentation of a plurality of windows, each window associated with an application and receiving a selection of at least one of the plurality of windows in the work area. In response to receiving a request to associate the selected windows with a workplace schema, locations of the selected windows in the work area are determined. The determined locations of the selected windows are stored in a first workplace schema, where the first workplace schema stores the layout of the work area based on the determined locations of the selected windows.

Abstract: A procedural pattern in a received query execution plan can be matched to a stored pattern for which an equivalent declarative operator has been pre-defined. The query execution plan can describe a query for accessing data. A hybrid execution plan can be generated by replacing the procedural pattern with the equivalent declarative operator. A hybrid execution plan processing cost can be assigned to execution of the hybrid execution plan and a query execution plan processing cost can be assigned to execution of the query execution plan. The assigning can include evaluating a cost model for the hybrid execution plan and the query execution plan. The query can be executed using the hybrid execution plan if the hybrid execution plan processing cost is less than the query execution plan processing cost or the query execution plan if the hybrid execution plan processing cost is greater than the query execution plan processing cost. Related systems, methods, and articles of manufacture are disclosed.

Abstract: Various embodiments of systems and methods to control interactions between an application user interface and a database are described herein. In one aspect, a secondary persistency of application data is generated based on a primary persistency of the application data in a database. A request to modify a value of a field of the application data in the secondary persistency is received from the application user interface. The field of the application data in the secondary persistency is updated in response to the received request for modification. A determination is made that the received request for modification influences other fields of the application data according to a set of rules. The other fields of the application data are updated based on the received request. The application data in the secondary persistency is then transitioned to the primary persistency upon request.

Abstract: Various embodiments of systems, computer program products, and methods to provide descriptor-transformer framework in an integration platform are described herein. In an aspect, an instruction to integrate a plurality of applications is received through a web interface application corresponding to the integration platform. A descriptor file associated with connectivity adapters corresponding to the plurality of applications is retrieved. Further, one or more preprocessor steps and/or one or more postprocessor steps are determined by analyzing the descriptor file. The plurality of applications is integrated by executing an integration flow based on the determined one or more preprocessor steps and/or one or more postprocessor steps.

Abstract: The present disclosure generally relates to a software application runtime having dynamic evaluation functions and parameters. A dynamic evaluation engine of an application's runtime accepts evaluation requests from methods of a software application. A request can be associated with an identifier for a method of the software application. The method identifier can be associated with one or more dynamic evaluation functions having one or more dynamic evaluation parameters. When the dynamic evaluation engine receives a request from an application method, the dynamic evaluation engine can determine the one or more current dynamic evaluation functions or parameters to use with the request. The dynamic evaluation engine can return an evaluation result to the method. The dynamic evaluation engine can be in communication with a repository, such as a central repository, providing a unique mechanism to look up dynamic evaluation functions and parameters, which can be imported into the application's runtime.

Abstract: A system, method, and computer-readable medium, including receiving a request to create a job chain, the job chain being a data structure and to reference a plurality of simple jobs; specifying the plurality of simple jobs referenced by the job chain, each of the simple jobs including at least one attribute defining an executable task for the simple job; specifying an order of execution for the plurality of simple jobs referenced by the job chain; and generating an instance of the job chain data structure, the generated job chain referencing the plurality of simple jobs and inheriting the at least one attribute of each of the plurality of simple jobs.

Abstract: A system, method, and tangible medium to build a user interface, the system including a backend system supporting processing and persisting of a parameter model defining a user interface, the parameter model specifying user input fields of the user interface to be defined; a user interface framework to render the parameter model to solicit at least one input value for the input fields of the user interface from a user; and a service, distinct from the user interface framework and the backend system, to deliver the parameter model to the user interface framework, the service further to persist the at least one input value from the user.

Abstract: Performing optimized update operations in in-memory database systems. Update values corresponding to a source table of values stored on an in-memory database are identified by an in-memory database computer system based on information from a computer system implementing a software application. The update values are distributed across a plurality of rows, each row including a plurality of column attributes. At least some column attributes of the plurality of column attributes include values updated relative to corresponding column attributes in the source table of values. A row of the update values is identified. The row includes a plurality of column attributes, each column attribute having a respective value. Each value of each column attribute of the row of the update values is the same as a corresponding value of a corresponding attribute of a corresponding row of the source table is determined.

Abstract: A system and method to receive, via a graphical user interface layout, a request to create a data element; and present within the graphical user interface layout, in response to receiving the request, an expanded user interface element including user interface input fields to specify at least one attribute of the data element.