Abstract: Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for concurrent production use of an enterprise system and testing of a modified enterprise system. Actions include receiving a test schema that provides one or more application views to application tables of production data in a database, at least one application view including a read-only view, providing one or more local tables for local test data provided during execution of the modified enterprise system, providing one or more triggers to the at least one application view, and executing the enterprise system based on a production database schema and concurrently executing the modified enterprise system based on the test database schema.

Abstract: Techniques and solutions are described for determining, evaluating, and selecting data retrieval pathways. A plurality of database objects, such as tables, can be retrieved, and relationships between them determined. The relationships are between various attributes of the database objects. A plurality of pathways are determined between at least two target database objects, where the path determination does not consider attribute-level relationship information. After a path is determined, the relationship-level information can be added. A summary of the path, and relationship information, can be displayed to a user. A user can select paths to remove from the display, and can indicate one or more database objects that are required for a valid path, one or more database objects that are prohibited from valid paths, or combinations thereof. A user can select a path, and a query language statement to implement the path can be generated and displayed to the user.

Abstract: An attribute vector including value identifiers and corresponding to a dictionary structure is identified. A dictionary type encoding structure is generated by virtually partitioning the dictionary structure. The dictionary type encoding structure may include multiple dictionary types. Based on the dictionary encoding structure, the attribute vector may be split to generate multiple attribute vector blocks that may be identified by block transition indices. Based on the dictionary types in the dictionary encoding structure, the value identifiers in the attribute vector blocks are rearranged. Such a rearrangement optimizes the attribute vector for searching the value identifiers.

Abstract: Techniques are described for service mapping and other backend operations for a collaborative platform. A platform may access data objects from any suitable number of source services. The data model of the platform may be dependent on the data models of its associated source services as well as source service annotations, where such annotations describe the mapping onto the various data model elements. The process of mapping requests and results between the platform and the external data sources at runtime may employ a schema mapping data structure to minimize potential performance impacts. Implementations may employ a hierarchical class structure that is configured to achieve efficient traversal by shifting computational load to initialization time when the source service data models and annotations are processed. The initialization of the structure may be triggered at initialization time of the platform or whenever an administrative action causes changes to the schema mapping.

Abstract: Annotations can be placed in source code to indicate properties for user-defined functions. A wide variety of properties can be implemented to provide information that can be leveraged when constructing a query execution plan for the user-defined function and associated core database relational operations. A flexible range of permitted partition arrangements can be specified via the annotations. Other supported properties include expected sorting and grouping arrangements, ensured post-conditions, and behavior of the user-defined function.

Abstract: Techniques are described for graph based code performance analysis of software, such as software that is being developed and tested in a development environment. Implementations provide a technique for instrumenting code by adding various annotations into the code. Each annotation may be a function call that executes with the annotated code, but does not alter the behavior and/or functionality of the annotated code apart from outputting call tracking information during execution. The call tracking information generated by annotations can be analyzed to generate a call graph that depicts calling relationships between functions in the code. The call graph can be presented within a user interface and/or automatically analyzed to develop recommendations regarding code coverage for testing, impact information describing how changes to one function impact another function, code optimization recommendations, and so forth.

Abstract: Disclosed herein are system, method, and computer program product embodiments for creating and utilizing configuration providers for layered repository facilities. An embodiment operates by creating or loading a custom data structure for a software application, retrieving configuration information from at least one configuration provider, storing the retrieved configuration information in the custom data structure, and associating the custom data structure with the application and a specific layer of a layered repository facility.

Abstract: Some embodiments provide a non-transitory machine-readable medium storing a program that receives, at a first system, a first configuration for replicating a first type of data managed by the first system to a second system. The program further receives, at a third system, a second configuration for replicating a second type of data managed by the third system to the second system. The program also replicates a first set of data having the first type of data from the first system to the second system based on the first configuration. The program further replicates a second set of data having the second type of data from the third system to the second system based on the second configuration. The program also receives a third set of data from the second system, the third set of data generated by the second system based on the first and second sets of data.

Abstract: A system in which a volatile random access memory stores first header data, second header data, a first logical array in a first contiguous memory block and a second logical array in a second contiguous memory block. Each array position of the first logical array stores a database column value, and each array position of the second logical array stores an indication of a number of consecutive occurrences of a database column value. The first header data includes a first pointer to the first memory block, and the second header data includes a second pointer to the second memory block.

Abstract: In one respect, there is provided a distributed database system that includes a first local scheduler node and a second local scheduler node. The first local scheduler node can be configured to coordinate a performance of a first task and a second task by a first worker node associated with the first local scheduler node. The second local scheduler node can be configured to respond to a defect at the first local scheduler node by at least: collecting, from the first worker node, a log indicating one or more tasks completed by the first worker node prior to the defect at the first local scheduler node; determining, based at least on the log, that the first worker node has completed the first task but not the second task; and coordinating a performance of the second task by the first worker node. Related methods and articles of manufacture are also provided.

Abstract: A system includes determination of whether a current number of active worker threads of a client application is less than a maximum active worker thread limit, retrieval, if the number of active worker threads is less than the maximum active worker thread limit, of a first job associated with a first context from a job pool, determination of whether an inactive worker thread is associated with the first context, and, if an inactive worker thread is associated with the first context, execution of the first job on the inactive worker thread.

Abstract: Various examples are directed to converting a natural language query to a structured query. The natural language query may comprise a plurality of terms. A natural language system may generate a set of operators and a set of operands based at least in part on the plurality of terms and a metadata dictionary. The natural language system may generate an expression tree based at least in part on the set of operators and the set of operands. The expression tree may comprise a plurality of interconnected nodes. A first node may be associated with a first function corresponding to a first operator of the set of operators and a second node may be associated with a first argument of the first function corresponding to a first operand of the set of operands. The natural language system may generate a query based at least in part on the expression tree.

Abstract: Disclosed herein are system, method, and computer program product embodiments for determining the quality of a route for sending messages. An embodiment operates by determining that a message in a stream of messages and associated with a route is a duplicate of a previous message associated with the route. The embodiment inserts a Boolean value into a duplicate detection queue associated with the route based on the determination. The embodiment calculates a route quality value for the route based on the duplicate detection queue. The embodiment then performs an action for the route based on the route quality value.

Abstract: A system may comprise: an information storage device; RFID tags that are placed in different physical locations and contain information relating to a corresponding object, including at least identification information of the corresponding object; and provided at a physical location which facilitates access to the information by a user interested in the corresponding object; a mobile device configured to: select one or more objects of interest by establishing communication with one or more of the corresponding RFID tags; extract information relating to the one or more objects of interest from the one or more of the RFID tags corresponding to the one or more objects of interest; and send the extracted information to the information storage device via a wireless network, wherein the information storage device is configured to store the extracted information in association with an access code that enables access to the extracted information.

Abstract: According to some embodiments, a source application part may be established having a source data object with a set of source attribute identifiers and associated source attribute values. A target application part may also be established having a target data object with a set of target attribute identifiers. An object reuse platform may then receive, from a user via a graphical interface, an indication that the source data object relates to the target data object. The object reuse platform may then calculate, for each source attribute identifier, a probability that the source attribute identifier is associated with one of the target attribute identifiers.

Abstract: A Tenant request to subscribe to an Application is received. A Service that the Application consumes is determined. The Tenant is determined to be new to the Service. In response to determining the Tenant is new, a subscription of the Tenant is provided in the Service, and the Application is added to the subscription.

Abstract: Provided are devices and methods for repairing corrupt data using a secure environment in a productive system. In one example, the method includes receiving a request to modify a base table stored in a productive environment, generating a child table corresponding to the base table within a secure environment of the productive system, modifying the one or more table entries from the base table and storing the modified table entries in the child table, executing one or more operations on the child table within the secure environment to determine if the one or more modified table entries repair the base table, and outputting a determined result of the one or more operations to a user interface. As a result, corrupt data can be modified locally via inheriting tables within a secured environment without any further damage being done to productive data in a productive environment.

Abstract: Techniques and tools are described for facilitating user reflection on past decisions in order to determine trends and to assist in future decision-making. Technologies for administering a career history exercise and for visualizing results of the career history exercise are described. Visualizations include using stage cards representative of stages in a user's career history. User ratings of the stages in his or her career history are displayed on the stage cards using color-shaded ratings units.

Abstract: In an example, a graph structure and flat data corresponding to the graph structure are obtained, the graph structure containing a plurality of nodes. Stop words are removed from one or more search terms to obtain modified search terms. For each of the modified search terms, the pieces of data from the flat data are searched to locate one or more matching pieces of data from the flat data, wherein a piece of data from the flat data matches if it contains at least one attribute with a value that is similar to the modified search term. This information is used to calculate fuzzy match scores for each matching piece of data from the flat data.

Abstract: Techniques are described for dynamically synchronizing applications executed on a client device with backend systems. An example method includes identifying a triggering event associated with a request to perform a synchronization of a client application, where the request is associated with a request for a partial synchronization of the client application. A set of information defining a request context associated with the request is obtained. A set of potential partial synchronization scenarios are identified, where each of the potential partial synchronization scenarios associated with a predefined synchronization context. The request context is compared to the predefined synchronization contexts of the set of potential partial synchronization scenarios to identify a particular partial synchronization scenario corresponding to the request context.