Abstract: A method to search for at least one relationship pattern in a plurality of runtime artifacts is provided. The method may include detecting at least one data manipulation statement in the plurality of runtime artifacts. The method may also include extracting at least one relationship clause from the detected at least one data manipulation statement. The method may further include parsing the extracted at least one relationship clause. The method may include generating at least one normalized syntax tree based on the parsed at least one relationship clause. The method may also include performing a classification and a snippet discovery on the generated at least one normalized syntax tree.

Abstract: A database query is received that includes a logical query indicator at a distributed database node within a distributed network of databases. The logical query indicator includes at least one physical database query and at least one database node identifier that allows at least one distributed database node to identify at least one physical database to execute the physical database query against. It is determined that the at least one database node identifier matches a local node identifier. The at least one physical database query is executed against at least one local physical database table. A local query response is formed including data retrieved from the at least one local physical database table. The database query is responded to with at least the local query response.

Abstract: A database query is received that includes a logical query indicator at a distributed database node within a distributed network of databases. The logical query indicator includes at least one physical database query and at least one database node identifier that allows at least one distributed database node to identify at least one physical database to execute the physical database query against. It is determined that the at least one database node identifier matches a local node identifier. The at least one physical database query is executed against at least one local physical database table. A local query response is formed including data retrieved from the at least one local physical database table. The database query is responded to with at least the local query response. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Abstract: This invention relates to a system, method and computer program product for replicating triplestore data from generic data records including: a plurality of triplestore mapping operations; a record reader for listening for data events from the generic data record and for matching each data event to one or more triplestore mapping operations; a processor for generating equivalent triples for each located data event by applying the matched triplestore mapping operation; and a data sink for receiving generated equivalent triples so that the triplestore data is synchronized in real time with the generic data records.

Abstract: Various embodiments of the invention relate to optimizing storage of schema-less data. A schema-less dataset including a plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A graph coloring operation is performed on the graph. The graph coloring operation includes assigning each of nodes to a color, where nodes connected by an edge are assigned different colors. A schema is generated that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph based on the color assigned to the node.

Abstract: A method for propagating a query in a system made up of a number connectable database management system nodes, where each node is associated at least one database, includes: selecting a first node from the number of nodes; generating at least one connection operable to propagate a query from the first node to a first subset of the number of nodes; generating at least one connection operable to propagate a query from a second node in the first subset to a second subset of the plurality of nodes; where at least one node in the second subset is different from nodes in the first subset.

Abstract: A method of operating a hypercube network of processing devices includes determining that a plurality of the processing devices are storing data to be processed at a single processing device, obtaining the addresses of the plurality of processing devices storing the data to be processed, determining the most common number for each digit of the addresses of the plurality of processing devices storing the data to be processed, generating a new address comprising the determined most common number for each digit, and transferring the data to be processed to the processing device with the generated new address.

Abstract: Method and system are provided for assessing response routes in a network of connected nodes wherein a querying node propagates a query through multiple routes of intermediate nodes to a data source node and the data source node returns data to the querying node. The method at a data source node may include: receiving a query instance including metadata with route information of the route of intermediate nodes in the network that the query instance has travelled through from a querying node to the data source node; comparing the route information to a route policy; and responding to a query instance which meets the route policy by returning the query response via the route of intermediate nodes of the query instance.

Abstract: In general, the present disclosure describes techniques for detecting changes in demographic data of a customer based on energy consumption data of the customer. For example, a customer data management system receives energy consumption data of a customer and detects, based at least in part on the received energy consumption data of the customer, a change in demographic data associated with the customer. The customer data management system then outputs, based at least in part on the detecting, at least one demographic change report associated with the demographic data.

Abstract: In general, the present disclosure describes techniques for detecting changes in demographic data of a customer based on energy consumption data of the customer. For example, a customer data management system receives energy consumption data of a customer and detects, based at least in part on the received energy consumption data of the customer, a change in demographic data associated with the customer. The customer data management system then outputs, based at least in part on the detecting, at least one demographic change report associated with the demographic data.

Abstract: A method includes providing a columnar database comprising a plurality of columnar data structures associated with one column attribute; providing first data records having a plurality of first attribute-value pairs comprising counting information indicative of a number of first data records having the respective first attribute-value pair; providing mask data structures comprising one or more second attribute-value pairs; selecting second data records by intersecting the columnar data structures and the mask data structures; selecting one of the column attributes and one value contained in the column data structure associated with said selected column attribute as the destination attribute-value pair; creating one second rule for each first attribute-value pair; calculating, for each second rule, a co-occurrence-count between its respective source attribute-value pair and its destination attribute-value pair; and specifically selecting one or more of said second rules as the first rules in dependence on the

Abstract: Predictive analysis relating to nodes of a communication network is carried out by providing communication event information for a first set of nodes and a second set of nodes of the communication network, providing a set of attributes for the nodes of the first set, using the attributes and the communication event information for determining a set of groups among the first set of nodes, assigning each node of the second set to at least one group of the set of groups based at least on the communication event information available for the second group, the assigning resulting in membership information of the nodes of the second set, and deriving or applying a prediction model for the second set of nodes based on the communication event information for the second set and the membership information.

Abstract: A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Abstract: Various embodiments of the invention relate to optimizing storage of schema-less data. A schema-less dataset including a plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A graph coloring operation is performed on the graph. The graph coloring operation includes assigning each of nodes to a color, where nodes connected by an edge are assigned different colors. A schema is generated that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph based on the color assigned to the node.

Abstract: A logical table definition is received as part of a database query within a distributed database system. A determination is made as to whether the received logical table definition matches a local logical table definition. The query is processed in response to determining that the received logical table definition matches the local logical table definition. The query is forwarded to at least one other distributed database node.

Abstract: A method for managing a logical statement within a distributed database includes checking, responsive to receipt of a first logical statement for by first database management system node, whether the first logical statement is stored within a segment of the distributed database; and storing, responsive to a determination that the first logical statement is not stored within a segment of the distributed database, storing the first logical statement in at least one of non-unique fact table and unique fact table.

Abstract: A computer receives a transaction request that includes information identifying computer resource requirements for the transaction, a resource policy, and a transaction failure policy. The computer determines if sufficient computer resources are available to complete the transaction request based on the received information identifying resource requirements for the transaction. If there are not sufficient computer resources available to complete the transaction request, the computer applies the resource policy to the transaction request and processes the transaction request. If the processed transaction request fails to complete successfully, the computer applies the transaction failure policy to the processed transaction request.

Abstract: A database query is received including a logical table identifier at a distributed database node within a distributed network of databases. The logical table identifier includes a dynamically-updatable constant column identifier. Local logical table definitions are filtered based upon the logical table identifier and the dynamically-updatable constant column identifier to identify a local logical table associated with the logical table identifier and the dynamically-updatable constant column identifier. A local query response is formed including data retrieved from a local physical database table mapped by the local logical table in response to identifying the local logical table associated with the logical table identifier and the dynamically-updatable constant column identifier. The database query is responded to, in response to forming the local query response, with at least the local query response.

Abstract: Methods and systems are provided, for persistent querying in a federated database system. A federated database system has a plurality of connectable database management system nodes, each database node having at least one database. Persistent querying includes: receiving a query at a first database node and propagating the query from the first database node to other database nodes in the federated database system. A responding database node satisfying the query: obtains a query results set; defines a topic identifier for the query; and publishes subsequent messages relating to the topic identifier when data updates are available. The first database node receives query results sets from one or more responding nodes and the first database node subscribes to topic identifiers for publications of subsequent messages from the responding database nodes. Subsequent messages are published relating to the query along the connection through which the query is returned.

Abstract: A method includes providing a columnar database comprising a plurality of columnar data structures associated with one column attribute; providing first data records having a plurality of first attribute-value pairs comprising counting information indicative of a number of first data records having the respective first attribute-value pair; providing mask data structures comprising one or more second attribute-value pairs; selecting second data records by intersecting the columnar data structures and the mask data structures; selecting one of the column attributes and one value contained in the column data structure associated with said selected column attribute as the destination attribute-value pair; creating one second rule for each first attribute-value pair; calculating, for each second rule, a co-occurrence-count between its respective source attribute-value pair and its destination attribute-value pair; and specifically selecting one or more of said second rules as the first rules in dependence on the