Abstract: A method, according to one embodiment, includes identifying data to be stored in one or more tables within a predetermined portion of a partitioned storage in one of a plurality of nodes, the predetermined portion having at least one replica, and where no two identical replicas reside on a single node; assigning an identifier and a data storage hierarchical level to the data; mapping the data to an index and storing the data in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the predetermined portion and recording a write operation into a transaction log of the node; receiving a plurality of write operations; and combining a plurality of write tasks of the predetermined portion for a predetermined time period.

Abstract: A method, according to one embodiment, includes identifying data received or generated by one of a plurality of nodes; replicating the data to a plurality of storage components; receiving, at a first node of the plurality of nodes, a request for the data; determining that a cache of the first node does not include the data; identifying a second node of the plurality of nodes that has an identifier indicating that the data is stored in the second node; requesting that the second node of the plurality of nodes service the request; determining that the second node of the plurality of nodes has not responded to the request; identifying a third node of the plurality of nodes that has the identifier; requesting that the third node of the plurality of nodes service the request; retrieving the response to the request; and providing the data to the first node.

Abstract: A method, according to one embodiment, includes identifying data to be stored in one or more tables within a predetermined portion of a partitioned storage in one of a plurality of nodes, the predetermined portion having at least one replica, and where no two identical replicas reside on a single node; assigning an identifier and a data storage hierarchical level to the data; mapping the data to an index and storing the data in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the predetermined portion and recording a write operation into a transaction log of the node; receiving a plurality of write operations; and combining a plurality of write tasks of the predetermined portion for a predetermined time period.

Abstract: A computer-implemented method according to one embodiment includes identifying data to be stored in one or more tables on a bucket, where the bucket is an allocation of a partitioned storage in a node of one or more nodes of a swarm database, the bucket having at least one replica, and where no two identical bucket replicas reside on a single node, assigning an identifier and a data storage hierarchical level to the data, mapping the data to an index and storing the data in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the bucket and recording a write operation into a transaction log of the node, receiving a plurality of write operations, and combining a plurality of write tasks of the bucket for a predetermined time period.

Abstract: A method of managing a database system that includes a swarm database with nodes of processors and memory. The memory stores programs that can be executed on the processors. Determining data files to delete, moving the data files to delete to a trash directory, truncating using a trash daemon, larger files to delete to smaller sized file pieces and deleting the smaller sized file pieces by a local operation system.

Abstract: A method of requesting a search query to be displayed in a web browser. The method includes receiving search terms and slash operators and generating results based on the search terms and slash operators.

Abstract: A method, according to one embodiment, includes identifying data received or generated by one of a plurality of nodes; replicating the data to a plurality of storage components; receiving, at a first node of the plurality of nodes, a request for the data; determining that a cache of the first node does not include the data; identifying a second node of the plurality of nodes that has an identifier indicating that the data is stored in the second node; requesting that the second node of the plurality of nodes service the request; determining that the second node of the plurality of nodes has not responded to the request; identifying a third node of the plurality of nodes that has the identifier; requesting that the third node of the plurality of nodes service the request; retrieving the response to the request; and providing the data to the first node.

Abstract: A method of managing a database system using a swarm database system that communicates a request to read data to at least a subset of nodes. Checking the identifier by each respective node in the subset of nodes to determine if the requested read data is stored in the node. Providing the read data to the first node if the respective node in the subset includes read data.

Abstract: A method, according to one embodiment, includes receiving, at a first node of a distributed database system from one or more caller nodes of the distributed database system, a predetermined number of service tasks to add to a value in a row stored in the distributed database system at a write daemon. Additionally, a time of receipt of the predetermined number of service tasks is recorded. Further, the predetermined number of service tasks are combined to a single row in the distributed database system at the write daemon. Further still, a number of operations to attend to the predetermined number of service tasks is reduced by sending the predetermined number of service tasks to at least two bucket daemons on at least two other nodes of the distributed database system.

Abstract: A method, according to one embodiment, includes storing programs to be executed by a distributed database system having three or more nodes. At a first node of the distributed database system, an N number of service tasks to add to a value in a row stored in the distributed database system at a write daemon are received from one or more caller nodes. The N number of service tasks are combined to a single row in the distributed database system at the write daemon. A number of service tasks to attend to the N number of requests is reduced by sending the N number of requests to at least two other bucket daemons on at least two other nodes that combine the N number of service tasks and executing the reduced number of service tasks in accordance with an order associated with a time of receipt.

Abstract: A method of organizing a data in a database system using a swarm database system that has one or more nodes comprising one or more processors and memory, the memory of the one or more nodes storing one or more programs to be executed by the one or more processors. Identifying data to store in one or more tables on a bucket, wherein the bucket is a allocation of a partitioned storage in a node of the one or more nodes. Assigning to each of the identified data an identifier and a data storage hierarchical level of a plurality of hierarchical levels.

Abstract: A method, according to one embodiment, includes storing programs to be executed by a distributed database system having three or more nodes. At a first node of the distributed database system, an N number of service tasks to add to a value in a row stored in the distributed database system at a write daemon are received from one or more caller nodes. The N number of service tasks are combined to a single row in the distributed database system at the write daemon. A number of service tasks to attend to the N number of requests is reduced by sending the N number of requests to at least two other bucket daemons on at least two other nodes that combine the N number of service tasks and executing the reduced number of service tasks in accordance with an order associated with a time of receipt.

Abstract: A method of managing a database system that receives N number of requests from one or more nodes in the database system. The N requests are combined before initiating operations to attend to the requests. The number of operations to attend to the requests is reduced and this reduced number of operations is executed.

Abstract: A method of increasing the speed of disk reading and writing operations in a database by using nodes of memory and processors where the memory stores programs to be executed by the processors. The data in the database is separated into one or more buckets and at least two replicas of each bucket of data are stored in different storage devices of the nodes. Determining a subset of storage devices that will be dedicated to writing, while keeping at least one replica of each bucket dedicated to reading and dedicating at least a substantial portion of the remaining storage devices to reading.

Abstract: A method of counting items in a database system. The database system having nodes comprising processors and memory where the memory stores programs to be executed by the processors. Identifying and counting M unique number of items. Determining and storing a logcount for M unique items.

Abstract: A method of increasing the speed of disk reading and writing operations in a database by using nodes of memory and processors where the memory stores programs to be executed by the processors. The data in the database is separated into one or more buckets and at least two replicas of each bucket of data are stored in different storage devices of the nodes. Determining a subset of storage devices that will be dedicated to writing, while keeping at least one replica of each bucket dedicated to reading and dedicating at least a substantial portion of the remaining storage devices to reading.

Abstract: A method of counting items in a database system. The database system having nodes comprising processors and memory where the memory stores programs to be executed by the processors. Identifying and counting M unique number of items. Determining and storing a logcount for M unique items.

Abstract: A method of managing a database system using a swarm database system that communicates a request to read data to at least a subset of nodes. Checking the identifier by each respective node in the subset of nodes to determine if the requested read data is stored in the node. Providing the read data to the first node if the respective node in the subset includes read data.

Abstract: A method of managing a database system that receives N number of requests from one or more nodes in the database system. The N requests are combined before initiating operations to attend to the requests. The number of operations to attend to the requests is reduced and this reduced number of operations is executed.

Abstract: A method of organizing a data in a database system using a swarm database system that has one or more nodes comprising one or more processors and memory, the memory of the one or more nodes storing one or more programs to be executed by the one or more processors. Identifying data to store in one or more tables on a bucket, wherein the bucket is a allocation of a partitioned storage in a node of the one or more nodes. Assigning to each of the identified data an identifier and a data storage hierarchical level of a plurality of hierarchical levels.