Abstract: In some implementations, a device may receive data associated with a set of taxonomies, wherein a taxonomy, of the set of taxonomies, represents a classification of a set of relationships of data entries of the data. The device may integrate the set of taxonomies to generate a meta-taxonomy of the data. The device may generate a data graph of the data based on integrating the set of taxonomies to generate the meta-taxonomy, wherein the data graph is based on a graph-based search model that is associated with at least one of: taxonomy-based filtering, metadata attribute prioritization, or semantic matching. The device may store the data graph.

Abstract: In some implementations, a device may receive data associated with a set of taxonomies, wherein a taxonomy, of the set of taxonomies, represents a classification of a set of relationships of data entries of the data. The device may integrate the set of taxonomies to generate a meta-taxonomy of the data. The device may generate a data graph of the data based on integrating the set of taxonomies to generate the meta-taxonomy, wherein the data graph is based on a graph-based search model that is associated with at least one of: taxonomy-based filtering, metadata attribute prioritization, or semantic matching. The device may store the data graph.

Abstract: In some implementations, a device may receive data associated with a set of taxonomies, wherein a taxonomy, of the set of taxonomies, represents a classification of a set of relationships of data entries of the data. The device may integrate the set of taxonomies to generate a meta-taxonomy of the data. The device may generate a data graph of the data based on integrating the set of taxonomies to generate the meta-taxonomy, wherein the data graph is based on a graph-based search model that is associated with at least one of: taxonomy-based filtering, metadata attribute prioritization, or semantic matching. The device may store the data graph.

Abstract: A transaction verification method is provided, including: obtaining transaction information, and generating verification identification information according to the transaction information; storing the verification identification information as a leaf node in a verification block having a tree structure; obtaining root node information of the verification block and a verification path of the verification identification information in the verification block; and sending the verification identification information, the root node information, and the verification path to a first transaction party involved in the transaction information, so that the first transaction party verifies the transaction information.

Abstract: A computational engineering modelling tool having a point generation module arranged to read geometry data representing a domain to be modelled. The point generation module also generates point data for the domain having multiple boundary points located on a boundary of the domain and multiple further points spaced from the boundary within the domain. A point mutation module processes the point generation module output and generates automatically a plurality of alternative point data definitions for the domain in which the location of at least one point differs between each of the alternative point definitions. A blocking module discretizes the domain by creating multiple geometric blocks over the domain using a computational geometric operator wherein each point represents a vertex of at least one block. The blocking module outputs a discretized computational model of the domain and the tool scores the model according to a geometric attribute of the blocks.