Abstract: Embodiments extend the relational model and language of standard SQL, to recognize features of higher level entity-relationship models (ERMs). SQL extensions implemented in the data design language (DDL) incorporate Entities (and Views) having custom-defined/semantic structure, rather than being limited to primitive types (e.g. flat tables as in standard SQL). Entities are defined similar to structured types with an underlying persistency, but with a uniquely identifying leading key. In DDL, these entities are combined with associations in the data model. The associations of the extended SQL reflect relationships between entities in the ERM. Associations are specified by adding an element to a source entity, with an association type pointing to a target entity. This may be complemented by providing optional information (e.g., cardinality, keys, filter conditions), up to a complete JOIN condition. In the query language (QL), JOINs may be replaced by the use of simple path expressions.

Abstract: A method includes processing a transaction on an in memory database where data being processed has a validity time, updating a time dependent data view responsive to the transaction being processed to capture time validity information regarding the data, and storing the time validity information in a historization table to provide historical access to past time dependent data following expiration of the validity time.

Abstract: A computer system includes at least one processor and at least one memory operably coupled to the at least one processor. The memory includes a memory pool and a database partitioned into multiple fragments. Each of the fragments is allocated a block of memory from the memory pool and the fragments store compressed data in a columnar table format. A database operation is applied in a compressed format to the compressed data in at least one of the fragments.

Abstract: Embodiments extend the relational model and language of standard SQL, to recognize features of higher level entity-relationship models (ERMs). Annotation language is implemented in the data design language (DDL) to incorporate tables and entities Using DDL, annotations are typed structures of metadata. Annotations may be used for types, entities and elements. In the query language (QL), annotations may be added to the standard QL. A reflection program may use the metadata of the annotation language for reflection on the tables or entities.

Abstract: In an example embodiment, roles within a job based security model are refactored to roles within a task oriented security model. The task oriented security model comprises task roles, which allow access to functionality and data, and enabler roles, which provide limits on the scope of the task roles. Data such as user assignment data, role to functionality mapping, functionality authorization objects, user identity and organizational data may be combined and normalized to create a mapping of users to functionality and organizational data. A refactoring engine may then examine the map to identify new candidate roles using contiguous regions of the map. Tuning parameters and constraints allow tuning of the candidate roles, and statistical metrics allow evaluation of the candidate roles. Candidate roles may be tested and applied in the new system.

Abstract: A database language is extended to define constraints on a data model (e.g., entity-relationship model) rather than the concrete database. The constraints can be declarative (e.g., constraints that are defined using expressions of the database language) or programmatic (e.g., constraints that are defined as a stored procedure implemented in a domain specific language). By storing the constraints at a higher level than the database level, the constraints can be performed without changing the persistency of the database. Also disclosed are techniques for handling of constraints on partially loaded entities.

Abstract: A database language (e.g. SQL) is extended to define a transient field whose value is derived from data stored in a database. The value of the transient field is calculated by the database engine for consumption as needed by the application layer, for example as part of a particular data model. The value of the transient field may not be materialized as a persistent field in the underlying database table, or may be selectively materialized based upon a heuristic or hint. Certain embodiments may implement the transient field as a basic elaboration on standard SQL utilizing an identifier. Some embodiments may implement the transient field as an entity where SQL has been extended to accommodate concepts of a higher-level Entity Relationship Model (ERM). The use of constants and/or floating values (e.g. a current time) in connection with transient fields, is also disclosed.

Abstract: A technique is described for generating error buffer that includes errors from both a program and event handlers called by the program. A program in an event-driven environment triggers an event. In response to the triggered event, the program calls event handlers related to the event. The event handlers are executed and error messages generated during the execution are stored in a local error buffer. Upon completion of the event handlers, the local error buffers are returned to the program and the program merges the local error buffers with an error buffer associated with the program.

Abstract: Techniques are described for expressing a constraint in a host language. A constraint can be defined in the host language as an event handler. The event handler can be registered to a built-in event associated with an object of the database that the constraint is intended to validate. When the object triggers the built-in event, the event handler is called to execute the constraint. Exemplary built-in events include onSave (trigger the event when the object is saved), onValidate (trigger the event when an explicit call to validate the object is detected), onInsert (trigger the event when the object is inserted), onUpdate (trigger the event when the object is updated), and onCheckBeforeSave (trigger the event when the object is checked prior to saving).

Abstract: Embodiments extend the relational model and query language to recognize features of tables and higher level entity-relationship models (ERMs). Extension language is implemented in the data design language (DDL) to incorporate tables, entities (and views) having custom-defined/semantic structure, rather than being limited to primitive types (e.g. flat tables as in standard SQL). The extension language includes an indication that a query is to include all active elements for each table extension or entity extension that is active. The extension language can be chained to extend a table or entity that has been extended.

Abstract: Disclosed are techniques employed alone or in combination, to further enhance a database language and improve conciseness and comprehensiveness of query statements in application code. Embodiments may build upon an initial extension of database language to accommodate concepts of entity-relationship models (ERMs). That initial extension may include entities with structured types, and named associations. One technique modifies SQL to allow the SELECT command to specify element path expressions based upon a relationship (e.g. named associations between ERM elements). Another technique modifies SQL to introduce filter expressions suffixed to associations within path expressions, thus improving adherence to the principle of locality within query statements. Yet another technique allows a shorthand to “factor out” association path prefixes, thereby avoiding lengthy lists of path expressions in order to read several elements from the same nested structure or a same target entity behind a single association.

Abstract: An in memory database system includes a random access memory to store an in memory database table, a stored set of defined views over the database tables, a stored set of analytical services adapted to provide transaction services and database warehouse services, an engine to run the analytical services on the database table, and an interface to interact with users and provide access to the engine, analytical services, and views to perform transactions and data warehouse functions on the database table.

Abstract: In an example embodiment a market data management system allows users to track information regarding commodities. A representative market data management system comprises physical commodity objects including a plurality of fields that describe a real world commodity, market identifier objects including market identifier codes, and contract specification objects including a plurality of fields that describe a derivative contract specification for a particular commodity traded at a particular commodity market. In the data model, a one to many relationship may exist for a physical commodity object and contract specification objects (e.g., a given commodity may be traded according to different derivative contract specifications). The data model may also allow a many to many relationship between contract specification objects and market identifier objects (e.g.

Abstract: A cross system analytics system includes sets of in memory database tables stored on random access memory of the system. Each set of tables corresponds to data from a different source system to provide separation of data from each source system. A separate in memory database schema for each set of tables corresponds to each source system. A replication system is coupled to provide replication of data from the source systems into the sets of in memory database tables. An analytics engine executes cross system views of data in the sets of tables to provide a cross system central and consistent view for reporting and analyzing data for an organization having multiple systems with different database schemas.

Abstract: Techniques allow automatic identification of statistically significant attribute combinations in a dataset, and provide users with an understanding thereof including starting points for further analysis. Statistically significant combinations may be obtained from large data sets by limiting combinations to four or fewer attributes. The combinations obtained may be ranked to differentiate patterns, e.g. according to factors such as error ratio, decision tree depth, occurrences, and number of attributes. Still further insights may be achieved by ranking attributes according to the number of statistically significant combinations in which they appear. For useful visualization of statistically significant information within the patterns, only those having at least one measure/numeric may analyzed for further insight (e.g. by an outlier algorithm) and presented as output in a chart (e.g. pie, bar) form.

Abstract: According to some embodiments, a source version of a software product may be established in connection with a software production landscape. A first container, representing a first uniquely addressable physical location in the software production landscape, may then be associated with the source version. An executable derivative version of the software product may be built from the source version, and a second container, representing a second uniquely addressable physical location in the software production landscape, may be associated with the executable derivative version. Software configuration information may then be automatically provided to a user based at least in part on a relationship between the first and second containers at a given point in time.

Abstract: The subject matter disclosed herein provides, methods and apparatus, including computer program products for the management of a view of a data structure. In one aspect, there is provided a method that may include generating a view of a data structure. The data structure and the view may include a plurality of nodes and at least one association. This method may further include determining, at run time, whether the generated view is invalid based on an indicator. The indicator may represent whether a change has occurred to a system including the view. This method may further include deleting, at run time, the view based on the results of the determining. Related apparatus, systems, techniques and articles are also described.

Abstract: Various embodiments include at least one of systems, methods, and software for automated deployment of a deployment template to computing systems. Some embodiments include receiving a selection of a deployment template from an entity via a network, identifying platforms of the entity compatible with the compatibility information, receiving a selection of a target platform, validating the selected deployment template for deployment to the selected platform, and deploying the selected deployment template to the selected platform. The validation of the selected deployment template for deployment to the selected platform may include transmitting a validation data request to an agent that executes on the selected platform to obtain validation data related to at least one validation rule, receiving validation data in response to the validation data request, and applying the at least one validation rule to the received validation data to determine validation success or failure.

Abstract: In an aspect, the present application relates to a computer-implemented method, computer system, and computer program product for (automatically) generating reusable test components to test software applications. The computer-implemented method for generating reusable test components to test software applications may comprise: accessing an object model relating to at least part of a software application; and generating at least one test component applicable to test the software application, comprising: analyzing the object model, generating a meta-description from the object model and store the meta information in at least one descriptor according to a meta model, and generating the test component and a corresponding component implementation based on the descriptor.

Abstract: Technologies are disclosed for pruning a dependency graph representing source artifacts compilable by a plurality of compilers. The dependency graph can include strongly connected components represented as a directed acyclic graph. During compilation of the source artifacts, it can be discovered that some source artifacts did not need to be compiled, and associated nodes in the dependency graph can be pruned. Pruning can result in removal of nodes for source artifacts that are yet to be compiled, and compilation for source artifacts associated with such nodes in the dependency graph can be avoided.