Abstract: Methods and apparatus, including computer program products, are provided for data pulls. In some implementations, a method may be provided which includes accessing an object to determine whether a prior pull request is at least one of an a restricted type or an unrestricted type; generating, when the prior pull request is determined to be of the unrestricted type and successful, a pull request including a time stamp obtained from the object; generating, when the prior pull request is determined to be at least one of the restricted type or unsuccessful, a pull request including at least one of a selection criteria and another time stamp obtained from the object, the other time stamp representing a prior successful pull request; sending, by a first processor, the generated pull request to a second processor having master data to obtain an update to data at the first processor.

Abstract: This disclosure provides various embodiments of software for identifying and utilizing a generic update module with recursive calls. In one aspect, the software receives packed update parameters for updating a data record in a database, unpacks the update parameters, and updates the data record in the database using the unpacked update parameters. In some implementations, the update parameters may comprise a packed long byte string. The software may update the data record by returning the unpacked update parameters to a business application for database execution.

Abstract: This disclosure provides various embodiments of software for identifying and utilizing a generic update module with recursive calls. In one aspect, the software receives packed update parameters for updating a data record in a database, unpacks the update parameters, and updates the data record in the database using the unpacked update parameters. In some implementations, the update parameters may comprise a packed long byte string. The software may update the data record by returning the unpacked update parameters to a business application for database execution.

Abstract: This disclosure provides various embodiments of software for identifying and utilizing a generic update module with recursive calls. In one aspect, the software receives packed update parameters for updating a data record in a database, unpacks the update parameters, and updates the data record in the database using the unpacked update parameters. In some implementations, the update parameters may comprise a packed long byte string. The software may update the data record by returning the unpacked update parameters to a business application for database execution.

Abstract: Systems and processes may access data in various graph structures, often including data models that do not partially or fully utilize relations such as hierarchical graphs. For example, software for processing this non-relational data identifies a data model that includes a plurality of nodes independent of relations, each non-root node storing an identifier of the particular node's parent. The software then processes the data model using a generic graph service that utilizes nodes and relations. In some cases, such data models may include hierarchical graph structures and one or more of the nodes may be a recursive node.

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: A computer system may receive an instruction to perform an action on an object. A schedule manager may identify a set of processes associated with the action that need to be performed by the computer system. A subset of primary process and a subset of secondary processes may be identified from the set of processes associated with the action. The schedule manager may schedule an asynchronous process to perform the subset of secondary processes on the object. The computer system may perform the subset of primary processes on the object. The subset of secondary process may be performed by the asynchronous process based upon the scheduling.

Abstract: This disclosure provides various embodiments of software for utilizing a common database layout. In one aspect, a first database table having a first layout and a generic index is accessed using a first instance of a query, and a second database table having a second layout and the generic index is accessed using a second instance of the query. Some implementations may have a generic index that consists of a globally unique identifier. Other implementations may have a generic index that is a combination of database table fields. In some implementations, the first and second database tables may be resident in a first data repository, and the software may access a third database table having a third layout and the generic index using a third instance of the query, wherein the third database table is resident in a second data repository.

Abstract: This disclosure provides various embodiments of software for identifying and utilizing a generic update module with recursive calls. In one aspect, the software receives packed update parameters for updating a data record in a database, unpacks the update parameters, and updates the data record in the database using the unpacked update parameters. In some implementations, the update parameters may comprise a packed long byte string. The software may update the data record by returning the unpacked update parameters to a business application for database execution.

Abstract: This disclosure provides various embodiments of software for utilizing a common database layout. In one aspect, a first database table having a first layout and a generic index is accessed using a first instance of a query, and a second database table having a second layout and the generic index is accessed using a second instance of the query. Some implementations may have a generic index that consists of a globally unique identifier. Other implementations may have a generic index that is a combination of database table fields. In some implementations, the first and second database tables may be resident in a first data repository, and the software may access a third database table having a third layout and the generic index using a third instance of the query, wherein the third database table is resident in a second data repository.

Abstract: Systems and processes may access data in various graph structures, often including data models that do not partially or fully utilize relations such as hierarchical graphs. For example, software for processing this non-relational data identifies a data model that includes a plurality of nodes independent of relations, each non-root node storing an identifier of the particular node's parent. The software then processes the data model using a generic graph service that utilizes nodes and relations. In some cases, such data models may include hierarchical graph structures and one or more of the nodes may be a recursive node.