which is the best dynamic databases model?
Suppose I have millions of pears of strings X-Y. first string X contains from 50 to 500 characters second one X contains 20 characters. I want put in order those pears according X to be easy to find desired pear (X). and also dynamically add new pears to this database. So that do not alert whole database after adding new item.
Could anyone tell me name of best database models which fits to this requirements? or explain briefly such models would be much more appreciating.
Could anyone tell me name of best database models which fits to this requirements? or explain briefly such models would be much more appreciating.
| pears of strings X-Y |
I hate pears. I prefer apples.
Then again - maybe you mean "pairs"? ;-)
| first string X contains from 50 to 500 characters second one X contains 20 characters. |
Err...huh? 50-500 or 20? And what about Y?
| Could anyone tell me name of best database models which fits to this requirements? |
What's wrong with "just a table of two varchar's and an index on the one you are going to search for"?
Ciao, Imi.
Any database can do that. If you want small and free, you could try sqlite3, or if you can cope with not using SQL, BerkeleyDB.
pairs of course :)
X can be between 50 and 500 characters and Y is always 20 characters. X(50-500) <- Y(20).
I want to put in order X so that to be possible to have idea (at least approximately) where will be any X which I want to find without search in whole table.
If I will put a database in order alphabetically according X and make a map than I do not know how should I deal with new pairs. I do not want to rewrite database for every new items.
Preliminarily define of a table where would be empty spaces: position for all possible new items is impossible. since I would need 500! element on a table.
I am beginner in databases programming. There should be any database model for pairs..
Any help would be very appreciating.
X can be between 50 and 500 characters and Y is always 20 characters. X(50-500) <- Y(20).
I want to put in order X so that to be possible to have idea (at least approximately) where will be any X which I want to find without search in whole table.
If I will put a database in order alphabetically according X and make a map than I do not know how should I deal with new pairs. I do not want to rewrite database for every new items.
Preliminarily define of a table where would be empty spaces: position for all possible new items is impossible. since I would need 500! element on a table.
I am beginner in databases programming. There should be any database model for pairs..
Any help would be very appreciating.
You don't put data into a database in order. You ask the database to order the data on retrieval.
You you only have 500 entries, you can do it in memory.
You you only have 500 entries, you can do it in memory.
thank you very much!
Not 500 entries. I just wanted to say that maximal possible number of entries (all possible combinations) can be 500! (factorial of 500. 500!=1*2*3*...*499*500).
but in practice it should be about C20 000(7) =20 000!/((20 000-7)!*7!), approximately 10 to the 25 power which is still very large.
Not 500 entries. I just wanted to say that maximal possible number of entries (all possible combinations) can be 500! (factorial of 500. 500!=1*2*3*...*499*500).
but in practice it should be about C20 000(7) =20 000!/((20 000-7)!*7!), approximately 10 to the 25 power which is still very large.
Isn't 500! larger than the amount of particles in the universe or something like that?
10^25 entries are still way too much data. That's way more than the entire storage of the internet.
Ciao, Imi.
10^25 entries are still way too much data. That's way more than the entire storage of the internet.
Ciao, Imi.
of course 500! is incredible large but its just all possible combination 500 characters (in the case if all characters are different). 10^25 is still enforced number. probably real one should be several order less. Anyway will have large date and i need fast a and intelligent database..
Topic archived. No new replies allowed.