[MNEMONIC-104] Create a Durable Map

• Type: New Feature
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Affects Version/s: 0.6.0-incubating
• Fix Version/s: 0.6.0-incubating
• Component/s: Collection
• Assignee: Johnu George
• Reporter: Gordon King
• Due: 30/Apr/17
• Created: 26/Aug/16 16:53
• Updated: 14/Mar/17 23:34
• Resolved: 14/Mar/17 23:34

Description

A durable map (DM) would be a general key structure of Mnemonic collections. the durable map should be able to be recovered from any kind of memory services e.g. volatile/non-volatile without doing heavily serDe operations, in addition, DM is required to load its data lazily to amortize memory/IO/CPU consumption. at the first stage, the DM could be implemented using most feasible approach, e.g. Hashmap, and not necessary to comply with the interface of Java Map, but the Key/Value of DM should support generic types as Durable list does.
the DM aims to manage huge amount of mutable key-value datasets, so the design of Durable map should be flexible enough as possible to accommandate future optimizations.

Sub-Tasks

• Implement GET/PUT/DELETE Map operations: Closed
• Implement Iterators for bulk operations: Closed
• Adding Testcases for durable buffers and chunks: Closed