Abstract: A query relationship data structure (RELSTRUCT) generator configured to select a plurality of queries, each query structured for application against a database to yield a query result. The RELSTRUCT generator includes a query analyzer configured to identify query parts of individual queries, and determine for each query, a relation, if any, of an included query part to any query part of remaining queries of the plurality of queries. The RELSTRUCT generator also may create, for each query, a query relationship data structure in which the query is related to at least one other query of the plurality of queries, based on the determined relation of a query part of the query and a query part of the at least one other query of the plurality of queries.

Abstract: A system, a method, and a computer program product for deploying objects are disclosed. A file containing a plurality of artifacts for deploying during runtime of an application is defined. At least one dependency for at least one artifact in the plurality of artifacts is determined based on the defined file. A database object for implementation during runtime of the application is created based on the determined dependency. At least one change to the database object during runtime of the application is implemented. The artifact is deployed during runtime of the application based on the implemented change to the database object.

Abstract: A method and system for time dependent search is described. A search manager may receive a query for time dependent information relating to a base object and a time period. The search manager may search a search optimized storage system of technical objects for a technical object that matches the query. Each technical object may include a reference to time dependent information stored by a base object and a validity period. The validity period for each technical object is chosen by time stretching logic such that valid time dependent information is available for all time periods.

Abstract: Methods, systems, and computer program products for creating a customized runtime environment are described. One or more runtime environment capabilities are determined based on a profile. One or more runtime bundles corresponding to the one or more runtime environment capabilities are identified and the identified runtime bundles are assembled.

Abstract: Methods, computer-readable media and systems are disclosed for building, deploying, operating, and maintaining an intelligent dynamic form in which a trained machine learning (ML) model is embedded. A universe of questions is associated with a plurality of output classifiers, which could represent eligibilities for respective benefits. The questions are partitioned into blocks. Each block can be associated with one or more of the classifiers, and each classifier can have a dependency on one or more blocks. An ML model is trained to make inferences from varied combinations of responses to questions and pre-existing data, and determine probabilities or predictions of values of the output classifiers. Based on outputs of the trained model, blocks of questions can be selectively rendered. The trained model is packaged with the question blocks and other components suitably for offline deployment. Uploading collected responses and maintenance of the dynamic form are also disclosed.

Abstract: Disclosed herein are system, method, and computer program product embodiments for distributed transaction processing in massively parallel processing (MPP) databases. An embodiment operates by receiving a transaction including a read timestamp corresponding to a version of data of a database associated with the query. It is determined whether a locally stored portion of the data of the database has a local timestamp that is equivalent to or after the read timestamp. A lock may be requested, and if received, the data is updated.

Abstract: A system for memory allocation and deallocation with a multi-level memory map is provided. In some implementations, the system performs operations comprising allocating a memory map for addressing a plurality of memory locations in a heap, the memory map comprising a root node, one or more second-level nodes, and a plurality of third-level nodes. The plurality of third-level nodes can comprise third entries for pointing to the memory locations and/or the one or more second-level nodes can comprise a plurality of second entries corresponding to the plurality of third-level nodes. The operations can further include determining a location to store data within the heap and/or tracking the location by placing a pointer within a third-level node of the plurality of third-level nodes and incrementing a counter corresponding to the third-level node. Related systems, methods, and articles of manufacture are also described.

Abstract: Some embodiments provide a program that receives, from a first sensor, a first set of sensor data that the first sensor detects from a first set of signal-transmitting devices. The program receives, from a second sensor, a second set of sensor data that the second sensor detects from a second set of signal-transmitting devices. The program processes the first set of sensor data to determine a first set of potential locations and a corresponding first set of location metrics associated with the first set of potential locations. The program processes the second set of sensor data to determine a second set of potential locations and a corresponding second set of location metrics associated with the second set of potential locations. The program identifies a location from the first and second sets of potential locations as a location of the device based on the first and second sets of location metrics.

Abstract: A system and method for modeling service endpoints of BPMN processes is disclosed. The process is modeled using a BPMN modeling tool. A service endpoint is modeled using the BPMN modeling tool. A uniform resource locator (URL) is generated for the service endpoint, the URL being a web-based address under which a service represented by the process can be called by a business process application. The service endpoint is linked to the process, and then service-provisioned to be executed in the BPMN domain.

Abstract: Prioritization criteria can be applied to assign a priority ranking to server processes executed by a backend server, and a utilization of the backend server by server demands can be quantified. Upon determining that the quantified utilization of the backend server has reached or exceeded one or more determined limits on backend utilization, at least a lowest priority server process can be throttled based on one or more throttling parameters.

Abstract: A system and method for generating dynamic user interfaces that retrieve, at a backend UI server, one or more user requests originating from an information management application, retrieving, at the backend UI server, a data response originating from a data server in response to the one or more user requests, calculate, at the backend UI server, relevance values for each display component of the information management application, append the calculated relevance values to the data response, transmit the calculated relevance values and the data response to a frontend UI server; and generate, at the frontend UI server, a user interface for the information management application based on the calculated relevance values.

Abstract: A regular language for XML, next generation (RNG) file referencing an RNG schema file is obtained. Subsequently, the referenced RNG schema file is stored in a file directory structure matching a reference definition of the schema in the RNG file. Based on the RNG file, a first nonextensible schema and a first extensible schema are generated each corresponding to the referenced RNG schema file. Related apparatus, systems, techniques and articles are also described.

Abstract: Allocation within a database environment is performed by processing a sequence of steps, each of which is described by an allocation processing block. The allocation processing block receives three inputs (input tables or input view) and computes a result. Related apparatus, systems, techniques and articles are also described.

Abstract: A request is received to change a first, current encryption root key used to encrypt and decrypt a set of data in a database. A new, second encryption root key is generated. The second encryption root key is stored in a secured area in disk storage as a new current encryption root key. The first encryption root key is maintained in the secured area as a historical encryption root key. New root key version information that identifies the new, second encryption root key is generated and stored as current root key version information. A request is received to encrypt the set of data. The second encryption root key is identified as the current encryption root key based on the current root key version information. The second encryption root key is used to encrypt the set of data to create an encrypted set of data.

Abstract: Methods and apparatus are disclosed for supporting the addition of new instances of database objects and relationships, for a relational database environment that can be partially represented as a graph of fields (columns) of database tables. For a new instance of a graph element (node or edge) to be spawned, the element is classified into one of several use cases. Each database table is analyzed based on its key and non-key fields, according to use-case-dependent rules, to determine whether it should be augmented with a new entry for the new element instance. If yes, then the database table can be augmented, or can be marked for augmentation upon a subsequent request for a new instance of the graph element. Efficient and reliable growth of large and complex relational databases is enabled. Examples are provided across a wide range of domains. Certain variants are also disclosed.

Abstract: Innovations in performing sort operations for dictionary-compressed values of columns in a column-store database using value identifiers (“IDs”) are described. For example, a database system includes a data store and an execution engine. The data store stores values at positions of a column A dictionary maps distinct values to corresponding value IDs. An inverted index stores, for each of the corresponding value IDs, a list of those of the positions that contain the associated distinct value. The execution engine processes a request to sort values at an input set of the positions and identify an output set of the positions for sorted values. In particular, the execution engine iterates through positions stored in the lists of the inverted index. For a given position, the execution engine checks if the given position is one of the input set and, if so, adds the given position to the output set.

Abstract: A plurality of data sources accessed by a software program are automatically determined by a compliance tool. At least a portion of the data sources are automatically associated with one or more formalized compliance terms using the compliance tool. At least a portion of the data sources is analyzed by the compliance tool using at least one formalized compliance norm that include at least one of the one or more formalized compliance terms to provide compliance results. The compliance results are output to a user.

Abstract: A telecommunication system, a computer-implemented method, and a computer readable medium having stored thereon a computer executable program code for processing data related to monitoring and controlling of a network providing resources to users is disclosed herein.

Abstract: A method, implemented at least in part by a computing device, for software upgrade analysis includes receiving a selection of at least one object class of a plurality of available object classes. One or more application programming interface (API) calls may be retrieved from a plurality of API calls based on the received selection. A test definition may be generated based at least in part on the one or more API calls. A first test may be executed by using the one or more API calls in the test definition within a software environment. The first test is run on the software environment prior to upgrading the environment. Subsequent to upgrading the environment, a second test is executed by using the one or more API calls within the upgraded software environment. A software upgrade report is generated based on a comparison of test results from the first and second tests.

Abstract: A candidate position selector determines locations for M candidate positions along pathways within an area defining potential routes for moving objects within the area. A coverage rate calculator calculates a coverage rate for a device layout of N media capture devices among the M candidate positions, including calculating the coverage rate as a ratio of the moving objects captured by the N media capture devices in the device layout to a total number of the moving objects in the area within a defined period of time. A layout selector iteratively tests different device layouts of the N media capture devices among the M candidate positions, based on corresponding coverage rates calculated by the coverage rate calculator for each tested device layout, until a termination condition is reached and a final device layout of the tested device layouts is selected.