| Patent application number | Description | Published |
|---|
| 20090077036 | PROPAGATING A QUERY IN A FEDERATED DATABASE - 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. | 03-19-2009 |
| 20090077075 | MANAGEMENT OF LOGICAL STATEMENTS IN A DISTRIBUTED DATABASE ENVIRONMENT - 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. | 03-19-2009 |
| 20090083379 | Enabling connections for use with a network - An apparatus for enabling connections for use with a network comprising at least one vertex, the apparatus comprising: a receiver, for receiving a first message associated with the first vertex, wherein the first message comprises an indication that the first vertex wishes to join the network; a generator, responsive to receipt of the first message, for generating a second message associated with the at least one vertex, wherein the second message comprising an indication that the at least one vertex is operable to connect to the first vertex; and a probabilistic component for determining a first time value associated with transmission of the second message to the first vertex in accordance with probabilistic data. | 03-26-2009 |
| 20100094851 | NODE-LEVEL SUB-QUERIES IN DISTRIBUTED DATABASES - 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. | 04-15-2010 |
| 20100094862 | AUTOMATED QUERY PATH REPORTING IN DISTRIBUTED DATABASES - 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. | 04-15-2010 |
| 20100094892 | AUTOMATED PROPAGATION OF NON-CONFLICTING QUERIES IN DISTRIBUTED DATABASES - A logical table definition is received in association with 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. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract. | 04-15-2010 |
