Design and implementation of clustered in-memory database

Abstract

An in-memory database system and method for administrating a distributed in-memory database, comprising one or more nodes having modules configured to store and distribute database partitions of collections partitioned by a partitioner associated with a search conductor. Database collections are partitioned according to a schema. Partitions, collections, and records, are updated and removed when requested by a system interface, according to the schema. Supervisors determine a node status based on a heartbeat signal received from each node. Users can send queries through a system interface to search managers. Search managers apply a field processing technique, forward the search query to search conductors, and return a set of result records to the analytics agents. Analytics agents perform analytics processing on a candidate results records from a search manager. The search conductors comprising partitioners associated with a collection, search and score the records in a partition, then return a set of candidate result records after receiving a search query from a search manager.

What is claimed is: 
     
         1 . A system comprising:
 a first node storing a plurality of records of an in-memory database;   a second node receiving a search query from a client;   a third node receiving the search query from the second node, querying the records based on the search query, identifying a record from the records, determining a score for the record, and sending a search result to the second node, wherein the search result links to the record based on the score satisfying a threshold value; and   a fourth node receiving the search result from the second node, generating a file containing a content derived from the search result, wherein each of the first node, the third node, and the fourth node is a distinct node.   
     
     
         2 . The system of  claim 1 , wherein the second node is distinct from the first node, the third node, and the fourth node. 
     
     
         3 . The system of  claim 1 , wherein the fourth node identifies a data linkage in the search result, wherein the record is a first record containing a first content, wherein the records comprise a second record containing the second content, wherein the data linkage correlates the first content and the second content. 
     
     
         4 . The system of  claim 1 , further comprising:
 a fifth node receiving a heartbeat signal from at least one of the first node, the second node, the third node, or the fourth node, wherein the heartbeat signal comprises a node status, wherein the fifth node supervises the at least one of the first node, the second node, the third node, or the fourth node.   
     
     
         5 . The system of  claim 4 , wherein the fifth node sends a configuration file to at least one of the first node, the second node, the third node, or the fourth node based on the sixth node determining the configuration to be misconfigured. 
     
     
         6 . The system of  claim 4 , further comprising:
 a sixth node monitoring a status based on the heartbeat signal received via the fifth node, wherein the status is of a configuration at least one of the first node, the second node, the third node, or the fourth node.   
     
     
         7 . The system of  claim 6 , wherein the status is monitored via a tree stored at least one of local or remote from the sixth node. 
     
     
         8 . The system of  claim 7 , wherein the fifth node is distinct from the sixth node. 
     
     
         9 . The system of  claim 1 , further comprising:
 a fifth node partitioning a collection of the records into a partition according to the schema file and sending the partition to the first node according to the schema file such that the first node stores the records in a fragmented manner according to the schema file, wherein the partition contains the records.   
     
     
         10 . The system of  claim 1 , further comprising:
 a fifth node partitioning a collection of the records into a partition according to a schema file and sending the partition to the first node according to the schema file, wherein the partition contains the records.   
     
     
         11 . A method comprising:
 storing, by a first node, a plurality of records of an in-memory database;   receiving, by a second node, a search query from a client;   in response to receiving, by a third node, the search query from the second node, querying, by the third node, the records based on the search query, identifying, by the third node, a record from the records, determining, by the third node, a score for the record, and sending, by the third node, a search result to the second node, wherein the search result links to the record based on the score satisfying a threshold value; and   in response to receiving, by a fourth node, the search result from the second node, generating, by the fourth node, a file containing a content derived from the search result, wherein each of the first node, the third node, and the fourth node is a distinct node.   
     
     
         12 . The method of  claim 11 , wherein the second node is distinct from the first node, the third node, and the fourth node. 
     
     
         13 . The method of  claim 11 , wherein the fourth node identifies a data linkage in the search result, wherein the record is a first record containing a first content, wherein the records comprise a second record containing the second content, wherein the data linkage correlates the first content and the second content. 
     
     
         14 . The method of  claim 11 , further comprising:
 receiving, by a fifth node, a heartbeat signal from at least one of the first node, the second node, the third node, or the fourth node, wherein the heartbeat signal comprises a node status, wherein the fifth node supervises the at least one of the first node, the second node, the third node, or the fourth node.   
     
     
         15 . The method of  claim 14 , wherein the fifth node sends a configuration file to at least one of the first node, the second node, the third node, or the fourth node based on the sixth node determining the configuration to be misconfigured. 
     
     
         16 . The method of  claim 14 , further comprising:
 monitoring, by a sixth node, a status based on the heartbeat signal received via the fifth node, wherein the status is of a configuration at least one of the first node, the second node, the third node, or the fourth node.   
     
     
         17 . The method of  claim 16 , wherein the status is monitored via a tree stored at least one of local or remote from the sixth node. 
     
     
         18 . The method of  claim 17 , wherein the fifth node is distinct from the sixth node. 
     
     
         19 . The method of  claim 11 , further comprising:
 partitioning, by a fifth node, a collection of the records into a partition according to the schema file; and   sending, by the fifth node, the partition to the first node according to the schema file such that the first node stores the records in a fragmented manner according to the schema file, wherein the partition contains the records.   
     
     
         20 . The method of  claim 11 , further comprising:
 partitioning, by a fifth node, a collection of the records into a partition according to a schema file; and   sending, by the fifth node, the partition to the first node according to the schema file, wherein the partition contains the records.