Abstract: A computerized method useful for node cluster formation and management in a distributed database system includes the step of providing a set of database nodes in a database cluster. Each node of the set of database nodes comprises a cluster management module, a heartbeat module, and a globally unique node identifier. The cluster management module manages cluster membership by maintaining a succession list. The succession list comprises a list of all current members in the database cluster. The heartbeat module communicates a pulse message to every other node in the set of database nodes. The method includes the step of maintaining, with each heartbeat module of each database node, an adjacency list.

Abstract: In one embodiment, a computer-implemented method of a distributed database system included the step of providing a query processor to receive a query request and to chart out a query execution plan based on the query request. The method includes the step of providing a data generator to generate a digest list based on the query request, wherein the list of digests comprises each stream or filter applied in servicing the query request. The method includes the step of providing a query engine to obtain a digest list from a multiple-data source as a result of the query request and to filter the digest list. The method includes the step of providing a query worker to obtain the query request and process the query request based on a type of the query request. The method includes the step of providing one or more query worker threads to perform an asynchronous I/O operation for the query request.

Abstract: A computerized method useful for node cluster formation and management in a distributed database system includes the step of providing a set of database nodes in a database cluster. Each node of the set of database nodes comprises a cluster management module, a heartbeat module, and a globally unique node identifier. The cluster management module manages cluster membership by maintaining a succession list. The succession list comprises a list of all current members in the database cluster. The heartbeat module communicates a pulse message to every other node in the set of database nodes. The method includes the step of maintaining, with each heartbeat module of each database node, an adjacency list.

Abstract: In one exemplary embodiment, a method includes allocating an arena block of a shared memory of a database node server. The arena block is divided into one or more slots. The one or more slots include a discreet and constant area of memory within the arena block. Each slot is assigned a constant-memory address relative to an arena-block's shared memory address. The index is implemented as a red-black tree data structure. Each red-black tree node is mapped to a slot. Each red-black-tree node is provided a pointer to one or more neighbor nodes. The index stored in shared memory can be used during a ‘warm’ rebooting process.

Abstract: In one exemplary embodiment, a method includes the step of executing, with at least one processor, a main database node server in a source-database node of a source-database cluster. The main database node server manages database server operations. The main database node server communicates a source-database cluster state and a specified server operation metadata to a data-shipping daemon. The specified server operation metadata, includes an information about server operation occurring on the source-database node. Another step includes executing a data-shipping daemon in the source-database node. The data-shipping daemon receives the specified server operation metadata and stores the specified server operation metadata in a digest log. The data log includes a file of the specified server operation metadata. The data-shipping daemon reads the digest log and communicate data referred to in the specified server operation metadata in the digest log to a destination database node in a destination database cluster.

Abstract: In one embodiment, a computer-implemented method of a distributed database system included the step of providing a query processor to receive a query request and to chart out a query execution plan based on the query request The method includes the step of providing a data generator to generate a digest list based on the query request, wherein the list of digests comprises each stream or filter applied in servicing the query request. The method includes the step of providing a query engine to obtain a digest list from a multiple-data source as a result of the query request and to filter the digest list. The method includes the step of providing a query worker to obtain the query request and process the query request based on a type of the query request. The method includes the step of providing one or more query worker threads to perform an asynchronous I/O operation for the query request.

Abstract: In one exemplary embodiment, a method includes the step of executing, with at least one processor, a main database node server in a source-database node of a source-database cluster. The main database node server manages database server operations. The main database node server communicates a source-database cluster state and a specified server operation metadata to a data-shipping daemon. The specified server operation metadata, includes an information about server operation occurring on the source-database node. Another step includes executing a data-shipping daemon in the source-database node. The data-shipping daemon receives the specified server operation metadata and stores the specified server operation metadata in a digest log. The data log includes a file of the specified server operation metadata. The data-shipping daemon reads the digest log and communicate data referred to in the specified server operation metadata in the digest log to a destination database node in a destination database cluster.

Abstract: In one exemplary embodiment, a method includes allocating an arena block of a shared memory of a database node server. The arena block is divided into one or more slots. The one or more slots include a discreet and constant area of memory within the arena block. Each slot is assigned a constant-memory address relative to an arena-block's shared memory address. The index is implemented as a red-black tree data structure. Each red-black tree node is mapped to a slot. Each red-black-tree node is provided a pointer to one or more neighbor nodes. The index stored in shared memory can be used during a ‘warm’ rebooting process.

Abstract: Embodiments include a method, apparatus and computer program product for executing a database transaction in parallel using subtransactions. The method includes receiving a transaction at an application, the transaction having a first statement and a second statement, and determining whether operation of the first statement is independent from operation of the second statement. When it is determined that operation of the first statement is independent from operation of the second statement, assigning the first statement to a first subtransaction and the second statement to a second subtransaction, the first and second subtransactions being part of a transaction group. The method further includes executing the subtransactions using resources of the database. Finally, when execution of all of the subtransactions have successfully completed, committing all of the subtransactions.

Abstract: Systems, methods, computer program product embodiments are provided for maintaining transaction consistency for distributed transactions in a distributed shared disk cluster environment. An embodiment includes utilizing broadcast messaging among the plurality of instances to identify at least one of a transaction and a transaction owner instance for a transaction request. Execution of the transaction occurs on an owner instance as found based on a response to the broadcast messaging.