Home  |  About  | Last |  Submit  |  Contact
AllQuests.com

Previous Question:  Function to calculate closest leaf in binary tree  Algorithms Data StructuresNext Question:  FW 2.80 DownDate to FW 2.71 for TA 079~086 PSP v0.01 By 0okm[  PSP Discussion

Question Data storage in MySQL ( CodeGuru Forums Algorithms Data Structures )
Updated: 2008-08-12 06:10:09 (0)
Data storage in MySQL

Hi, I was wondering what the best way to store dynamic arrays in SQL was. The 2 options I can think off off the top of my head are:

1) create new tables for the items you want stored in the dynamic array and reference by the first table's key values (I.E. I have table CHARACTERS and I want an inventory list of items of dynamic length, so I make table ITEMS and attach each item to the character's name).

2) use a varchar string, with hashed out values of the items. But this would require, in theory, VERY long strings, which might become a burden?

I won't have to access this information too incredibly often, so speed isn't a huge, huge deal. If anything the write time is more important than the read time.

Previous Question:  Function to calculate closest leaf in binary tree  CodeGuru Forums  Algorithms Data StructuresNext Question:  FW 2.80 DownDate to FW 2.71 for TA 079~086 PSP v0.01 By 0okm[  PS3Forums  PSP Discussion

- Source: Data storage in MySQL CodeGuru Forums Algorithms Data Structures
- Previous Question: Function to calculate closest leaf in binary tree CodeGuru Forums Algorithms Data Structures
- Next Question: FW 2.80 DownDate to FW 2.71 for TA 079~086 PSP v0.01 By 0okm[ PS3Forums PSP Discussion





AllQuests.com


Best dedicated servers   Top dedicated servers   Cheap dedicated servers   Linux dedicated servers   Windows dedicated servers   Unmetered dedicated servers