Abstract: Data is received at a source system and characterizing a modified first software object for transport to a destination system via a request and to update a first software object deployed on the destination system. A first dependency of the modified first software object on a second software object is determined by the source system. An inconsistency between the modified first software object and the second software object is identified by the source system and using the first dependency. Data indicative of the inconsistency is provided. Related apparatus, systems, techniques and articles are also described.

Abstract: A method, system, and computer-readable medium, including receiving a request to process a business object including an indication of at least one feature that can be invoked in the processing of the business object; determining the at least one feature associated with the business object based on the indication thereof included with the business object; determining whether the at least one feature associated with the business object can be executed by a second application based on an indication of a set of features supported by the second application; processing, in response to a determination that the at least one feature can be executed by the second application, the business object by the second application; and processing, in response to a determination that the at least one feature is not supported by the second application, the business object by a first application that supports a first set of features.

Abstract: In an example, information about interactions by users, via the graphical user interface, with a plurality of items rendered in the graphical user interface, is obtained, the information including a timestamp of a time and date at which the corresponding interaction occurred. A series of operations is performed upon detecting a condition that triggers a ranking of items rendered in the graphical user interface, for each item for which the condition applies. A ranking score is calculated for the item and a decay is applied to the ranking score by applying a Gaussian distribution, using the timestamp of the item as an origin to the Gaussian distribution, producing a decayed ranking score. The items for which the condition applies are then ranked based on their respective decayed ranking scores and a subset is rendered in the graphical user interface in an order matching the ranking.

Abstract: Systems and methods are provided for receiving an input comprising one or more attributes, selecting a subset of query options from a list of query options relevant to the attributes of the input, and based on query optimization results from an audit of previous queries, determining a priority order to execute each query in the set of queries based on the query optimization results, and executing each query in the priority order to generate a candidate list. For each candidate in the list of candidates, systems and methods are provided for selecting a subset of available workflows based on relevance to the candidate and based on workflow optimization results, determining an order in which the selected subset of workflows is to be executed, and executing the selected subset of workflows in the determined order to generate a match score indicating the probability that the candidate matches the input.

Abstract: A method may include applying a machine learning model, such as a bidirectional encoder representations from transformers model, trained to generate a representation of a word sequence including a reference word, a first candidate noun, and a second candidate noun. The representation may include a first attention map and a second attention map. The first attention map may include attention values indicative of a strength of various linguistic relationships between the reference word and the first candidate noun. The second attention map may include attention values indicative of a strength of various linguistic relationships between the reference word and the second candidate noun. A natural language processing task, such as determining whether the reference word refers to the first candidate noun or the second candidate noun, may be performed based on the first attention map and the second attention map. Related methods and articles of manufacture are also disclosed.

Abstract: A calculation engine of a database management system is described. The calculation engine may receive a query associated with a calculation scenario that defines a data flow model. The data flow model may include one or more calculation nodes, each of which corresponding to an operation performed on one or more database tables stored at a database. The one or more calculation nodes may include at least one calculation node corresponding to a ranking filter operation. The calculation engine may execute the query including by executing the calculation scenario. The executing of the calculation scenario may include performing the ranking filter operation to generate a result corresponding to at least a portion of rows included in a first partition of a database table stored at the database. Related systems, methods, and articles of manufacture are provided.

Abstract: A method may include defining, based on one or more user inputs, a custom type including one or more fields having one or more capabilities. In response to a first request from a publish service, the custom type may be sent to the publish service such that the publish service publishes, to a search system, one or more documents in accordance with a schema specified by the custom type. In response to a second request from a search service, a response may be sent to the search service identifying one or more field names and/or methods at the search system that correspond to one or more fields and/or actions specified by a first query received at the search service. The one or more field names and/or methods may be identified based at least on the custom type. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: Systems and methods include reception of a request for changed data of an object from a subscriber, determination of a logging table associated with the object and comprising a plurality of logging table entries, determination of a pointer to a last-processed entry of the logging table based on the object and the subscriber, definition of a plurality of sub-portions of logging table entries subsequent to the last-processed entry, and reconstruction and transfer of first data associated with a first one of the plurality of sub-portions to the subscriber using a first process, and reconstruction and transfer, in parallel with the first process, second data associated with a second one of the plurality of sub-portions to the subscriber using a second process.

Abstract: A data storage and retrieval system for a computer memory including a memory slice formed of segments and adapted to contain one or more documents and a checkpoint adapted to persist the memory slice. The checkpoint includes a document vector containing a document pointer corresponding to a document. The document pointer including a segment identifier identifying a logical segment of the memory slice and an offset value defining a relative memory location of the first document within the identified segment. There are checkpoint memory blocks, each storing a copy of a corresponding segment of the memory slice. The segment identifier of the document pointer identifies a checkpoint memory block and the offset value of the document pointer defines a relative location of the document within the checkpoint memory block.

Abstract: Systems and methods are disclosed for connection multiplexing in a parallel processing environment. An example method includes requesting, responsive to a request to perform multiple database operations in a single transaction, a connection identifier for a physical connection to the database, providing the connection identifier to each of a plurality of workers, and performing the multiple database operations using the plurality of workers. Each worker may obtain a work item from a work queue, initiate a database request for the work item, and provide the database request to a database server. The database request represents one of the multiple database operations and includes the connection identifier. The database server may determine that the connection identifier corresponds to the physical connection, add the request to a connection queue associated with the physical connection, and execute requests from the connection queue against the database via the physical connection.

Abstract: A method may include storing, in a first database table, a first set of configuration data and a second set of configuration data for a software application. A first condition for activating the first set of configuration data and a second condition for activating the second set of configuration data may be stored in a second database table. A database view may be generated to include the first set of configuration data from the first database table and the first condition from the second database table. The first set of configurations may be activated in response to determining, based on the database view, that the first condition for activating the first set of configurations is present. The second set of configuration data may be deactivated in response to the activating of the first set of configuration data. Related systems and articles of manufacture, including computer program products, are also provided.

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: Structure data is received from a database. The structured data may comprise data values and specifying relationships among the data values. A method is provided to include receiving selections of operations to be performed on the structured data and an order of the operations. The operations may include at least one permutation operation. The method may include determining a graphically displayable data format based on the selections of operations. The method may include representing the structured data and the relationships among the data values in the graphically displayable data format. The method may comprise performing operations according to the selections, including, permuting entries of the graphically displayable data format. The permuting may comprise bringing the entries of the graphically displayable data format into a logical order while maintaining the relationships. The method may also include displaying the entries for analysis after performing the operations.

Abstract: Systems and methods include determination of an augmented view of a source system to be created in a target system, the augmented view including a structured query language view and annotations, and the augmented view associated with an object hierarchy, determination of a structured query language statement to create the augmented view in the source system, conversion of the structured query language statement to include augmented view names and augmented view field names, modification of one or more session context variables of the converted structured query language statement, creation of a target augmented view in the target system using the converted and modified structure query language statement, and creation of each object of the object hierarchy which is not an augmented view in the target system.

Abstract: A method and system including at least one application, wherein a data storage is associated with each application; a de-duplication module; a de-duplication processor in communication with the de-duplication module and operative to execute processor-executable process steps to cause the system to: receive a data storage for each of the at least one application, wherein a first data storage and a second data storage include a same record or the one data storage includes two or more of the same record; separate the records into a key portion and a data portion; assign an internal key to each record, wherein the internal key is stored in both the key portion and the data portion for that record; calculate a golden record including golden record values; assign a golden record internal key to the golden record; replace each internal key in the key portion with the golden record internal key; and remove the data portion of each data record where the internal key in the data portion is different from the internal k

Abstract: Methods, systems, and computer-readable storage media for receiving, by a database connector having a taint extension, a SQL request from an application, sending, by the taint extension, the SQL request to a SQL parser, receiving, by the taint extension, a structural representation of the SQL request from the SQL parser, adding, by the taint extension, taint information corresponding to data within the SQL request to provide an enhanced SQL statement, and transmitting, by the database connector, the enhanced SQL statement to a database for storing the taint information with the data.

Abstract: Disclosed herein are system, method, and computer program product embodiments for converting column loadable data in a database into a page loadable format. When a column oriented in-memory database needs to perform an operation on a table, the affected columns must be loaded fully into memory. In some cases, a database may partition tables, allowing for column fragments corresponding to those partitions to be loaded into memory. These column fragments may exceed available memory, such that it is beneficial to convert the column fragment into a page loadable format. Approaches are discussed herein for performing the conversion without the need to update global metadata during the process, allowing for multiple parallel column fragments to be updated, allowing data manipulation language (DML) operations to continue on the column during the conversion process, and reducing the impact of blocked parallel savepoint operations during the conversion process by chunking the conversion process.

Abstract: A method, a system, and a computer program product for executing a query in a database system. A query plan for execution of a query is generated. The query requires access to at least one table stored in a database system. One or more occurrences of one or more duplicate predicates is detected in the query plan. In response to detecting a first occurrence of the duplicate predicates, one or more intermediate query execution results responsive to the duplicate predicates are generated. The generated intermediate query execution results are cached. Query execution results incorporating cached intermediate query execution results being responsive to each occurrence of the duplicate predicates subsequent to the first occurrence of the duplicate predicates in the query plan are generated.

Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in a federated database system or in a cache of a database management system of a central computing system. When data associated with the virtual table is requested, or prior to receiving the request, the data can be stored in a table in the cache. The logical pointer can be updated to reference the cache. If the cache is full, the table can be removed from the cache, and the logical pointer can be updated to reference a table at the federated database system.

Abstract: Systems, methods, and computer media for blockchain-based communication between applications are provided herein. Using a blockchain-based multi-application communication platform, different applications can create and interact with trusted records. A trusted record represents something quantified and/or tracked through an application. Trusted records are stored in a blockchain. Trusted records can be created by one application and accessed by other applications through the platform. Interactions of the different applications with a trusted record are also stored in the blockchain. The immutability of information stored in the blockchain ensures that the trusted records can in fact be trusted, ensures that interactions with trusted records are memorialized, and removes uncertainty as to which application's records are correct.