Abstract: A method and system for staged compilation of a declarative program that includes receiving the declarative program, parsing and semantically checking the declarative program, translating the declarative program into a relational algebra machine (RAM) using a modified semi-naïve algorithm, performing a translation of the RAM into code of an imperative programming language to obtain a translated RAM, generating specialized extractor code in the imperative programming language, generating query application programming interface (API) code in the imperative programming language, and compiling the translated RAM, the specialized extractor code, and the query API code to obtain a program analysis module.

Abstract: A method and system for for staged compilation of a declarative program that includes receiving the declarative program, parsing and semantically checking the declarative program, translating the declarative program into a relational algebra machine (RAM) using a modified semi-naïve algorithm, performing a translation of the RAM into code of an imperative programming language to obtain a translated RAM, generating specialized extractor code in the imperative programming language, generating query application programming interface (API) code in the imperative programming language, and compiling the translated RAM, the specialized extractor code, and the query API code to obtain a program analysis module.

Abstract: Methods and apparatus, including computer program products, are provided for providing for processing calculation plans. In one aspect, there is provided a computer-implemented method. The method may include generating a calculation plan including a plurality of nodes; determining whether at least one of the nodes includes a function node; and compiling the function node into executable code to enable execution of the plurality of nodes including the function node at the database. Related apparatus, systems, methods, and articles are also described.

Abstract: According to some embodiments, a plurality of interconnected entities may be discovered in a network landscape. A subset of the entities may then be automatically consolidated into a business participant, the consolidating may performed in accordance with at least one rule based algorithm. A business process landscape, including the business participant, may then be generated and/or displayed to an operator.

Abstract: A computer program product tangibly embodied in a computer readable storage device includes a business network meta model comprising entity objects configured to generate interactive representations of a business network, including at least a business application representation and an information technology representation.

Abstract: According to some embodiments, a plurality of interconnected entities may be discovered in a network landscape. A subset of the entities may then be automatically consolidated into a business participant, the consolidating may performed in accordance with at least one rule based algorithm. A business process landscape, including the business participant, may then be generated and/or displayed to an operator.

Abstract: According to some embodiments, a plurality of interconnected entities may be discovered in a network landscape. A subset of the entities may then be automatically consolidated into a business participant, the consolidating may performed in accordance with at least one rule based algorithm. A business process landscape, including the business participant, may then be generated and/or displayed to an operator.

Abstract: Methods and apparatus, including computer program products, are provided for providing for processing calculation plans. In one aspect, there is provided a computer-implemented method. The method may include generating a calculation plan including a plurality of nodes; determining whether at least one of the nodes includes a function node; and compiling the function node into executable code to enable execution of the plurality of nodes including the function node at the database. Related apparatus, systems, methods, and articles are also described.

Abstract: According to some embodiments, a plurality of interconnected entities may be discovered in a network landscape. A subset of the entities may then be automatically consolidated into a business participant, the consolidating may performed in accordance with at least one rule based algorithm. A business process landscape, including the business participant, may then be generated and/or displayed to an operator.

Abstract: A computer program product tangibly embodied in a computer readable storage device includes a business network meta model comprising entity objects configured to generate interactive representations of a business network, including at least a business application representation and an information technology representation.

Abstract: Systems and methods in accordance with the present invention provide for an implementation of the XQuery standard, and such an implementation will be referred to herein as an XQuery (XML Query language) implementation. An XQuery implementation can be based on a token stream representation, which allows large XML documents to be processed without having to first read the entire document. An XQuery implementation can also utilize a streaming XQuery engine. A set of algorithms and a set of rewrite rules can be used for the implementation. Given a query, a set of rules can be applied to that query to transform the query into another query. Some of these rules allow the resulting query to be streamable. In other words, a query that would otherwise require an XML document to be read into memory can now be transformed into a query that can work on an XML stream. The type system of the XQuery language can be based on XML Schema, and the basic types of XML Schema can have derived types.

Abstract: Systems and methods in accordance with the present invention provide for an implementation of the XQuery standard, and such an implementation will be referred to herein as an XQuery (XML Query language) implementation. An XQuery implementation can be based on a token stream representation, which allows large XML documents to be processed without having to first read the entire document. An XQuery implementation can also utilize a streaming XQuery engine. A set of algorithms and a set of rewrite rules can be used for the implementation. Given a query, a set of rules can be applied to that query to transform the query into another query. Some of these rules allow the resulting query to be streamable. In other words, a query that would otherwise require an XML document to be read into memory can now be transformed into a query that can work on an XML stream. The type system of the XQuery language can be based on XML Schema, and the basic types of XML Schema can have derived types.