BufferedDataStore Implementation

The following implementation features several key changes:

1) Buffer records in memory and discard the buffer if the file is already in the Data Store. This allows for very fast processing of duplicate files with small overhead for files that do not collide.
2) Use of read/write locks so that multiple records can be submitted simultaneously without blocking, but will be blocked if there are deletions occurring.
3) Less synchronization in general.