Jump to: navigation, search

Difference between revisions of "SMILA/Project Concepts/Binary Storage"

(Analyze of hierarchical structure)
(Test Results)
 
(12 intermediate revisions by 2 users not shown)
Line 56: Line 56:
  
 
The hierarchical (tree) structure is being created during the the storage of new data (the initial number of binary data which is going to be persisted is unknown for Binary Storage Service).
 
The hierarchical (tree) structure is being created during the the storage of new data (the initial number of binary data which is going to be persisted is unknown for Binary Storage Service).
 +
 +
''The configurable tree - hierarchic structure algorithm, will not be based on the B-Tree structure since it will get modified very often because of the deleting/inserting records operations (this is specific for b-tree delete/insert operations), so the b-tree structure needs to be update (like moving up in the hierarchy of some leaf-records) in order to keep the tree height balanced. Depending on the level of the b-tree, these "moving/migrating operations" could consist in large operations (which involves the number of records that need to be moved and the size of these records). For example inserting/deleting of simple record needs to re-balance the b-tree structure by moving very large records in a distributed file system.''
  
 
===== Hierarchical structure nomenclature. Test scenario =====
 
===== Hierarchical structure nomenclature. Test scenario =====
Line 219: Line 221:
 
* sub-tree (folder) name length (l = 2, these are the substring-parts starting from the left side of the hashed id, used to build the structure like : "1d", "41", "cd" and "87")
 
* sub-tree (folder) name length (l = 2, these are the substring-parts starting from the left side of the hashed id, used to build the structure like : "1d", "41", "cd" and "87")
  
Because of the starting part of hashed id of different records (which define the hierarchic structure - deterministically calculation) may be different enough, it is very possible that in many cases there will be only single record stored into a deterministically calculated location (since there will be no match, or at least not enough, related to the left part of the hashed IDs - which defines the location where the record is going to be persisted). As a matter of fact, it is possible that a hierarchic structure to contains many subfolders that contain only one subfolder(not deepest level) or single record(deepest level). This my be an issue since most of the file system APIs creates listeners for all these sub-folders in order to provide cache (refresh) functionality, so for single record there will be 5 listeners (4 sub-folders + 1 record) created and memory consumption increases significantly. For example, for storing 540 records, a total number of 977 subfolders will be created.
+
Because of the starting part of hashed id of different records (which define the hierarchic structure - deterministically calculation) may be different enough, it is very possible that in many cases there will be only single record stored into a deterministically calculated location (since there will be no match, or at least not enough, related to the left part of the hashed IDs - which defines the location where the record is going to be persisted). As a matter of fact, it is possible that a hierarchic structure to contains many subfolders that contain only one subfolder(not deepest level) or single record(deepest level). This my be an issue since most of the file system APIs creates listeners for all these sub-folders in order to provide cache (refresh) functionality, so for single record there will be 5 listeners (4 sub-folders + 1 record) created and memory consumption increases significantly.  
 +
 
 +
 
 +
{| border="1"
 +
|-
 +
! style="background-color: #eeeeee; width:12%" | t (number of attachments)
 +
! style="background-color: #eeeeee;width:12%" | n (hierarchy level)
 +
! style="background-color: #eeeeee;width:12%" | l (sub-tree-folder name length )
 +
! style="width:12%" | TF (total number of folders)
 +
|-
 +
! style="background-color: #eeeeee;align:right" | 540
 +
! style="background-color: #eeeeee;align:right" | 4
 +
! style="background-color: #eeeeee;align:right" | 2
 +
! style="align:right" | 977
 +
|-
 +
! style="background-color: #eeeeee;align:right" | 19013
 +
! style="background-color: #eeeeee;align:right" | 4
 +
! style="background-color: #eeeeee;align:right" | 2
 +
! style="align:right" | 54503
 +
|-
 +
|}
  
 
As long as the records number to be stored gets higher, the matching coincidence (the first string part of the hashed IDs that is used by the deterministically calculation) increases and the system becomes more efficient - from the number of records to number of sub-folders report.
 
As long as the records number to be stored gets higher, the matching coincidence (the first string part of the hashed IDs that is used by the deterministically calculation) increases and the system becomes more efficient - from the number of records to number of sub-folders report.
Line 237: Line 259:
 
! style="width:40%" | Disadvantages
 
! style="width:40%" | Disadvantages
 
|-
 
|-
! style="align:left" | Configurable Tree
+
! | Configurable Tree
 
! |  
 
! |  
 
* configurable structure; splits node only when required
 
* configurable structure; splits node only when required
 
* less memory consumption
 
* less memory consumption
 
* better structure control
 
* better structure control
! style="align:left" |  
+
! |  
 +
* mapping between hashed ID and persistence path needs to be stored
 +
* possibility of assync. situations between the existing storage persistence and stored mapping (in case of some external factors alters the persistence storage)
 +
* implementation effort
 +
 
 
|-
 
|-
! style="align:left" | Deterministically Calculation
+
! | Deterministically Calculation
! style="align:left" |  
+
! |  
! style="align:left" |  
+
* deterministically calculation -> no mapping needs to be stored (hashed ID - stored path)
 +
* less implementation effort (almost done)
 +
! |  
 +
* less control of the hierarchic structure
 +
* nodes gets split depending on the matching coincidence between the first string part of the hashed IDs that is used by the deterministically calculation
 +
* memory consumption and faster risk of OutOfMemory occurrence (the file system APIs creates listeners for all these sub-folders in order to provide cache (refresh) functionality, so for single record there will be 5 listeners (4 sub-folders + 1 record) created and memory consumption increases significantly)
 
|-
 
|-
 
|}
 
|}
Line 323: Line 354:
 
== UML Class Diagram ==
 
== UML Class Diagram ==
  
[[Image:SMILA-BinaryStorage-ClassDiagram.jpg]]
+
[[Image:SMILA-BinaryStorage-ClassDiagram.jpg|1024px]]
 +
 
 +
== Test Results ==
 +
 
 +
Following link contains results of tests based on different implementations (simple java.io and EFS).
  
 +
[https://bugs.eclipse.org/bugs/show_bug.cgi?id=254852 https://bugs.eclipse.org/bugs/show_bug.cgi?id=254852]
  
 
[[Category:SMILA]]
 
[[Category:SMILA]]

Latest revision as of 05:04, 18 November 2008

Overview

Design a service to easy store / access binary data documents.

Description

Client components will access the Binary Storage Service for persisting binary data (attachments) into the binary storage. The binary data shall be simply identified by a unique key / identifier as a String data type. No directly client component access to the persistence storage shall be available; the persistence storage will be only accessible through the Binary Storage Service API which provides the needed CRUD operations.

Backend mechanism of Binary Storage shall be completely transparent to the client, thus user shall have the opportunity to setup basic configuration of the service. Binary Storage shall be able to determine and use default/optimistic configuration in case no one is specified by the user.

Storage Mechanism Internal Structure.

Binary Storage will depend on the amount of data it needs to persist/manage. Because of this the persistence storage of service shall be able to deal with fallowing persistence structures/techniques, depending on service configuration:

  • A. File System
    • I. Local hard drive
      • 1. Flat structure
      • 2. Hierarchical structure (configurable tree)
      • 3. Hierarchical structure (deterministically calculation)
      • Analyze of hierarchical structure
    • II. Distributed file system (SFTP, FTP)
      • 1. Flat structure
      • 2. Hierarchical structure (configurable tree)
      • 3. Hierarchical structure (deterministically calculation)
  • B. RDBMS
  • C. Object DataBase (ODBMS)

One of the persistence options will be used by the Binary Storage Service at the running time. Internally, the DAO & DAO Factory concept provides the appropriate/configured persistence option implementation to the Binary Storage Service independently. User can shall configure its appropriate persistence option that satisfies his/her needs.

SMILA-BinaryStorage-HighLevel.jpg

A. File System

Binary Storage Service saves the binary data directly in the file system.

I. Local hard drive

The service saves data in the local drive using a predefined persistence storage location - binary.storage.root.path. Under this root path Binary Storage will create its files system structures flat or hierarchical, depending on the configuration.

1. Flat structure

The file system - flat structure configuration shall be used in case of small amount of data, since all the attachments will be saved in the same path location. For huge amount of data the systems becomes very slow, time responding increases significantly.

This option shall only be used for debugging purpose, since it offers an easy way for locating a specific persisted attachment.

In case of no initial configuration is provided by the user, the file system - flat structure option shall not be used as default.

SMILA-BinaryStorage-Flat.jpg

2. Hierarchical structure (configurable tree)

Through the hierarchical file system persistence, Binary Storage Service will manage by itself a configurable & hierarchically & internal structure under the configured persistence storage root path. This is to be considered the default configuration. Following parameters are available for configuring the hierarchical structure:

  • q - Maximum number of subfolders per folder
  • r - Maximum number of persisted attachments per folder

The hierarchical (tree) structure is being created during the the storage of new data (the initial number of binary data which is going to be persisted is unknown for Binary Storage Service).

The configurable tree - hierarchic structure algorithm, will not be based on the B-Tree structure since it will get modified very often because of the deleting/inserting records operations (this is specific for b-tree delete/insert operations), so the b-tree structure needs to be update (like moving up in the hierarchy of some leaf-records) in order to keep the tree height balanced. Depending on the level of the b-tree, these "moving/migrating operations" could consist in large operations (which involves the number of records that need to be moved and the size of these records). For example inserting/deleting of simple record needs to re-balance the b-tree structure by moving very large records in a distributed file system.

Hierarchical structure nomenclature. Test scenario

Fallowing picture outlines the hierarchic overview, file system nomenclature and binary data distribution (persistence) inside the tree structure. In the illustrated sample , our test scenario uses a total number of attachments to be stored 360. The configuration values are :

q = 3 (maximum 3 subfolders per folder in the hierarchy)
r = 10 (maximum 10 files stored in a folder inside of the hierarchic structure)
t = 360 (total number of attachments-files to be stored)

As it is outlined in the picture, the total number of subfolders from hierarchy structure represents a geometric progression (in mathematics also known as a geometric sequence), where each term (number of folders from the same level of the hierarchy) after the first is found by multiplying the previous one by a fixed non-zero number called the common ratio. The common ration identifies with maximum number of sub-folders per folder - q.

For a optimistic hierarchy, it is possible to determine fallowing parameters in order to configure the hierarchy as user expects:

  • total number of folders from structure (t/r) - 36
  • total number of subfolder at each level from the structure - Bn formula. (b1= 1 folder at the first level; b2=3 folders at the second level; b3=9 folders at the third level; b4=23 folders at the fourth level)
  • total number of subfolders from the hierarchy (in full mode) - Sn formula
  • total number of subfolders from the deepest level : 23 folders, Bn' = Bn - (Sn - t/r). (Bn=27; Sn=40; t/r=36)
  • hierarchy level - n=4 (logarithmical function)

SMILA-BinaryStorage-Hierarchical.jpg

Binary Storage Service has to map each attachment identifier to the path where the binary data is being stored. The mappings needs to be persisted so they can be reused if the system gets restarted.

An external manipulation of persistence storage structure (like deleting data form inside of it) will break the mappings. This is considered an exceptional case and it is not in the Binary Storage Service scope.

Fallowing table provides an overview of the hierarchical structure based on configured parameters:

t (number of attachments) q (max number of subfolders in folder) r (max number of att.in folder) TF (number of folders) n (hierarchical level) Sn (full mode hierarchy) M (missing subfolders in deepest level)
360 3 10 36 4 40 4
1000000 25 200 5000 4 16276 11276
1000000 50 200 5000 4 127551 122551
1000000 75 300 3333 3 5701 2368
1000000 100 300 3333 3 10101 6768
1000000 150 300 3333 3 22651 19318
1000000 200 350 2857 3 40201 37344
1000000 250 500 2000 3 62751 60751
1000000 300 750 1333 3 90301 88968
1000000 100 400 2500 3 10101 7601
1000000 200 500 2000 3 40201 38201
1000000 250 600 1666 3 62751 61085
1000000 300 750 1333 3 90301 88968
1000000 300 1000 1000 3 90301 89301

3. Hierarchical structure (deterministically calculation)

Another solution for building the hierarchical structure uses deterministically calculation based on the hash id, passed by the blackboard service to the Binary Storage Service. The solution comes to avoid storing data into a single path location and to offer a hierarchic structure. The structure will be located under the binary.storage.root.path and it will be build by using parts from the passed hashed id.

i.e. for a passed binary data, having the ID = "1d41cd87e735ceb23fdfafd814366b3ca9816e3dfce6fecc30560f8c242de", the deterministically calculation will assign fallowing path, where the record will be stored:

  binary.storage.root.path\1d\41\cd\87\1d41cd87e735ceb23fdfafd814366b3ca9816e3dfce6fecc30560f8c242de

When using the deterministically calculation all data will be stored at the same hierarchic level.

There are two parameters that could be configured in order to define the deterministically calculation:

  • hierarchy level (in our case n = 4)
  • sub-tree (folder) name length (l = 2, these are the substring-parts starting from the left side of the hashed id, used to build the structure like : "1d", "41", "cd" and "87")

Because of the starting part of hashed id of different records (which define the hierarchic structure - deterministically calculation) may be different enough, it is very possible that in many cases there will be only single record stored into a deterministically calculated location (since there will be no match, or at least not enough, related to the left part of the hashed IDs - which defines the location where the record is going to be persisted). As a matter of fact, it is possible that a hierarchic structure to contains many subfolders that contain only one subfolder(not deepest level) or single record(deepest level). This my be an issue since most of the file system APIs creates listeners for all these sub-folders in order to provide cache (refresh) functionality, so for single record there will be 5 listeners (4 sub-folders + 1 record) created and memory consumption increases significantly.


t (number of attachments) n (hierarchy level) l (sub-tree-folder name length ) TF (total number of folders)
540 4 2 977
19013 4 2 54503

As long as the records number to be stored gets higher, the matching coincidence (the first string part of the hashed IDs that is used by the deterministically calculation) increases and the system becomes more efficient - from the number of records to number of sub-folders report.

Following image, represents a simple sample of hierarchical structure obtained with deterministically calculation. Since accessing (storing and fetching) of records is done based on the hashed ID, there is no necessary to save any mapping between the record and calculated path location.

SMILA-BinaryStorage-HierarchicalCalculation.jpg

The sample, also outlines hashed ID part matching on first hierarchic level which means common usage of some first subfloders level.

Analyze of hierarchical structure

Advantages Disadvantages
Configurable Tree
  • configurable structure; splits node only when required
  • less memory consumption
  • better structure control
  • mapping between hashed ID and persistence path needs to be stored
  • possibility of assync. situations between the existing storage persistence and stored mapping (in case of some external factors alters the persistence storage)
  • implementation effort
Deterministically Calculation
  • deterministically calculation -> no mapping needs to be stored (hashed ID - stored path)
  • less implementation effort (almost done)
  • less control of the hierarchic structure
  • nodes gets split depending on the matching coincidence between the first string part of the hashed IDs that is used by the deterministically calculation
  • memory consumption and faster risk of OutOfMemory occurrence (the file system APIs creates listeners for all these sub-folders in order to provide cache (refresh) functionality, so for single record there will be 5 listeners (4 sub-folders + 1 record) created and memory consumption increases significantly)

II. Distributed file system (SFTP, FTP)

The purpose of distributed file system option is to allow storing/accessing of binary data into network storage devices transparently through SFTP, FTP. User needs to provide configuration data related to distributed systems (host, user, password). It is considered that user has write access to the distributed system at the configured persistence location path.

1. Flat structure

It has the same characteristics like in the local flat configuration, but it is applied on the persistence location from the distributed system.

2. Hierarchical structure (configurable tree)

It has the same characteristics like in the local hierarchic (configurable tree) configuration, but it is applied on the persistence location from the distributed system.

3. Hierarchical structure (deterministically calculation)

It has the same characteristics like in the local hierarchic (deterministically calculation) configuration, but it is applied on the persistence location from the distributed system.

B. RDBMS

Binary Storage Service shall also be able to store the records (blob) into RDBMS. Url connection-string shall be configured (driver, host, database name, port, user, password).

For performance considerations, database schema shall contain multiple tables (since large BLOBs will be stored). Binary Storage Service shall deterministically distribute records to database tables.

C. Object DataBase

Binary Storage Service will use existing Open Source Object Database Engine to store the binary data. It is not Binary Storage Service responsibility to directly access the stored data; the service will store/fetch the data by using the exposed API.

Open Source Database Engines :

  • Oracle Berkeley DB
  • Berkeley DB Java Edition

Cluster configuration

Binary Storage Service must offer fallowing cluster configurations:

  • Client components clustering (like blackboard service) - where the client services run in cluster and all the cluster nodes needs to share the same data (which means, all the nodes have to share the same binary persistence storage). This will be only possible by configuring the Binary Storage Service to use the distributed file system option or object database option (where the Object Database Engine is capable to be remotely accessed - not an embedded designed database which does not allow directly remote connections);
  • Persistence storage clustering - where binary data will be stored in more than one nodes.

The two cluster options shall be available even configuring both at the same time, or only one, or non of them.

Both options must be supported by the frameworks / RDBMS that Binary Storage Service will use.

Concurrent access

Binary Storage Service shall allow multiple clients accessing (read/write) the storage. It is Binary Storage Service responsibilities to synchronize the operation in order to avoid deadlocks.

Technical aspects for designing the Binary Storage Service

  • Binary data compressing and encryption shall be available via configuration
  • Binary storage shall internally manage its persistence hierarchy.
  • The binary service shall be designed as a single bundle / service.
  • Exception handling mechanism should treat all internal binary storage (logical and unexpected) errors and wrap the exceptions into a “binary storage exception” that makes sense for the Blackboard service
  • Resources synchronization shall be done at the lowest possible level
  • Binary Storage shall manage its configuration internally (highly couple classes are difficult to maintain and hard to understand in isolation – they tend to introduce internal dependencies). Decouple binary storage configuration from blackboard service

2.Sequence Diagram NewBinaryStorae.jpg

  • The Binary Storage Service API shall stay as simple as possible
void store(String id, InputStream stream);
void store(String id, byte[] blob)
byte[] fetchAsByte(String id)
InputStream fetchAsStream(String id)
void remove(String id)
int fetchSize(String id)

UML Class Diagram

SMILA-BinaryStorage-ClassDiagram.jpg

Test Results

Following link contains results of tests based on different implementations (simple java.io and EFS).

https://bugs.eclipse.org/bugs/show_bug.cgi?id=254852