Best way to store table like data

Question

What is the best way to store table like data like:

         | Column 0 | Column 1 | Column 2 | Column 3 | Column 4
Row 0    | 0.984546 | 0.654564 | 0.467676 | 0.673466 | 50.03333
Row 1    | 0.684546 | 0.457564 | 0.467776 | 0.674566 | 45.73335
Row 2    | 0.884546 | 0.424564 | 0.445676 | 0.664566 | 12.23333
Row 3    | 0.284546 | 0.054564 | 0.237676 | 0.124566 | 45.01333

Both max column and row is dynamic and the coordinates of the value is very important, as I have to do calculation based on those value. It's not a database because the data is different every time and I don't want it to be forever there. Also, I need it to be easily accessible. I try to use LinkedList with Double[] but it's just too difficult for me to locate each of the value. Speed is a factor too.

Any suggestion on the type of collection I should use or ways to handle it?

You could use a `Dictionary>` or a class wrapping it into an indexer. — Florian F., Jun 08 '14 at 00:46
It's not clear what your use cases are of your collection but it's possible this might be one of the few cases where you want to go with a double[,] over a generic collection — Conrad Frix, Jun 08 '14 at 01:16

score 3 · Accepted Answer · answered Jun 08 '14 at 00:49

3

I think you should declare this variable:

List< List<double> > matrix = new List< List<double> >();

Later you can use matrix.Capacity to decide the number of rows and use that same property on each row to set the number of columns. This way you wont have memory wasted.

You can use matrix.TrimExcess() to resize the matrix if your next data will be shorter.

The idea behind using matrix.Capacity and matrix.TrimExcess() is to have control of how much space is reserved in the data structure. This way it wont grow by itself and you will gain performance.

answered Jun 08 '14 at 00:49

rareyesdev

2,337
1
25
43

You can use a DataTable or save them in file using Xml – MRebai Jun 08 '14 at 00:57
@moez I think `DataTable` is not needed in this scenario, and saving to a file isn't a requirement of the question. I see no problem with my answer. – rareyesdev Jun 08 '14 at 00:59
I'm just afraid this will make things slow down – Horrible Programmer Jun 08 '14 at 14:46
1

@SunnySunday Then you shouldn't go with `DataTable` or `XML` approach. Those are a lot slower than this. If you want something faster than this, your only option is `double[,] matrix` – rareyesdev Jun 10 '14 at 00:35
Do you mean 2D array? – Horrible Programmer Jun 10 '14 at 05:15

score 2 · Answer 2 · edited May 23 '17 at 11:46

You can use the .NET DataTable class without using a database at all... You can build one yourself very easily without any datasource.

This way, you still get all of the benefits (you can query it with LINQ, bind it to stuff, still have it be dynamic) but you don't need it to be backed by a database.

Here is a SO answer on how to accomplish that. https://stackoverflow.com/a/1042638/643951

score 0 · Answer 3 · answered Jun 08 '14 at 00:52

0

Another option is to use XML structure

answered Jun 08 '14 at 00:52

Swagata

622
5
19

1

I think that's overkill, dynamic grow data structure should do it just fine. – rareyesdev Jun 08 '14 at 00:56

Best way to store table like data

3 Answers3