Hierarchical diff files

• US 9,607,085 B2
• Filed: 12/16/2011
• Issued: 03/28/2017
• Est. Priority Date: 06/19/2009
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Peters, Keith, Dole, Bryn Robert, Markson, Michael, Saliba, Robert Michael, Skrenta, Rich, Truel, Robert N., Lindahl, Gregory B.
• Primary Examiner(s): Yen, Syling
• Application Number:
  US13/328,648
• Publication Number:
  US 20120158800A1
• Time in Patent Office: 1,929 Days
• Field of Search: 707/200, 707/802, 707/812, 707/999.003, 709/212, 709/234, 709/219, 711/122
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2228 Indexing structures
• CPC Class Codes: G06F 16/2282 Tablespace storage structures; Management thereof
• CPC Class Codes: G06F 16/24554 Unary operations; Data partitioning operations
• CPC Class Codes: G06F 16/2462 Approximate or statistical queries
• CPC Class Codes: G06F 16/273 Asynchronous replication or reconciliation
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

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.

Claims

1. A method of organizing data in a database system comprising:

via a swarm database having 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 an allocation of a partitioned storage in a node of the one or more nodes, the bucket having at least one replica and no two of the same bucket replicas reside on the same node; and

assigning to each of the identified data an identifier and a data storage hierarchical level of a plurality of hierarchical levels, wherein the plurality of hierarchical levels includes;

a first level indicative of the oldest data in the one or more tables on the bucket,

a second level indicative of newer stored data in the one or more tables on the bucket, and

a third level indicative of the most recent stored data in the one or more tables on the bucket;

mapping to an index and storing each of the data in accordance with the index and assigned hierarchical level, the storing including writing data to a row in a table on the bucket of a node of the one or more nodes by a writer daemon and recording a write operation of the writing into a transaction log of the node;

receiving write operations from the writer daemon; and

combining write tasks of a bucket for a predetermined time period by a bucket daemon.

2. The method of claim 1, wherein the writer daemon delays the writing operation to a respective bucket to collect additional write operations designated to the same respective bucket.

3. The method of claim 1, wherein the predetermined time period is determined by the time period for the bucket daemon to collect write operations that meet a predetermined file size.

4. The method of claim 1, wherein the bucket daemon writes the data in the collected write operations to the third hierarchical level;

merges the data stored as the third hierarchical level to the second hierarchical level after a first predetermined time period; and

merges the data of the second hierarchical level to the first hierarchical level after a second predetermined time period.

5. The method of claim 4, further comprising:

designating a merging limit value to one or more tables on the bucket, wherein the merging limit value is indicative of a level of the plurality of hierarchical levels; and

limiting the merging of files in accordance with the designated merging limit value by refraining from merging data files in the next level once the merge limit value level is met.

6. The method of claim 5, further comprising, storing a bloom filter

for row keys for each hierarchical level;

and

consulting the bloom filter to determine whether a given row key is to be found in a given hierarchical level of storage.

7. The method of claim 1, wherein combining write tasks of a bucket further includes metering the combined write tasks.

8. A system for organizing data in a database system comprising:

a swarm database having at least two nodes, each node having one or more processors and memory, each node in communication with one another and configured to,

receive data;

assign to the received data an identifier and a data storage hierarchical level, wherein the hierarchical levels include;

a first level indicative of the oldest data in one or more tables on the bucket;

a second level indicative of newer stored data in the one or more tables on the bucket, and

a third level indicative of the most recent stored data in the one or more tables on the bucket;

map the data to an index;

store the data on a bucket in one of the nodes, in accordance with the mapped index and assigned hierarchical level, including writing data to a row in a table on the bucket of a node of the one or more nodes by a writer daemon and recording a write operation of the writing into a transaction log of the node,

wherein the bucket is a unique allocation of a partitioned data storage in each node, the bucket having at least one replica and no two of the same bucket replicas reside on the same node; and

copy the data in a replica of the bucket,

wherein the replica of the bucket is located on a node different than the bucket;

receive write operations from the writer daemon; and

combine write tasks of a bucket for a predetermined time period by a bucket daemon.

9. The system of claim 8 wherein the bucket replica is dedicated to reading.

10. The system of claim 8 wherein the bucket replica is dedicated to writing.