Abstract: Various embodiments for a triple integration and querying system are described herein. An embodiment operates by identifying a plurality of triples corresponding to a knowledge graph, and generating a table in a database into which to import the set of triples. The table includes a subject column, a predicate column, and multiple object columns across different datatypes. Values from the triples of the knowledge graph are loaded into the table and a query is executed on the table.

Abstract: A method for executing a query may include generating a partition value identifier for a partitioned table. The partitioned table may include a main fragment including a main dictionary storing a first value and a main value identifier corresponding to the first value and a delta fragment including a delta dictionary storing a second value and a delta value identifier corresponding to the second value. The partition value identifier may be set based at least in part on the first value and the second value. The generated partition value identifier and a corresponding one of the main value identifier and the delta value identified may be maintained as part of a mapping. A query to group data stored in the partitioned table may be received. The query may be executed by at least using the mapping.

Abstract: Various embodiments for a triple integration and querying system with dictionary compression are described herein. An embodiment operates by identifying a table of a database with four or more columns with triple formatted data including one subject column, one predicate column, and two or more object columns. It is determined that a master dictionary is to be generated for the both the subject column and the predicate column based on an identical datatype being used for both columns. A subject data dictionary and a predicate data dictionary are generated. A unique value is assigned a same unique identifier a in both the object data dictionary and the subject data dictionary. A master dictionary including both the unique values from the subject data dictionary and the predicate data dictionary is generated. Values in the subject column and the predicate column are replaced based on the unique values from the master dictionary.

Abstract: Various embodiments for a triple integration and querying system are described herein. An embodiment operates by identifying a plurality of triples corresponding to a knowledge graph, and generating a table in a database into which to import the set of triples. The table includes a subject column, a predicate column, and multiple object columns across different datatypes. Values from the triples of the knowledge graph are loaded into the table and a query is executed on the table.

Abstract: A method for executing a query may include generating a partition value identifier for a partitioned table. The partitioned table may include a main fragment including a main dictionary storing a first value and a main value identifier corresponding to the first value and a delta fragment including a delta dictionary storing a second value and a delta value identifier corresponding to the second value. The partition value identifier may be set based at least in part on the first value and the second value. The generated partition value identifier and a corresponding one of the main value identifier and the delta value identified may be maintained as part of a mapping. A query to group data stored in the partitioned table may be received. The query may be executed by at least using the mapping.

Abstract: A method for executing a query may include generating a partition value identifier for a partitioned table. The partitioned table may include a main fragment including a main dictionary storing a first value and a main value identifier corresponding to the first value and a delta fragment including a delta dictionary storing a second value and a delta value identifier corresponding to the second value. The partition value identifier may be set based at least in part on the first value and the second value. The generated partition value identifier and a corresponding one of the main value identifier and the delta value identified may be maintained as part of a mapping. A query to group data stored in the partitioned table may be received. The query may be executed by at least using the mapping.

Abstract: Various examples are directed to systems and methods optimizing database queries. A database management system may receive a first query comprising a plurality of query expressions. The database management system may determine that a first expression of the first query is nullable and that the first expression is null preserving. The database management system may generate optimized query code for the first query. The optimized query code may comprise a first code segment and a conditional jump instruction. The first code segment that, when executed by a processor, may cause the processor to perform operations comprising determining a value of the first expression. The conditional jump instruction may, when executed by the processor, cause the processor to perform operations comprising: skipping execution of at least a portion of the first code segment and returning null for the first expression.

Abstract: Technologies are provided for scaling applications via application scenarios. Portions of application resource content stored in a database are associated with application scenarios. The portions of the resource content associated with an application scenario are replicated to one or more computing nodes associated with the application scenario. Requests associated with the application scenario are transmitted to the one or more one or more computing nodes, where they are processed using the replicated portions of the resource content associated with the application scenario.

Abstract: Techniques are described for efficient execution of analytical queries on large amounts of data in a parallel database cluster while making maximal use of the available hardware.

Abstract: Technologies are provided for scaling applications via application scenarios. Portions of application resource content stored in a database are associated with application scenarios. The portions of the resource content associated with an application scenario are replicated to one or more computing nodes associated with the application scenario. Requests associated with the application scenario are transmitted to the one or more one or more computing nodes, where they are processed using the replicated portions of the resource content associated with the application scenario.

Abstract: Technologies are provided for scaling applications via application scenarios. Portions of application resource content stored in a database are associated with application scenarios. The portions of the resource content associated with an application scenario are replicated to one or more computing nodes associated with the application scenario. Requests associated with the application scenario are transmitted to the one or more one or more computing nodes, where they are processed using the replicated portions of the resource content associated with the application scenario.

Abstract: A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition.

Abstract: Disclosed herein are system, method, and computer program product embodiments for fault tolerant communications in a distributed system. An embodiment operates by determining a failure of a first node of a cluster of a plurality of nodes. Prior to the failure, a second node transmitted a first message to the first node. The second node determines content corresponding to the first message. A third node to which to provide the content of the first sub-task is identified. A second message, including content corresponding to the first message, is transmit to the third node.

Abstract: Various examples are directed to systems and methods optimizing database queries. A database management system may receive a first query comprising a plurality of query expressions. The database management system may determine that a first expression of the first query is nullable and that the first expression is null preserving. The database management system may generate optimized query code for the first query. The optimized query code may comprise a first code segment and a conditional jump instruction. The first code segment that, when executed by a processor, may cause the processor to perform operations comprising determining a value of the first expression. The conditional jump instruction may, when executed by the processor, cause the processor to perform operations comprising: skipping execution of at least a portion of the first code segment and returning null for the first expression.

Abstract: Disclosed herein are system, method, and computer program product embodiments for fault tolerant communications in a distributed system. An embodiment operates by determining a failure of a first node of a cluster of a plurality of nodes. Prior to the failure, a second node transmitted a first message to the first node. The second node determines content corresponding to the first message. A third node to which to provide the content of the first sub-task is identified. A second message, including content corresponding to the first message, is transmit to the third node.

Abstract: Aggregating input into hashtables using just-in-time compilation of compilable code in response to a database query. Compilable code can be generated that is configured to cause a programmable processor to produce one or more hashmaps based on the input database. The one or more hashmaps can correspond to each individual thread from the input. The compilable code can be configured to cause the one or more processors to insert the hashmaps into a scheduler. Compilable code can be generated that is configured to: aggregate elements from the one or more hashmaps into buckets of elements having the same partition identity; rehash the buckets of elements having the same partition identity to reduce the number of groups within the bucket; facilitate the merger of all non-empty elements from each target-partition into a merged-partition.

Abstract: The invention relates to a method and apparatus for inspecting an aircraft fuel tank. The invention also relates to an aircraft fuel tank including an inspection apparatus. The invention provides an aircraft fuel tank, the aircraft fuel tank containing a robotic device. The robotic device is arranged to be movable within the aircraft fuel tank. The robotic device further comprises a sensor for inspecting the aircraft fuel tank.

Abstract: Technologies are provided for scaling applications via application scenarios. Portions of application resource content stored in a database are associated with application scenarios. The portions of the resource content associated with an application scenario are replicated to one or more computing nodes associated with the application scenario. Requests associated with the application scenario are transmitted to the one or more one or more computing nodes, where they are processed using the replicated portions of the resource content associated with the application scenario.

Abstract: A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition.

Abstract: Aggregating input into hashtables using just-in-time compilation of compilable code in response to a database query. Compilable code can be generated that is configured to cause a programmable processor to produce one or more hashmaps based on the input database. The one or more hashmaps can correspond to each individual thread from the input. The compilable code can be configured to cause the one or more processors to insert the hashmaps into a scheduler. Compilable code can be generated that is configured to: aggregate elements from the one or more hashmaps into buckets of elements having the same partition identity; rehash the buckets of elements having the same partition identity to reduce the number of groups within the bucket; facilitate the merger of all non-empty elements from each target-partition into a merged-partition.