in reply to Re^12: Storing large data structures on disk
in thread Storing large data structures on disk
So it's actually a 2D array (nucleotide, experiment set) (10^10 * 10^3) where each cell points to a list of varying length (of up to, let's say, ~200) of integers.
Besides that we have 10^3 arrays, each of size 10^5-10^6 (all of the same length, though), each array represents a specific experiment set. Each cell in such an array holds a reference to a small hash (a specific result).
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^14: Storing large data structures on disk
by BrowserUk (Patriarch) on Jun 01, 2010 at 09:23 UTC | |
by roibrodo (Sexton) on Jun 01, 2010 at 09:54 UTC | |
by Anonymous Monk on Jun 02, 2010 at 03:21 UTC | |
by JavaFan (Canon) on Jun 01, 2010 at 09:41 UTC | |
by BrowserUk (Patriarch) on Jun 01, 2010 at 10:19 UTC | |
by jethro (Monsignor) on Jun 01, 2010 at 10:56 UTC | |
by JavaFan (Canon) on Jun 01, 2010 at 11:32 UTC |