Abstract: Provided are systems and methods for generating a hierarchy. In one example, a method includes receiving a first data graph including a plurality of nodes and links connecting the plurality of nodes, receiving a second data graph including a second plurality of nodes and links connecting the second plurality of nodes, generating a hierarchy based on the first data graph and the second data graph, where the generated hierarchy includes a plurality of levels, nodes from the first data graph arranged on at least one level, nodes from the second data graph arranged on at least one other level, and links connecting the nodes from the first data graph and the nodes from the second data graph, and indicating a relationships between the first and second data items, and outputting the generated hierarchy for at least one of display and further processing.

Abstract: An apparatus for handling string variables with open domains is provided. In some implementations, the apparatus performs operations including retrieving a first string variable having a first domain, the first domain comprising at least one undefined string value. The operations further include retrieving a second string variable having a second domain, the second domain comprising one or more string values each assigned an integer value in a second set of integer values. The operations further include applying a constraint relating the first string variable with the second string variable. The operations further include comparing the first set of integer values with the second set of integer values and filtering the first set of integer values in the first domain to a third set of integer values in the first domain. The operations further include displaying the third set of integer values for the first string variable.

Abstract: The disclosure generally describes computer-implemented methods, software, and systems for self-learning localization services. A computer-implemented method includes: identifying, at a location remote from a first application, a request for localization of a string value associated with the first application from a source language to a target language, sending the string value to a translation request buffer in response to a determination that the localization of the string value in the target language is unavailable, and triggering, in response to satisfaction of at least one heuristic analysis, a translation process of the string value from the source language into the target language where the string value is retrieved from the translation request buffer. In some instances, the location remove from the first application is a centralized localization service accessible by remote requests from a plurality of applications.

Abstract: In one general aspect, a method can include generating a user interface for an enterprise application executing on a computing device using a flexible screen layout. The generating can include displaying, on a display device included in the computing device, a first user interface for the enterprise application including a first column that occupies an available screen area of the display device and that presents first content, receiving, in the first user interface, a selection for forward navigation, and displaying, on the display device, a second user interface for the enterprise application. The second user interface can include a second column presenting the first content and a third column presenting the second content that can occupy the available screen area of the display device. The flexible screen layout can adjust a size of the second column and the third column based on the available screen area of the display device.

Abstract: A method for filtering a product transaction data file involves receiving, by a computer, a query including one or more groups of attribute conditions for filtering the product transaction data file. The attribute conditions in the query are applicable to product attribute data records split across a set of vertically split attribute data files. The method further includes determining which of the product attribute data records split across the set of vertically split attribute data files satisfy all of the one or more groups of attribute conditions in the query, identifying product keys associated with the product attribute data records that satisfy all of the one or more groups of attribute conditions in the query, and using the so-identified product keys to filter product data records in the transaction data file.

Abstract: A declarative user interface representation in one declarative format can be converted to a declarative user interface representation in a different declarative format. Templates can rely on template helpers for mapping and programmatic extensions to support a wide variety of declarative formats. Complex scenarios such as composition and decomposition of properties across declarative representations can be supported. A hierarchical approach facilitates development and maintenance of solutions.

Abstract: Technologies are described for facilitating transaction processing within a database environment having a coordinator node, a first worker node, and at least a second worker node. The coordinator node receives local transaction tokens from the first and the at least a second worker nodes. The coordinator nodes determines a synchronized transaction token using at least the local transaction tokens from the first and the at least a second worker nodes. The coordinator node sends the synchronized transaction token to the first and the at least a second worker nodes.

Abstract: An application object framework provides a GUI developer with application object metadata that can be leveraged to design and implement GUI controls in an efficient, standardized, straightforward manner. For example, a smart control interface may be utilized that enables linking of a particular GUI control with a corresponding application object, including linking to the application data and logic, through the use of metadata of the corresponding application object. In this way, validations and GUI logic required by the GUI control may be provided automatically, leaving the GUI developer the freedom to focus on the visual composition, functionality, and other desired aspects of the GUI controls.

Abstract: A first code version is received. The first code version includes a plurality of code features, such as methods or classes. A second code version is received. The second code version includes a plurality of code features. The first code version is executed. A first plurality of code features executed during the execution of the first code version are determined. A second plurality of code features differing between the first and second code versions are determined. The first and second plurality of code features are compared. An indication is provided that a code feature is potentially relevant to the code behavior if the code feature is present in the first plurality of code features and in the second plurality of code features.

Abstract: Techniques for increasing accessibility of data across different environments of a computer system architecture are disclosed.

Abstract: In some implementations, there is provided an apparatus having at least one data processor and at least one memory storing instructions which, when executed by the at least one data processor, cause requesting a configuration of a user interface element associated with a user interface of an application being executed at, or accessed by, the apparatus; presenting a configuration user interface to enable configuration of the user interface element, the configuration user interface including at least one option for configuring the user interface element and an indication of whether a selected option is to be applied at runtime, to just the application or a plurality of applications; and presenting, during runtime of at least the application, the user interface element in accordance with the at least one option and/or the indication selected via the configuration user interface. Related systems and articles of manufacture are also provided.

Abstract: Disclosed herein are system, method, and computer tangible medium embodiments for generating a relational database model from a model view that provides an estimate for generating query plan for a query on the model view, according to an embodiment. A join model of a model view set on one or more database tables is received. At least one index conversion of the join model is performed, where the index conversion converts at least one index in the join model into at least one leaf node in a relational model tree. At least one join conversion of the join model is performed where the at least one join conversion generates a node in the relational model tree that joins a first and second leaf nodes in the relational model tree. A requested parameter conversion is performed, where the requested parameter conversion includes an attribute or key figure requested by a query.

Abstract: Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.

Abstract: Disclosed herein are system, method, and computer program product embodiments for data anonymization in an in-memory database. An embodiment operates by receiving an indication to perform data anonymization based on quasi attributes of a data set. Partitioning is recursively performed on the data set based on one or more of the quasi attributes until both a first anonymization threshold corresponding to the quasi attributes is satisfied and a second anonymization threshold corresponding to the one or more sensitive attributes is satisfied for each of a plurality of sub-partitions produced as a result of the partitioning. A resultant data set including a plurality of records of the data set corresponding to the plurality of sub-partitions that satisfy both the first anonymization threshold and the second anonymization threshold is provided.

Abstract: Disclosed herein are system, method, and computer program product embodiments for automatically integrating different software applications in a cloud platform. An embodiment operates by creating a registration entry representing an integration use-case for a first tenant of a first application in an integration discovery service. The embodiment generates a barcode based on the registration entry. The embodiment matches the integration use-case for the first tenant of the first application with a potential integration use-case for a second tenant of a second application based on the barcode. The embodiment then creates an integration configuration for enabling the integration use-case for the first tenant of the first application with the potential integration use-case for the second tenant of the second application based on the matching.

Abstract: A device and a method for displaying content on a display device involve generating a graphical user interface including a toolbar in response to a request to display content. The toolbar is displayed simultaneously with the content on a display screen of the display device, with at least two sides of the toolbar are separated from edges of the display screen. The toolbar is partially transparent and brought onto display using an animation, separately from display of the content.

Abstract: Disclosed herein are system, method, and computer program product embodiments for incrementally building hash collision tables. In some embodiments, hashes and hash collision tables may be used to improve efficiency of relational operations, such as those used in relational databases. An embodiment operates by determining hash collisions between data entries, then storing newly determined hash values corresponding to collisions in a hash collision table. The storing can be done incrementally, without needing to rebuild hash tables or hash collision tables for all data entries.

Abstract: Disclosed herein are system, method, and computer program product embodiments for message handling related to non-parallelizable functionality. An embodiment operates by determining a plurality of diagnostic messages corresponding to processing a request that includes both a first set and a second set of diagnostic messages. Diagnostic information corresponding to the first set of diagnostic messages, from previously processed requests, is determined to be stored in a cache. Diagnostic information corresponding to the second set of diagnostic messages is retrieved from the disk storage. A diagnostic report associated with the processing of the request including diagnostic information from both the first set and the second set of diagnostic messages is generated and returned.

Abstract: A transformation platform allows a common data model to provide query output to multiple types of output devices, and incorporate query responses received using multiple types of constrained user input devices, such as neural headsets, that may be used by disabled individuals. Data and software applications can employ input and output modes of a client computer device without the data or application having to be specifically formatted or programmed for the different input and output modes. The data can specify queries that include response fields having response options that are selectively, such as progressively, highlighted. A user can provide input to select a highlighted response option. For a query having multiple response fields, response options for each response field can be progressively displayed after user input is received for a current set of response options. The query responses can be stored in the data model in association with field identifiers.

Abstract: Disclosed herein are system, method, and computer program product embodiments for data anonymization in an in-memory database. An embodiment operates by receiving an indication to perform data anonymization based on one or more quasi attributes of a data set. The data set is sorted based on the one or more quasi attributes. The sorted data set is grouped into a first plurality of groups. A particular group that does not include enough records to satisfy an anonymization threshold is identified from amongst the first plurality of groups. The particular group is combined with another group of the first plurality of groups.