Click here to Skip to main content
15,892,005 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
Hello everyone

I dont know how to solve the following problem:
I have multiple Tables, each filled with different Entries. (All Integers)

It's kinda like in an experiment, where different values are added into the table.
Now I want to calculate the relation between these entries.
Each entrie stands for a certain iteration and for each iteration in each table there is one entrie.

By time I could build charts and see the relation between different entries inside the tables.

It't like the index of an exchange market, I want to know how much one chart is influencing another. (Just an example, my database has nothing to do with these)


Thanks
Posted
Comments
Sergey Alexandrovich Kryukov 27-Mar-14 14:16pm    
It's pretty interesting stuff. Can you define what does "calculate the relation"? If this is a chart, could you at least show some example of what is required?
Of maybe you just need to reflect the complete database schema?
—SA
Member 10527905 30-May-14 4:31am    
Sorry for he late reply:

The database is not really the problem, maybe i described the problem wrong.
The problem is, that I have some kind of field or map. You probably know chess.
Now each field is able to have a certain value (or in the chess example, a figure).
Think about any possible constellation in a game, then the constellation (our table with data) in the next turn is pretty much predictable (not only, because there is just one figure you can move at once).
(Not 100% predictable, but lets say approx 70%.)

Im having the same kind of constellation in another problem, which has parallels to chess. Now I'm looking for a way to implement the ability of predicting, resulting the experience in the past, because I have got a bunch of data (talking about 1,7 million of these constellations).
Sergey Alexandrovich Kryukov 30-May-14 11:24am    
This is even more interesting, but leads us to deep mathematics (including game theory, but not much) and a lot of unknown. For your information, some games don't have practical and comprehensive solutions as number of variants greatly exceeds the capacities of all computers. Chess is only one example of having no comprehensive solution: existing algorithms just calculate N steps in depth and innovations are slow and only introduce some limited shortcuts to the basic algorithm. And a database of many known pattern plays huge role.

So, we don't have much to address this problem. It is at least too vague in your formulation. Sorry.

However, if you are sure it's about 1.7 million of combinations, it's a low number. In principle, you can scan them all. That's all I can say based on your limited information.

—SA

Please see my comment to the question and my questions. It's likely that you need to extract all the database schema from the database: http://en.wikipedia.org/wiki/Database_schema[^].

Unfortunately, to best of my knowledge, the reflection of the schema is not a part of any SQL standard and depends on the particular database server. You would need to work with some particular server or have (or create) some common abstraction layer.

Please see: http://msdn.microsoft.com/en-us/library/kcax58fh%28v=vs.110%29.aspx[^].

Look at these open-source projects:
http://dbschemareader.codeplex.com[^],
http://schemaspy.sourceforge.net[^].

Sorry, only the first project is for .NET and written in C#, but the second one is not; it is written in Java, but it is very interesting; maybe it can give you some good ideas.

—SA
 
Share this answer
 
use joins for this

can read join blogs
 
Share this answer
 

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900